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 Java (OpenJDK 11.0.6) (judge verdict: Wrong Answer)

import java.util.*;

public class Main{
  public static void main(String[] args){
    Scanner scan = new Scanner(System.in);
    String s = scan.next();
    String t = scan.next();

    String a = "abcdefghijklmnopqrstuvwxyz";

    ArrayList<ArrayList<Integer>> b = new ArrayList<ArrayList<Integer>>();
    ArrayList<ArrayList<Integer>> c = new ArrayList<ArrayList<Integer>>();

    for (int i=0;i<26;i++){
      ArrayList<Integer> b1 = new ArrayList<Integer>();
      b1.add(-1);
      b.add(b1);
      ArrayList<Integer> c1 = new ArrayList<Integer>();
      c1.add(-1);
      c.add(c1);
    }

    for (int i=0;i<s.length();i++){
      for (int j=0;j<26;j++){
        if (a.charAt(j) == s.charAt(i)){
          ArrayList<Integer> d = b.get(j);
          d.add(i);
          break;
        }
      }

      for (int j=0;j<26;j++){
        if (a.charAt(j) == t.charAt(i)){
          ArrayList<Integer> e = c.get(j);
          e.add(i);
          break;
        }
      }
    }

    ArrayList<Character> check = new ArrayList<Character>();
    for (int i=0;i<s.length();i++){
      char g = s.charAt(i);
      if (check.contains(g)){
        continue;
      }
      else{
        check.add(g);
        for (int j=0;j<26;j++){
          if (g == a.charAt(j)){
            ArrayList<Integer> mm = b.get(j);
            boolean ff = false;
            for (int k=0;k<26;k++){
              ArrayList<Integer> nn = c.get(k);
              if (find(mm,nn) == 1){
                ff = true;
                break;
              }
            }
            if (ff == false){
              System.out.println("Yes");
              return;
            }
          }
        }
      }
    }
    System.out.println("Yes");
  }

  static int find(ArrayList<Integer> a, ArrayList<Integer> b){
    if (a.size() != b.size()){
      return 0;
    }

    for (int i=0;i<a.size();i++){
      if (a.get(i) != b.get(i)){
        return 0;
      }
    }
    return 1;
  }
}