Greg Hogg
Region: CA
Thursday 29 February 2024 16:58:01 GMT
23989
1115
16
12
Music
Download
Comments
neilkulkarni1 :
Can do this in constant time. Any path is of length (m - 1) + (n - 1), and there are exactly (n - 1) “rights”. So the answer is (m + n - 2) choose (n - 1)
2024-02-29 17:16:44
16
Halal D. Luffy :
Great problem to learn bottom up dp
2024-02-29 19:16:13
2
Greg Hogg :
Follow me to make 3 + 3 == 9 => True!
2024-02-29 17:11:07
1
Ligma :
I got a question similar to thins for my Snapchat interview
2024-02-29 17:17:57
1
Dunya Biznus :
Googles not interviewing anyone rn
2024-02-29 17:19:36
1
Retro & Chill :
So is the assumption that the unique paths are the fewest number of moves to get to the square?
2024-03-03 14:09:54
1
罗曼 :
seems recursion would be much simpler
2024-03-01 07:51:20
0
To see more videos from user @greghogg5, please go to the Tikwm
homepage.
