Check if Two given Strings are Isomorphic to each other

#include<bits/stdc++.h>
#define NO_OF_CHARS 256
using namespace std;
 
// This function returns true if s1 and s2 are ismorphic
bool isIsomorphic(string s1, string s2)
{
 
    int m = s1.length(), n = s2.length();
 
    //if lengths are not same then they are not isomorphic
    if (m != n)
      return false;
 
    // To mark visited characters in s2
    bool is_visited[NO_OF_CHARS] = {false};
 
    // To store mapping of every character from s1 to
    // that of s2. Initialize all entries of map as -1.
    int map[NO_OF_CHARS];
    memset(map, -1, sizeof(map));
 
    // P
    for (int i = 0; i < n; i++)
    {
        // If current character of s1 is seen first
        // time in it.
        if (map[s1[i]] == -1)
        {
            // If current character of s2 is already
            // seen, one to one mapping not possible
            if (is_visited[s2[i]] == true)
                return false;
 
            // Mark current character of s2 as visited
            is_visited[s2[i]] = true;
 
            // Store mapping of current characters
            map[s1[i]] = s2[i];
        }
 
        //if this is not the first appearence of char in s1
        //then check its previous appearence is mapped to the
        //respective character
        else if (map[s1[i]] != s2[i])
            return false;
    }
 
    return true;
}
 
int main()
{
   string s1,s2;
   cin>>s1>>s2;
   if(isIsomorphic(s1, s2))
   {
       cout<<"TRUE"<<endl;
   }
   else
   {
       cout<<"FALSE"<<endl;
   }
   return 0;
}

Java Program to Check if Two given Strings are Isomorphic to each other

import java.util.Scanner;
class sum
{
    // This function returns true if s1 and s2 are ismorphic
    public static boolean isIsomorphic(String s1, String s2)
    {
        int m = s1.length(), n = s2.length();
        //if lengths are not same then they are not isomorphic
        if (m != n)
          return false;
        // To mark visited characters in s2
        boolean is_visited[] = new boolean[256];
        for(int i=0;i<256;i++)
        {
            is_visited[i]=false;
        }
        // To store mapping of every character from s1 to
        // that of s2. Initialize all entries of map as -1.
        int map[] = new int [256];
        for(int i=0;i<256;i++)
        {
            map[i]=-1;
        }
        // P
        for (int i = 0; i < n; i++)
        {
            // If current character of s1 is seen first
            // time in it.
            if (map[s1.charAt(i)] == -1)
            {
                // If current character of s2 is already
                // seen, one to one mapping not possible
                if (is_visited[s2.charAt(i)] == true)
                    return false;

                // Mark current character of s2 as visited
                is_visited[s2.charAt(i)] = true;

                // Store mapping of current characters
                map[s1.charAt(i)] = s2.charAt(i);
            }

            //if this is not the first appearence of char in s1
            //then check its previous appearence is mapped to the
            //respective character
            else if (map[s1.charAt(i)] != s2.charAt(i))
                return false;
        }

        return true;
    }
    public static void main(String[] args)  
    { 
        Scanner sr = new Scanner(System.in);
        String s1 = sr.next();
        String s2 = sr.next();
        if(isIsomorphic(s1,s2)==true)
        {
            System.out.println("TRUE");
        }
        else
        {
            System.out.println("FALSE");
        }
    }
    
}

abpanban
pjhpljpl

TRUE

abpanban
pppjhljl

FALSE

Complexity Analysis to Check if Two given Strings are Isomorphic to each other