Search
⌘K
Get Premium
Leetcode 205. Isomorphic Strings
Determine whether there exists a consistent one-to-one character mapping from s to t that transforms s into t (i.e., each character in s always maps to the same character in t, and no two different s-characters map to the same t-character). Strings are equal length ASCII sequences, so you only need to verify a bijective positional mapping.
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.