Search⌘ K
AI Features
Home
Courses
Learn Data Structures and Algorithms in Java

Problem: First Missing Positive

Explore how to solve the problem of finding the first missing positive integer in an unsorted array by using cyclic sort. Learn to rearrange array elements in place within O(n) time and constant space to achieve an optimal solution.

We'll cover the following...

Statement

Given an unsorted integer array nums, find and return the smallest positive integer that is not present in nums.

Your solution must run in O(n)O(n) time and use O(1)O(1) auxiliary space.

Constraints:

  • 1≤1 \leq nums.length ≤105\leq 10^5 ...