# Minimum Factorization: Walkthrough
Minimum Factorization shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Greedily take digits from 9 down to 2 whenever they divide a, sort those digits ascending, and assemble. If a leftover >1 remains it is impossible. Watch 32-bit overflow.
## 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(log a).
## Common mistake
Assembling digits descending (that is the largest number) or giving up when a still has factor 4,6,8,9.
## 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 the Linkjob AI app.