# Dijkstra Tri color Invariant: Practice Notes

Dijkstra Tri color Invariant shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Maintain that no black object points to a white one, so a concurrent collector can finish without rescanning the whole heap.

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

The invariant is local; the write barrier restores it in constant time.

## Common mistake

Turning an object black before all of its children have been grayed, which orphans white objects.

## 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 real-time interview help.