Some questions ask for the minimum or maximum value that makes something possible, like the smallest ship capacity that delivers all packages within D days. If you can check one candidate quickly and the answer is monotonic (once it works, every larger value works), you can binary search over the range of answers. This turns a search over a huge range into about 30 checks. If feasibility is not monotonic, binary search gives wrong answers, so prove that property first.