# DSU On Tree Color Counting: Walkthrough

DSU On Tree Color Counting shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Keep a frequency map of colors while adding light subtrees onto the kept heavy sack, then read how many colors meet a threshold.

## 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).

## Common mistake

Updating the answer while adding and forgetting to undo it when a light subtree is erased.

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