Leetcode 373. Find K Pairs with Smallest Sums

Given two non-decreasing arrays, return the k pairs (one element from each) with the smallest sums — the challenge is to efficiently produce the smallest k sums from the Cartesian product without enumerating all pairs, typically via a min-heap / k-way merge.

Asked at:

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Mid February, 2025

Senior

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 373. Find K Pairs with Smallest Sums

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact