# Greatest Sum Divisible By Three: Walkthrough
Greatest Sum Divisible By Three shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Max subsequence sum divisible by 3. Track the best sums modulo 0/1/2 while scanning, or keep the smallest 1-mod and 2-mod leftovers to subtract from the total.
## 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
Dropping every remainder-1 and remainder-2 element (you may need one or two of them) or using a knapsack of size sum (unnecessary).
## 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 Linkjob AI.