Identical Words

CodeChefOpen on judge ↗

Ritesh is fond of playing with strings, he always curious to know to find strings property, This time he has three strings $S1$, $S2$, $S3$ and he wants to find , if it is possible to make $S2$ and $S3$ equivalent to $S1$ by **Re-arranging** characters of $S2$ and/or $S3$ any number of times. For Example: $S1$ = "ritesh" $S2$ = "irtesh" $S3$ = "irtehs" By performing

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