Available question text
Given an n×n board with digits, obstacles 'X', start 'S' (bottom-right) and end 'E' (top-left), find the maximum sum of digits collectible moving only up, left, or up-left and the number of distinct paths that achieve that maximum (mod 1e9+7). This is a DP problem where each cell tracks the best sum reachable and the count of ways to reach that best sum, returning [maxSum, count] or [0,0] if unreachable.
Related questions
Continue with questions that share topics or the same question type.
- Find and Count Maximum-Score Grid Paths
Coding · Dynamic Programming · Grids & Matrices
- Max Number of K-Sum Pairs
Coding
- Maximum Number of Operations With the Same Score I
Coding
- Maximum Number of Operations With the Same Score II
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1301. Number of Paths with Max Score
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source