Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3418. Maximum Amount of Money Robot Can Earn
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.