Longest Increasing Path in a Matrix
Filed under Nutanix · Also reported at Bitgo, DoorDash
The question
Given an n x m matrix of integers from 1 to 10^9, find the longest path such that each step moves to an adjacent cell with a strictly greater value without visiting any cell more than once.
No write-up yet. Related questions below have one.
Related Nutanix questions
Collected from public candidate posts and coding forums. Updated Nov 2026.