← Oracle questions

Modified minimum cost path in a matrix with obstacles

Filed under Oracle

Find the minimum cost path from (0,0) to (m,n) in a grid containing positive/negative integers and blocked cells ('X'). You can only move right or down. Output both the minimum cost and the actual…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Oracle questions

Collected from public candidate posts and coding forums. Updated Nov 2026.