Longest palindrome length
Given a string of letters (case-sensitive), you may rearrange any subset of them to form a palindrome. Return the length of the longest palindrome you can build. Example: 'abccccdd' gives 7, e.g. 'dccaccd'. A single leftover letter may sit in the middle, but at most one.
Implement
longest_palindrome_length(letters: str) → intExamples
in
["abccccdd"]out7What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 11 min
solution.py
InputExpectedGot
["abccccdd"]7not run yetsample