Medium data structure and algorithm practice puzzle.
Given a linked list, passed in as its values, and a position n (starting from 0), remove the node at n and return the values left. If n is past the end, return the list unchanged. On a real linked list, you'd just point the node before it past it.
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 Sample Cache Tier, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles