Palindrome With All Characters | Dataford Interview Questions

A SIXT QA utility receives a text value and must determine whether its characters can be rearranged to form a palindrome. Return True if all characters can be used exactly once to create a palindrome, otherwise return False.

Treat uppercase and lowercase letters as different characters, and count spaces and punctuation as ordinary characters. The original order does not matter.

Formal Specification

Implement can_rearrange_to_palindrome(s).

Input: s, a non-empty string containing printable ASCII characters.
Output: A boolean. Return True when at most one distinct character has an odd frequency.

A palindrome has matching character pairs around its center. Therefore, every character must occur an even number of times, except that one character may occur an odd number of times when the string length is odd.

Constraints

1 <= len(s) <= 100,000
s contains printable ASCII characters
Uppercase and lowercase characters are distinct
Spaces and punctuation count as characters
Every input character must be used exactly once

Function Signature

def can_rearrange_to_palindrome(s):

Your question is Palindrome With All Characters. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem