Word Path in a Letter Grid

Asked at Glean · Coding Questions · Difficulty: Medium

Given a rectangular grid of upper-case letters and a target word, decide whether the word can be spelled by walking through the grid one neighbouring cell at a time, never stepping on the same cell twice.

Loading the problem…