Maximum gems collection in a grid
Filed under Groupon
The question
Given an n*m matrix containing positive numbers (gems) and negative numbers (poison), find the maximum gems that can be collected while moving from (0,0) to (n,m) moving east, south, or south-east.
No write-up yet. Related questions below have one.
Related Groupon questions
Collected from public candidate posts and coding forums. Updated Nov 2026.