Practice Word Search
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Given an m x n grid of characters board and a string word, return true if word exists in the grid. The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once. Follow up: Could you use search pruning to make your solution faster with a larger board?
Source: Word Search on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCCED"
true
# Example 2
board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "SEE"
true
# Example 3
board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCB"
false
Constraints
Related LeetCode Problems
Practice more problems similar to Word Search.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.