# CEK Machine Transitions: Interview Notes
CEK Machine Transitions shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Evaluate with an explicit control term, environment and continuation, so every reduction is a small-step transition of that triple.
## 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
One transition per syntactic form; useful as a reference interpreter.
## Common mistake
Capturing the environment in a continuation frame after it has already been extended, which leaks bindings into the wrong site.
## 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 Linkjob AI interview assistant.