Longest Increasing Path in a Matrix | Live Coding with Explanation | Leetcode - 329

[@AlgorithmsMadeEasy]

We hope you all are enjoying our videos!!! Don't forget to leave a comment!!! Please like the video to support us!!! Questions you might like: ✅✅✅[ Tree Data Structure] : kzbin.info/aero/PLJtzaiEpVo2zx-rCqLMmcFEpZw1UpGWls ✅✅✅[ Graphs Data Structure] : kzbin.info/aero/PLJtzaiEpVo2xg89cZzZCHqX03a1Vb6w7C ✅✅✅[ February Leetcoding Challenge] : kzbin.info/aero/PLJtzaiEpVo2wrfvII0eZQsPm-MZCmHodm ✅✅✅[ January Leetcoding Challenge] : kzbin.info/aero/PLJtzaiEpVo2wCalBcRcNjXQ0C6ku3dRkn ✅✅✅[ February Leetcoding Challenge] : kzbin.info/aero/PLJtzaiEpVo2wrfvII0eZQsPm-MZCmHodm ✅✅✅[ March Leetcoding Challenge] : kzbin.info/aero/PLJtzaiEpVo2zH-YC5ZiptbAvw2QZkmyk9 ✅✅✅[ December Leetcoding Challenge] : kzbin.info/aero/PLJtzaiEpVo2xo8OdPZxrpybGR8FmzZpCA ✅✅✅[ November Leetcoding Challenge] : kzbin.info/aero/PLJtzaiEpVo2yMYz5RPH6pfB0wNnwWsK7e ✅✅✅[ August Leetcoding Challenge] : kzbin.info/aero/PLJtzaiEpVo2xu4h0gYQzvOMboclK_pZMe ✅✅✅[ July Leetcoding challenges] : kzbin.info/aero/PLJtzaiEpVo2wrUwkvexbC-vbUqVIy7qC- ✅✅✅[ June Leetcoding challenges] : kzbin.info/aero/PLJtzaiEpVo2xIPptnCvUtKrUcod2zAKG ✅✅✅[ May Leetcoding challenges] : kzbin.info/aero/PLJtzaiEpVo2wRmUCq96zsUwOVD6p66K9e ✅✅✅Cracking the Coding Interview - Unique String: kzbin.info/aero/PLJtzaiEpVo2xXf4LZb3y_BopOnLC1L4mE Struggling in a question?? Leave in a comment and we will make a video!!!🙂🙂🙂

[@spoorthibasu]

We aren't using visited array here because we are only allowed to move to cells where the value is greater than the current cell ( matrix[x][y] >matrix[i][j] ). This constraint prevents cycles, because once you move to a larger number, you can never return to a smaller one.

[@erickvidbaz3086]

Thank you Khushbu, your graphical explanation always help me to catch the algorithm, really appreciated.

[@AlgorithmsMadeEasy]

Thanks Erick!! 😊

[@bharathkalyans]

I am surprised why aren't we using any boolean [][] visited to keep track of the traversal![I am assuming as the value wont be big enough to consider to out current path length!!]

[@souravkumar-hl2ot]

Hey actually I tried using the same visited array but the problem is that if we keep on marking visited cells as true then the cells will become inaccessible for some paths since the cell has already been marked true by some previous travesing so we will not get correct answer

[@bharathkalyans]

@@souravkumar-hl2ot why don't you backtrack by making them false again??

[@sriramkrishnamurthy4473]

U have the sweetest voice didi !!!!!! Much Love ❤️😃👍👍

[@sumitnimesh9320]

thankyou for the simple and step by step explained solution and your voice is so sweet

[@AlgorithmsMadeEasy]

Most welcome 😊

[@siddharthdwivedi3263]

Clarity at its best!!Thank you!!

[@Cloud-577]

Thank you! I would appreciate if you can include a walk through the code

[@rishabhsamrajain9313]

Can you explain how time complexity for the technique after memoization is O(mn) and not larger than that? How we can know the time complexity without doing memoization?

[@sapirkikoz7518]

Great video thank you!

[@rahulsahay19]

very nice explaination.

[@harshitchoukse2602]

What will be the time complexity for brute force??

[@tannusharma2285]

Thank u so much...God Bless u..

[@AlgorithmsMadeEasy]

Most welcome!! Don't forget to subscribe!!! :)

[@randomone3073]

Can you explain the time complexity after memorization?

[@ashwinvarma9349]

Mam, can u also show cpp code as well for upcoming videos?

[@kirant5548]

good one

[@AlgorithmsMadeEasy]

Thanks

[@nalingoyal881]

what was the Time complexity of brute force approach

[@harshitchoukse2602]

I think O(N^2) where is N is total number of elements in matrix

[@jayantshukla9025]

Why don't we take any visited array here??

[@rechinraj111]

U guys are SUPER se UPER 👍😎

[@AlgorithmsMadeEasy]

Thanks!!! 😊

[@ravitiwari2160]

Could someone please explain how this code works without marking cells as visited?

[@vinamrasangal8436]

no

[@jailudhani8841]

Suppose, I need to give complete path as answer, how to solve then, can you help me in that case.

[@vinamrasangal8436]

shut up man

[@ayushsingh3877]

You are not explaning in matrix how it is working, the given example of matrix was easy one. You are just simply writting your memorized code.