Love Babbar's DP Series: study plan and how long it takes
The CodeHelp - by Babbar playlist is 38 videos and 16.4 hours long. Here's how long it takes at different paces, a week-by-week schedule built from the real videos, and a planner that turns it into your own daily plan.
38 videos · 16.4 hours · CodeHelp - by Babbar
This playlist collects the dynamic programming lectures (102 to 139) from Love Babbar's C++ Placement DSA course: climbing stairs and house robber, knapsack, combination sum, LIS and Russian dolls, buy and sell stock, LCS, edit distance and wildcard matching.
It's a good standalone DP course if you learned the basics elsewhere and only want the DP section.
Who it's for: Students who know recursion and C++ basics and want a DP-only course in Hindi.
How long does it take?
The full playlist is 16.4 hours across 38 videos. Here's roughly how many days that is at different daily watch times and speeds, counting video time only:
| Daily time | At 1x | At 1.5x | At 2x |
|---|---|---|---|
| 30 min a day | 33 days | 22 days | 17 days |
| 1 h a day | 17 days | 11 days | 9 days |
| 2 h a day | 9 days | 6 days | 5 days |
Make your own schedule
The playlist link is already filled in. Press Plan, set how much time you have each day and your speed, and you'll get a day-by-day schedule with a finish date and a calendar file. It reads the live playlist, so new videos are included.
Week-by-week schedule
A sample plan at 1 hour a day and normal speed, using whole videos so none is split across days. That's 4 weeks in total. For a different pace, start date or speed, use the planner above.
Week 1Videos 1–12 · 5h 18m
Day 1 · 37m
- 1Lecture 102: Introduction to Dynamic Programming | Memoization | Tabulation | Space Optimisation37m
Day 2 · 34m
- 2Lecture 103: Minimum Cost Climbing Stairs || DP Series34m
Day 3 · 51m
- 3Lecture 104: Minimum Number of Coins || DP Series31m
- 4Lecture 105: Maximum Sum of Non-Adjacent Elements || DP Series21m
Day 4 · 36m
- 5Lecture 106: House Robbery Problem || DP Series12m
- 6Lecture 107: Cut Rod into Segments of X, Y, Z || DP Series25m
Day 5 · 52m
- 7Lecture 108: Count derangements || DP Series27m
- 8Lecture 109: Painting Fence Algorithm || DP Series25m
Day 6 · 51m
- 9Lecture 110: 0/1 KnapSack Problem || learn 2-D DP Concept || DP Series51m
Day 7 · 56m
- 10Lecture 111: Combination Sum IV Problem || DP Series18m
- 11Lecture 112: Perfect Squares Problem || DP Series21m
- 12Lecture 114: Minimum Cost for Tickets || Part-2 || DP Series18m
Week 2Videos 13–21 · 4h 41m
Day 8 · 54m
- 13Lecture 113: Minimum Cost for Tickets || Part-1 || DP Series26m
- 14Lecture 115: Largest Square area in Matrix || DP Series28m
Day 9 · 26m
- 15Lecture 116: Min Score Triangulation of Polygon || DP Series26m
Day 10 · 51m
- 16Lecture 117: Minimum Sideways Jump LeetCode || 2D-DP || DP Series51m
Day 11 · 27m
- 17Lecture 118: Reducing Dishes LeetCode || 2D-DP || DP Series27m
Day 12 · 46m
- 18Lecture 119: Longest Increasing Subsequence + Russian Doll LeetCode || DP + Binary Search46m
Day 13 · 44m
- 19Lecture 120: Maximum Height by Stacking Cuboid || DP Series16m
- 20Lecture 121: Pizza with 3n Slices || 2D - DP || DP Series28m
Day 14 · 33m
- 21Lecture 122: Number of Dice Rolls with Target Sum || DP Series33m
Week 3Videos 22–35 · 5h 10m
Day 15 · 28m
- 22Lecture 123: Partition Equal Subset Sum || DP Series28m
Day 16 · 42m
- 23Lecture 124: Minimum Swaps to make Subsequences Increasing || DP Series42m
Day 17 · 49m
- 24Lecture 125: Longest Arithmetic Subsequence || DP Series38m
- 25Lecture 126: Longest AP with given Difference "d" || DP Series11m
Day 18 · 46m
- 26Lecture 127: Unique Binary Search Trees || Catalan Number20m
- 27Lecture 128: Guess Number Higher or Lower || DP Series25m
Day 19 · 37m
- 28Lecture 129: Minimum Cost Tree From Leaf Values || DP Series27m
- 29Lecture 130: Buy and Sell Stock [Part 1] || DP Series10m
Day 20 · 51m
- 30Lecture 131: Buy and Sell Stock [Part 2] || DP Series30m
- 31Lecture 132: Buy and Sell Stock [Part 3] || DP Series21m
Day 21 · 57m
- 32Lecture 133: Buy and Sell Stock [Part 4] || DP Series19m
- 33Lecture 134: Buy and Sell Stock [Part 5] || DP Series8m
- 34Lecture 135: Longest Common Subsequence || DP on Strings22m
- 35Lecture 136: Longest Palindromic Subsequence || DP on Strings8m
Week 4Videos 36–38 · 1h 15m
Day 22 · 43m
- 36Lecture 137: EDIT Distance || DP on Strings30m
- 37Lecture 138: Maximum Rectangle with all 1's || DP Series13m
Day 23 · 32m
- 38Lecture 139: Wildcard Pattern Matching || DP Series32m
Tips for finishing
- Each problem is solved recursively, then with memoization, then tabulation. Code all three yourself before moving on.
- If you're also following the full C++ course, don't watch both: this playlist is the same lectures.