First Missing Positive

For each number x in [1, n], swap it to index x-1 (cyclic sort idea).

After rearranging, scan: the first index i where nums[i] ≠ i+1 gives the answer i+1.

Numbers outside [1, n] are irrelevant — ignore them during the swap phase.