# Design Bitset: Walkthrough

Design Bitset shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A bitset of size size supports fix/unfix/flip/all/one/count/toString. Keep a byte/int array plus a flipped flag so flip is O(1): fix/unfix invert the meaning when flipped, and count is ones or size-ones. toString walks the bits (the hard part on huge size — generate on the fly).

## 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(1) most ops, O(size) toString.

## Common mistake

Materializing a full flipped copy on every flip(), or forgetting that fix after flip writes the opposite physical bit.

## 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 Linkjob AI.