# Number Of Dice Rolls With Target Sum: Explained
Number Of Dice Rolls With Target Sum shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
DP[dice][sum] += DP[dice-1][sum-face] for each face 1..k, modulo 1e9+7; only keep the previous row if you want O(target) memory.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n * target * k).
## Common mistake
The classic 'stars and bars' count, which allows face values outside 1..k.
## 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 search and interview copilot.