CHEF AND ROTATION

CodeChefOpen on judge ↗

Once Chef was walking on the Road he watched many Vehicles on the Road , as Chef is good at observing things. He observed the rotation of the wheels carefully, and from there he formed a problem in his mind as given below- Given a string $A$ and a another string $B$. He wants to know that, is the given string $A$ when rotated as many number of times you can, will ever form a string same as

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