# Centroid Decomposition Layers: Interview Notes

Centroid Decomposition Layers shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Repeatedly remove a centroid so each component shrinks by half, then answer queries by walking the O(log n) centroids that dominate a vertex.

## 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 log n) build; many path or distance structures become O(log n) after this layering.

## Common mistake

Choosing a vertex that is not a centroid (a vertex whose heaviest remaining child is more than n/2), which can make the decomposition linear-depth.

## 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 undetectable AI interview copilot.