Linkedin Mülakat Sorusu – Isomorphic Strings

LeetCode içerisinde bulunan “Isomorphic Strings” sorusunun açıklaması ve çözümü. Bu soruda sizi verilen iki string içerisinde, ilk string içerisindeki karakterlerin ikinci string içerisinde tam olarak map’lenmesinin olup olmadığı soruluyor.

► LeetCode 205. Isomorphic Strings:

► Problem açıklaması:

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


1 <= s.length <= 5 * 10^4

t.length == s.length

s and t consist of any valid ascii character.

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.