# Find Score Of An Array After Marking All Elements: Interview Notes
Find Score Of An Array After Marking All Elements shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Repeatedly pick the unused smallest value (ties: smallest index), add it to the score, and mark it plus its adjacent indices. A min-heap of (value,index) plus a marked array: pop until you get an unmarked index, then mark i-1,i,i+1.
## 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 log n).
## Common mistake
Rescanning for the min each time (O(n^2)) or marking only the chosen index and not its neighbors.
## 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 interview assistant.