# Kirchhoff Matrix Tree Theorem Count: Study Guide
Kirchhoff Matrix Tree Theorem Count shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Form the Laplacian, delete one row and column, and take the determinant to count distinct spanning trees.
## 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) for the determinant.
## Common mistake
Forgetting to delete a row and column and expecting det(L) itself to be the count (it is zero).
## 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 AI job interview answers in real time.