Typo

CodeChefOpen on judge ↗

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 : - choose two adjacent characters in $S$ and swap them. ### Input - $S$$T$ ### Output - 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. ### Constraints - Each of $S$

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI