Optum OA 2026 | Maximum Grid Profit with One Shield & Constrained Network Routing

Problem 1 - Maximize Total Grid Profit (2D Dynamic Programming) Problem Statement You are given an M × N grid representing profit values across different sectors. A drone starts at the top-left cell and must reach the bottom-right cell. The drone may only move: Right Down The drone starts with exactly one shield. When visiting a negative-valued cell: If the shield is available, the negative value is collected and the shield is consumed. If the shield has already been used, ...