Leetcode 329. Hard || Longest Increasing Path in a Matrix

[@johnj171]

Hey! these coding videos are nice! Just wanted to say this!!

[@vinaygoswami5374]

Thank you very much for such a wonderful explanation of the problem.

[@iamnoob7593]

Good one , Thanks

[@shashiKumar-db2xm]

I am very thankful to you, loved the way u teach!

[@pollob3193]

very effective. please keep making problem solving video

[@tusharnanda3885]

if(i>=n || j >= m || i < 0 || j < 0) return 0; this line is redundant ? (please check)

[@raushankumar6993]

thanks

[@aditigupta6870]

Can you pls discuss time complexity as well? Because without it its incomplete in interview.

[@ankitjha7132]

you made it look very easy

[@avinashgarg7894]

You nailed it dii

[@utsavprabhakar5072]

Hi alisha, stumbled upon this video while trying to find the time complexity of this problem. Great job helping the community. Just one feedback. You can improve the code writing, i can see two many if statements or i,j variable naming which is not ideal and will be noticed while giving the interview.

[@samueljohnprasad]

nice explaination..

[@neelamtripathi4289]

Do we really need the if conditions for recursive calls if it goes out of bound it will be taken care by the base case anyways why so much typing

[@siddharthkakade7779]

yep agreed.

[@reshmaparveen6679]

Greatest ❤️❤️❤️

[@AmanSharma-vb5jl]

it is having O(n2) time and space na?

[@pradeeprekapalli8355]

Great

[@aryanpatidar5392]

what is time complexity

[@adhed_engineer]

didi how you solve such problems very easily, how can i become this good

[@utsavaggrawal2697]

thanks