Medium data structure and algorithm practice puzzle.
Given a grid of transition counts and the current state, return the most likely next state. Look only at the current state's row and return the index of its biggest count. You don't need to turn the counts into probabilities first, because dividing everything by the same total can't change which one is biggest.
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 Step Range Service, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles