10509: ABC110 —— C - String Transformation
[Creator : ]
Description
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.
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.
Input
Input is given from Standard Input in the following format:
```
$S$
$T$
```
```
$S$
$T$
```
Output
If $S$ and $T$ can be made equal, print `Yes`; otherwise, print `No`.
Constraints
- $1 \leq |S| \leq 2 \times 10^5$
- $|S| = |T|$
- $S$ and $T$ consists of lowercase English letters.
- $|S| = |T|$
- $S$ and $T$ consists of lowercase English letters.
Sample 1 Input
azzel
apple
Sample 1 Output
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 2 Input
chokudai
redcoder
Sample 2 Output
No
No sequences of operation can change chokudai to redcoder.
Sample 3 Input
abcdefghijklmnopqrstuvwxyz
ibyhqfrekavclxjstdwgpzmonu
Sample 3 Output
Yes