human
Positive integers up to N that are not present in given Array | Function to find positive integers from 1 to N that are not present in the array.
Declare bitset.
Iterate from 0 to M - 1.
Iterate from 0 to n - 1.
Iterate from bset . _Find_first ( ) to bset . size ( ) - 1.
Driver Code"
Solution in Python:
assistant
#Here is code to positive integers up to N that are not present in given Array and the other steps required.
 def findMissingNumbers ( arr , n ) :
	M = 15
	bset = [ 0 ] * M
	for i in range ( M ) :
		bset [ i ] = i
	for i in range ( n ) :
		bset [ arr [ i ] - 1 ] = 0
	bset = [ i for i in bset if i != 0 ]
	for i in range ( len ( bset ) ) :
		if ( bset [ i ] + 1 > n ) :
			break
		print ( bset [ i ] + 1 )
if __name__ == " _ _ main _ _ " :
	arr = [ 1 , 2 , 4 , 6 , 8 , 9 ]
	n = len ( arr )
	findMissingNumbers ( arr , n )