solulubeta
Sign in
NeetCode 150 / 2-D Dynamic Programming
14.07 · Problem

Longest Increasing Path in a Matrix

Hard DFS with memoisation on a DAG 1 video LC 329 Pro

This problem is part of solulu Pro

Return the length of the longest strictly increasing path in a matrix, moving up, down, left or right (no diagonals, no wrapping).

Lifetime ₹1,999 ₹999 · Launch offer
Mark this problem as solved when you are finished.

Item 117 of 150 · updated 2026-10-12