# Tarjan Path Expression Reducible: Study Guide

Tarjan Path Expression Reducible shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Convert a reducible flow graph into a regular path expression with sequence, choice and iteration, then evaluate a data-flow algebra on it.

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

Linear in the size of the path expression for reducible graphs.

## Common mistake

Applying the construction to an irreducible graph without first making it reducible, which the original algorithm does not accept.

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