Medium data structure and algorithm practice puzzle.
Given a list of numbers and a window size, split the list into chunks of that size, with no overlap, and return the average of each chunk, rounded to 3 decimals. Drop any leftover that doesn't fill a whole chunk. So [2, 4, 6, 8] with size 2 is [3, 7]. The output shrinks by exactly the window size.
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 Anomaly Watch, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles