# Find The Punishment Number Of An Integer: Study Guide
Find The Punishment Number Of An Integer shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A number i contributes i*i to the punishment number if the decimal digits of i*i can be partitioned into contiguous pieces that sum to i. Backtrack over split points of the square (n <= 1000 keeps this cheap) and sum i*i for those i that work.
## 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(n * 2^{digits}).
## Common mistake
Allowing non-contiguous pieces, or adding i instead of i*i.
## 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 AI job interview answers in real time.