{"id":"palindrome-greedy-even-portions","text":"`longestPalindrome` computes the result by summing `count // 2 * 2` for each character frequency, extracting the largest even number ≤ count, plus 1 if any odd count exists.","truth_value":"IN","source":"entries/2026/06/06/longest-palindrome-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":["palindrome-construction-reduces-to-frequency-parity"],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"palindrome-greedy-even-portions","truth_value":"IN","reason":"premise"}]}}