Binary search
Halving the search space each step, on sorted data or on the answer itself.
| Status | Challenge | Topics | Level | Accepted | Save |
|---|---|---|---|---|---|
| 1.Binary SearchFind a number's position in a sorted array in log time. | ArraysBinary search | Easy | – | ||
| 2.Longest Increasing SubsequenceFind the longest strictly rising sequence you can pick out of an array. | Dynamic programmingBinary search | Medium | – | ||
| 3.Search in a Rotated ArrayBinary-search a sorted array that has been rotated. | ArraysBinary search | Medium | – | ||
| 4.Median of Two Sorted ArraysFind the median of two sorted arrays taken together. | ArraysBinary search | Hard | – |