Leetcode 3677. Count Binary Palindromic Numbers

Count how many integers k in [0, n] have palindromic binary representations. The key challenge is to efficiently enumerate binary palindromes up to n by generating palindromes by bit-length (constructing a half and mirroring for even/odd lengths) rather than checking every number, since n can be as large as 10^15 (~50 bits).