Check if a word exists in a grid
TuroSoftware Engineer · Technical Screen
Last updated
This question evaluates a candidate's skills in backtracking search, grid traversal, and managing state for constrained path-finding problems. Commonly asked to assess algorithmic problem-solving, recursion and memory-management (including in-place visited marking) within the Coding & Algorithms domain, it emphasizes practical application and understanding of time and space complexity trade-offs rather than purely theoretical concepts.
Given an m×n grid of characters and a string word, determine whether the word can be formed by sequentially adjacent cells (adjacent means horizontally or vertically). The same cell may not be used more than once in a single path.
Implement a function exists(board, word) -> bool.
Follow-up: Explain how to do the visited marking in-place (without an extra visited matrix) and derive the time and space complexity.
Solution walkthrough is for members
Get the full walkthrough with reference code and complexity analysis, plus Kitty Coach at 300 messages a day. Hints, the code runner and community answers stay free.