566. Reshape the Matrix https://leetcode.com/problems/reshape-the-matrix
74. Search a 2D Matrix https://leetcode.com/problems/search-a-2d-matrix
240. Search a 2D Matrix II https://leetcode.com/problems/search-a-2d-matrix-ii
392. Is Subsequence https://leetcode.com/problems/is-subsequence
792. Number of Matching Subsequences https://leetcode.com/problems/number-of-matching-subsequences
658. Find K Closest Elements https://leetcode.com/problems/find-k-closest-elements
35. Search Insert Position https://leetcode.com/problems/search-insert-position
162. Find Peak Element https://leetcode.com/problems/find-peak-element
852. Peak Index in a Mountain Array https://leetcode.com/problems/peak-index-in-a-mountain-array
33. Search in Rotated Sorted Array https://leetcode.com/problems/search-in-rotated-sorted-array
81. Search in Rotated Sorted Array II https://leetcode.com/problems/search-in-rotated-sorted-array-ii
Prerequisite Knowledge
Before reading this article, you should first study:
The essence of binary search is to quickly narrow down the search interval. This article will show you classic use cases of the binary search algorithm in arrays.
In the previous article Detailed Explanation of the Binary Search Framework, we discussed binary search in one-dimensional arrays. How do we apply binary search in two-dimensional matrices?
