• Home
• com.github.javadev
• leetcode-in-java
• 1.38
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0201_0300.s0205_isomorphic_strings.readme.md Maven / Gradle / Ivy

205\. Isomorphic Strings

Easy

Given two strings `s` and `t`, _determine if they are isomorphic_.

Two strings `s` and `t` are isomorphic if the characters in `s` can be replaced to get `t`.

All occurrences of a character must be replaced with another character while preserving the order of characters. No two characters may map to the same character, but a character may map to itself.

**Example 1:**

**Input:** s = "egg", t = "add"

**Output:** true 

**Example 2:**

**Input:** s = "foo", t = "bar"

**Output:** false 

**Example 3:**

**Input:** s = "paper", t = "title"

**Output:** true 

**Constraints:**

*   1 <= s.length <= 5 * 104
*   `t.length == s.length`
*   `s` and `t` consist of any valid ascii character.