Question

How to find a pair with maximum product from int list in Python

Answer 1

def max_product_from_int_list(arr):
    it1 = lst[0]
    it2 = lst[1]
    l = len(lst)
    
    for i in range(0, l):
        for j in range(i + 1, l):
            if (lst[i] * lst[j] > it1 * it2):
                it1 = lst[i] 
                it2 = lst[j]
                
    return it1, it2
 
 
lst = [3, 9, 1, 3, 7, 0, 8, 4]
tem1 = 0
item2 = 0
      
item1, item2 = max_product_from_int_list(lst)
      
print(item1, item2)
  
  
   
'''
run:
   
9 8
   
'''

 

70+ SQL courses for beginners and professionals

Answer 2

def max_product_pair(lst):
   if len(lst) < 2:
       return "No pairs exist"
   
   lst.sort()
   
   product1 = lst[0] * lst[1]
   product2 = lst[-1] * lst[-2]
   if product1 > product2:
       return (lst[0], lst[1])
   else:
       return (lst[-2], lst[-1])


lst = [3, 9, 1, 3, 7, 0, 8, 4]

print(max_product_pair(lst)) 


'''
run:

(8, 9)

'''

 

70+ SQL courses for beginners and professionals