Distinct Palindrome

CodeChefRating 1304Open on judge ↗

Given integers $N$ and $X$, generate a [palindrome](https://en.wikipedia.org/wiki/Palindrome) of length $N$ consisting of **lowercase English alphabets** such that the number of **distinct** characters in the palindrome is **exactly** $X$. If it is impossible to do so, print $-1$ instead. ### Input - First line will contain $T$, number of test cases. Then the test cases follow. - Each test case

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