human
Find least non | function to find the smallest non - overlapping number.
Sort the intervals based on their starting value.
Check if any missing value exist.
Finally print the missing value.
Driver code"
How can the above be solved in Python?
assistant
#Here is code to find least non and the other steps required.
 def find_missing ( interval ) :
	interval . sort ( )
	mx = 0
	for i in range ( len ( interval ) ) :
		if ( interval [ i ] [ 0 ] > mx ) :
			print ( mx )
			return
		else :
			mx = max ( mx , interval [ i ] [ 1 ] + 1 )
	print ( mx )
if __name__ == " _ _ main _ _ " :
	interval = [ [ 0 , 14 ] , [ 86 , 108 ] , [ 22 , 30 ] , [ 5 , 17 ] ]
	find_missing ( interval ) ;