Skip to interview prep
Apexed

331. Determine whether a word exists in a 2D grid of letters, moving between horizontally or vertically adjacent cells without reusing a cell.

MediumString algorithms

Technical

Write a solution in JavaScript or Python, add a few test calls that print results and press Run. This is ungraded practice: Run shows output and does not check correctness. Open the Model answer tab to compare. Your code is saved in this browser.

Tab indents · Ctrl/⌘ + Enter runs · Esc then Tab leaves the editor

Press Run to see your program’s output.

Determine whether a word exists in a 2D grid of letters, moving between horizontally or vertically adjacent cells without reusing a cell. — Data structures & al