Easy data structure and algorithm practice puzzle.
Given a list of seat numbers that are already taken, return the lowest seat number that's free. Seats start at 1. Put the taken seats in a set, then check 1, 2, 3, and so on until you find one that isn't in 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 Calendar Merger, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles