w3resource

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


28. Aggregation Pair (Max,Min)

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)

For more Practice: Solve these Related Problems:

  • Write a Python program to find the pair of adjacent elements with the maximum sum and the pair with the minimum sum from a list.
  • Write a Python program to iterate over a list and compute aggregation pairs (max, min) based on a sliding window of two elements.
  • Write a Python program to use itertools to generate all possible pairs from a list and then identify the pair with the maximum and minimum aggregated values.
  • Write a Python program to calculate the maximum and minimum product pairs from a list of integers using a custom aggregation function.

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.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.



Follow us on Facebook and Twitter for latest update.