Find K Pairs with Smallest Sums (C# and Python3)

You are given two integer arrays nums1 and nums2 sorted in ascending order and an integer k.

Define a pair (u, v) which consists of one element from the first array and one element from the second array.

Return the k pairs (u1, v1), (u2, v2), ..., (uk, vk) with the smallest sums.




Don’t miss these tips!

We don’t spam! Read our privacy policy for more info.

Open chat
Powered by