Available question text
Given a pattern and a string, determine whether you can assign each pattern character to a non-empty substring of the string (different characters map to different substrings) so that concatenating the mapped substrings in pattern order exactly recreates the string; this typically requires backtracking to explore consistent, bijective mappings.
Related questions
Continue with questions that share topics or the same question type.
- Word Pattern
Coding
- 132 Pattern
Coding · Array · Binary Search · Monotonic Stack
- Analyze User Website Visit Pattern
Coding · Array · Hash Table · Sorting
- Bad Word Checker
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 291. Word Pattern II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source