# Fast Subset Convolution Mobius: Walkthrough
Fast Subset Convolution Mobius shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
The subset convolution (f * g)[S] = sum_{T subset S} f[T] g[S\T] is computed via ranked zeta transforms, pointwise products, and a Mobius inversion.
## 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(n^2 2^n) or O(n 2^n) with careful ranked FWHT-style lifts.
## Common mistake
Omitting the rank (popcount) so intersecting rather than disjoint subsets get mixed into the product.
## 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.