Day 18/75: Binary search on answers
Today's note was about protecting the search interval in binary search on answers so every bound update stays justified. I kept coming back to the same checks: state what the active interval still allows before the first loop iteration, move left and right only when the predicate proves one side is impossible, and test the smallest failing boundary because off-by-one errors hide there first.…
