human
Maximum water that can be stored between two buildings | Return the maximum water that can be stored.
Check all possible pairs of buildings.
Maximum so far.
Driver code"
How can the above be solved in Python?

Can you provide a code to maximum water that can be stored between two buildings and the other steps required?
assistant
#Here is code to maximum water that can be stored between two buildings and the other steps required.
 def maxWater ( height , n ) :
	maximum = 0 ;
	for i in range ( n - 1 ) :
		for j in range ( i + 1 , n ) :
			current = min ( height [ i ] , height [ j ] ) * ( j - i - 1 ) ;
			maximum = max ( maximum , current ) ;
	return maximum ;
if __name__ == " _ _ main _ _ " :
	height = [ 2 , 1 , 3 , 4 , 6 , 5 ] ;
	n = len ( height ) ;
	print ( maxWater ( height , n ) ) ;