← HashedIn questions

Minimum Cost Path in a Grid

Filed under HashedIn · Also reported at Zomato

The question

Given a grid and a point (X, Y), starting from the origin find the minimum distance path to reach that point traveling horizontally, vertically, and diagonally.

No write-up yet. Related questions below have one.

Related HashedIn questions

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