# Find The Score Of All Prefixes Of An Array: Explained
Find The Score Of All Prefixes Of An Array shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
The conversion of a prefix is nums[i] + max(nums[0..i]); the score of a prefix is the sum of conversions along it. Maintain a running max and a running sum of (nums[i]+running_max).
## 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).
## Common mistake
Restarting the max at every prefix from scratch without need, or using the global array max for early prefixes.
## 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 here.