2328. Number of Increasing Paths in a Grid | Recursion | LeetCode Daily Challenge

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

0:00 - Question Understanding
2:40 - Observations
6:00 - Approach
9:25 - Code
16:00 - Complexity

#coding #dsa #leetcode #daily #programming #cpp #tutorial

Рекомендации по теме

Комментарии

class Solution {
public:
int mod = 1e9+7;
int dp[1001][1001];
int solve(vector<vector<int>>& grid, int i, int j, int prev) {
int m = grid.size(), n = grid[0].size();
if (i < 0 || i >= m || j < 0 || j >= n || grid[i][j] <= prev) {
return 0;
}
if (dp[i][j] != -1) {
return dp[i][j];
}
int up = solve(grid, i-1, j, grid[i][j]);
int down = solve(grid, i+1, j, grid[i][j]);
int left = solve(grid, i, j-1, grid[i][j]);
int right = solve(grid, i, j+1, grid[i][j]);
return dp[i][j] = (1 + up + down + left + right) % mod;
}

int grid) {
int ans = 0, m = grid.size(), n = grid[0].size();
memset(dp, -1, sizeof(dp));
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
ans = (ans + solve(grid, i, j, -1)) % mod;
}
}
return ans;
}
};

deepintotech

I recently completed arrays, strings, stacks, binary search, and linked list questions on LeetCode. Mostly easy and medium questions. However, I still don't feel very comfortable when it comes to solving random problems from these topics. So, should I work on these topics more or complete the rest of the DSA like greedy, dynamic programming (DP), graphs, tries, etc., and then start doing more problems outside my comfort zone?

novascotia

I implemented the simmiler logic. But when I tried to run my code without using memoization it gave me wrong answer. I expected TLE. I was just curious so I ran the code without memoization. But When I run the code with memoization it works and submits. The logic is exactly the same. I was using Set to keep track of the visited node each time I ran dfs on each node. Would mind taking a look at my code? It's in JS. Thank you the explanation was very good. I skipped the video and just saw the memoize part I got it in like 30 sec. Thank you brother 😄😄

aadil

2328. Number of Increasing Paths in a Grid | Recursion | LeetCode Daily Challenge

Number of Increasing Paths in a Grid | Leetcode - 2328

Number of Increasing Paths in a Grid - Leetcode 2328 - Python

Leetcode 2328. Number of Increasing Paths in a Grid

Number of Increasing Paths in a Grid | DFS + Memo | ADOBE, MICROSOFT | Leetcode-2328 | Live Code

2328. Number of Increasing Paths in a Grid - Day 18/30 Leetcode June Challenge

Weekly Contest 300 | Leetcode 2328 Number of Increasing Paths in a Grid | Easy DP

2328. Number of Increasing Paths in a Grid (Leetcode Hard)

2328. Number of Increasing Paths in a Grid | Recursion | LeetCode Daily Challenge

2328. Number of Increasing Paths in a Grid

Number of Increasing Paths in a Grid - LeetCode 2328 - Python

2328. Number of Increasing Paths in a Grid (LeetCode)

Weekly Contest 300 | 2328. Number of Increasing Paths in a Grid

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

Leetcode 2328. Number of Increasing Paths in a Grid - Dynamic Programming

2328. Number of Increasing Paths in a Grid || SLIDING WINDOW APROACH Explained✅ #DSA #Leetcode

2328. Number of Increasing Paths in a Grid | Recursion to DP solution | Approach + Intuition

Number of Increasing Paths in a Grid | 2328 LeetCode | Dp | Leetcode Weekly Contest 300

Leetcode 2328. Number of Increasing Paths in a Grid (grid dp)

Leetcode 2328 Number of Increasing Paths in a Grid | Hindi

Leetcode 2328. Number of Increasing Paths in a Grid

python tutorial - Number of Increasing Paths in a Grid | JavaScript, Java and C++ | LeetCode #2328

2328. Number of Increasing Paths in a Grid (LeetCode Problem) by The Stylish Coder

LeetCode: 2328. Number of Increasing Paths in a Grid || Daily Challenge (18)||#leetcode #codeforces

Number of Increasing Paths in a Grid | Graph | Dynamic Programming | Leetcode | Algorithm Unlock