Isomorphic Strings
Given two strings s and t, determine if they are isomorphic. Two strings s and t are isomorphic if the characters in s can be replaced to get t. All occurrences of a character must be replaced with another character while preserving the order of characters. No two characters may map to the same character, but a character may map to itself.
Isomorphic Strings
Given two strings s and t, determine if they are isomorphic. Two strings s and t are isomorphic if the characters in s can be replaced to get t. All occurrences of a character must be replaced with another character while preserving the order of characters. No two characters may map to the same character, but a character may map to itself.
Example 1
Input: s = "egg", t = "add" Output: true
Example 2
Input: s = "foo", t = "bar" Output: false
Show hint
Use two hash maps to track character mappings in both directions. Check if mapping is consistent for all characters.
Sign in to submit, save progress and mark problems as solved. You can still run your code.
Loading editor...
"egg"
"add"
true