MCPcopy Create free account

hub / github.com/devweekends/DW-Fellowship-DSA-Roadmap / functions

Functions315 in github.com/devweekends/DW-Fellowship-DSA-Roadmap

⨍ Functions 315◇ Types & classes 140
MethoduniquePathsMemo
Approach 2: Memoization (Top-Down DP) Time: O(m*n), Space: O(m*n) - memoization table
Level 1/Week 11/Dynamic Programming/62. Unique Paths/code.cpp:33
MethoduniquePathsMemoHelper
Level 1/Week 11/Dynamic Programming/62. Unique Paths/code.cpp:39
MethoduniquePathsMemoHelper
Level 1/Week 11/Dynamic Programming/63. Unique Paths II/code.cpp:43
MethoduniquePathsOptimized
Approach 4: Space Optimization Time: O(m*n), Space: O(n) - 1D DP array
Level 1/Week 11/Dynamic Programming/62. Unique Paths/code.cpp:68
MethoduniquePathsRecursion
Approach 1: Recursion (Brute Force) Time: O(2^(m+n)), Space: O(m+n) - recursion stack
Level 1/Week 11/Dynamic Programming/62. Unique Paths/code.cpp:16
MethoduniquePathsRecursionHelper
Level 1/Week 11/Dynamic Programming/62. Unique Paths/code.cpp:21
MethoduniquePathsRecursionHelper
Level 1/Week 11/Dynamic Programming/63. Unique Paths II/code.cpp:23
MethoduniquePathsTabulation
Approach 3: Tabulation (Bottom-Up DP) Time: O(m*n), Space: O(m*n) - 2D DP array
Level 1/Week 11/Dynamic Programming/62. Unique Paths/code.cpp:55
MethoduniquePathsWithObstacles
Main function - using the most optimal approach
Level 1/Week 11/Dynamic Programming/63. Unique Paths II/code.cpp:115
MethoduniquePathsWithObstaclesMemo
Approach 2: Memoization (Top-Down DP) Time: O(m*n), Space: O(m*n) - memoization table
Level 1/Week 11/Dynamic Programming/63. Unique Paths II/code.cpp:35
MethoduniquePathsWithObstaclesOptimized
Approach 4: Space Optimization Time: O(m*n), Space: O(n) - 1D DP array
Level 1/Week 11/Dynamic Programming/63. Unique Paths II/code.cpp:93
MethoduniquePathsWithObstaclesRecursion
Approach 1: Recursion (Brute Force) Time: O(2^(m+n)), Space: O(m+n) - recursion stack
Level 1/Week 11/Dynamic Programming/63. Unique Paths II/code.cpp:16
MethoduniquePathsWithObstaclesTabulation
Approach 3: Tabulation (Bottom-Up DP) Time: O(m*n), Space: O(m*n) - 2D DP array
Level 1/Week 11/Dynamic Programming/63. Unique Paths II/code.cpp:59
MethodvalidPalindrome
Level 1/Week 02/2 pointers/680. Valid Palindrome II/code.cpp:27
Methodvalidate
Level 1/Week 04/Trees/98. Validate Binary Search Tree/code.cpp:34
← previous301–315 of 315, ranked by callers