Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2684. Maximum Number of Moves in a Grid
Given an m x n grid of positive integers, you may start at any cell in the first column and move only to the right-up, right, or right-down cell in the next column if that cell's value is strictly larger; return the maximum number of such moves possible. The core challenge is finding the longest strictly increasing path that advances exactly one column per step (a column-directed DAG / dynamic programming pattern).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.