Taking a look at another Algorithm this week, we’re tackling Isomorphic Strings. What are they and how in the world can we determine if the strings we have are Isomorphic or not? Let’s look at the definition below and get started:
“Two strings, X and Y , are called isomorphic if all occurrences of each character in X can be replaced with another character to get Y and vice-versa. For example, consider strings ACAB and XCXY .”
(Techiedelight.com)
Problem
Please click the link below to view the Problem Statement
Solution
My solution was the following:
Although my solution worked, it was not very fast on the time complexity spectrum. As always, here is a faster, optimal, one liner solution.
Using the spread operator, mapping through each element of the string and comparing the index to the other string. Genius!
Conclusion
Thank you so much for stopping by! Stay tuned for more Algorithm Content!
Please checkout my online portfolio and feel free to connect with me on Linkedin!
Sources:
https://leetcode.com/problems/isomorphic-strings/discuss/285805/One-line-JavaScript-Solution