Do Equal

CodeChefOpen on judge ↗

Rahul has n strings each of lowercase English Letters. In one move he can rotate a string towards left by 1.For example, if he has the string “banana”, in one move he can transform it into the string “ananab”. After the Plenty of moves(possibly zero) if a string si is equal to string sj then si will be equal to 0. Now Rahul asks himself: what is minimum moves to make n strings 0!! NOTE: Stri

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