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.