Find K Pairs with Smallest Sums
Amazon● MediumFULLTIMEPHONE SCREENProblem statement
Given two integer arrays nums1 and nums2, both sorted in nondecreasing order, consider every index pair (i, j) and the pair [nums1[i], nums2[j]].
The problem statement continues
ProExamples
Example 1
nums1 = [1,7,11]nums2 = [2,4,6]k = 3return = [[1,2],[1,4],[1,6]]The three smallest pair sums are 3, 5, and 7.
Original screenshot from the interview report
ProFastPrep Pro
Reported in 1 Amazon interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 1 more worked example, explained
- Guided hints and editorial
- Run your code on real test cases
$8.25/month
$99 billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week