{"id":"palindrome-center-bonus-at-most-once","text":"`longestPalindrome` adds at most one center character regardless of how many characters have odd frequencies, using a boolean flag converted to int via Python's `bool` subclassing `int`.","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-center-bonus-at-most-once","truth_value":"IN","reason":"premise"}]}}