https://jeanphilogong.github.io/jeanblog/tags/binary/Recent content in Binary on Jeanphilo BlogHugo -- 0.168.0en-usWed, 15 Jul 2026 00:00:00 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/191-number-of-1-bits/Wed, 15 Jul 2026 00:00:00 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/191-number-of-1-bits/Start from a right-shift baseline, derive how n & (n - 1) clears one lowest set bit, and prove LeetCode 191 with a loop invariant.https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/338-counting-bits/Wed, 15 Jul 2026 00:00:00 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/338-counting-bits/Start by counting every value in 0..n independently, then derive answer[i] = answer[i & (i - 1)] + 1 for an O(n) solution.https://jeanphilogong.github.io/jeanblog/alg/leetcode/231-power-of-two/Wed, 21 Jan 2026 14:06:56 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/231-power-of-two/Judge whether an integer is a power of two in O(1) time using bit tricks. Includes engineering scenarios, pitfalls, and multi-language solutions.