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: Accepted)

import java.util.*;

class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        String T = sc.next();
      	String[] ss = new String[2*100000];
        int[] sss = new int[2*100000];
        String[] tt = new String[2*100000];
        int[] ttt = new int[2*100000];
      	Set<String> se = new HashSet<String>();
      	Set<String> se2 = new HashSet<String>();
      for(int i = 0; i< S.length() ; i++){
        se.add(S.substring(i,i+1));
      }
      for(int i = 0; i< T.length() ; i++){
        se2.add(T.substring(i,i+1));
      }
      int i = 0;
      for(String value : se){
	  	ss[i] = value;
        int count = 0;
        for(int j = 0; j < S.length(); j++){
        	if(Objects.equals(ss[i],S.substring(j,j+1)))
            {
            count++;
            }
        }
        sss[i] = count;
        ++i;
      }
      
      int ii = 0;
      for(String value : se2){
	  	tt[ii] = value;
        int count = 0;
        for(int j = 0; j < T.length(); j++){
        	if(Objects.equals(tt[ii],T.substring(j,j+1)))
            {
            count++;
            }
        }
        ttt[ii] = count;
        ++ii;
      }
      Arrays.sort(sss);
      Arrays.sort(ttt); 
      
      if(Arrays.equals(sss,ttt)){
      System.out.println("Yes");
      } else{
      System.out.println("No");
      }
    }
}