Word Search (DFS)

📝 Description

Given 2D board and word, find if word exists in the grid (DFS)

Input Format

[[c11,c12,...],...] (2D grid), word

Output Format

true/false

Constraints

m,n ≤ 6, word length ≤ 15

🔍 Sample Input

[["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], "ABCCED"
            

✅ Sample Output

true