Solution16.java

/*205. Isomorphic Strings

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.
*/
class Solution {
    public boolean isIsomorphic(String s, String t) {
        if (s.length() != t.length()) // Check if strings have different lengths
            return false;
        
        int[] mapS = new int[256]; // Assuming ASCII characters
        int[] mapT = new int[256];
        
        for (int i = 0; i < s.length(); i++) {
            char charS = s.charAt(i);
            char charT = t.charAt(i);
            
            if (mapS[charS] != mapT[charT]) {
                return false; // If the mappings are inconsistent, return false
            } else {
                mapS[charS] = i + 1; // Update the mappings
                mapT[charT] = i + 1;
            }
        }
        return true; // If all characters mapping is consistent, return true
    }
}