Must-do problems: Binary Search

These are the binary search problems every placement candidate should be able to solve, from a plain search to a median of two lists. For each one, decide first whether you search a position, a boundary or an answer. Trace a small input on paper, then check your program against every test.

1. 1.Find an order idEasy
2. 2.Where does a new price goEasy
3. 3.Count one stock levelEasy
4. 4.Integer square rootEasy
5. 5.First and last position of a levelEasy
6. 6.Smallest bundle that is large enoughEasy
7. 7.Orders inside a price rangeEasy
8. 8.Smallest value in a rotated listMedium
9. 9.Find a value in a rotated listMedium
10. 10.Top of a visitor curveMedium
11. 11.Smallest truck for the parcelsMedium
12. 12.Slowest speed that clears the queuesMedium
13. 13.The k-th missing numberMedium
14. 14.Look up a code in a sorted gridMedium
15. 15.The one unpaired itemMedium
16. 16.Earliest day for the bouquetsHard
17. 17.Median of two sorted listsHard
18. 18.Place servers as far apart as possibleHard
19. 19.Find a value in a rotated list with repeatsHard
20. 20.The k-th smallest value in a sorted gridHard