Palindrome Pain
You are given two integers $X$ and $Y$. You need to construct two different strings $S_1$ and $S_2$ consisting of only the characters $‘a’$ and $‘b’$, such that the following conditions are satisfied: 1. Both $S_1$ and $S_2$ are [palindromes](https://en.wikipedia.org/wiki/Palindrome). 2. Both $S_1$ and $S_2$ should contain exactly $X$ occurrences of $\texttt{a}$ and $Y$ occurrences of $\texttt{b}
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.
Sign in to chat with the tutor and save your progress.
Sign in to start