Isomorphic Strings

easy

Hashmap and Heaps

Question Solve Solutions

1. You will be given two strings s and t
 2. You need to check if they are isomorphic.
 3. Two strings are isomorphic if we can map the characters of string 1 to characters of string 2.
 4. Return true or false.
 5. Input and output is handled for you
 6. It is a functional problem ,please do not modify main()

Input Format

Input is handled for you.

Output Format

Output is handled for you.

Constraints

Assume input strings are in lowercase

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input

paper
title

Output

true

Related Questions

easy Double Pair Array easy Subdomain Visit Count easy Group Anagrams easy Valid Anagram easy Longest Subarray With Sum Divisible By K easy The Skyline Problem easy Word Pattern easy Number Of Employees Under Every Manager easy Find Itinerary From Tickets easy Check If An Array Can Be Divided Into Pairs Whose Sum Is Divisible By K easy Largest Subarray With Zero Sum easy Count Distinct Elements In Every Window Of Size K easy Largest Subarray With Contiguous Elements medium Count Of All Subarrays With Zero Sum hard Smallest Substring Of A String Containing All Characters Of Another String medium Smallest Substring Of A String Containing All Unique Characters Of Itself