Minimum Path in Matrix from (1,1) to (n,m)
Filed under Nutanix
The question
Given a matrix with coordinates up to (10^7, 10^7), find the minimum path from (1, 1) to (n, m) using allowed moves (x, x+y) or (x+y, y), or determine if no path exists.
No write-up yet. Related questions below have one.
Related Nutanix questions
Collected from public candidate posts and coding forums. Updated Nov 2026.