Available question text
Find the maximum-sum path from the top-left to bottom-right of an m×n grid moving only right or down, where cell values may be negative but you may neutralize (ignore) the negative effect of at most two cells on the path. The core challenge is DP with an extra state tracking how many neutralizations (0–2) have been used to maximize the total.
Related questions
Continue with questions that share topics or the same question type.
- Maximum Points Tourist Can Earn
Coding
- Build Array Where You Can Find The Maximum Exactly K Comparisons
Coding
- Distribute Money to Maximum Children
Coding · Greedy · Math
- Maximum Candies You Can Get from Boxes
Coding · Array · Breadth-First Search · Graph Theory
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 3418. Maximum Amount of Money Robot Can Earn
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source