CodeWithHarry Data Structures and Algorithms: study plan and how long it takes
The CodeWithHarry playlist is 92 videos and 31.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.
92 videos · 31.9 hours · CodeWithHarry
CodeWithHarry's DSA course in Hindi implements every data structure in C: arrays, linked lists (singly, doubly and circular), stacks with infix-to-postfix conversion, queues, sorting algorithms, binary trees, binary search trees, AVL trees and graphs up to Prim's algorithm.
Each concept usually has a theory video followed by a coding video, which makes it easy to schedule.
Who it's for: Beginners comfortable in C who want DSA explained in Hindi with full implementations.
How long does it take?
The full playlist is 31.9 hours across 92 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 | 64 days | 43 days | 32 days |
| 1 h a day | 32 days | 22 days | 16 days |
| 2 h a day | 16 days | 11 days | 8 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 6 weeks in total. For a different pace, start date or speed, use the planner above.
Week 1Videos 1–8 · 4h 28m
Day 1 · 32m
- 1Introduction to Data Structures & Algorithms32m
Day 2 · 33m
- 2Time Complexity and Big O Notation (with notes)33m
Day 3 · 34m
- 3Asymptotic Notations: Big O, Big Omega and Big Theta Explained (With Notes)34m
Day 4 · 40m
- 4Best Case, Worst Case and Average Case Analysis of an Algorithm (With Notes)40m
Day 5 · 46m
- 5How to Calculate Time Complexity of an Algorithm + Solved Questions (With Notes)46m
Day 6 · 47m
- 6Arrays and Abstract Data Type in Data Structure (With Notes)25m
- 7Array as An Abstract Data Type in Data Structures(With Notes)22m
Day 7 · 36m
- 8Implementing Array as an Abstract Data Type in C Language36m
Week 2Videos 9–24 · 5h 40m
Day 8 · 45m
- 9Operations on Arrays in Data Structures: Traversal, Insertion, Deletion and Searching29m
- 10Coding Insertion Operation in Array in Data Structures in C language17m
Day 9 · 53m
- 11Coding Deletion Operation in Array Using C Language (With Notes)18m
- 12Linear Vs Binary Search + Code in C Language (With Notes)35m
Day 10 · 49m
- 13Introduction to Linked List in Data Structures (With Notes)25m
- 14Linked List Data Structure: Creation and Traversal in C Language24m
Day 11 · 43m
- 15Insertion of a Node in a Linked List Data Structure19m
- 16Insertion in a Linked List in C Language24m
Day 12 · 58m
- 17Deletion in a Linked List | Deleting a node from Linked List Data Structure17m
- 18Delete a Node from Linked List (C Code For Deletion From Beginning, End, Specified Position & Key)24m
- 19Circular Linked List and Operations in Data Structures (With Notes)17m
Day 13 · 54m
- 20Circular Linked Lists: Operations in C Language21m
- 21Doubly Linked Lists Explained With Code in C Language13m
- 22Introduction to Stack in Data Structures20m
Day 14 · 38m
- 23Implementing Stack Using Array in Data Structures22m
- 24C Code For Implementing Stack Using Array in Data Structures16m
Week 3Videos 25–42 · 5h 58m
Day 15 · 50m
- 25Push, Pop and Other Operations in Stack Implemented Using an Array24m
- 26Coding Push(), Pop(), isEmpty() and isFull() Operations in Stack Using an Array| C Code For Stack26m
Day 16 · 46m
- 27Peek Operation in Stack Using Arrays (With C Code & Explanation)21m
- 28stackTop, stackBottom & Time Complexity of Operations in Stack Using Arrays13m
- 29How to Implement Stack Using Linked List?12m
Day 17 · 46m
- 30Implementing all the Stack Operations using Linked List (With Code in C)31m
- 31peek(), stackTop() and Other Operations on Stack Using Linked List (with C Code)15m
Day 18 · 1h
- 32Parenthesis Matching Problem Using Stack Data Structure (Applications of Stack)19m
- 33Parenthesis Checking Using Stack in C Language20m
- 34Multiple Parenthesis Matching Using Stack with C Code20m
Day 19 · 43m
- 35Infix, Prefix and Postfix Expressions27m
- 36Infix To Postfix Using Stack17m
Day 20 · 57m
- 37Coding Infix to Postfix in C using Stack28m
- 38Queue Data Structure in Hindi11m
- 39Queue Implementation: Array Implementation of Queue in Data Structure18m
Day 21 · 55m
- 40Array implementation of Queue and its Operations in Data Structure17m
- 41C Code For Queue and its Operations Using Arrays in Data Structure14m
- 42Introduction to Circular Queue in Data Structures24m
Week 4Videos 43–55 · 4h 40m
Day 22 · 36m
- 43enqueue(), dequeue() & other Operations on Circular Queue15m
- 44C Code For Circular Queue & Operations on Circular Queue in Hindi21m
Day 23 · 58m
- 45Queue Using Linked Lists27m
- 46Implementing Queue Using Linked List in C Language (With Code)16m
- 47Double-Ended Queue in Data Structure (DE-Queue Explained)🔥15m
Day 24 · 29m
- 48Introduction to Sorting Algorithms10m
- 49Criteria For Analysis of Sorting Algorithms19m
Day 25 · 55m
- 50Bubble Sort Algorithm in Hindi32m
- 51Bubble Sort Program in C23m
Day 26 · 32m
- 52Insertion Sort Algorithm in Hindi32m
Day 27 · 55m
- 53Insertion Sort in C Language (With Explanation)30m
- 54Selection Sort Algorithm25m
Day 28 · 15m
- 55Selection Sort Program in C15m
Week 5Videos 56–74 · 6h 2m
Day 29 · 52m
- 56QuickSort Algorithm in Hindi (With Code in C)52m
Day 30 · 56m
- 57Analysis of QuickSort Sorting Algorithm20m
- 58MergeSort Sorting Algorithm in Hindi36m
Day 31 · 50m
- 59MergeSort Source Code in C (Helpful Explanation)23m
- 60Count Sort Algorithm27m
Day 32 · 48m
- 61Introduction to Trees17m
- 62What is a Binary Tree?10m
- 63Types of Binary Trees20m
Day 33 · 51m
- 64Representation of a Binary Tree20m
- 65Linked Representation Of Binary Tree in C17m
- 66Traversal in Binary Tree (InOrder, PostOrder and PreOrder Traversals)13m
Day 34 · 50m
- 67Preorder Traversal in a Binary Tree (With C Code)11m
- 68PostOrder Traversal in a Binary Tree (With C Code)11m
- 69InOrder Traversal in a Binary Tree (With C Code)14m
- 70*Best* Trick To Find PreOrder, InOrder & PostOrder Traversal14m
Day 35 · 55m
- 71Binary Search Trees: Introduction & Properties14m
- 72Checking if a binary tree is a binary search tree or not!16m
- 73Searching in a Binary Search Trees (Search Operation)17m
- 74C Code For Searching in a BST8m
Week 6Videos 75–92 · 5h 5m
Day 36 · 48m
- 75Iterative Search in a Binary Search Tree7m
- 76Insertion in a Binary Search Tree18m
- 77Deletion in a Binary Search Tree23m
Day 37 · 52m
- 78C Code For Deletion in a Binary Search Tree23m
- 79AVL Trees - Introduction11m
- 80Insertion and Rotation in AVL Tree18m
Day 38 · 54m
- 81AVL Trees - LL LR RL and RR rotations23m
- 82C Code For AVL Tree Insertion & Rotation (LL, RR, LR & RL Rotation)31m
Day 39 · 49m
- 83Introduction to Graphs | Graph Data Structure18m
- 84Representation of Graphs - Adjacency List, Adjacency Matrix & Other Representations21m
- 85Graph traversal & Graph traversal algorithms10m
Day 40 · 48m
- 86Breadth First Search (BFS) Graph Traversal in Data Structures19m
- 87BFS Implementation in C | C Code For Breadth First Search12m
- 88Depth First Search (DFS) Graph Traversal in Data Structures11m
- 89DFS Implementation in C | C Code For Depth First Search6m
Day 41 · 53m
- 90Spanning Trees & maximum no of possible spanning trees for complete graphs18m
- 91Calculating Spanning tree Cost & Minimum Spanning Tree16m
- 92Prims Minimum Spanning Tree Algorithm (Step by Step with examples)20m
Tips for finishing
- Type out every implementation yourself; the value of this course is in writing the code, not watching it.
- Learn C first if you haven't. CodeWithHarry's C tutorials playlist is a natural lead-in.