Given a grid of characters and a word, return whether the word exists as a path of adjacent cells (up, down, left, right) without reusing a cell. First solve with a visited array and state…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.