Module Binary search on answer

Binary search on answer

**Frequency: 6/10** Optimization problems are always hard (.i.e finding the best solution best solution from all feasible solutions) but checking if a value is a solution for a problem is way easier. Therefore, we use binary search to determine the answer.

Resources

- [USACO Guide: Binary search](https://usaco.guide/silver/binary-search?lang=cpp)

Problems

Reading 1039 / 1087 800
Minimum maximum 962 / 1013 800
Beautiful number 920 / 975 1000
Multiplication table 763 / 787 1000
k-th digit 609 / 660 1000
Maximum mean 555 / 654 1200
Birthday 447 / 482 1200
Sorting the differences 452 / 474 1300
Collecting 414 / 439 1400