Smallest Missing Positive Integer | Dataford Interview Questions

Write a function function solution(A); that, given an array A of N integers, returns the smallest positive integer greater than 0 that does not occur in A.

Implement def solution(A):, where A is a list of integers and the return value is an integer. Values may be negative, zero, duplicated, or larger than N; aim for linear time and constant auxiliary space.

Constraints

0 <= len(A) <= 100000
-1000000000 <= A[i] <= 1000000000
The input array may contain duplicates.
The function returns an integer and may modify A in place.

Function Signature

def solution(A):

Your question is Smallest Missing Positive Integer. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Write a function function solution(A); that, given an array A of N integers, returns the smallest positive integer greater than 0 that does not occur in A.

Constraints

0 <= len(A) <= 100000
-1000000000 <= A[i] <= 1000000000
The input array may contain duplicates.
The function returns an integer and may modify A in place.

Function Signature

def solution(A):

Your question is Smallest Missing Positive Integer. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.