Neso Academy Data Structures: study plan and how long it takes
The Neso Academy playlist is 144 videos and 18.9 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.
144 videos · 18.9 hours · Neso Academy
Neso Academy's Data Structures course starts with the C foundations it needs (pointers, void pointers and structures), then covers singly, doubly and circular linked lists with applications, and stacks with programs and GATE problems.
The free YouTube playlist stops after stacks: the last four entries (queues, binary trees, BSTs and AVL trees) are one-to-three-minute chapter previews for the rest of the course on nesoacademy.org.
Who it's for: Students preparing for university exams or GATE who want short, precise lectures.
How long does it take?
The full playlist is 18.9 hours across 144 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 | 38 days | 26 days | 19 days |
| 1 h a day | 19 days | 13 days | 10 days |
| 2 h a day | 10 days | 7 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 3 weeks in total. For a different pace, start date or speed, use the planner above.
Week 1Videos 1–70 · 6h 40m
Day 1 · 55m
- 1Introduction to Data Structures11m
- 2Data Types vs. Abstract Data Types8m
- 3Data Structure Definition & Advantages4m
- 4Types of Data Structures4m
- 5Basics of Asymptotic Analysis (Part 1)7m
- 6Basics of Asymptotic Analysis (Part 2)3m
- 7Basics of Asymptotic Analysis (Part 3)10m
- 8Basics of Asymptotic Analysis (Part 4)8m
Day 2 · 57m
- 9Basics of Asymptotic Analysis (Part 5)12m
- 10Guidelines for Asymptotic Analysis (Part 1)5m
- 11Guidelines for Asymptotic Analysis (Part 2)8m
- 12Asymptotic Analysis (Solved Problem 1)7m
- 13Asymptotic Analysis (Solved Problem 2)4m
- 14Asymptotic Analysis (Solved Problem 3)4m
- 15Understanding the Void Pointers4m
- 16Understanding the Null Pointers4m
- 17Understanding the Dangling Pointers5m
- 18Understanding the Wild Pointers2m
Day 3 · 1h
- 19Basics of Dynamic Memory Allocation4m
- 20Dynamic Memory Allocation using malloc()8m
- 21Dynamic Memory Allocation using calloc()2m
- 22Dynamic Memory Allocation using realloc()5m
- 23Releasing the Dynamically Allocated Memory using free()4m
- 24Structures and Functions (Part 1)7m
- 25Structures and Functions (Part 2)3m
- 26Structures and Functions (Part 3)3m
- 27Structures and Functions (Part 4)4m
- 28Structures and Functions (Part 5)8m
- 29Structures and Functions (Part 6)5m
- 30Self Referential Structures6m
Day 4 · 55m
- 31Introduction to Linked List6m
- 32Array vs. Single Linked List (In Terms of Representation)4m
- 33Creating the Node of a Single Linked List6m
- 34Creating a Single Linked List (Part 1)5m
- 35Creating a Single Linked List (Part 2)7m
- 36Traversing a Single Linked List (Counting the Nodes)6m
- 37Traversing a Single Linked List (Printing the Data)4m
- 38Traversing the List (Linked List vs. Arrays)4m
- 39Single Linked List (Inserting a Node at the End)6m
- 40Insertion at the End (Linked List vs. Array) - Part 18m
Day 5 · 58m
- 41Insertion at the End (Linked List vs. Array) - Part 28m
- 42Single Linked List (Inserting a Node at the Beginning)6m
- 43Inserting the Data at the Beginning of Single Linked Lists (Possible Mistake)6m
- 44Inserting the Data at the Beginning of Single Linked List (2nd Method)4m
- 45Inserting the Data at the Beginning (Singly Linked List vs. Array)7m
- 46Single Linked List (Inserting a Node at a Certain Position)7m
- 47Insertion at a Certain Position (Singly Linked List vs. Arrays) - Part 13m
- 48Insertion at a Certain Position (Singly Linked List vs. Arrays) - Part 28m
- 49Single Linked List (Deleting the First Node)4m
- 50Single Linked List (Deleting the Last Node)5m
Day 6 · 59m
- 51Single Linked List (Deleting the Last Node using Single Pointer)4m
- 52Deletion at the End (Singly Linked List vs. Array)4m
- 53Deletion at the Beginning (Single Linked List vs. Array)4m
- 54Single Linked List (Deleting the Node at a Particular Position)10m
- 55Deleting the Entire Single Linked List6m
- 56Reverse a Single Linked List12m
- 57Singly Linked List (Solved Problem 1)5m
- 58Singly Linked List (Solved Problem 2)7m
- 59Singly Linked List (Solved Problem 3)6m
Day 7 · 57m
- 60Singly Linked List (Solved Problem 4)8m
- 61Singly Linked List (Solved Problem 5)4m
- 62Singly Linked List (Solved Problem 6)7m
- 63Rapid Fire Quiz (Singly Linked List)5m
- 64Introduction to Doubly Linked List3m
- 65Doubly Linked List (Inserting a Node in an Empty List)3m
- 66Doubly Linked List (Insertion at the Beginning)4m
- 67Doubly Linked List (Insertion at the End)4m
- 68Doubly Linked List (Insertion between the Nodes) - Part 16m
- 69Doubly Linked List (Insertion between the Nodes) - Part 25m
- 70Creating an Entire Doubly Linked List7m
Week 2Videos 71–114 · 6h 9m
Day 8 · 57m
- 71Doubly Linked List (Deleting the First Node)4m
- 72Doubly Linked List (Deleting the Last Node)3m
- 73Doubly Linked List (Deleting the Intermediate Node)5m
- 74Reversing the Doubly Linked List8m
- 75Doubly Linked List (Solved Problem 1)4m
- 76Doubly Linked List (Solved Problem 2)4m
- 77Why Doubly Linked List?5m
- 78Rapid Fire Quiz (Doubly Linked List)5m
- 79Introduction to Circular Linked List4m
- 80Circular Singly Linked List (Insertion at the Beginning)5m
- 81Traversing a Circular Singly Linked List5m
- 82Circular Singly Linked List (Insertion at the End)3m
Day 9 · 58m
- 83Circular Singly Linked List (Insertion between the Nodes)7m
- 84Creating a Circular Singly Linked List6m
- 85Circular Singly Linked List (Deleting the First Node)4m
- 86Circular Singly Linked List (Deleting the Last Node)4m
- 87Circular Singly Linked List (Deleting the Intermediate Node)5m
- 88Circular Singly Linked List (Counting the Number of Elements)4m
- 89Circular Singly Linked List (Searching an Element)8m
- 90Circular Doubly Linked List (Insertion at the Beginning)6m
- 91Circular Doubly Linked List (Insertion at the End)5m
- 92Circular Doubly Linked List (Insertion between the Nodes)5m
- 93Circular Doubly Linked List (Deleting the First Node)4m
Day 10 · 49m
- 94Circular Doubly Linked List (Deleting the Last Node)4m
- 95Circular Doubly Linked List (Deleting the Intermediate Node)6m
- 96Sorted Singly Linked List (Inserting a New Element)12m
- 97Application of Linked List (Polynomial Arithmetic) - Part 14m
- 98Application of Linked List (Polynomial Arithmetic) - Part 223m
Day 11 · 44m
- 99Application of Linked List (Addition of Two Polynomials)17m
- 100Application of Linked List (Multiplication of Two Polynomials)14m
- 101Application of Linked List (Multiplication of Two Polynomials) - Improvements12m
Day 12 · 55m
- 102Adding Two Numbers using Linked Lists - Part 119m
- 103Adding Two Numbers using Linked Lists - Part 210m
- 104Adding Two Numbers using Linked Lists - Part 318m
- 105Introduction to Stacks9m
Day 13 · 53m
- 106Array Implementation of Stacks (Part 1)10m
- 107Array Implementation of Stacks (Part 2)11m
- 108Array Implementation of Stacks (Part 3)10m
- 109Array Implementation of Stacks (Part 4)16m
- 110Stacks (Important Questions) – Set 16m
Day 14 · 54m
- 111Stacks (Important Questions) – Set 213m
- 112Stacks (Program 1) – Part 116m
- 113Stacks (Program 1) – Part 210m
- 114Stacks (Program 1) – Part 314m
Week 3Videos 115–144 · 6h 5m
Day 15 · 55m
- 115Stacks (Program 2) – Part 110m
- 116Stacks (Program 2) – Part 212m
- 117Stacks (Program 3)13m
- 118Linked List Implementation of Stacks (Part 1)9m
- 119Linked List Implementation of Stacks (Part 2)12m
Day 16 · 53m
- 120Linked List Implementation of Stacks (Part 3)12m
- 121Stacks (Program 4) – Part 110m
- 122Stacks (Program 4) – Part 29m
- 123Stacks (Program 4) – Part 310m
- 124Stacks (Program 4) – Part 411m
Day 17 · 59m
- 125Stacks (Program 4) – Part 512m
- 126Stacks (Program 4) – Part 614m
- 127Stacks (Program 4) – Part 715m
- 128Stacks (Program 5)18m
Day 18 · 55m
- 129Application of Stacks (Nested Brackets) - Part 119m
- 130Application of Stacks (Nested Brackets) - Part 226m
- 131Application of Stacks (Infix to Postfix) - Part 111m
Day 19 · 44m
- 132Application of Stacks (Infix to Postfix) - Part 214m
- 133Application of Stacks (Infix to Postfix) - Part 310m
- 134Application of Stacks (Infix to Postfix) - Part 412m
- 135Application of Stacks (Infix to Postfix) - Part 59m
Day 20 · 47m
- 136Application of Stacks (Infix to Postfix) - Part 619m
- 137Application of Stacks (Infix to Postfix) - Part 728m
Day 21 · 53m
- 138Application of Stacks (Infix to Postfix) - Part 823m
- 139Stacks (GATE Problems) - Set 115m
- 140Stacks (GATE Problems) - Set 28m
- 141Queues | Chapter-7 | Data Structures | nesoacademy.org1m
- 142Binary Trees | Chapter-8 | Data Structures | nesoacademy.org3m
- 143Binary Search Trees | Chapter-9 | Data Structures | nesoacademy.org1m
- 144AVL Trees | Chapter-10 | Data Structures | nesoacademy.org1m
Tips for finishing
- Plan this as a course on linked lists and stacks. For queues, trees and graphs, follow up with Jenny's Lectures or William Fiset's data structures playlist.
- Tick off the four preview videos at the end in the playlist length calculator and the planner will leave them out.