Word Search — Medium Coding Interview Question

Given an m x n grid of characters board and a string word, return true if word exists in the grid.

Example

Input: board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCCED"

Output: true

Constraints

• 1 <= m, n <= 6
• 1 <= word.length <= 15

Topics & Companies

Topics: backtracking, arrays

Asked by: Amazon, Microsoft

Optimal Solution Complexity

Time complexity: O(N * 4^L). Space complexity: O(L).

Practice more

• All DSA Problems
• DSA Patterns