{"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 $c_1$ and $c_2$, then replace every occurrence of $c_1$ with $c_2$, and every occurrence of $c_2$ with $c_1$.\nDetermine if $S$ and $T$ can be made equal by performing the operation zero or more times.\n\n## Constraints\n\n*   $1 \\leq |S| \\leq 2 \\times 10^5$\n*   $|S| = |T|$\n*   $S$ and $T$ consists of lowercase English letters.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$S$\n$T$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc110_c","tags":[],"sample_group":[["azzel\napple","Yes\n\n`azzel` can be changed to `apple`, as follows:\n\n*   Choose `e` as $c_1$ and `l` as $c_2$. `azzel` becomes `azzle`.\n*   Choose `z` as $c_1$ and `p` as $c_2$. `azzle` becomes `apple`."],["chokudai\nredcoder","No\n\nNo sequences of operation can change `chokudai` to `redcoder`."],["abcdefghijklmnopqrstuvwxyz\nibyhqfrekavclxjstdwgpzmonu","Yes"]],"created_at":"2026-03-03 11:01:14"}}