Search
⌘K
Get Premium
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).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.