21 problems
Binary Search interview problems
21 Binary Search problems, from easy to hard. Each one has an editorial explaining the approach and its complexity, and a visualizer that runs the solution step by step on the example input or your own.
Easy (3)
Medium (11)
- 31. Search in Rotated Sorted ArrayMedium
- 32. Find First and Last Position of Element in Sorted ArrayMedium
- 71. Search a 2D MatrixMedium
- 78. Search in Rotated Sorted Array IIMedium
- 140. Find Minimum in Rotated Sorted ArrayMedium
- 144. Find Peak ElementMedium
- 201. H-Index IIMedium
- 266. Single Element in a Sorted ArrayMedium
- 309. Koko Eating BananasMedium
- 324. Capacity to Ship Packages Within D DaysMedium
- 374. Minimum Sum of Squared DifferenceMedium
Hard (7)
- 4. Median of Two Sorted ArraysHard
- 141. Find Minimum in Rotated Sorted Array IIHard
- 240. Split Array Largest SumHard
- 279. Kth Smallest Number in Multiplication TableHard
- 391. Distribute Elements Into Two Arrays IIHard
- 392. Kth Smallest Amount With Single Denomination CombinationHard
- 395. Maximize the Distance Between Points on a SquareHard