{"id":"bit-walking-over-string-conversion","text":"`even_odd_indices` walks bits via `n & 1` and `n >>= 1` rather than converting to a binary string with `bin()`, avoiding string allocation and keeping the solution at O(log n) with no dependencies.","truth_value":"IN","source":"entries/2026/06/06/number-of-even-and-odd-bits-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"bit-walking-over-string-conversion","truth_value":"IN","reason":"premise"}]}}