Find the missing number in a sorted 1..N array without overflow
Filed under OLA
The question
A sorted array holds elements from 1 to N with one missing (size N-1). Find the missing number in O(log N) while avoiding any possibility of overflow.
No write-up yet. Related questions below have one.
Related OLA questions
Collected from public candidate posts and coding forums. Updated Nov 2026.