Meet your coaches
Talk through the problem while you code. Signed-in reps become prep memory for the next session.
Start Part 1 to unlock your next challenge
Merge K Sorted Lists
You know how to merge two sorted lists—but what happens when there are k of them? Interviewers use this to see if you can scale your thinking and pick the right data structure for efficiency. The heap-based approach is elegant, but the real signal is how you reason about the tradeoffs.
Meet your coaches
Talk through the problem while you code. Signed-in reps become prep memory for the next session.
Chat with Fin or Coco right now on mobile.
Start talking through the problem here. Switch to desktop when you're ready to code and run tests.
Start coaching sessionStart a coached rep now. Sign in before or after the session so StrongYes can save what you struggled with to your prep memory.
Email me this coached-rep link
Start Part 1 to unlock your next challenge
Desktop required
Sorry - mobile cannot run the editor and tests yet. Use the next step below or email yourself a link to continue on desktop.
Stay in the library until you can get back to desktop for the full editor and tests.