
Shortest path through a digit grid with diagonal movesCodingYou are given an m x n grid of digits. A cell holding 0 is a wall; a cell holding 1 through 9 is open. Starting at the top-left cell (0, 0), find a shortest route to the…
Last asked Sep 2026








