Use of First Missing Positive Test
You are given an unsorted integer array nums. Your task is to find the smallest positive integer that does not appear in the array.
- Your solution must run in O(n) time.
- It must use O(1) auxiliary space (excluding the input).
This problem requires thoughtful use of indexing and in-place data rearrangement to track existing positive integers efficiently.
Chatgpt
Perplexity
Gemini
Grok
Claude







