Search
⌘K
Get Premium
Leetcode 1153. String Transforms Into Another String
Given two equal-length strings s and t, determine whether s can be converted into t by repeatedly replacing all occurrences of one character in s with another character; mappings must be consistent, and cycles in the character-mapping graph require at least one unused character (e.g., from the alphabet) to break.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.