Search⌘ K
AI Features

Problem: First Missing Positive

Explore how to find the first missing positive integer in an unsorted array by using the cyclic sort method. This lesson helps you understand rearranging elements in place to achieve O(n) time complexity and constant space usage. You will learn to apply these concepts to optimize array-based problem solving in C++.

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:

  • 11 \leq ...