Easy data structure and algorithm practice puzzle.
Given a linked list, passed in as its values, return true if it's sorted from smallest to largest. Equal neighbors are fine. Compare each value with the one before it, and return false the moment one is smaller. An empty list counts as sorted.
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 Document Undo Stack, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles