- # Maximum Strictly Increasing Cells in a Matrix (LeetCode 2713)
- ## Approach
- Sort values; DP per row/col max.
- ## Complexity
- Time and space depend on the approach above; state them in the interview.
- ## Practice tip
- Explain trade-offs out loud. For live coding rounds an [try it free](https://www.linkjob.ai/) can help you stay structured under time pressure.
