Leetcode 205 Isomorphic Strings Solution in java | 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 boolean isIsomorphic(String s, String t) {

       

        if(s.length() != t.length())

            return false;

       

        int[] map1 = new int[256];

        int[] map2 = new int[256];

   

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

           

            if(map1[s.charAt(idx)] != map2[t.charAt(idx)])

                return false;

           

            map1[s.charAt(idx)] = idx + 1;

            map2[t.charAt(idx)] = idx + 1;

        }

        return true;    

    }

}