Unique Paths (LeetCode 62) | Full Dynamic Programming method with Memoization

preview_player
Показать описание


Chapters:
00:00 - Intro
00:56 - Problem Statement and Description
03:24 - Visualizing the concept
06:55 - Efficient Solution
12:32 - Dry-run of Code
14:24 - Final Thoughts

📚 Links to topics I talk about in the video:

📖 Reference Books:

🎥 My Recording Gear:

💻 Get Social 💻

#leetcode #programming #interview
Рекомендации по теме
Комментарии
Автор

I started my leet code journey this month n this is the only channel who solves in java. Love ur explanations. Keep making leetcode solutions cause Im counting on u to help me crack my interviews.

Tan-Ned
Автор

Thank you so much for such a clear and simple explanation!

katrinpolit
Автор

This problem reminds me of Edit Distance! After watching about 5 minutes of this video I was able to come up with a dp solution. Thanks Nikhil!!

matthewzarate
Автор

Good to see you back bhaiya, your explanation is best that I see on youtube

manu-singh
Автор

brother is there any sequence to solve leet code problems . Or should it be solved in the order in which it is given on the leetcode ?

AnishMokashi-gzkl
Автор

actually I realized another solution is the same as fibonacci but just less efficient in terms of space

yomamasofat
Автор

Hi Nikhil, Please start a series on DP. It would be helpful

pragmaticcoder
visit shbcf.ru