Sometimes, we need to find the specific problem of getting the pair which yields the minimum sum, this can be computed by getting initial two elements after sorting. But in some case, we don’t with to change the ordering of list and perform some operation in the similar list without using extra space. Let’s discuss certain ways in which this can be performed.
Method #1 : Using list comprehension +
min() + combination() + lambda
This particular task can be performed using the combination of above functions in which we use list comprehension to bind all the functionalities and min function to get the minimum sum, combination function finds all sums internally and lambda function is used to compute the sum.
The original list : [3, 4, 1, 7, 9, 1] The minimum sum pair is : (1, 1)
Method #2 : Using list comprehension +
nsmallest() + combination() + lambda
This method has potential of not only finding a single minimum but also k minimum sum pairs if required and uses nsmallest function instead of min function to achieve this functionality.
The original list : [3, 4, 1, 7, 9, 8] The minimum sum pair is : [(3, 1), (4, 1)]
- Python - Minimum Product Pair in List
- Python List Comprehension to find pair with given sum from two arrays
- Python - Find the index of Minimum element in list
- Python - Find minimum k records from tuple list
- Python | Find minimum of each index in list of lists
- Python | Pair and combine nested list to tuple list
- Python | Pair iteration in list
- Python - Get minimum difference in Tuple pair
- Python - Maximum Quotient Pair in List
- Python - Maximum Aggregation Pair in List
- Python | Pair summation of list elements
- Python | Pair the consecutive character strings in a list
- Python | Ways to join pair of elements in list
- Python - Maximum of Consecutive Pair in integer list
- Python | Make pair from two list such that elements are not same in pairs
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.