Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2713. Maximum Strictly Increasing Cells in a Matrix
Given an m x n matrix, find the maximum number of cells you can visit by starting at any cell and repeatedly jumping to any other cell in the same row or column whose value is strictly greater than the current cell. Note m * n ≤ 10^5, so the solution requires an algorithmic approach faster than brute-force (e.g., sorting/DP/topological processing by values).
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.