CodingEasy-Medium
Minimum initial score to reach bottom-right of matrix
Filed under Tally Solutions
The question
Given an n x m matrix with cell values, find the minimum initial score required at (1, 1) to reach (n, m) by moving only right or down, ensuring the current score never drops to zero or below during traversal.
No write-up yet. Related questions below have one.
Related Tally Solutions questions
Collected from public candidate posts and coding forums. Updated Nov 2026.