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 1047 / 1095 800
Minimum maximum 968 / 1019 800
Beautiful number 921 / 976 1000
Multiplication table 769 / 794 1000
k-th digit 611 / 662 1000
Maximum mean 555 / 654 1200
Birthday 447 / 482 1200
Sorting the differences 453 / 475 1300
Collecting 414 / 439 1400