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.
 
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]


lista= range(-100000, 100000)
def solution(liste):
  for i in lista:
    if i not in liste and i > 0:
      return i
solution([-1,-3]) 

b472fb0ec2be5c9f230fc4e863b5ea823c2d723c
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.
 
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]


lista= range(-100000, 100000)
def solution(liste):
  for i in lista:
    if i not in liste and i > 0:
      return i
solution([-1,-3]) 
