human
Find the Side of the smallest Square that can contain given 4 Big Squares | Function to find the maximum of two values.
Function to find the smallest side of the suitable suitcase.
sort array to find the smallest and largest side of suitcases.
side of the suitcase will be smallest if they arranged in 2 x 2 way so find all possible sides of that arrangement.
since suitcase should be square so find maximum of all four side.
now find greatest side and that will be the smallest square.
return the result.
Driver Code.
Get the side of the 4 small squares.
Find the smallest side.
Get the side of the 4 small squares.
Find the smallest side"
Solution in Python:

=====
Can you provide a code to find the Side of the smallest Square that can contain given 4 Big Squares and the other steps required?
assistant
#Here is code to find the Side of the smallest Square that can contain given 4 Big Squares and the other steps required.
 def max ( a , b ) :
	if ( a > b ) :
		return a
	else :
		return b
def smallestSide ( a ) :
	a . sort ( reverse = False )
	side1 = a [ 0 ] + a [ 3 ]
	side2 = a [ 1 ] + a [ 2 ]
	side3 = a [ 0 ] + a [ 1 ]
	side4 = a [ 2 ] + a [ 3 ]
	side11 = max ( side1 , side2 )
	side12 = max ( side3 , side4 )
	sideOfSquare = max ( side11 , side12 )
	return sideOfSquare
if __name__ == ' _ _ main _ _ ' :
	side = [ 0 for i in range ( 4 ) ]
	print ( " Test ▁ Case ▁ 1" )
	side [ 0 ] = 2
	side [ 1 ] = 2
	side [ 2 ] = 2
	side [ 3 ] = 2
	print ( smallestSide ( side ) )
	print ( " " , ▁ end ▁ = ▁ " " )
	print ( " Test ▁ Case ▁ 2" )
	side [ 0 ] = 100000000000000
	side [ 1 ] = 123450000000000
	side [ 2 ] = 987650000000000
	side [ 3 ] = 987654321000000
	print ( smallestSide ( side ) )