YouTube Tools
Support

Love Babbar's Java DSA Series: study plan and how long it takes

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

120 videos · 71.7 hours · CodeHelp - by Babbar

CodeHelp's Java DSA Series, billed as a 150-day challenge, teaches data structures and algorithms in Java from flowcharts and the basics of the language through the Java Collections Framework, binary search, recursion, dynamic programming, linked lists and stacks.

Many lectures run over an hour, so treat it as a multi-month course and plan it phase by phase.

Who it's for: Students who want to do DSA in Java rather than C++, starting from zero, and are comfortable with Hindi.

How long does it take?

The full playlist is 71.7 hours across 120 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 day144 days96 days72 days
1 h a day72 days48 days36 days
2 h a day36 days24 days18 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 7 weeks in total. For a different pace, start date or speed, use the planner above.

Week 1Videos 1–15 · 10h 51m

  1. Day 1 · 1h 49m

    • 1DSA Complete Series 🚀 : Data Structures & Algorithms || 150 day Challenge9m
    • 2Lecture 1: Flowchart & Pseudocode + Basics || DSA Series by Babbar || Java1h 16m
    • 3Lecture 2: How a Java Program Run || DSA Series by Babbar15m
    • 4Lecture 3: IDE Setup for Coding || DSA Series by Babbar || Java8m

  2. Day 2 · 1h 48m

    • 5Lecture 4: Write your FIRST Java Program || DSA Series by Babbar23m
    • 6Lecture 5: VARIABLES in Java || DSA Series by Babbar15m
    • 7Lecture 6: DataTypes in Java || DSA Series by Babbar28m
    • 8Lecture 7: Operators in Java || DSA Series by Babbar30m
    • 9Lecture 8: Input/Output in Java || DSA Series by Babbar12m

  3. Day 3 · 1h 44m

    • 10Lecture 9: Conditionals in Java || DSA Series by Babbar35m
    • 11Lecture 10: Loops in Java || DSA Series by Babbar1h 9m

  4. Day 4 · 2h 7m

    • 12Lecture 11: Solve any PATTERN Printing Problem using this TRICK || DSA Series by Babbar2h 7m

  5. Day 5 · 58m

    • 13Lecture 12: Methods in Java || DSA Series by Babbar58m

  6. Day 6 · 1h 19m

    • 14Lecture 13: Arrays in Java || DSA Series by Babbar1h 19m

  7. Day 7 · 1h 7m

    • 15Lecture 14: Strings in Java || DSA Series by Babbar1h 7m
Week 2Videos 16–25 · 9h 14m

  1. Day 8 · 1h 17m

    • 16Lecture 15: Basic Maths needed for DSA || DSA Series by Babbar1h 17m

  2. Day 9 · 1h 47m

    • 17Lecture 16: Intro to OOPs Concepts || DSA Series by Babbar44m
    • 18Lecture 17: Classes, Objects, Constructors, Object Lifecycle in JAVA || DSA Series by Babbar30m
    • 19Lecture 18: Encapsulation in JAVA || DSA Series by Babbar33m

  3. Day 10 · 1h 36m

    • 20Lecture 19: Inheritance in Java || DSA Series by Babbar1h 36m

  4. Day 11 · 1h 34m

    • 21Lecture 20: Polymorphism in Java || DSA Series by Babbar38m
    • 22Lecture 21: Abstraction in Java || DSA Series by Babbar56m

  5. Day 12 · 37m

    • 23Lecture 22: Time & Space Complexity || DSA Series by Babbar37m

  6. Day 13 · 1h 25m

    • 24Lecture 23: Java Collection Framework ( Part-1 ) || DSA Series by Babbar1h 25m

  7. Day 14 · 58m

    • 25Lecture 24: Java Collection Framework ( Part-2 ) || DSA Series by Babbar58m
Week 3Videos 26–42 · 10h 57m

  1. Day 15 · 1h 5m

    • 26Lecture 25: Java Collection Framework ( Part-3 ) || DSA Series by Babbar1h 5m

  2. Day 16 · 1h 44m

    • 27Lecture 26: Bitwise Operators in Java || DSA Series by Babbar59m
    • 28Lecture 27: Array Problem Solving Part-1 || DSA Series by Babbar45m

  3. Day 17 · 1h 56m

    • 29Lecture 28: Array Manipulation Problems || DSA Series by Babbar49m
    • 30Lecture 29: Array Problem Solving Part-3 || DSA Series by Babbar26m
    • 31Lecture 30: Array Problem Solving Part-4 || DSA Series by Babbar42m

  4. Day 18 · 1h 14m

    • 32Lecture 31: Missing Elements from an Array of Duplicates || Array Problem || DSA Series by Babbar17m
    • 33Lecture 32: Maximum Sum Contiguous SubArray || Kadane's Algorithm || DSA Series by Babbar25m
    • 34Lecture 33: Solving 2D Array Problems || DSA Series by Babbar32m

  5. Day 19 · 1h 30m

    • 35Lecture 34: Rotate and Spiral Print a Matrix || DSA Series by Babbar46m
    • 36Lecture 35: Sorting Algorithms || DSA Series by Babbar44m

  6. Day 20 · 1h 34m

    • 37Lecture 36: Binary Search in 1 Video || DSA Series by Babbar40m
    • 38Lecture 37: Upper/Lower Bound, Number of Occurrences Binary Search || DSA Series by Babbar35m
    • 39Lecture 38: Find PEAK of MOUNTAIN Array || DSA Series by Babbar19m

  7. Day 21 · 1h 54m

    • 40Lecture 39: Search in a Rotated Sorted Array || DSA Series by Babbar34m
    • 41Lecture 40: Binary Search on Answers PATTERN || DSA Series by Babbar40m
    • 42Lecture 41: Book Allocation Problem || Min-Max Binary Search Pattern || DSA Series by Babbar40m
Week 4Videos 43–64 · 11h 40m

  1. Day 22 · 1h 37m

    • 43Lecture 42: Painter's Partition Problem || DSA Series by Babbar38m
    • 44Lecture 43: Aggressive Cows Problem || DSA Series by Babbar33m
    • 45Lecture 44: EKO SPOJ Problem || Binary Search || DSA Series by Babbar27m

  2. Day 23 · 1h 55m

    • 46Lecture 45: ROTI PRATA SPOJ Problem || DSA Series by Babbar47m
    • 47Lecture 46: Search in Nearly Sorted Array || Binary Search || DSA Series by Babbar15m
    • 48Lecture 47: Find Single Non-Duplicate element using Binary Search || DSA Series by Babbar30m
    • 49Lecture 48: Search in 2D Matrix I and II (Binary Search) || DSA Series by Babbar23m

  3. Day 24 · 1h 31m

    • 50Lecture 49: Row with Maximum 1's || Binary Search || DSA Series by Babbar29m
    • 51Lecture 50: Unbounded Search using Binary Search Concept || DSA Series by Babbar28m
    • 52Lecture 51: Reverse Words in a Strings || DSA Series by Babbar34m

  4. Day 25 · 1h 3m

    • 53Lecture 52: String Interview Questions Part-2 || DSA Series by Babbar36m
    • 54Lecture 53: String Interview Problems Part-3 || DSA Series by Babbar27m

  5. Day 26 · 1h 58m

    • 55Lecture 54: Recursion Basics || Recursion Series Day-1 || DSA Series by Babbar1h
    • 56Lecture 55: Recursive Time & Space Complexity || Recursion Series Day-2 || DSA Series by Babbar43m
    • 57Lecture 56: Climbing Stairs problem || Recursion Series Day-315m

  6. Day 27 · 1h 49m

    • 58Lecture 57: Recursion Basics || Recursion Day-455m
    • 59Lecture 58: Recursive BINARY SEARCH || Recursion Day-527m
    • 60Lecture 59: Subsequences of String || Recursion Series Day-627m

  7. Day 28 · 1h 46m

    • 61Lecture 60: House Robber Problem || Recursion Series Day-724m
    • 62Lecture 61: Coin Change 2 Problem || Recursion Series Day-831m
    • 63Lecture 62: COin Change I Problem || Recursion Series Day-925m
    • 64Lecture 64: Minimize the Difference Between Target and Chosen Elements || Recursion Series Day-1125m
Week 5Videos 65–79 · 10h 34m

  1. Day 29 · 1h 35m

    • 65Lecture 63: Partition Equal Subset Sum Problem || Recursion Series Day-1020m
    • 66Lecture 65: Jump Game Problem || Recursion Series Day-1224m
    • 67Lecture 66: Leetcode Triangle Problem || Recursive Series Day-1332m
    • 68Lecture 67: Subsequences with Sum K || Recursion Series Day-1419m

  2. Day 30 · 1h 30m

    • 69Lecture 68: Subsets 1 & Subsets II Problem || Recursion Series Day-1526m
    • 70Lecture 69: Combination Sum (All 3 *variants*) || Recursion Series Day-1640m
    • 71Lecture 70: Permutations of String || Recursion Series Day-1725m

  3. Day 31 · 1h 25m

    • 72Lecture 71: Intro to Backtracking || Recursion Series Day-181h
    • 73Lecture 72: Phone Keypad Problem || Recursion Series Day-1926m

  4. Day 32 · 1h 39m

    • 74Lecture 73: N-Queen Problem || Recursion Series Day-2054m
    • 75Lecture 74: Sudoku Solver Problem || Recursion Series Day-2145m

  5. Day 33 · 1h 39m

    • 76Lecture 75: Merge Sort in 1 Video || Recursion Series Day-221h 3m
    • 77Lecture 76: Inversion Count in an Array || Recursion Day-2335m

  6. Day 34 · 42m

    • 78Lecture 77: Quick Sort in 1 Video || Recursion Day - 2442m

  7. Day 35 · 2h 4m

    • 79Lecture 78: Starting Linked List Series || Day - 12h 4m
Week 6Videos 80–105 · 11h 58m

  1. Day 36 · 1h 9m

    • 80Lecture 79: All about Doubly Linked List || Linked List Series Day - 21h 9m

  2. Day 37 · 1h 55m

    • 81Lecture 80: Circular Linked List || Linked List Series Day-31h 28m
    • 82Lecture 81: Reverse a Linked List || Linked List Series Day-428m

  3. Day 38 · 1h 50m

    • 83Lecture 82: Middle Node of Linked List || Linked List Series Day-514m
    • 84Lecture 83: Check Palindrome Linked List || Linked List Series Day-621m
    • 85Lecture 84: Check Cycle in Linked List || Linked List Series Day-717m
    • 86Lecture 86: Remove Duplicate Nodes from LL || Linked List Series Day-911m
    • 87Lecture 87: Kth node from end of LL || Linked List Series Day-1017m
    • 88Lecture 88: Odd-Even Linked List || Linked List Series Day-1130m

  4. Day 39 · 1h 39m

    • 89Lecture 89: Merge Nodes in between Zeroes || Linked List Series Day-1224m
    • 90Lecture 90: Add 1 to LL || Linked List Series Day-1331m
    • 91Lecture 91: Intersection of 2 Linked List || Linked List Series Day-1425m
    • 92Lecture 92: Rotate Linked List || Linked List Series Day-1519m

  5. Day 40 · 1h 52m

    • 93Lecture 93: Sort LL of 0's, 1's and 2's || Linked List Series Day-1626m
    • 94Lecture 94: Swap Nodes in LL || Linked List Series day-1717m
    • 95Lecture 95: Delete N Nodes After M Nodes || Linked List Series Day-1824m
    • 96Lecture 97: DETECT Starting Node of CYCLE in Linked List || LL Series Day-2029m
    • 97Lecture 98: Partition a Linked List || LL Series Day-2216m

  6. Day 41 · 1h 45m

    • 98Lecture 96: Add 2 numbers in Linked List || LL Series Day-1914m
    • 99Lecture 99: Split a LL into Parts || Linked List Series Day-2225m
    • 100Lecture 100: Reverse LL in Groups of K || Linked List Series Day-2319m
    • 101Lecture 101: Flatten a Multi-Level LL || Linked List Series Day-2425m
    • 102Lecture 102: Find Nodes between Critical Points || Linked List Series Day-2522m

  7. Day 42 · 1h 47m

    • 103Lecture 103: Double a Number in Linked List || Linked List Series Day-2624m
    • 104Lecture 104: Deep Copy a Linked List || Linked List Series Day-2735m
    • 105Lecture 105: Starting Stack Series || Day-148m
Week 7Videos 106–122 · 6h 31m

  1. Day 43 · 1h 59m

    • 106Lecture 106: STACK warm-up Coding Problems || Day-21h 16m
    • 107Lecture 107: Check STACK is Sorted or Not || Stack Series Day-314m
    • 108Lecture 108: Insert Element in a Sorted Stack || Stack Series Day-412m
    • 109Lecture 109: Check String is VALID or NOT Stack Problem || Stack Series Day-516m

  2. Day 44 · 2h

    • 110Lecture 110: Min Addition to make Parentheses Valid || Stack Series Day-619m
    • 111Lecture 111: Minimum Bracket Reversal || Stack Series Day-730m
    • 113Lecture 113: Remove all Adjacent duplicates in String || Stack Series Day-914m
    • 115Lecture 112: Longest Valid Parentheses || Stack Series Day-838m
    • 116Lecture 114: Simplify Path || Stack Series Day-1019m

  3. Day 45 · 1h 44m

    • 117Lecture 115: Decode String || Stack Series Day-1131m
    • 118Lecture 116: Monotonic Stack Pattern Problem || Stack Series Day-1229m
    • 119Lecture 117: Stock Span Problem || Stack Series Day-1323m
    • 120Lecture 118: Next Greater Node in Linked List || Stack Series Day-1421m

  4. Day 46 · 49m

    • 121Lecture 119: Remove K Digits Problem || Stack Series Day-1527m
    • 122Lecture 120: Celebrity Problem || Stack Series Day-1621m

Tips for finishing

  • If you already know Java, start from the binary search lectures and use the planner's From field to skip the language basics.
  • Solve each lecture's homework before the next video; the series is built around practice between lectures.

Frequently asked questions

How long does it take to finish Love Babbar's Java DSA Series?

The playlist has 120 videos and 71.7 hours of content. At 1 hour a day that's about 72 days at normal speed, or 48 days at 1.5x. At 2 hours a day it's about 36 days.

More study plans

See all 166 study plans

Tools for any playlist