← Questions
Find K pairs with the smallest sums
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given two sorted arrays and k, return the k pairs (one number from each array) with the smallest sums. Start a min-heap with pairs formed from the first elements and push the next candidate each time you pop, instead of building every pair.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding