CodingEasycod-g1447

Subject GreedyLevel Entry–Mid~11 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

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) → int

Examples

in["abccccdd"]out7

What 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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.