Path in Infinite 2D Plot
Filed under Nutanix
The question
Starting at (1, 1), determine if you can reach (M, N) using moves (X+Y, Y) or (X, X+Y). Print the path if possible, given constraints up to 10^7.
No write-up yet. Related questions below have one.
Related Nutanix questions
Collected from public candidate posts and coding forums. Updated Nov 2026.