Medium data structure and algorithm practice puzzle.
Given two linked lists, passed in as their values, weave them together one node at a time, starting with the first list. When one runs out, add the rest of the other. So [1] and [2, 3, 4] becomes [1, 2, 3, 4].
Solve it three ways: snap the jigsaw pieces together, fill in the blanks, or type it from scratch against the tests. This one is free.
Every line of the solution comes with a note explaining why it is there, and a step by step replay shows the code running. At level 3, where you type it yourself, you can ask for an AI mock interview on this problem that ends with a hiring manager's scorecard.
Then grow it into a real project with the Software Engineer button: this puzzle becomes the Match Replay Log, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles