Skip to content

A function to find the smallest positive integer (greater than 0) that does not occur in A

Notifications You must be signed in to change notification settings

ayubamini/FindSmallestPositiveInterger

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

FindSmallestPositiveInterger

This is a demo task.

Write a function:

class Solution { public int solution(int[] A); }

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

For example,

Given A = [1, 3, 6, 4, 1, 2], the function should return 5.

Given A = [1, 2, 3], the function should return 4.

Given A = [−1, −3], the function should return 1.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];
each element of array A is an integer within the range [−1,000,000..1,000,000].

About

A function to find the smallest positive integer (greater than 0) that does not occur in A

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages