# Missing Element In Sorted Array: Explained

Missing Element In Sorted Array shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Missing count before index i is nums[i] - nums[0] - i. Binary search the last index whose missing count is below k.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(log n).

## Common mistake

Handling the case where the answer lies beyond the last element.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at Linkjob.ai.