# G Machine Graph Reduction: Practice Notes

G Machine Graph Reduction shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Compile lambda terms to instructions that build and unwind a graph of application nodes, updating the root after a reduction.

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

A sequence of unwind, pushglobal, mkap and slide instructions; shared subgraphs give lazy sharing.

## Common mistake

Not updating the root of a reduced redex, which loses sharing and can turn a linear program quadratic.

## 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 help for online coding assessments.