# Incremental Memory Leak: Walkthrough

Incremental Memory Leak shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Two memory sticks; second i allocates i bytes to the stick that currently has more free space (tie: stick 1). Simulate until both have less than i free; return [crash_second, leftover1, leftover2]. i grows but is small enough to simulate (or jump by solving a quadratic for the last full round).

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

O(sqrt(memory)).

## Common mistake

Always allocating to stick 1, or using 0-based seconds.

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