Score : $200$ points
You are given two strings $S$ and $T$. Determine whether it is possible to make $S$ and $T$ equal by doing the following operation at most once:
Note that it is allowed to choose not to do the operation.
Input is given from Standard Input in the following format:
$S$ $T$
If it is possible to make $S$ and $T$ equal by doing the operation in Problem Statement at most once, print Yes
; otherwise, print No
.
abc acb
Yes
You can swap the $2$-nd and $3$-rd characters of $S$ to make $S$ and $T$ equal.
aabb bbaa
No
There is no way to do the operation to make $S$ and $T$ equal.
abcde abcde
Yes
$S$ and $T$ are already equal.