LeetCode: Isomorphic Strings

Thank you for visiting this post! Be sure to also take a look at my other work on LinkedIn, Github, and my website.

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 .”



Please click the link below to view the Problem Statement


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!


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!







Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

From JSON to Stylus variables with one line

How JavaScript works? How Scope in JavaScript works? What is Scope Chain?

React Native: 3 ways to use Dev Settings API

NumPy 2D array

Tutorial: build a i18n app with Vue3, Vuex4 and the composition API

Understanding Information Flow in React: Data Down, Action Up

Iterators and Iterables In JavaScript

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Stephanie Segura

Stephanie Segura

More from Medium

A Linear Solution of Parentheses Coding Problems in O(1) Space Complexity

5/11 Binary tree

Common Interview Question Part 1

Approximation Algorithms