Given two strings str1 and str2, the task is to check if the two given strings are isomorphic to each other or not.
Two strings are said to be isomorphic if there is a one to one mapping possible for every character of str1 to every character of str2 and all occurrences of every character in str1 map to same character in str2.
Input: str1 = “egg”, str2 = “add”
‘e’ in str1 with ASCII value 101 is mapped to ‘a’ in str2 with ASCII value 97.
‘g’ in str1 with ASCII value 103 is mapped to ‘d’ in str2 with ASCII value 100.
Input: str1 = “eggs”, str2 = “addd”
ASCII-value based Approach: The idea is similar to that of the above approach. Follow the steps below to solve the problem:
- Initialize two arrays of size 256.
- Iterate through characters of the given strings and increment the index equal to the ASCII value of the character at ith position.
- If the are no conflicts in the mapping of the characters, print Yes. Otherwise, print No.
Below is the implementation of the above approach:
Time Complexity: O(N)
Auxiliary Space: O(256)
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course.
In case you wish to attend live classes with industry experts, please refer Geeks Classes Live