arrow_back Back to Challenges

#41 First Missing Positive

Hard Acceptance 0%
description

Problem Description

Given an unsorted integer array `nums`, return the smallest missing positive integer. You must implement an algorithm that runs in O(n) time and uses O(1) auxiliary space.

checklist Constraints

See problem description for detailed constraints.

science Examples

Case #1

In: # See problem description for input format
Out: # Expected output

Mastery Tags

Arrays Hash Table

Hiring Companies

Google Microsoft
code

Integrated IDE

code_blocks
Coding
psychology
Aptitude