# Bit Tricks: Lowbit And Popcount: Walkthrough
Bit Tricks: Lowbit And Popcount shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
x & -x isolates the lowest set bit and x & (x - 1) clears it, which gives a fast popcount loop.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(set bits).
## Common mistake
Using signed right shifts on negative numbers.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at learn more.