A Trade Between Friends

CodeChefOpen on judge ↗

Bob and Alice are very close friends. Once they decided to go to a shop to buy strings for themselves. The strings available in the shop contain only lowercase Latin letters. Alice and Bob decided to buy strings of the same length $N$. They also wanted the strings to be equal. It is guaranteed that the shop has at least two strings of the length $N$. But it's not guaranteed that the shop has two

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