Isomorphic Strings
Try to solve the Isomorphic Strings problem.
We'll cover the following...
Statement
Given two strings, check whether two strings are isomorphic to each other or not. Two strings are isomorphic if a fixed mapping exists from the characters of one string to the characters of the other string. For example, if there are two instances of the character "a" in the first string, both these instances should be converted to another character (which could also remain the same character if "a" is mapped to itself) in the second string. This converted character should remain the same in both positions of the second string since there is a fixed mapping from the character "a" in the first string to the converted ...
Create a free account to view this lesson.
By signing up, you agree to Educative's Terms of Service and Privacy Policy