Skip to main content

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.

Problems19 / 152
Sign in

Isomorphic Strings

EASYStringHash Table

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.

Draft saves automatically

Loading editor...

Submit also runs hidden tests
s =
"egg"
t =
"add"
Expected
true
Run with your own input (JSON)