# Articulation Points With Low-Link Values: Explained

Articulation Points With Low-Link Values shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A non-root u is a cut vertex if some child v has low[v] >= disc[u]; the root needs two or more DFS children.

## 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(V + E).

## Common mistake

Applying the non-root rule to the root.

## 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 tool for job interviews.