human
Length of the largest subarray with contiguous elements | Set 1 | Utility functions to find minimum and maximum of two elements.
Returns length of the longest contiguous subarray.
Initialize result.
Initialize min and max for all subarrays starting with i.
Consider all subarrays starting with i and ending with j.
Update min and max in this subarray if needed.
If current subarray has all contiguous elements.
Return result.
Driver Code"
How can the above be solved in Python?
 ... Write me a code to length of the largest subarray with contiguous elements and the other steps required?
assistant
#Here is code to length of the largest subarray with contiguous elements and the other steps required.
 def min ( x , y ) :
	return x if ( x < y ) else y
def max ( x , y ) :
	return x if ( x > y ) else y
def findLength ( arr , n ) :
	max_len = 1
	for i in range ( n - 1 ) :
		mn = arr [ i ]
		mx = arr [ i ]
		for j in range ( i + 1 , n ) :
			mn = min ( mn , arr [ j ] )
			mx = max ( mx , arr [ j ] )
			if ( ( mx - mn ) == j - i ) :
				max_len = max ( max_len , mx - mn + 1 )
	return max_len
arr = [ 1 , 56 , 58 , 57 , 90 , 92 , 94 , 93 , 91 , 45 ]
n = len ( arr )
print ( " Length ▁ of ▁ the ▁ longest ▁ contiguous ▁ subarray ▁ is ▁ " , findLength ( arr , n ) )