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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3078. Match Alphanumerical Pattern in Matrix I

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact