Dsa
Strings
Easy
Palindrome Rearranger
Create a function that determines if the characters of a given string can be rearranged to form a palindrome. A palindrome reads the same forwards and backwards. Ignore spaces and consider all characters to be case insensitive.
Input: A single line string S (1 ≤ |S| ≤ 100).
Output: 'YES' if the string can be rearranged to form a palindrome, otherwise 'NO'.
Example:
Input:
Tact Coa
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