# SPQR Tree Triconnected Pieces: Practice Notes

SPQR Tree Triconnected Pieces shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Decompose a biconnected graph into serial, parallel, and rigid triconnected components so many connectivity and planarity questions become tree queries.

## 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 + m).

## Common mistake

Treating a virtual edge as a real graph edge when reconstructing a split pair, which invents an extra connection.

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