human
Find pair with greatest product in array | Function to find greatest number.
Driver code"
Solution in Python:
assistant
#Here is code to find pair with greatest product in array and the other steps required.
 def findGreatest ( arr , n ) :
	result = - 1
	for i in range ( n ) :
		for j in range ( n - 1 ) :
			for k in range ( j + 1 , n ) :
				if ( arr [ j ] * arr [ k ] == arr [ i ] ) :
					result = max ( result , arr [ i ] )
	return result
if __name__ == " _ _ main _ _ " :
	arr = [ 30 , 10 , 9 , 3 , 35 ]
	n = len ( arr )
	print ( findGreatest ( arr , n ) )