Jun 25, 2020
2 min read
CODING
Day 28: The “Find K Pairs with Smallest Sums” Problem
Problem:
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.
