Sharma and Palindrome

CodeChefOpen on judge ↗

Sharma Ji has decided to marry. He is fond of palindromes and so he has decided to marry a girl whose name can be arranged as a palindrome. So the only condition which Sharma ji has kept is that the name of the girl could be rearranged to a palindrome. Given names of N girls, you need to determine how many of N girls are eligible to marry Sharma ji. Input The first line of input contains an i

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