Skip to main content
hardNeetCode 150

Longest Increasing Path in a Matrix

This one is about turning repeated work into a reusable state instead of re-solving subproblems. It's a hard one for a reason: it stresses state-and-transition thinking when the rules pile up. Don't rush the code—spend your time nailing the state definition first.

Arrays & HashingGraphsDynamic ProgrammingBFS / DFS

Chat with Fin or Coco right now on mobile.

Start talking through the problem here. Switch to desktop when you're ready to code and run tests.

Start coaching session
Coco
Fin

Meet your coaches

Talk through the problem while you code. Guest text is free. Hosted voice is the Own Words Pack.

1Longest Increasing Pathhard
Based onLeetCode

Code + tests need a desktop

Chat works on this phone. Email yourself a link when you want the editor and tests.