LeetCode 338 on Jeanphilo Bloghttps://shio-chan-dev.github.io/jeanblog/tags/leetcode-338/Recent content in LeetCode 338 on Jeanphilo BlogHugo -- 0.165.0en-usWed, 15 Jul 2026 00:00:00 +0800LeetCode 338: Counting Bits by Reusing Smaller Resultshttps://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/338-counting-bits/Wed, 15 Jul 2026 00:00:00 +0800https://shio-chan-dev.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.