← All problemsSign in

Break the Myth

In Chef village there is a myth that there does not exist any string which is not a palindrome. Chef however an intellectual guy knows that it's not true. Chef challenges the villagers that he will be able to convert any string to a non-palindromic string. The chef will be given a list of $T$ strings. The chef will try to change each string having a length $N$ to a non-palindromic and if he ca

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

Sign in to chat with the tutor and save your progress.

Sign in to start