Leetcode 62. Unique Paths || Code + Explanation

[@nguyenbach4710]

love the way u make everything easier when i practice on leetcode i just watch 2 channels: ur channel and neetcode. Thanks a lot

[@SoumojitKoley-sd5je]

thanks for the explanation, you are great, great approach and great solution, really appreciated.

[@jkali-pg4fh]

Very good explanation. Thank you Alisha!

[@nikhil8854]

Supper explaintion, never understood any solution so fast.

[@samridhshubham8109]

Beautifully explained.

[@raj_kundalia]

Amazing, thanks for the video!

[@bharathg3174]

Good explanation 🎉❤

[@vinaykenguva362]

nice explaination. can u explain the problem where movement is possible from all 4 directions but revisit isnt allowed

[@Zedxwhy]

Declare vector of vectors initially all grid value 1 for loop start with I and j for column dp I and j is equal to I minus 1 and j and same j minus 1 returns because last node

[@SomneelMaity]

Great Explanation. Thanks Mam.

[@pankajchadda1780]

Thank you for this wonderful explanation😄

[@vyankateshkulkarni4374]

thanks for such a wonderful explanation

[@reshmaparveen6679]

V useful explain tq so much 👍

[@Jai-Shree-Ram715]

Great explaination

[@dhairyashiil]

Thank You! , Nice video as always : )

[@kasthurishravankumarhpc]

Great explantion

[@gokulnaathbaskar9808]

Thank you so much, it was so good!

[@bhooviarora519]

Amazing

[@himanshushorts7143]

very nice explain

[@tusharnain6652]

This can be more optimized!

[@user-sz6sr6ql3l]

Great

[@005_adarshprajapati9]

mam plz do space optimization too. super explanation

[@Idukhan-jj9kc]

Tq so much 💖

[@vamshidharsingh5549]

time and space complexity

[@bhooviarora519]

Vector of vector mai(n,1) ka kya meaning

[@piyush2750]

3 suggestions : 1. At the end please mention the time complexity and space complexity 2. Can we start from recursion and then memorization and then dp solution . In this way , we can prove why we are using dynamic programming for this solution ( as we can see overlapping problem while drawing recurrence tree ) 3. Currently we are using 2 D matrix (dp) to store the ans . We can optimise it to two 1 D matrix as we only need previous row and current row

[@ishugaur9234]

totli