# ZINC Argument Grinding: Explained

ZINC Argument Grinding shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Apply a function by pushing extra arguments onto a stack and entering its code, then returning unused extra arguments to the caller (the ZINC/Zinc strategy).

## 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 behind OCaml's bytecode; handles currying without building an intermediate closure for every partial apply.

## Common mistake

Building a fresh closure on every extra-argument apply instead of reusing the argument stack, which destroys the currying benefit.

## 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 www.linkjob.ai.