#527Medium· asked at 4 companies
Find K Pairs with Smallest Sums
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: nums1 = [1,7,11], nums2 = [2,4,6], k = 3 Output: [[1,2],[1,4],[1,6]]
Example 2
Input: nums1 = [1,1,2], nums2 = [1,2,3], k = 2 Output: [[1,1],[1,1]]
Constraints
- •
1 <= nums1.length, nums2.length <= 10^5 - •
-10^9 <= nums1[i], nums2[i] <= 10^9 - •
nums1andnums2both are sorted in non-decreasing order. - •
1 <= k <= 10^4