← All problemsSign in

Dummy Palindromic Strings

A *dummy palindromic string* (DPS) is a string which can be converted into a palindrome by performing each of the following operations exactly once: - Permute the characters of the string in an arbitrary way. - Choose a valid index $i$ and change the $i$-th character of the resulting string to a **different** character (not necessarily present in the original string). You are given a string $S$.

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