Number of Increasing Paths in a Grid II DFS II DP II Graph II Recursion II Leetcode 2328

[@ARYANMITTAL]

Code & Notes: drive.google.com/file/d/1G9zMf2HrRRZbpVbHiqLOpbSFrtWtFvYo/view?usp=sharing
Today's Live Contest Discussion might not come, Not feeling well 🥲. But I will try my best

[@madhavgupta2002]

if live isnt possible, kindly provide solutions as per ur convenience if possible

[@user-nm1wq1rk9n]

perfect length

[@mukulkhanna5071]

today i was drunk but your video motivated me to do the problem and finally i did it, omg hat's off to you bruh😂😂😂😂😂😂

[@VivekYadav-ds8oz]

Classic textbook DP problem. I think this should be a good testing problem once you've learned very basic DP.

[@sureshchelani7497]

Thanks 😊

[@thisismrsanjay]

very nice thanks

[@ms-ej4gd]

Quality content and clear explanation. Subscribed

[@ashishdhal4614]

This was so smart man loved the problem especially memoization part

[@tejaspatel2212]

keep all videos around 15-17 min long max

[@sawanchakraborty8596]

class Solution {
public:
int mod=1e9+7;
int delrow[4]={1,-1,0,0};
int delcol[4]={0,0,1,-1};
int countPaths(vector& grid) {
int m=grid.size();
int n=grid[0].size();
//{vector,{i,j}}
queueq;
unordered_mapmp;
for(int i=0;i

[@rohithdon2621]

hai Aryan I had doubt how you saying by seeing constraints it wont work like in this said 1e5*1e5 wont work ..

[@varunaggarwal7126]

online compilers don't like anything beyond 10^8

[@justajay2228]

Live stream??

[@kamla2620]

No need to put so many mods, we should put only where needed

[@aadarshsonkar5170]

Explanation becomes cringy when you start doing some nonsense. Try to keep it simple bruh!