# Minimize Malware Spread II: Explained

Minimize Malware Spread II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

For each initial node, Union-Find the graph with that node removed and see how many clean nodes become uniquely infected only through it; pick the node that saves the most (tie: smallest index).

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n^3).

## Common mistake

Using the part-I rule (only isolate a unique infected in its component), which does not match this variant where the node is fully removed.

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