Easy

Quiz

#205 Isomorphic Strings

APPROACH

Given two strings s and t, determine if they are isomorphic.

Two strings are isomorphic if every character in s can be consistently mapped to a unique character in t to produce t. All occurrences of a character must map to the same replacement, and no two distinct characters in s may map to the same character in t, though a character may map to itself.

1 of 4
1:00

What is the optimal approach for this problem?