All problems
Binary search problems
12 problems: 3 easy, 9 medium and 0 hard. Start at the top; each one assumes the ones above it.
- Not startedEasyFind it by halvingBinary search, Arrays
- Not startedEasySearch insert positionBinary search, Arrays
- Not startedEasyTwo sum in a sorted listTwo pointers, Binary search, Arrays
- Not startedMediumBinary search on a sorted list someone rotatedBinary search, Arrays
- Not startedMediumIs this really a search treeBinary search, Trees
- Not startedMediumLongest increasing subsequenceBinary search, Dynamic programming
- Not startedMediumSharing the books so nobody reads too muchBinary search, Arrays
- Not startedMediumThe kth smallest value in a search treeBinary search, Trees
- Not startedMediumThe slowest speed that still finishes in timeBinary search, Arrays
- Not startedMediumThe smallest ship that still finishes in timeBinary search, Arrays
- Not startedMediumThe smallest value after a rotationBinary search, Arrays
- Not startedMediumWhere a repeated value starts and endsBinary search, Arrays