# Virtual Tree DP On Queries: Interview Notes

Virtual Tree DP On Queries shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Build the auxiliary tree for each query's important vertices, run tree DP there, then discard it so many queries stay sublinear in n.

## 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 + total |S| log n).

## Common mistake

Reusing leftover adjacency from the previous query's virtual tree.

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