Leetcode 2060. Check if an Original String Exists Given Two Encoded Strings

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.

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 2060. Check if an Original String Exists Given Two Encoded Strings

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact