Hard

Quiz

#41 First Missing Positive

APPROACH

Return the smallest positive integer absent from unsorted integer array nums. The algorithm must run in O(n) time using O(1) auxiliary space.

Example 1:

Input: nums = [1,2,0]

Output: 3

Explanation: The numbers in the range [1,2] are all in the array.

Example 2:

Input: nums = [3,4,-1,1]

Output: 2

Explanation: 1 is in the array but 2 is missing.

Example 3:

Input: nums = [7,8,9,11,12]

Output: 1

Explanation: The smallest positive integer 1 is missing.

1 of 4

1:00

What is the optimal approach for this problem?