Leetcode 3078. Match Alphanumerical Pattern in Matrix I

Given an m×n grid of alphanumeric characters and a target pattern string, determine whether the pattern can be formed by a path of adjacent (up/down/left/right) cells without revisiting a cell. This is a DFS/backtracking search problem requiring careful pruning to handle grid size and pattern length.