Step through cyclic sort concepts to efficiently handle various missing and corrupt number scenarios.

Coding

Cyclic Sort

Efficiently prepare for coding interviews with strategies from FAANG engineers. Avoid the LeetCode grind and simplify your interview prep with real-world questions from top companies.

The ultimate guide to the System Design Interview – developed by Meta & Google engineers. Master distributed system fundamentals, and practice with real-world interview questions & mock interviews.

System Design

The essential guide to API Design & Product Design Interviews – developed by FAANG engineers. Master product design fundamentals & get hands-on with real-world APIs.

API Design

A battle-tested guide to Object Oriented Design Interviews – developed by FAANG engineers. Master OOD fundamentals & practice real-world interview questions.

Low Level Design Interview Using OOD Principles

Your essential EM Interview crash course. Learn strategies from FAANG hiring managers to demonstrate your leadership skills & experience to interviewers.

Engineering Management and Leadership Interviews

The ultimate guide to behavioral interviews. Developed by FAANG engineers. Use real-world questions, video recording, and structured strategies to get interview-ready in just a few hours.

Behavioral

# Statement

Given an unsorted integer array, `nums`, return the smallest missing positive integer. 
Create an algorithm that runs with an $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 $1$.


**Constraints:**

- $1 \leq$ `nums.length` $\leq 10^5$

- $-2^{31} \leq$ `nums[i]` $\leq 2^{31} - 1$


Try to solve the First Missing Positive problem.

Problem: First Missing Positive

Statement

Problem: First Missing Positive

Statement