Gatare Libère gatarelib

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.

Calendar Challenge

	import os
	os.environ['TF_CPP_MIN_LOG_LEVEL'] = '3'
	import tensorflow as tf
	import cv2
	import mediapipe as mp
	from keras.models import load_model
	import numpy as np
	import time
	import pandas as pd

	<?php

	class WipeCommand extends Command
	{
	use ConfirmableTrait;

	/**
	* The console command name.
	*
	* @var string

	package main

	import (
	"time"

	"gobot.io/x/gobot"
	"gobot.io/x/gobot/drivers/gpio"
	"gobot.io/x/gobot/platforms/firmata"
	)

	class ShoppingCart(object):
	def __init__(self):
	self.total = 0
	self.items = {}

	def add_item(self, item_name, quantity, price):
	self.total += quantity * price
	if type(item_name) == str and quantity > 0:
	self.items.update({item_name: quantity})

	def minimum_swaps(ratings):
	if sorted(ratings, reverse=True) == ratings:
	return 0
	swaps = 1
	while sorted(ratings, reverse=True) != sorter(ratings):
	swaps += 1
	return swaps

	def sorter(array):

	def splitInteger(num,parts):
	quotient, remainder = divmod(num, parts)
	lower_elements = [quotient] * (parts - remainder)
	higher_elements = [quotient + 1] * remainder
	return lower_elements + higher_elements