Leetcode 205 Isomorphic Strings Solution in c++ | Hindi Coding Community

 

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

class Solution {

public:

    bool isIsomorphic(string s, string t) {

       

        unordered_map <char , char> rep;

        unordered_map <char , bool> used;

       

        for(int idx = 0 ; idx < s.length() ; idx++) {

           

            if(rep.count(s[idx])) {

               

                if(rep[s[idx]] != t[idx])

                    return false;

            }

           

            else {

                if(used[t[idx]])

                    return false;

               

                rep[s[idx]] = t[idx];

                used[t[idx]] = true;

            }

        }

       

        return true;

    }

};