Easy data structure and algorithm practice puzzle.
Given a 2D grid, return all its values in one flat array, row by row. Walk each row from left to right and add every value. In this row-major order, the cell at (r, c) ends up at index r x width + c, which is also how a 2D array is actually stored in memory.
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 Window Auditor, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles