GoodLeap Home Improvement Financing application flows may process user-entered text that must satisfy simple structural rules. Given a string, determine whether its characters can be rearranged to form a palindrome.
A palindrome reads identically from left to right and right to left. The input is case-sensitive, and every character must be used exactly once. Return True if at least one valid rearrangement exists, otherwise return False.
Implement can_form_palindrome(s), where s is a string containing lowercase English letters. Return a Boolean value.
A string can form a palindrome when no more than one character appears an odd number of times. For even-length strings, every character count must be even. For odd-length strings, exactly one character may have an odd count.
def can_form_palindrome(s):