 All Problems
Isomorphic Strings
easy
strings
hash map
amazon
google
microsoft
linkedin

Two strings s and t are isomorphic if every character in s can be replaced consistently to get t (no two chars map to the same char).

Example 1:

Input: egg
       add
Output: true

Example 2:

Input: foo
       bar
Output: false

Input format: Line 1 = s, line 2 = t.

Run to check your code against the sample cases, or submit to run every case