# Kirchhoff Matrix Tree Count: Explained

Kirchhoff Matrix Tree Count shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Any cofactor of the Laplacian (degree minus adjacency) equals the number of distinct spanning trees of a graph.

## 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^3) via Gaussian elimination over the integers or a field.

## Common mistake

Deleting a row and column that do not correspond to the same vertex, which is not a cofactor.

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