Uber OA 2025 | Grid Path Optimization with One Bypass

Problem 1 - Dynamic Ride-Matching Matrix Problem Statement You are engineering a ride-matching system for a real-time mobility platform. The city is represented as an M × N matrix called grid. Each cell contains an integer representing the congestion delay incurred when passing through that zone. A vehicle starts at the top-left corner (0, 0) and must reach the bottom-right corner (M - 1, N - 1). The vehicle may only move: Right Down The platform provides exactly one Express ...