Solution: Find K Pairs with Smallest Sums
Let's solve the Find K Pairs with Smallest Sums problem using the K-Way Merge pattern.
Statement
Given two arrays and an integer , find pairs of numbers with the smallest sum so that in each pair, each array contributes one number to the pair.
Constraints:
-
list1.length
,list2.length
-
list1[i]
,list2[i]
-
-
Input lists should be sorted in ascending order.
-
If the value of exceeds the total number of valid pairs that may be formed, return all the pairs.
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.