Problem 3797 · Hard

Count Routes to Climb a Rectangular Grid

Climb from the bottom row to the top row through dot cells, stepping to nearby cells within distance d and never making two sideways moves in a row.

Open the interactive visualisation