Unique Paths | Dynamic programming | Leetcode #62

This video explains an important dynamic programming interview problem which is to count all possible unique paths to reach from first cell to the last cell in a grid.We can solve this problem simply by using recursion but it is a costly process in terms of time.We can improve recursive solution by using a
lookup table which is called memoization.The most optimal approach is to solve using tabulation dynamic programming approach.I have shown the TOP-DOWN dynamic programming approach.I have explained the entire problem step by step by using proper examples and intuition for each step.I have dry run the algorithm and have also explained the code walk through at the end of the video.CODE LINK is present below as usual. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

=================================================================
=================================================================

OTHER PROBLEMS:-

[saurabhsomani]

Somebody give this man a medal ASAP. Crystal clear explanations on each and every problem. Very Inspiring and Helpful.

[dumbcurious]

Everyone starts with matrix directly no one says why this would work. this Man is someone who tells the exact logic behind it. Great work Mate ...

[rahulbawa]

Its been 10 months and this Guy still hasn't received a medal!!!! You deserve it man! Thanks for explaining this nicely.

[savvy]

This is how a coding problem should be Everybody needs to learn from this man right Hats off🎉🎉

[VrickzGamer]

I like Your Dark theme in the videos which gives my eyes the power to view more.

[thiyagarajanr]

This man is so good at segementing the problems ! More power to you bro! A Die hard fan of you bro 💗

[venkateshmusuvathi]

Salute to ANYONE who gets this interview question and solves it within half n hr

[sudhanshukumar]

I have already solved this problem 2 months back, hence I copied my code from there. It was bottom up approach. Good to know about the top down approach.

[maansi]

The Explanation is soo great....just came through an one line python solution.
return

[rutachaudhari]

You are way underrated for your work. Thanks for the solutions!

[rogerknight]

By combinatorics its like
(m+n-2)C(n-1). An better SC approach though!!

[md_aaqil]

Mind-blowing Explanation
I am a fan of the way you think and solve the problem bro

[adityagoswami]

The best explanation, you deserve 1 Million subscriber .

[HemanthaKumarYadav]

Most underrated channel ! Hatsoff to you brother !

[hariprakash]

Sucessfully completed. Thanks for this workout

[RohitSubedi]

You can minimise the space complexity to O(M). Following is the Golang code:
func uniquePaths(m int, n int) int {
grid := make([]int, m)
for i := 0; i < n; i++ {
for j := 0; j < m; j++ {
if i == 0 || j == 0 {
grid[j] = 1
} else {
grid[j] = grid[j] + grid[j-1]
}
}
}

return grid[m-1]
}

[ashishupadhyay]

Start watching at 10:40. Great stuff btw, thanks for this.

[lavanya_m]

This universe needs people like him!! Protect him :)

[aminumado]

Best explanation for the unique paths problem.

[Ayush-xxbx]

Can't thank you enough, I was stuck for hours with this approach. Now I understand it completely.