terminal
Elevo
/
ESC
Login
Initiate Registration
code
Topics
corporate_fare
Companies
history
History
arrow_back
Back to Challenges
#41
First Missing Positive
Hard
Acceptance 0%
Editorial
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
Python 3
expand_more
C
C++ 17
Java
JavaScript
Python 3
C
C++ 17
Java
JavaScript
Python 3
refresh
class Solution: def firstMissingPositive(self, *args): # Write your solution here pass
Login to Compile
Processing
terminal
Debug Output
home
Home
extension
Practice
robot_2
login
Sign In
account_circle
Menu
code_blocks
Coding
psychology
Aptitude
Navigation
close
Login
Registration