# Persistent Union Find Partial: Interview Notes

Persistent Union Find Partial shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Record parent changes on a persistent array (or a segment tree of versions) so an old version of the DSU can still be queried, usually without full path compression.

## 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(log n) per find with a persistent array.

## Common mistake

Using path compression on a shared persistent node, which mutates older versions.

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