# Du Jiao Sieve Prefix Mobius: Interview Notes

Du Jiao Sieve Prefix Mobius shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Use the identity μ * 1 = ε to write prefix M(n) in terms of prefix sums of 1 and smaller M(floor(n/k)), then memoize every floor value.

## 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^{3/4}) naive memo, O(n^{2/3}) with a linear sieve prefilling.

## Common mistake

Memoizing M(n) without also caching the floor(n/k) blocks, which recomputes the same values.

## 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 this tool.