Google Coding Interview Tutorial - Longest Increasing Path in a Matrix [LeetCode 329]

In this video I explain the solution of a common coding interview question “Longest Increasing Path in a Matrix” [LeetCode 329].

If there is a coding interview problem you would like me to cover, let me know in the comments.

[not]

Very good explanation. I watched 5 videos before stumbling on this one. Your explanation is very clear and easy to understand.

[jlecampana]

This is Fantastic, you're the Wonder Girl for LeetCode explanations! I was wondering if the caching itself is the reason Why Leetcode calls this one a DP problem.

[mehmetfrataksoy]

Thank you for having the best explanation possible for this question. Respects from Turkey

[AndreyMaksimov-cs]

I really liked your coding of this problem! Thanks a lot!

[uptonogood]

wow! such crystal clear explanation.
initially i thought of some backtracking soln but this is simpler, thanks

[iamparitosh]

This is the problem I tried after 3 months gap and I literally feel bad for not able to devise the solution to the problems I used to be really good at :/
By the way, your explanation was really to the point,

[tejassrivastava]

Can we do this using modified dijkstra...putting every element in minheap and then start by selecting smallest ones?

[sushantsingh]

Nice explanation !
I have a qn ..why can't we do this problem with tabular DP w/o using recursion and memorization ??

[janedoe]

Thanks for making this very easy to understand!

[Suryabasettydustin]

Can we solve it using graphs also right? We can take each possible edge with weight 1 and find all possible Source Destination and get maximum?

[rishibansal]

Nice explanation. If coding part is bit slow and more explained that will be better.

[amanjain]

Can you please share which app you are using for drawing. Btw great explanation, subscribed.☺️