YouTube Tools
Support

Jenny's Lectures Data Structures and Algorithms: study plan and how long it takes

The Jenny's Lectures CS IT playlist is 121 videos and 43.6 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.

121 videos · 43.6 hours · Jenny's Lectures CS IT

Jenny's Lectures DSA playlist is a university-style course covering arrays, linked lists (including doubly and circular), stacks and expression evaluation, queues, trees, AVL and B-trees, graphs and minimum spanning trees, sorting, hashing and an introduction to dynamic programming.

It's popular with Indian university students because it follows typical exam syllabi closely.

Who it's for: Computer science students preparing for university exams, GATE or UGC NET who want topics explained the way they're examined.

How long does it take?

The full playlist is 43.6 hours across 121 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 day88 days59 days44 days
1 h a day44 days30 days22 days
2 h a day22 days15 days11 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 4 weeks in total. For a different pace, start date or speed, use the planner above.

Week 1Videos 1–37 · 13h 4m

  1. Day 1 · 1h 32m

    • 11.1 Arrays in Data Structure | Declaration, Initialization, Memory representation23m
    • 21.2 Array Operations - Traversal, Insertion | Explanation with C Program | DSA Course29m
    • 31.3 Array Operations | Deletion from Array | Explanation with Code | Data Structure15m
    • 41.4 Pointers and Arrays | Data structure Tutorials25m

  2. Day 2 · 1h 59m

    • 51.5 Introduction to Two Dimensional (2D) Arrays | Implementation of 2D Arrays |Memory representation38m
    • 61.6 Pointers and 2-D Arrays | Two dimensional Array | Data Structures & Algorithm Tutorials25m
    • 72.1 Introduction to Linked List | Need of Linked List | DSA Tutorials22m
    • 82.2 Types of Linked List in Data Structures | DSA Full Course13m
    • 92.3 Arrays vs Linked List | Data structures21m

  3. Day 3 · 1h 56m

    • 102.4 Linked List Implementation in C/C++ | Creation and Display | DSA Tutorials29m
    • 112.5 Insertion of a Node in Linked List(at Beginning,End,Specified Position)with Code | DSA Tutorials27m
    • 122.6 Deletion of a node from Linked List (from beginning, end, specified position) | DSA Tutorials26m
    • 132.7 Find length of Linked List- Iterative approach | DSA Tutorials6m
    • 142.8 Reverse a Linked List - Iterative Method | Data Structure Tutorials19m
    • 152.9 Introduction to Doubly Linked List in Data structures | DSA Tutorials9m

  4. Day 4 · 2h

    • 162.10 Implementation of Doubly Linked List - Data Structures21m
    • 172.11 Insertion in Doubly Linked List(beginning, end, specific position) | Data Structures35m
    • 182.12 Deletion from Doubly Linked List (beginning,end,specific position) | Data Structures Tutorials22m
    • 192.13 Reverse a Doubly Linked List | Data Structures & Algorithm Tutorials20m
    • 202.14 Circular Linked List in Data Structure | Creation and Display | DSA Course22m

  5. Day 5 · 1h 50m

    • 212.15 Implementation of Circular linked list in C | Data Structure Tutorials28m
    • 222.16 Insertion in Circular Linked List | Data Structure Tutorials20m
    • 232.17 Deletion of a Node from Circular Linked List(beginning, end, given position) | DSA Tutorials24m
    • 242.18 Reverse a Circular Linked List | Data Structure Tutorials18m
    • 252.19 Implementation of Doubly Circular Linked List| Creation and Display | Data Structures20m

  6. Day 6 · 1h 49m

    • 262.20 Insertion in Doubly Circular Linked List | Data Structure & Algorithm Tutorials26m
    • 272.21 Deletion from Doubly Circular Linked List | Data Structure & Algorithm Course21m
    • 283.1 Stack in Data Structure | Introduction to Stack | Data Structures Tutorials18m
    • 293.2 Implementation of Stack using Array | Data Structure and Algorithm Tutorials17m
    • 303.3 Stack implementation using Linked List | Data Structures and Algorithm Tutorials27m

  7. Day 7 · 1h 59m

    • 313.4 Infix Prefix and Postfix expressions | Data Structures Tutorials14m
    • 323.5 Infix to Postfix Conversion Rules using Stack | Data structures Tutorials13m
    • 333.6 Infix to Postfix using Stack | Data Structure and Algorithm20m
    • 343.7 Infix to Postfix conversion using Stack | Data structures and algorithms16m
    • 353.8 Infix to Prefix using Stack | Data Structures Tutorials24m
    • 363.9 Evaluation of Prefix and Postfix expressions using Stack | Data Structures21m
    • 373.10 Postfix Expression Evaluation using Stack | Data Structures and Algorithms11m
Week 2Videos 38–73 · 12h 32m

  1. Day 8 · 1h 37m

    • 383.11 Prefix to Infix Conversion | Postfix to Infix Conversion | Data structure Tutorials10m
    • 393.12 Expression Trees | Binary Expression Tree | Data Structures Tutorials13m
    • 403.13 Expression Tree from Postfix | Data Structures Tutorials10m
    • 414.1 Queue in Data Structure | Introduction to Queue | Data Structures Tutorials20m
    • 424.2 Implementation of Queue using Arrays | Data Structures & Algorithm Tutorials23m
    • 434.3 Queue Implementation using Linked List in C | Data Structure Tutorials20m

  2. Day 9 · 1h 35m

    • 444.4 Circular Queue in Data Structure | Circular Queue using Arrays in C | DSA Tutorials24m
    • 454.5 Circular Queue in Data Structure | Circular Queue using Linked List | DSA Tutorials29m
    • 464.6 Implement Queue using Stack in C| Data Structures Tutorials29m
    • 474.7 DEQUE in Data Structure | Introduction to DEQue - Double Ended Queue13m

  3. Day 10 · 1h 55m

    • 484.8 Implementation of DEQUE using Circular Array | Data Structures Tutorials37m
    • 495.1 Tree in Data Structure | Introduction to Trees | Data Structures Tutorials29m
    • 505.2 Binary Tree in Data Structure| Types of Binary Tree| Data Structures Tutorials24m
    • 515.3 Binary Tree Implementation in C Program | Data Structures Tutorials25m

  4. Day 11 · 1h 51m

    • 525.4 Binary Tree Representation |Array representation of Binary Tree | Data Structure18m
    • 535.5 Binary Tree Traversals (Inorder, Preorder and Postorder) | Data structures and algorithms11m
    • 545.6 Binary Tree traversal | Preorder, Inorder, Postorder | Data Structures Tutorials20m
    • 555.7 Construct Binary Tree from Preorder and Inorder Traversal | Example | Data Structures Tutorials10m
    • 565.8 Construct Binary Tree from Postorder and Inorder with example | Data structures Course8m
    • 575.9 Construct Binary Tree from Preorder and Postorder traversal | Data Structure Tutorials19m
    • 585.10 Binary Search Trees (BST) - Insertion and Deletion | DSA Full Course17m
    • 595.11 Construct Binary Search Tree(BST) from Preorder example |Data Structures & Algorithm9m

  5. Day 12 · 1h 50m

    • 605.12 Construct Binary Search Tree(BST) from Postorder Traversal | Data structures11m
    • 615.13 AVL Tree - Insertion, Rotations(LL, RR, LR, RL) with Example | Data Structure Tutorials25m
    • 625.14 AVL Tree Insertion | with Solved Example | Data Structures & Algorithm Tutorials26m
    • 635.15 AVL Tree Deletion in Data structures | with Example | DSA Tutorials15m
    • 645.16 Red Black tree | Introduction to Red Black trees | DSA Tutorials33m

  6. Day 13 · 1h 59m

    • 655.17 Red Black Tree Insertion | Insertion Algorithm | Data Structure Tutorials28m
    • 665.18 Red Black Tree Deletion | DSA Tutorials for Beginners1h 3m
    • 675.19 Splay Tree Introduction | Data structure & Algorithm29m

  7. Day 14 · 1h 44m

    • 685.20 Splay Tree Insertion | Data structure34m
    • 695.21 Splay Trees Deletion | Bottom-up Splaying | Data Structure & Algorithm13m
    • 705.22 Splay Tree Deletion | Top Down Splaying | Data Structure & Algorithm21m
    • 715.23 Introduction to B-Trees | Data Structures & Algorithm Tutorials10m
    • 725.24 Insertion in B-tree of Order 3 | B-Tree Example | Data structures and algorithms10m
    • 735.25 Insertion in B-Tree of Order 5 | Data structures and algorithms Tutorials16m
Week 3Videos 74–108 · 12h 34m

  1. Day 15 · 1h 48m

    • 745.26 Insertion in B-Tree of Order 5 with Given Alphabets | Data structures and algorithms18m
    • 755.27 Insertion in B-Tree of Order 4 (Data Structure)15m
    • 765.28 B-Tree Deletion in Data Structures | DSA Tutorials28m
    • 775.29 B+ Tree Insertion | B+ Tree Creation example | Data Structure Tutorials19m
    • 785.30 B+ Tree Deletion| with example |Data structure & Algorithm Tutorials16m
    • 795.31 B+ Tree Insertion | Create B+ Tree of Order 5 | Data Structures Tutorials12m

  2. Day 16 · 1h 59m

    • 806.1 Graph Representation in Data Structure(Graph Theory)|Adjacency Matrix and Adjacency List12m
    • 816.2 BFS and DFS Graph Traversals| Breadth First Search and Depth First Search | Data structures20m
    • 826.3 Types of Edges in DFS | Edge Classification | Data Structures and Algorithms26m
    • 836.4 Minimum Spanning Tree | Properties of MST | Data Structures Tutorials16m
    • 846.5 Prim's Algorithm for Minimum Spanning Tree | Data Structures Tutorials10m
    • 856.6 Kruskals Algorithm for Minimum Spanning Tree- Greedy method | Data structures9m
    • 866.7 Minimum spanning Tree(MST) | UGC NET(Computer Science) Practice Question with Solution8m
    • 876.8 Cycle detection in Directed Graph |Data Structures and Algorithms Tutorials11m
    • 886.9 Detect Cycle in Undirected Graph | Data Structures and Algorithms7m

  3. Day 17 · 1h 46m

    • 896.10 Topological Sorting (with Examples) | How to find all Topological Orderings of a Graph14m
    • 906.11 Connected Components |How to find Connected Components in Graph | Graph Theory21m
    • 916.12 Bridges(Cut Edge) in a Graph | Find All Bridges in a Graph | Graph Theory21m
    • 926.13 Dijkstra Algorithm | Single Source Shortest Path| Greedy Method35m
    • 936.14 Bellman Ford Algorithm-Single Source Shortest Path | Dynamic Programming16m

  4. Day 18 · 1h 39m

    • 946.15 Floyd Warshall Algorithm All Pair Shortest Path algorithm | Data Structures and Algorithms31m
    • 957.1 Linear Search Algorithm | Linear Search in C | Data Structures Tutorials15m
    • 967.2 What is Binary Search | Binary Search Algorithm with example | Data Structures Tutorials24m
    • 97Introduction to Sorting Algorithms29m

  5. Day 19 · 1h 46m

    • 987.3 Bubble Sort Algorithm| Data Structures Tutorials36m
    • 997.4 Insertion Sort Algorithm |Explanation with C Program| Data Structure Tutorials28m
    • 1007.5 Selection Sort in Data Structure | Selection Sort Algorithm with C Program18m
    • 1017.6 Quick Sort in Data Structure | Sorting Algorithm | DSA Full Course25m

  6. Day 20 · 1h 56m

    • 1027.7 Merge Sort in Data Structure | Sorting Algorithms| DSA Full Course35m
    • 1037.8 Max Heap Insertion and Deletion | Heap Tree Insertion and Deletion with example| Data Structure34m
    • 1047.9 Heap Sort | Heapify Method | Build Max Heap Algorithm | Sorting Algorithms46m

  7. Day 21 · 1h 40m

    • 1067.11 Shell Sort | Sorting Algorithms | Full explanation with Code | DSA Course34m
    • 1077.12 Counting Sort (Analysis and Code) | Easiest Explanation | Data Structure Tutorials32m
    • 1087.13 Radix Sort - Easiest explanation with Code | Sorting Algorithms | Data Structures Tutorials34m
Week 4Videos 109–122 · 5h 27m

  1. Day 22 · 1h 59m

    • 1098.1 Hashing Techniques to Resolve Collision| Separate Chaining and Linear Probing | Data structure26m
    • 1108.2 Hashing - Quadratic Probing | Collision Resolution Technique | Data structures and algorithms16m
    • 1118.3 Double Hashing | Collision Resolution Technique | Data Structures and algorithms27m
    • 1129.1 Huffman Coding -Greedy Method |Data Structures Tutorials34m
    • 1139.2 Huffman Coding with Probabilities | UGC NET Previous Year Question15m
    • 114Complete DSA and Java Course for Placement | Early Bird Offer Inside #coding #java #dsa1m

  2. Day 23 · 1h 37m

    • 115Exclusive | Only 3 Days are left !!7m
    • 116Introduction to Dynamic Programming | Greedy vs DP29m
    • 117Dynamic Programming Introduction| Memoization | Tabulation | Space Optimization46m
    • 118Fibonacci Number | Recursion + Memoization | Tabulation | DP Series | LeetCode 50914m

  3. Day 24 · 1h 51m

    • 119LEETCODE 70 - Climbing Stairs | 4 Approaches | DP Series36m
    • 120LEETCODE 746 - Min Cost Climbing Stairs | Recursive| Memoization | Tabulation | Space Optimization56m
    • 121Recursion vs Dynamic Programming | DP Series #Lec612m
    • 122Types of Knapsack | Dynamic Programming | #76m

Tips for finishing

  • Use the chapter numbers in the video titles to schedule only the units on your syllabus.
  • One video is unavailable and one is a course announcement; tick the announcement off and the planner will skip both.

Frequently asked questions

How long does it take to finish Jenny's Lectures Data Structures and Algorithms?

The playlist has 121 videos and 43.6 hours of content. At 1 hour a day that's about 44 days at normal speed, or 30 days at 1.5x. At 2 hours a day it's about 22 days.

More study plans

See all 166 study plans

Tools for any playlist