# STG Spineless Tagless: Practice Notes
STG Spineless Tagless shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Represent heap objects as closures with an entry code pointer and update a thunk in place after its first evaluation.
## 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
The abstract machine of GHC; each closure application is an indirect jump plus argument setup.
## Common mistake
Forgetting to update a shared thunk after evaluation, which recomputes it on every later entry.
## 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 https://www.linkjob.ai/.