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.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String S = sc.next();
		String T = sc.next();
		sc.close();
		
		boolean flag = true;
		Map<Character, Character> map = new HashMap<>();
		Map<Character, Integer> sMap = new HashMap<>();
		Map<Character, Integer> tMap = new HashMap<>();
		for(int i = 0;i < S.length();++i) {
			if(map.containsKey(S.charAt(i))) {
				if(map.get(S.charAt(i)) != T.charAt(i)) {
					flag = false;
					break;
				}
			} else {
				map.put(S.charAt(i), T.charAt(i));
			}
			if(sMap.containsKey(S.charAt(i)))
				sMap.put(S.charAt(i), sMap.get(S.charAt(i)) + 1);
			else
				sMap.put(S.charAt(i), 1);
			if(tMap.containsKey(T.charAt(i)))
				tMap.put(T.charAt(i), tMap.get(T.charAt(i)) + 1);
			else
				tMap.put(T.charAt(i), 1);
		}
		if(flag) {
			List<Entry<Character, Integer>> sList = new ArrayList<>(sMap.entrySet());
			List<Entry<Character, Integer>> tList = new ArrayList<>(tMap.entrySet());
			sList.sort(Entry.comparingByValue());
			tList.sort(Entry.comparingByValue());
			if(sList.size() != tList.size()) {
				flag = false;
			} else {
				for(int i = 0;i < sList.size();++i) {
					if(sList.get(i).getValue() != tList.get(i).getValue()) {
						flag = false;
						break;
					}
				}
			}
		}
		
		if(flag)
			System.out.println("Yes");
		else
			System.out.println("No");
	}
}