Minimum-Cost Path in a Hidden Weighted Grid

linkedin

You are given a hidden 2D grid and start at (0, 0). Some cells are blocked; every traversable cell has a positive entry cost. You may move one cell at a time in the four cardinal directions. The...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: