Sulba
ReviewSign inAccount
Theme
Editor theme
Light
Dark

Beginner · Coding interviews

Binary search

Five interview problems that halve what's left to search at each step: the insertion point, the first and last places of a value, a rotated list, a whole-number square root and the least capacity to ship in time.

You build
insertion.py, then first_last.py, then rotated.py, then square_root.py, then shipping.py
Stages
5 Problems
Time
About 1.5 hours

Loading the workspace…