# Mo Algorithm On Trees Via Euler Tour: Interview Notes

Mo Algorithm On Trees Via Euler Tour shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Map each path to two Euler-tour intervals, sort the resulting 1D ranges with Mo's order, and maintain a presence count as pointers move.

## 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 + q) sqrt n * F) where F is add/remove cost.

## Common mistake

Treating an LCA special case as a normal interval so the LCA is counted twice or not at all.

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