Leetcode 79. Word Search

Determine whether a target word can be formed by a path of horizontally or vertically adjacent cells in an m×n letter grid without reusing a cell. The core challenge is performing DFS/backtracking on the grid with visited tracking (and optional pruning) to efficiently explore valid paths.