Python: Find the maximum, minimum aggregation pair in given list of integers

Last update on December 21 2024 07:30:58 (UTC/GMT +8 hours)

Write a Python program to find the maximum, minimum aggregation pair in a given list of integers.

Sample Solution:

Python Code:

from itertools import combinations 
def max_aggregate(l_data):
    max_pair = max(combinations(l_data, 2), key = lambda pair: pair[0] + pair[1])
    min_pair = min(combinations(l_data, 2), key = lambda pair: pair[0] + pair[1])
    return max_pair,min_pair
nums = [1,3,4,5,4,7,9,11,10,9]
print("Original list:")
print(nums)
result = max_aggregate(nums)
print("\nMaximum aggregation pair of the said list of tuple pair:")
print(result[0])
print("\nMinimum aggregation pair of the said list of tuple pair:")
print(result[1])

Sample Output:

Original list:
[1, 3, 4, 5, 4, 7, 9, 11, 10, 9]

Maximum aggregation pair of the said list of tuple pair:
(11, 10)

Minimum aggregation pair of the said list of tuple pair:
(1, 3)

Python Code Editor:

Have another way to solve this solution? Contribute your code (and comments) through Disqus.

Previous: Write a Python program to chose specified number of colours from three different colours and generate the unique combinations.
Next: Write a Python program to interleave multiple lists of the same length. Use itertools module.