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).