# Segment Tree Beats Chmin: Interview Notes

Segment Tree Beats Chmin shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

On a chmin update, skip a node whose maximum is already below the tag, push into a node with a unique maximum, and recurse only when the second maximum is still larger.

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

Amortized O(log n) per update on typical sequences.

## Common mistake

Recursing whenever max > tag even if second_max < tag, which throws away the beats pruning.

## 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 interview assistant.