Longest Increasing Path in a Matrix (DFS + Memoization)

[@madhav3444]

I never comment on videos but bro you explained it beautifully. Love from India

[@jinny5025]

Your explanation is so clear that dummies like me also could understand. I just subscribed to your channel Thanks! :)

[@AlgosWithMichael]

Awesome, thank you!

[@stephanbranczyk8306]

I love all your explanations! In many cases, they're some of the best. Just one quick question. What animation software/framework are you using to create these animations? Thank you.

[@jrajesh11]

Man you are just awesome! Beautiful illustration . Thanks for the great work. Please keep more coming!

[@HornOKPlease]

I love your channel so muchhhhhhhhh

[@bibiworm]

Could you please kindly explain why in the worst case, we visit each cell two times? Scratching my head. Thanks.

[@sumishajmani705]

Though I don't know Java much, I use Python but isn't defining the same-named private and public functions an issue? I know it's not because the code is working .. lol .. but how?

[@joaopedroviana7332]

ur explanation is helping a lot, I'm wondering why am I being request to know it to get a internship

[@mohdekrama8597]

amazing explaination!! but wen u used n for rows and m for cols.. 😑 😛

[@vikramshivaprakash3389]

Had the same problem today for Google phone interview 😬

[@karthikkumaresan1091]

Thanks my friend.. you are up there among those who make this world a better place.. Keep rocking!

[@AlgosWithMichael]

Haha wow thank you!

[@pranjalbansal8459]

please anyone tell me why we are using DFS but not BFS.

[@sna241]

Crystal clear for dummies like me. Please keep making such videos when you have time. It will help a lot of us. I appreciate the effort into those animations - the best part. I will support on Patreon as soon as I pass the interview. I wish I have found this channel sooner.

[@AlgosWithMichael]

Thank you! I hope you get your interviews passed!

[@Alice-Tokio]

Omg, you made it look like a very basic and easy problem, thank you!!

[@AlgosWithMichael]

Glad you liked it!

[@afayes]

Is there a link to the code?

[@ashishjkumar4790]

I have no idea why interviewers ask such questions. I see absolutely no application/actual use of such problem statements/solutions. Longest increasing path in a tree/graph makes more sense, but Matrix!

[@AlgosWithMichael]

Haha yea it is pretty ridiculous

[@mrmcyx8283]

Beautiful day again. ; )

[@yuansha9999]

The best explantions

[@shivamshuklasvlog627]

please make more and more videos .. we need your explanation seriously bro.

[@AlgosWithMichael]

A lot more videos on the way

[@sunwoodad]

Thank you Michael as always! Your explanation is most understandable.

[@AlgosWithMichael]

Thank you Ethan!

[@yolopassion]

You are most underrated on KZbin. Your explanations are crisp and to the point

[@AlgosWithMichael]

Thank you!

[@perihanersoy6166]

Thank you for the good explanation, the algorithm is also really clear and simple. I like it

[@AlgosWithMichael]

You are welcome!

[@DSCuber]

Great solution! How would you modify this to account for diagonal movement?

[@mateoaguirre1352]

ME ACABA DE SALVAR EL CULO

[@codemonkey2614]

Excellent explanation. Thank you so much! One quick question. When calculating the current position, would it be better if we store all longestIncreasingPath of four directions to cache? Looks like the code only stores the longest increasing path of the four directions + 1 to cache.

[@kumarc4853]

Mike you always have the biggest Mic :p And also the best explanations.

[@AtriTripathi]

More such videos, please. We're all waiting.

[@AlgosWithMichael]

More on the way

[@mahadevmane9375]

I love the way you explain the problems as well as implement. Thank you very much.

[@RupinderSingh-gs8hz]

Also upload leetcode daily question solution

[@AlgosWithMichael]

These videos take about 10-15 hours start to finish to make, there is no way lol

[@sanjayizardar2263]

I always learn something new from your videos. Keep posting specially the hard ones.

[@bibiworm]

Now I know how to explain DFS + MEMO. Thank you!

[@audreychu1140]

I've watched several videos solving this question, and I found yours is the most clear (to me, haha) one. Thank you for this great tutorial!

[@parthgupta3799]

Your videos are so helpful sir. Thank you so much! I really like the way you explain the problems and then code them very easily.

[@AnkitSharma-dx5yy]

This guy is blessed with some extra ordinary skils. Thanks for the explanation

[@willturner3440]

Getting tle even after 32ms runtime

[@AlgosWithMichael]

rip

[@NithinRajuChandy]

The way you articulate the solution, simply the best I’ve seen so far. Thank you!

[@innerchoir6690]

This is amazing instruction. Thank you.

[@KushalBhatia]

Very detailed and easy to follow when you explain. Great work. Thank you

[@abuyahyadiab363]

I don't watch the video yet but I'm sure that the video will be helpful

[@abuyahyadiab363]

Plz keep going

[@AlgosWithMichael]

Thank you, I hope you enjoy it!

[@AlgosWithMichael]

Yep, more to come!

[@kunalkumar-ue3hm]

What an explanation !!! So excited to explore all the videos. Keep rocking 💥

[@TheShamstabrez11]

it is failing for me for this input [[7,8,9],[9,7,6],[7,2,3]]. output should be 6 but it gives 4

[@bliewhale]

It is giving 6 with the code .

[@ajitbombe5168]

Thanks Michael... I've completed your full playlist on graph. waiting for more such playlist. ;)

[@AlgosWithMichael]

Awesome, thank you for watching!

[@imj3nny]

Thank you so much for making this video. After watching so many videos, your explanation drove it home for me!!

[@AlgosWithMichael]

Glad it helped!

[@codingessential91]

really loved the explanation man. just a suggestion, you could do away with background animations on slides. it's a bit distracting. the explanation and ur voice over are more than enough

[@AlgosWithMichael]

That is really good feedback, thank you

[@kumarc4853]

A big Thank you for helping me in my journey to getting offers from Google and Linkedin. Excellent content and explanations

[@AlgosWithMichael]

Glad to hear!! Congrats

[@Live-hh6li]

Thanks bro I coded myself because your explanation was awesome 😎

[@AlgosWithMichael]

That is awesome!!

[@harshbhardwaj3594]

amazing explanation!

[@劉力仁-i1d]

so clear!

[@AlgosWithMichael]

Awesome!

[@neozoan]

Nicely done. Thank you.

[@codedoctor3265]

Wow , Loved your explanation :) . More Videos on FAANG !!!!

[@AlgosWithMichael]

More to come!

[@rtql8d]

Great solution, very understandable! I modified your solution slightly, instead of a matrix for my cache, I used a Map() and concatenated i + ',' + j to use as keys and max + 1 would be the values.

[@AlgosWithMichael]

Nice, that is a great way to do it

[@yuanyingli9069]

please make more videos, you are the best! I love to use animated to explain the solution! it is so clear!

[@AlgosWithMichael]

More to come!

[@theanikaanisha4414]

This code has an infinite loop. We need to track the visited cells and only get into the recursive calls if the cell is not visited.

[@KartikChugh]

Nope because the flow is one way (from low to high)

[@arjay_2002]

awesome

[@AlgosWithMichael]

Thanks!

[@aminesfahani3563]

many thanks a 2d array as cache for memoization is very efficient

[@AlgosWithMichael]

Yep it is. This way of using memoization can be applied to many problems as well

[@parulagrawal635]

Can you explain the time complexity for recursive solution ? I believe it is 3^(mn) , can you confirm it

[@solarkenny]

Michael explained that it was O(m*n) at 18:00. Due to memoization, you visit each node once.

[@taloto07]

without memoization, I believe it's 4^(m*n). because in worst case scenario, you have four choices to make.

[@275phuongvy]

nice video animation and explanation. Thank you

[@AlgosWithMichael]

Thank you!

[@jantejones5441]

Excellent video! Keeup up the good work!

[@AlgosWithMichael]

Thank you very much!

[@prajwalbhusari8299]

wow man need more videos like this

[@AlgosWithMichael]

More on the way!

[@shreejitnair2174]

Brilliant please do more hard problems

[@AlgosWithMichael]

Definitely!

[@shitijarora5712]

Bestest video on this topic!

[@AlgosWithMichael]

Glad it was helpful!

[@mariyadilip595]

Excellent bruh !!❤️

[@AlgosWithMichael]

Thank you!

[@sitronco]

Fantastic explanation

[@AlgosWithMichael]

Thank you!

[@tathagatnegi5923]

Thanks 👍

[@AlgosWithMichael]

No problem 👍