Neetcode Spaced Repetition System

329. Longest Increasing Path In a Matrix

Hard

2-D Dynamic Programming

Optimal Complexity

Time

O(m * n)

Space

O(m * n)

Start First Attempt