Problem:
Score : 300 points

Problem Statement

You are given strings S and T consisting of lowercase English letters.

You can perform the following operation on S any number of times:

Operation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.

Determine if S and T can be made equal by performing the operation zero or more times.

Constraints

1 \leq |S| \leq 2 \times 10^5

|S| = |T|

S and T consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:

S
T

Output

If S and T can be made equal, print Yes; otherwise, print No.

Sample Input 1

azzel
apple

Sample Output 1

Yes

azzel can be changed to apple, as follows:

Choose e as c_1 and l as c_2. azzel becomes azzle.

Choose z as c_1 and p as c_2. azzle becomes apple.

Sample Input 2

chokudai
redcoder

Sample Output 2

No

No sequences of operation can change chokudai to redcoder.

Sample Input 3

abcdefghijklmnopqrstuvwxyz
ibyhqfrekavclxjstdwgpzmonu

Sample Output 3

Yes

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.awt.Point;
import java.util.ArrayDeque;
import java.util.Scanner;
import java.util.*;
import java.util.Arrays;
import java.util.ArrayList;
import java.util.Set;
import java.util.HashSet;
import java.util.Collection;



public class Main{

        static final Scanner sc=new Scanner(System.in);






        public static void main(String[]args){
                String S=sc.next();
                String T=sc.next();
                int s[]=new int[S.length()];
  int t[]=new int[S.length()];
  for(int i=0;i<S.length();i++){
    s[i]=moji(S.charAt(i));
    t[i]=moji(T.charAt(i));
  }
  boolean ok=true;
  for(int i=1;i<=26;i++){
    int a[]=new int[200000];
    int sum=0;
   for(int j=0;j<S.length();j++){
      if(s[j]==i){
        a[sum]=j;
        sum++;
      }
    }
    
    
    for(int k=0;k<sum;k++){
      if(t[a[k]]==t[a[k+1]]){
        

      }else{
        ok=false;

      }

    }
    

    }
    if(ok){
      System.out.println("Yes");
    }else{

      System.out.println("No");
    }






                



        }








        
        private static int gcd(int m, int n) {
                if(m < n) return gcd(n, m);
                if(n == 0) return m;
                return gcd(n, m % n);
            }
        private static int moji(char i){
                if(i=='a'){
                        return 1;
                      }
                      if(i=='b'){
                        return 2;
                      }
                      if(i=='c'){
                        return 3;
                      }
                      if(i=='d'){
                        return 4;
                      }
                      if(i=='e'){
                        return 5;
                      }
                      if(i=='f'){
                        return 6;
                      }
                      if(i=='g'){
                        return 7;
                      }
                      if(i=='h'){
                        return 8;
                      }
                      if(i=='i'){
                        return 9;
                      }
                      if(i=='j'){
                        return 10;
                      }
                      if(i=='k'){
                        return 11;
                      }
                      if(i=='l'){
                        return 12;
                      }
                      if(i=='m'){
                        return 13;
                      }
                      if(i=='n'){
                        return 14;
                      }
                      if(i=='o'){
                        return 15;
                      }
                      if(i=='p'){
                        return 16;
                      }
                      if(i=='q'){
                        return 17;
                      }
                      if(i=='r'){
                        return 18;
                      }
                      if(i=='s'){
                        return 19;
                      }
                      if(i=='t'){
                        return 20;
                      }
                      if(i=='u'){
                        return 21;
                      }
                      if(i=='v'){
                        return 22;
                      }
                      if(i=='w'){
                        return 23;
                      }
                      if(i=='x'){
                        return 24;
                      }
                      if(i=='y'){
                        return 25;
                      }
                      if(i=='z'){
                        return 26;
                      }
                      return 100;
                      
        }






}