Determine whether a word exists in a letter grid

Q: Determine whether a word exists in a letter grid

This question evaluates algorithmic problem-solving and implementation skills in grid-based search, including concepts like graph traversal and backtracking; it falls under Coding & Algorithms and primarily assesses practical application and state-management implementation rather than only conceptual understanding.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Loading...

Given an m x n grid of characters board and a string word, determine whether word can be constructed from sequentially adjacent cells.

Rules:

Adjacent cells are those horizontally or vertically neighboring (no diagonals).
The same cell may not be used more than once in a single construction path.

Input

board : 2D array of characters
word : target string

Output

Return true if word exists in the grid by the rules above, else false .

Example

board = [[A,B,C,E],[S,F,C,S],[A,D,E,E]], word = "ABCCED" → true

Constraints

1 ≤ m, n ≤ 12
1 ≤ |word| ≤ m*n

Determine whether a word exists in a letter grid

Quick Overview

Input

Output

Example

Constraints

Comments (0)