Dsa
Strings
Easy
Palindrome Rearrangement
Given a string, determine if it’s possible to rearrange the characters of the string to form a palindrome.
Input:
The input consists of a single line with the string s (1 ≤ |s| ≤ 100).
Output:
Print 'YES' if it can be rearranged to a palindrome, otherwise print 'NO'.
Example:
Input:
occd
Output:
YES
Key concepts
stringspalindromerearrangement
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now