String Transformation

AtCoder
IDabc110_c
Time2000ms
Memory256MB
Difficulty
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$ [samples]
Samples
Input #1
azzel
apple
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`.
Input #2
chokudai
redcoder
Output #2
No

No sequences of operation can change `chokudai` to `redcoder`.
Input #3
abcdefghijklmnopqrstuvwxyz
ibyhqfrekavclxjstdwgpzmonu
Output #3
Yes
API Response (JSON)
{
  "problem": {
    "name": "String Transformation",
    "description": {
      "content": "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 ",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc110_c"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "You are given strings $S$ and $T$ consisting of lowercase English letters.\nYou can perform the following operation on $S$ any number of times:\nOperation: Choose two distinct lowercase English letters ...",
      "is_translate": false,
      "language": "English"
    }
  ]
}
Full JSON Raw Segments