Algorithm
1.34. Find First and Last Position of Element in Sorted Array
0 <= nums.length <= 105\-109 <= numsi <= 109nums is a non-decreasing array.\-109 <= target <= 109Related Topics - Binary Search가 있어서
2.33. Search in Rotated Sorted Array
1 <= nums.length <= 5000\-104 <= numsi <= 104All values of nums are unique.nums is an ascending array that is possibly rotated.\-104 <=
3.74. Search a 2D Matrix
m == matrix.lengthn == matrixi.length1 <= m, n <= 100\-104 <= matrixi, target <= 104이진탐색 카테고리에 있기는 했지만 이게 더 빠른거같아서 이렇게 작성.
4.153. Find Minimum in Rotated Sorted Array
n == nums.length1 <= n <= 5000\-5000 <= numsi <= 5000All the integers of nums are unique.nums is sorted and rotated between 1 and n times.
5.162. Find Peak Element
1 <= nums.length <= 1000\-231 <= numsi <= 231 - 1numsi != numsi + 1 for all valid i.이진탐색 사용이렇게 사용하여도 결과는 같게 나오며 시간도 비슷하게 나온다.
6.15. 3Sum
3 <= nums.length <= 3000\-105 <= numsi <= 105
7.844. Backspace String Compare
1 <= s.length, t.length <= 200s and t only contain lowercase letters and '
8.986. Interval List Intersections
0 <= firstList.length, secondList.length <= 1000firstList.length + secondList.length >= 10 <= starti < endi <= 109endi < starti+10 &
9.11. Container With Most Water
n == height.length2 <= n <= 1050 <= heighti <= 104
10.713. Subarray Product Less Than K
1 <= nums.length <= 3 \* 1041 <= numsi <= 10000 <= k <= 106
11.209. Minimum Size Subarray Sum
1 <= target <= 1091 <= nums.length <= 1051 <= numsi <= 104