[LeetCode] 74. Search a 2D Matrix - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/search-a-2d-matrix/description/ Search a 2D Matrix - LeetCode Can you solve this real interview question? Search a 2D Matrix - You are given an m x n integer matrix matrix with the following two properties: * Each row is sorted in non-decreasing order. * The first integer of each row is greater than the last integer leetcode.com 문제 You are given an m x n integer mat..
[LeetCode] 2300. Successful Pairs of Spells and Potions - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/successful-pairs-of-spells-and-potions/description/ Successful Pairs of Spells and Potions - LeetCode Can you solve this real interview question? Successful Pairs of Spells and Potions - You are given two positive integer arrays spells and potions, of length n and m respectively, where spells[i] represents the strength of the ith spell and potions[j] repre leetcode...
[LeetCode] 153. Find Minimum in Rotated Sorted Array - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/ Find Minimum in Rotated Sorted Array - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,..
[LeetCode] 374. Guess Number Higher or Lower - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/guess-number-higher-or-lower/description/ Guess Number Higher or Lower - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 We are playing the Guess Game. The game is as follows: I pick a number from 1 to n. You have to guess which number I picked. Eve..
HYOJUN
'이진탐색' 태그의 글 목록