Minimum moves in matrix with jump constraints
Filed under Vivriti Capital
The question
Given a matrix X of size N*M, find the minimum number of moves to reach (N, M) from (1, 1) by jumping (i + X[i][j], j) or (i, X[i][j] + j), returning -1 if impossible.
No write-up yet. Related questions below have one.
Related Vivriti Capital questions
Collected from public candidate posts and coding forums. Updated Nov 2026.