Loading repovive.com/roadmaps/dynamic-programming
Roadmaps
Dynamic Programming
Prefix Sums
Problemset
Discussion
AI Helper
Recursion Fundamentals
0/42
Dynamic Programming Fundamentals
0/44
1D DP
0/41
Multi-Dimensional DP
0/40
Knapsack
0/43
Knapsack Variations
0/46
Prefix Sums
0/44
1
Intro
2
The Range Sum Problem
3
Naive Approach
4
Vocabulary - Prefix Sum
5
Building the Prefix Array
6
Answering Range Queries
7
Prefix Sums - Implementation
8
Prefix Sums - Walkthrough
9
Challenge: Off-by-One Errors
10
Quiz: Prefix Sums Basics
11
Static Range Sum Queries - Problem Statement
12
Static Range Sum Queries - Why Prefix Sums
13
Codeforces 869B Kuriyama Mirai's Stones - Problem Statement
14
Static Range Sum Queries - The Formula
15
Codeforces 869B Kuriyama Mirai's Stones - Two Arrays
16
Static Range Sum Queries - Walkthrough
17
Codeforces 869B Kuriyama Mirai's Stones - Walkthrough
18
Quiz: Range Query Complexity
19
Static Range Sum Queries - Implementation
20
Codeforces 869B Kuriyama Mirai's Stones - Implementation
21
LeetCode 560 Subarray Sum Equals K - Problem Statement
22
LeetCode 560 Subarray Sum Equals K - HashMap Trick
23
LeetCode 560 Subarray Sum Equals K - Implementation
24
LeetCode 560 Subarray Sum Equals K - Walkthrough
25
Challenge: Subarray Sum Zero
26
Quiz: Prefix Sum + HashMap
27
LeetCode 238 Product of Array Except Self - Problem Statement
28
LeetCode 238 Product of Array Except Self - Prefix and Suffix
29
LeetCode 238 Product of Array Except Self - Walkthrough
30
Quiz: Product Edge Cases
31
LeetCode 238 Product of Array Except Self - Space Optimization
32
LeetCode 304 Range Sum Query 2D - Problem Statement
33
LeetCode 304 Range Sum Query 2D - The Concept
34
LeetCode 304 Range Sum Query 2D - Walkthrough
35
Challenge: 2D Submatrix Count
36
LeetCode 304 Range Sum Query 2D - Implementation
37
Quiz: 2D Prefix Sums
38
LeetCode 53 Maximum Subarray Sum - Problem Statement
39
LeetCode 53 Maximum Subarray Sum - Implementation
40
Quiz: Kadane vs Prefix
41
Lessons from Prefix Sums
42
Pattern - When to Use Prefix Sums
43
What's Next
44
Section Recap
Longest Increasing Subsequence
0/47
LCS and Edit Distance
0/41
Interval DP
0/45
DP on Trees
0/43
Bitmask DP
0/42
Digit DP
0/42
Game Theory DP
0/46
Probability DP
0/44
D&C and Knuth Optimization
0/47
Convex Hull Trick
0/43
Monotonic Queue Optimization
0/45
Aliens Trick (WQS Binary Search)
0/41
Slope Trick
0/47
Broken Profile DP (Plug DP)
0/42
7.1
Intro
4 minutes
100%
Tasks
Read Unit