# LeetCode 162. Find Peak Element

Find Peak Element The key word in the problem: nums[n] != nums[n+1]

# LeetCode 154. Find Minimum in Rotated Sorted Array II

Find Minimum in Rotated Sorted Array II

# LeetCode 153. Find Minimum in Rotated Sorted Array

Find Minimum in Rotated Sorted Array

# LeetCode 74. Search a 2D Matrix

Search a 2D Matrix. Solve it by binary search, use treat the matrix as a array, with special handling in the index. Array[i] = matrix[i/Length2, i%length2]

# LeetCode 35. Search Insert Position

Search Insert Position. It is a binary search problem. So do the binary search. If the value can not be found, compare the last value you traversed, depends on the…

# LeetCode 34. Search for a Range

Search for a Range. I do two binary searches, one for the left boundary of the range, one for the right boundary of the range.

# LeetCode 33. Search in Rotated Sorted Array

Search in Rotated Sorted Array. Binary search with some special handling. A similar (but more clear I guess) solution can be found in Search in Rotated Sorted Array II.