Problem 935 · Medium

Knight Dialer

Count digit sequences of a given length that can be typed by moving a chess knight across a phone keypad. The visual shows the keypad with the number of sequences ending at each digit updated per step.

Open the interactive visualisation