Find the missing number with constraints
Filed under SanDisk
The question
Find the missing number in an array efficiently, first requiring less than O(n) space complexity and then O(1) space complexity, along with the mathematical formula for the sum of numbers from 1 to n.
No write-up yet. Related questions below have one.
Related SanDisk questions
Collected from public candidate posts and coding forums. Updated Nov 2026.