โ† OYO questions
CodingReported in a candidate post, Jun 2021

Find K Pairs with Smallest Sums

Filed under OYO

Given two sorted arrays nums1 and nums2 and an integer k, return the k pairs (u, v) with the smallest sums, where u is from nums1 and v is from nums2.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related OYO questions

Collected from public candidate posts and coding forums. Updated Nov 2026.