213. First Missing Positive

PRO

Hard

Topics

Companies

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: nums = [1,2,0]

Output: 3

Explanation: The numbers 1 and 2 are present in the array. The smallest positive integer not present is 3.

Example 2:

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

Output: 2

Explanation: The number 1 is present. The number 2 is not present. Hence, 2 is the smallest missing positive integer.

Example 3:

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

Output: 1

Explanation: The smallest positive integer 1 is not present in the array.

Constraints:

•
•

Time Complexity

N/A

Space Complexity

N/A

213. First Missing Positive

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

213. First Missing Positive

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Companies

Hint

Use Cases