Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to Heaps & priority queues

Ready to read

JSJavaScript⑂Git◎Interview prepΣDSA in JSSDSystem Design
More topics15›
</>HTML{ }CSS⚛ReactNNext.jsNeNest.jsTSTypeScriptNoNode.js🐳DockerDBSQL & Databases✓Testing🔒Web Security☁Cloud & DevOps◈GraphQL◆Redis☸Kubernetes
☰‹›
Description
All topics›JavaScript›Heaps & priority queues

Find K Pairs with Smallest Sums

advancedlayer I3 · Heaps & priority queues5 tests

Given two integer arrays nums1 and nums2, both sorted in non-decreasing order, and an integer k, return the k pairs [u, v] — one value from each array — with the smallest sums.

  • If fewer than k pairs exist, return all of them
  • Building every pair is O(n * m) and far too slow for large inputs
  • Pairs with equal sums may appear in any order
  • A MinHeap class is already written for you in the starter — you only need the algorithm

Stuck?

All exercisesPlayground
1234567891011121314
loading the editor…

Nothing yet — hit Run and whatever you log shows up here.

Submit to see how you did.

⌘/Ctrl + Enter run⌘/Ctrl + S save⌘/Ctrl + / comment⌘/Ctrl + F find/replace⌘/Ctrl + D select next matchAlt + click multi-cursorTab indent · ⇧Tab outdentEsc leave fullscreen