Solution: First Missing Positive

Let's solve the First Missing Positive problem using the Cyclic sort pattern.

Statement

Given an unsorted integer array, nums, return the smallest missing positive integer. Create an algorithm that runs with an O(n)O(n) time complexity and utilizes a constant amount of space.

Note: The smallest missing positive isn’t the first positive number that’s missing in the range of elements in the input, but the first positive number that’s missing if we start from 11.

Constraints:

  • 11 \leq nums.length 105\leq 10^5

  • 231-2^{31} \leq nums[i] 2311\leq 2^{31} - 1

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.