Palindromes Not Allowed

CodeChefRating 1360Open on judge ↗

It is JJ's birthday and you decide to gift him a string $S$ (consisting of English alphabet only) of length $N$. But you also know that JJ does not like palindromes so you decide that none of the substrings of $S$ of length $\ge 2$ should be a palindrome. Can you find any suitable string which can be gifted to JJ? Recall that a string is called palindrome if it reads the same backwards and forwa

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