Match Alphanumerical Pattern in Matrix I: coding question

Available question text

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.

Continue with questions that share topics or the same question type.

Design Excel Sum Formula
Coding · Array · Design · Graph Theory
Design Spreadsheet
Coding · Array · Design · Hash Table
Analyze User Website Visit Pattern
Coding · Array · Hash Table · Sorting
Accounts Merge
Coding · Array · Breadth-First Search · Depth-First Search

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

Meta
Leetcode 3078. Match Alphanumerical Pattern in Matrix I
Reported Jul 1, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source

LeetCode company tags · 2 records

Roblox
Match Alphanumerical Pattern in Matrix I
Reported date not specified · Source window: 3mo
Source snapshot: Oct 20, 2026
Source frequency score: 64.1. This is not an interview probability.
View source
Roblox
Match Alphanumerical Pattern in Matrix I
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 63.3. This is not an interview probability.
View source

Available question text

Match Alphanumerical Pattern in Matrix I

Available question text

Related questions

Match Alphanumerical Pattern in Matrix I

Available question text

Related questions