YouTube Tools
Support

Love Babbar's C++ Placement DSA Course: study plan and how long it takes

The CodeHelp - by Babbar playlist is 149 videos and 96.5 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.

149 videos · 96.5 hours · CodeHelp - by Babbar

Love Babbar's Complete C++ Placement DSA Course on the CodeHelp channel starts from flowcharts and your first C++ program and goes all the way to graphs and dynamic programming. It is taught in Hindi and is a popular choice for students preparing for placements.

With 140 lectures that are often an hour or more, it is a multi-month course. Breaking it into phases with a finish date for each keeps momentum through the long middle sections.

Who it's for: Students preparing for campus placements who are comfortable learning in Hindi. It starts from zero, so no prior coding is needed.

How long does it take?

The full playlist is 96.5 hours across 149 videos. Here's roughly how many days that is at different daily watch times and speeds, counting video time only:

Days to finish the playlist by daily watch time and playback speed
Daily timeAt 1xAt 1.5xAt 2x
30 min a day193 days129 days97 days
1 h a day97 days65 days49 days
2 h a day49 days33 days25 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.

Open on YouTube Track watched videos

Week-by-week schedule

A sample plan at 2 hours a day and normal speed, using whole videos so none is split across days. That's 9 weeks in total. For a different pace, start date or speed, use the planner above.

Week 1Videos 1–10 · 10h 57m

  1. Day 1 · 1h 54m

    • 1Lecture 1: Intro to Programming & Flowcharts58m
    • 2Lecture 2: Write Your First Program in C++56m

  2. Day 2 · 2h

    • 3Lecture 3: If-Else, While loop & Lots of Patterns (Part-1)56m
    • 4Lecture 4: Solving Pattern Questions (Part-2)1h 4m

  3. Day 3 · 1h 51m

    • 5Lecture 5: Bitwise Operators, For Loops, Operator Precedence & Variable Scoping1h 16m
    • 6Lecture 6: Binary & Decimal Number System35m

  4. Day 4 · 43m

    • 7Lecture 7: LeetCode Problem Solving Session43m

  5. Day 5 · 1h 25m

    • 8Lecture 8: Switch Statement & Functions1h 25m

  6. Day 6 · 1h 30m

    • 9Lecture 9: Introduction to Arrays in C++1h 30m

  7. Day 7 · 1h 35m

    • 10Lecture 10: Solving LeetCode/CodeStudio Questions [Arrays]1h 35m
Week 2Videos 11–24 · 9h 41m

  1. Day 8 · 1h 49m

    • 11Lecture 11:Time & Space Complexity || How to avoid Time Limit Exceeded [TLE]29m
    • 12Lecture 12: Binary Search Explained in 1 Video [Theory + Code]39m
    • 13Lecture 13: Binary Search Interview Questions [Google, Amazon, Microsoft] || ProblemSet - 142m

  2. Day 9 · 56m

    • 14Lecture14: Binary Search Interview Questions [Google, Amazon, Microsoft] || ProblemSet - 256m

  3. Day 10 · 1h 42m

    • 15Lecture 15: Book Allocation Problem || Aggressive Cows Problem || Binary Search Advanced Problems1h 5m
    • 16Lecture16: Selection Sort [Theory + Code] || C++ Placement Series34m
    • 17CodeHelp Weekly Contest 1 is LIVE || Game starts Now2m

  4. Day 11 · 1h 6m

    • 18Lecture 17: BUBBLE SORT in 1 Video [Theory + Optimised Code] || Best/Worst Case Complexity32m
    • 19Lecture 18: INSERTION SORT in 1 Video [Theory + Code] || Best/Worst Case Complexity34m

  5. Day 12 · 1h 37m

    • 20Lecture19: C++ STL in 1 Video (Re-Uploaded)1h 2m
    • 21Lecture 20: Solving LeetCode/CodeStudio Questions [Arrays]36m

  6. Day 13 · 37m

    • 22Lecture21: Solving LeetCode/CodeStudio Questions [Arrays]34m
    • 23CodeHelp Weekly Contest 2 is LIVE || Contest 1 Results announced3m

  7. Day 14 · 1h 53m

    • 24Lecture22: All about Char Arrays, Strings & solving LeetCode Questions1h 53m
Week 3Videos 25–43 · 11h 54m

  1. Day 15 · 1h 31m

    • 25Lecture 23: Introduction to 2D Arrays in C++ || LeetCode Questions1h 31m

  2. Day 16 · 1h 29m

    • 26Lecture 24: Basic Maths for DSA || Sieve || Modular Arithmetics || Euclid’s Algorithm44m
    • 27DSA Placement course || Phase-1 Completed1m
    • 28Lecture 25: Pointers in C++ || Part-1 || DSA Placement Course - Love Babbar44m

  3. Day 17 · 1h 57m

    • 29Lecture 26: Pointers in C++ || Part-2 || DSA Placement Course - Love Babbar1h 4m
    • 30Lecture27: Double Pointers in C++ || Pointers Practice MCQs53m

  4. Day 18 · 1h 49m

    • 31Lecture28: Reference Variable | Static vs Dynamic Memory | Part-147m
    • 32Lecture29: Dynamic Memory Allocation of 2D Arrays23m
    • 33Lecture30: Macros, Global Variables, Inline Functions & Default Args39m

  5. Day 19 · 1h 23m

    • 34Lecture 31: Learning Recursion the Best Way! | 10 Day Recursion Challenge38m
    • 35Lecture32: Understanding Recursion the easiest way || Day-2 || 10 Day Recursion Challenge45m

  6. Day 20 · 1h 47m

    • 36Lecture33: Recursion and Binary Search | Day-3 | 10 Days Recursion Challenge43m
    • 37Lecture34: Recursion with Strings | Day-4 | 10 Day Recursion Challenge37m
    • 38Lecture35: Merge Sort using Recursion | Day-5 | 10 Day Recursion Challenge24m
    • 39CodeHelp Weekly Contest 3 is LIVE || Contest 1 & 2 Gifts Sent !!3m

  7. Day 21 · 1h 58m

    • 40Lecture36: Quick Sort using Recursion | Day-6 | 10 Day Recursion Challenge38m
    • 41Lecture37: Recursion - Subsets / Subsequences of String [Theory + Code]27m
    • 42Lecture38: Phone Keypad Problem Recursion || C++ Placement Course31m
    • 43Lecture39: Permutations of a String || C++ Placement Course22m
Week 4Videos 44–56 · 11h 35m

  1. Day 22 · 1h 27m

    • 44Lecture40: Rat in a Maze Problem || C++ Placement Course 202238m
    • 45Lecture 41: Time & Space Complexity of Recursive Algorithms || C++ Placement Course49m

  2. Day 23 · 1h 29m

    • 46Lecture 42: OOPs Concepts in C++ || Part-11h 29m

  3. Day 24 · 1h 35m

    • 47Lecture 43 : 4 Pillars of OOPs Concept -Inheritance, Polymorphism, Encapsulation & Abstraction1h 35m

  4. Day 25 · 2h 21m

    • 48Lecture 44: Linked List & its types - Singly, Doubly, Circular etc.2h 21m

  5. Day 26 · 1h 36m

    • 49Lecture 45: Linked List Questions: Reverse LL and find Middle of LL53m
    • 50CodeHelp Weekly Contest 4 is LIVE || Contest Editorial/Solutions4m
    • 51Lecture 46: Linked List Questions: Reverse LL in "K group" && Check LL is Circular or not40m

  6. Day 27 · 1h 18m

    • 52Lecture47: Detect & Remove Loop in Linked List [Approach Discussion + Optimised Implementation]51m
    • 53Lecture 48: Remove Duplicates from a Sorted/UnSorted Linked List27m

  7. Day 28 · 1h 48m

    • 54Lecture 49: Merge 2 Sorted Linked Lists || Sort 0s, 1s and 2s in Linked List59m
    • 55Lecture 50: Check Palindrome in Linked List || C++ Placement Course23m
    • 56Lecture 51: Add 2 Numbers represented by Linked Lists || C++ Placement Course26m
Week 5Videos 57–69 · 11h 29m

  1. Day 29 · 1h 23m

    • 57Lecture 52: Clone a Linked List with Random Pointers || C++ Placement Course55m
    • 58Lecture 53: Merge Sort in Linked List [ Theory + Implementation ]28m

  2. Day 30 · 43m

    • 59Lecture 54: Introduction to Stacks [Theory + Implementation] || C++ Placement Course43m

  3. Day 31 · 1h 36m

    • 60Lecture 55: Stack Interview Questions || Placement Series by Love Babbar1h 36m

  4. Day 32 · 1h 50m

    • 61Lecture 56: Largest Rectangular Area in Histogram [Optimised Approach]29m
    • 62Lecture 57: Stack - Celebrity Problem && Max Rectangle in Binary Matrix with all 1's44m
    • 63Lecture 58: "N" Stacks in an Array || Stack Hard Question38m

  5. Day 33 · 1h 35m

    • 64Lecture 59: Design Special Stack Problem || C++ Placement Course29m
    • 65Lecture 60: Queues in C++ [STL + Implementation + Types of Queues ]1h 5m

  6. Day 34 · 2h 24m

    • 66Lecture 61: Queue FAANG Interview Questions || Placement Series by Love Babbar2h 24m

  7. Day 35 · 1h 59m

    • 67Lecture 62: Binary Trees & its Representation || Different types of Traversals55m
    • 68CodeHelp Weekly Contest 5 is LIVE || Contest Editorial/Solutions2m
    • 69Lecture 63: Binary Tree FAANG Interview Questions || Part-11h 1m
Week 6Videos 70–82 · 9h 45m

  1. Day 36 · 1h 12m

    • 70Lecture 64: Binary Tree FAANG Interview Questions || Part-21h 12m

  2. Day 37 · 1h 36m

    • 71Lecture 65: Binary Tree FAANG Interview Questions || Part-359m
    • 72Lecture 66: Construct a Binary Tree from InOrder/PreOrder/PostOrder Traversal37m

  3. Day 38 · 1h

    • 73Lecture 67: Minimum Time to BURN the Entire Binary Tree || C++ Placement Series28m
    • 74Lecture 68: Morris Traversal || Flatten a Binary tree to Linked List || C++ Placement Series32m

  4. Day 39 · 1h 44m

    • 75Lecture 69: Binary Search Tree & its Implementation || Insertion, Deletion & Searching a Node1h 6m
    • 76Lecture 70: Binary SearchTree FAANG Interview Questions || Part-138m

  5. Day 40 · 1h 57m

    • 77Lecture 71: Binary SearchTree FAANG Interview Questions || Part-248m
    • 78Lecture 72: Merge 2 Binary Search Trees || C++ Placement Series46m
    • 79Lecture 73: Largest BST in a Binary Tree || C++ Placement Series23m

  6. Day 41 · 1h 5m

    • 80Lecture 74: Heaps in C++ || Heap Sort || Insertion/Deletion in Heap || Priority Queue STL1h 5m

  7. Day 42 · 1h 11m

    • 81Lecture 75: Heaps in C++ || Interview Questions || Part - 11h 8m
    • 82CodeHelp Weekly Contest 6 is LIVE || MacBook Giveaway Coming Soon3m
Week 7Videos 83–109 · 12h 52m

  1. Day 43 · 1h 55m

    • 83Lecture 76: Heaps in C++ || Interview Questions || Part - 250m
    • 84Lecture 77: Heaps Hard Interview Questions || Part - 31h 5m

  2. Day 44 · 1h 53m

    • 85Lecture 78: Hashmaps in C++ || C++ Placement Series1h 3m
    • 86CodeHelp Weekly Contest 7 is LIVE1m
    • 87Lecture 79: Trie & its Implementation || C++ Placement Series48m

  3. Day 45 · 1h 50m

    • 88Lecture 80: Longest Common Prefix Problem || Tries || C++ Placement Series20m
    • 89Lecture 81: Implement a Phone Directory Using Trie || C++ Placement Series27m
    • 90Lecture 82: Rat in Maze Problem || Backtracking Day 1 || C++ Placement Series32m
    • 91Lecture 83: N-Queen Problem || Backtracking Day 2 || C++ Placement Series31m

  4. Day 46 · 1h 35m

    • 92Lecture 84: Sudoku Solver Problem || Backtracking Day 3 || C++ Placement Series23m
    • 93Lecture 85: Introduction to Graphs || Creation and Implementation33m
    • 94Lecture 86: BFS Traversal in Graph || C++ Placement Series24m
    • 95Lecture 87: DFS Traversal in Graph || C++ Placement Series14m

  5. Day 47 · 1h 59m

    • 96Lecture 88: Cycle Detection in Undirected Graphs || Using BFS and DFS32m
    • 97Lecture 89: Cycle Detection in Directed Graphs || Placement Series19m
    • 98Lecture 90: Topological Sort ( Using DFS ) || Placement Series20m
    • 99Lecture 91: Topological Sort ( Using Kahn's Algorithm ) || Placement Series17m
    • 100CodeHelp Weekly Contest 9 is LIVE || C++ Placement Series3m
    • 101Lecture 92: Cycle Detection in Directed Graph || Using BFS8m
    • 102Lecture 93: Shortest Path in Undirected Graphs || C++ Placement Series20m

  6. Day 48 · 1h 43m

    • 103Lecture 94: Shortest Path in Directed Acyclic Graphs || C++ Placement Series34m
    • 104Lecture 95: Dijkstra's Algorithm || C++ Placement Series36m
    • 105Lecture 96: Minimum Spanning Tree || Prim's Algorithm33m

  7. Day 49 · 1h 57m

    • 106Lecture 97: Kruskal's Algorithm || Disjoint Set || Union by Rank & Path Compression41m
    • 107Lecture 98: Bridges in a Graph || C++ Placement Series25m
    • 108Lecture 99: Articulation Points in Graphs || C++ Placement Series30m
    • 109Lecture 100: Kosaraju's Algorithm for Strongly Connected Components || C++ Placement Series22m
Week 8Videos 110–133 · 11h 32m

  1. Day 50 · 1h 34m

    • 110Lecture 101: Bellman Ford Algorithm || C++ Placement Series22m
    • 111Lecture 102: Introduction to Dynamic Programming | Memoization | Tabulation | Space Optimisation37m
    • 112Lecture 103: Minimum Cost Climbing Stairs || DP Series34m

  2. Day 51 · 1h 54m

    • 113Lecture 104: Minimum Number of Coins || DP Series31m
    • 114Lecture 105: Maximum Sum of Non-Adjacent Elements || DP Series21m
    • 115Lecture 106: House Robbery Problem || DP Series12m
    • 116Lecture 107: Cut Rod into Segments of X, Y, Z || DP Series25m
    • 117Lecture 108: Count derangements || DP Series27m

  3. Day 52 · 1h 55m

    • 118Lecture 109: Painting Fence Algorithm || DP Series25m
    • 119Lecture 110: 0/1 KnapSack Problem || learn 2-D DP Concept || DP Series51m
    • 120Lecture 111: Combination Sum IV Problem || DP Series18m
    • 121Lecture 112: Perfect Squares Problem || DP Series21m

  4. Day 53 · 1h 38m

    • 122Lecture 113: Minimum Cost for Tickets || Part-1 || DP Series26m
    • 123Lecture 114: Minimum Cost for Tickets || Part-2 || DP Series18m
    • 124Lecture 115: Largest Square area in Matrix || DP Series28m
    • 125Lecture 116: Min Score Triangulation of Polygon || DP Series26m

  5. Day 54 · 1h 18m

    • 126Lecture 117: Minimum Sideways Jump LeetCode || 2D-DP || DP Series51m
    • 127Lecture 118: Reducing Dishes LeetCode || 2D-DP || DP Series27m

  6. Day 55 · 1h 30m

    • 128Lecture 119: Longest Increasing Subsequence + Russian Doll LeetCode || DP + Binary Search46m
    • 129Lecture 120: Maximum Height by Stacking Cuboid || DP Series16m
    • 130Lecture 121: Pizza with 3n Slices || 2D - DP || DP Series28m

  7. Day 56 · 1h 43m

    • 131Lecture 122: Number of Dice Rolls with Target Sum || DP Series33m
    • 132Lecture 123: Partition Equal Subset Sum || DP Series28m
    • 133Lecture 124: Minimum Swaps to make Subsequences Increasing || DP Series42m
Week 9Videos 134–149 · 6h 44m

  1. Day 57 · 1h 35m

    • 134Lecture 125: Longest Arithmetic Subsequence || DP Series38m
    • 135Lecture 126: Longest AP with given Difference "d" || DP Series11m
    • 136Lecture 127: Unique Binary Search Trees || Catalan Number20m
    • 137Lecture 128: Guess Number Higher or Lower || DP Series25m

  2. Day 58 · 1h 55m

    • 138Lecture 129: Minimum Cost Tree From Leaf Values || DP Series27m
    • 139Lecture 130: Buy and Sell Stock [Part 1] || DP Series10m
    • 140Lecture 131: Buy and Sell Stock [Part 2] || DP Series30m
    • 141Lecture 132: Buy and Sell Stock [Part 3] || DP Series21m
    • 142Lecture 133: Buy and Sell Stock [Part 4] || DP Series19m
    • 143Lecture 134: Buy and Sell Stock [Part 5] || DP Series8m

  3. Day 59 · 1h 45m

    • 144Lecture 135: Longest Common Subsequence || DP on Strings22m
    • 145Lecture 136: Longest Palindromic Subsequence || DP on Strings8m
    • 146Lecture 137: EDIT Distance || DP on Strings30m
    • 147Lecture 138: Maximum Rectangle with all 1's || DP Series13m
    • 148Lecture 139: Wildcard Pattern Matching || DP Series32m

  4. Day 60 · 1h 30m

    • 149Lecture 140: GREEDY ALGORITHMS in 1 VIDEO1h 30m

Study plan, phase by phase

Video numbers are positions in the playlist. To schedule just one phase, enter its numbers in the planner's From and To fields.

  1. 01

    Programming basics

    Videos 1–11 · 11h 26m

    Flowcharts, first programs, loops and patterns, bitwise operators, number systems, functions, arrays and time complexity, with LeetCode practice sessions.

  2. 02

    Searching, sorting, STL, strings and 2D arrays

    Videos 12–27 · 11h 27m

    Binary search and its interview questions, book allocation, selection, bubble and insertion sort, the C++ STL, character arrays and strings, 2D arrays and basic maths.

  3. 03

    Pointers and memory

    Videos 28–33 · 4h 31m

    Pointers, double pointers, references, dynamic memory allocation, macros and inline functions.

  4. 04

    Recursion

    Videos 34–45 · 6h 35m

    Recursion from scratch, merge sort and quick sort, subsets, phone keypad, permutations, rat in a maze and the complexity of recursive algorithms.

  5. 05

    Object-oriented programming

    Videos 46–47 · 3h 5m

    OOP concepts and the four pillars: inheritance, polymorphism, encapsulation and abstraction.

  6. 06

    Linked lists, stacks and queues

    Videos 48–66 · 16h 34m

    Linked list types and interview questions, stacks (largest rectangle in a histogram, the celebrity problem, N stacks) and queues.

  7. 07

    Trees, heaps, hashmaps and tries

    Videos 67–89 · 16h 19m

    Binary trees and their interview questions, Morris traversal, binary search trees, heaps, hashmaps and tries.

  8. 08

    Backtracking and graphs

    Videos 90–110 · 8h 38m

    Rat in a maze, N-Queens and Sudoku, then graphs: BFS, DFS, cycle detection, topological sort, shortest paths, minimum spanning trees, bridges, articulation points, Kosaraju and Bellman-Ford.

  9. 09

    Dynamic programming and greedy

    Videos 111–149 · 17h 54m

    Around 37 DP lectures from climbing stairs to knapsack, LIS, buy and sell stock, LCS, edit distance and wildcard matching, then greedy algorithms in one video.

Tips for finishing

  • The playlist includes short "CodeHelp Weekly Contest is LIVE" announcements. Tick them off in the playlist length calculator and the planner will skip them.
  • Schedule one phase at a time using the planner's video range. Linked lists through queues alone is over 16 hours.
  • Solve the lecture's homework problems before the next video. The course is built around practice between lectures.

Frequently asked questions

How long does it take to finish Love Babbar's C++ Placement DSA Course?

The playlist has 149 videos and 96.5 hours of content. At 1 hour a day that's about 97 days at normal speed, or 65 days at 1.5x. At 2 hours a day it's about 49 days.

Is Love Babbar's DSA course in Hindi?

Yes, the lectures are in Hindi with code and slides in English.

Love Babbar or Striver: which DSA course should I pick?

Love Babbar's course starts from zero and teaches C++ along the way, in Hindi. Striver's A2Z assumes some programming and is in English, organised around a problem sheet. Beginners often start with Babbar; those who can already code often prefer A2Z.

More study plans

See all 166 study plans

Tools for any playlist