def find_smallest_positive(items) -> int:
	"""
	Returns the smallest positive integer that does not exist in the given int array.
	:param items: array of ints
	:return: the smallest positive int not in the array
	"""
	# Create boolean array to hold if an integer is found
	# Maps index of array to the integer in items
	items_b = [False] * len(items)
	for item in items:
		if len(items_b) >= item > 0:
			items_b[item - 1] = True

	# Return the index(+1) of the first False value
	for idx, item_b in enumerate(items_b):
		if not item_b:
			return idx + 1

	# If all ints in items are sequential from 1, return the next positive integer
	return len(items) + 1