# First Missing Positive: Walkthrough

First Missing Positive shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Place each value v in index v-1 with swaps, then scan for the first index whose value is not i+1.

## 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 answer, sliding window, stack, or in-place rewrite) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n) time, O(1) extra.

## Common mistake

Leaving non-positive and out-of-range values in place without skipping them.

## 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.