Available question text
Determine whether two strings of letters and digit-substrings (where digits represent lengths of omitted substrings) can both be encodings of the same original string. The core challenge is matching the two encodings by exploring states (positions in each string plus the net unmatched length difference) via DFS/DP with memoization, treating digit runs (≤3 digits) as variable-length skips.
Related questions
Continue with questions that share topics or the same question type.
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 2060. Check if an Original String Exists Given Two Encoded Strings
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source