Palindrome Anagram Checker

Problem Description

Given a string, determine whether any permutation (anagram) of the string can form a palindrome. In other words, check if it is possible to rearrange the characters of the given string such that the resulting string is a palindrome.

Details

• The check should be case-insensitive (e.g., 'A' and 'a' are considered the same).
• Ignore non-alphanumeric characters.
• For example:
  • Input: "civic" → Output: true (already a palindrome)
  • Input: "ivicc" → Output: true (can be rearranged to form "civic")
  • Input: "civil" → Output: false
  • Input: "livci" → Output: false

Background

On March 18, history reminds us of the importance of creativity and problem-solving. Just as this day has seen remarkable events, use your ingenuity to solve this string manipulation challenge!

Function Signature

Implement the function to determine if the input string can be rearranged to form a palindrome.