Free Video Lectures for DSA Course in Software Development
The Ultimate DSA Course offers a comprehensive library of free video lectures covering everything from foundational concepts like time complexity and recursion to advanced topics such as dynamic programming, graph algorithms, and trie-based problems. Each lecture is designed to break down complex ideas into digestible lessons, making it easier for learners at all levels to follow along. Whether you're just starting with C++ or diving into AVL trees and heap sort, these videos provide structured, expert-led instruction. The course ensures you build a strong conceptual base before moving into problem-solving and coding practice.
Learn the basics
| C++ Tutorial for Beginners - Learn C++ in 1 Hour 82:56 min |  |
| Pointers in C / C++ [Full Course] 227:23 min | |
Time & Space Complexity
| Time Complexity #1 09:44 min | |
| Time Complexity Example #2 14:13 min | |
| Time Complexity of While and if #3 21:54 min | |
| Classes of functions 03:10 min | |
| Compare Class of Functions 05:11 min | |
| Asymptotic Notations Big Oh - Omega - Theta #1 15:46 min | |
| Asymptotic Notations - Big Oh - Omega - Theta #2 10:07 min | |
| Properties of Asymptotic Notations 11:58 min | |
| Comparison of Functions #1 09:28 min | |
| Comparison of Functions #2 10:26 min | |
| Best Worst and Average Case Analysis 18:56 min | |
| Recurrence Relation (T(n)= T(n-1) + 1) #1 13:43 min | |
| Recurrence Relation (T(n)= T(n-1) + n) #2 16:00 min | |
| Recurrence Relation (T(n)= T(n-1) + log n) #3 12:25 min | |
| Recurrence Relation T(n)=2 T(n-1)+1 #4 10:42 min | |
| Masters Theorem Decreasing Function 08:10 min | |
| Recurrence Relation Dividing Function T(n)=T(n/2)+1 #1 08:41 min | |
| Recurrence Relation Dividing [ T(n)=T(n/2)+ n] #2 07:26 min | |
| Recurrence Relation [ T(n)= 2T(n/2) +n] #3 11:20 min | |
| Masters Theorem in Algorithms for Dividing Function #1 16:50 min | |
| Examples for Master Theorem #2 05:41 min | |
| Root function (Recurrence Relation) 05:37 min | |
Solve Problems on Arrays
| Arrays in Data Structure | Declaration, Initialization, Memory representation 22:38 min | |
| Array Operations - Traversal, Insertion | Explanation with C Program | DSA Course 28:51 min | |
| Array Operations | Deletion from Array | Explanation with Code | Data Structure 14:59 min | |
| Pointers and Arrays | Data structure Tutorials 25:05 min | |
| Introduction to Two Dimensional (2D) Arrays | Implementation of 2D Arrays | Memory representation 37:44 min | |
| Pointers and 2-D Arrays | Two dimensional Array | Data Structures & Algorithm Tutorials 24:49 min | |
Topic-wise Video Lessons on Algorithms and Data Structures
One of the biggest advantages of this course is its topic-wise organization of video content, allowing learners to focus on specific areas such as sorting algorithms, linked lists, binary trees, or shortest path algorithms. This structure is especially helpful for those preparing for software development roles, since technical interviews often test discrete topics like backtracking, greedy methods, or hashing. Each video is paired with code walkthroughs in languages like C and C++, reinforcing theoretical knowledge with practical implementation. You can easily revisit individual topics - say, Dijkstra's algorithm or merge sort - without rewatching unrelated content.
- Sorting algorithms: Bubble, Merge, Quick, Heap, Radix, and more
- Tree structures: BST, AVL, Red-Black, Splay, B-Trees, and B+ Trees
- Graph traversals: BFS, DFS, topological sort, and cycle detection
- Dynamic programming series covering knapsack, edit distance, and grid problems
Learn Important Sorting Techniques
| Linear Search Algorithm | Linear Search in C | Data Structures Tutorials 15:09 min | |
| Bubble Sort Algorithm | Data Structures Tutorials 35:36 min | |
| Insertion Sort Algorithm | Explanation with C Program | Data Structure Tutorials 28:13 min | |
| Selection Sort in Data Structure | Selection Sort Algorithm with C Program 17:49 min | |
| Quick Sort in Data Structure | Sorting Algorithm | DSA Full Course 24:43 min | |
| Merge Sort in Data Structure | Sorting Algorithms | DSA Full Course 35:28 min | |
| Max Heap Insertion and Deletion | Heap Tree Insertion and Deletion with example | Data Structure 34:28 min | |
| Heap Sort | Heapify Method | Build Max Heap Algorithm | Sorting Algorithms 46:03 min | |
| Radix Sort/Bucket Sort in Data Structure | Sorting Algorithm 11:51 min | |
| Shell Sort | Sorting Algorithms | Full explanation with Code | DSA Course 34:07 min | |
| Counting Sort (Analysis and Code) | Easiest Explanation | Data Structure Tutorials 31:40 min | |
| Radix Sort - Easiest explanation with Code | Sorting Algorithms | Data Structures Tutorials 34:13 min | |
Binary Search [1D, 2D Arrays, Search Space]
| What is Binary Search | Binary Search Algorithm with example | Data Structures Tutorials 23:30 min | |
| Binary Search Algorithm - Theory + Code 58:16 min | |
| Binary Search Interview Questions - Google, Facebook, Amazon 241:46 min | |
Recursion [PatternWise]
| What is RECURSION? | DSA series | Codes provided in all the 3 languages. 10:40 min | |
| How does recursion work? | Recursion stack | DSA series | Codes in the description 13:57 min | |
| What is a recursion tree? | The time and space complexity of a recursive function | DSA series 20:38 min | |
| Find Nth power of a number using recursion | DSA series | Code available in description 12:55 min | |
| Using recursion, check whether a string is a palindrome or not | DSA series 13:16 min | |
| General steps to solve any recursion problem | Reverse an array using recursion | DSA series 09:50 min | |
| Find all the possible subsets of an array | Power set | Recursion | DSA series 20:24 min | |
| Find all the permutations of an array | Recursion | DSA series | Codes in description. 17:43 min | |
| Find all the UNIQUE permutations of an array | Recursion | DSA series | Codes in description. 08:20 min | |
| Subset II problem | Find all UNIQUE subsets of an array with duplicate elements | Recursion 16:15 min | |
| Combinations | Find all possible combinations of k numbers out of the range 1 to N | Recursion 25:23 min | |
| Combination Sum 1 | Recursion | DSA Series | Codes available in description 25:30 min | |
| Combination Sum 2 | Recursion | DSA Series | Codes available in description 13:45 min | |
| Combination Sum 3 | Medium level Recursion Problem | DSA | Codes available in description 22:04 min | |
| Letter Combinations of a Phone Number | DSA | Codes available in description 23:12 min | |
| Partition to K equal sum subsets | DSA | Codes available in description 28:30 min | |
| Maximum Length of a Concatenated String with Unique Characters | Codes available in description 21:10 min | |
| Flood fill algorithm | Recursion | DSA series by Fraz | Codes available 19:37 min | |
| Word search #1 | Recursion | DSA series by Fraz | Notes available in description 13:47 min | |
| Rat in a Maze | Recursion | DSA series by Fraz | Notes available in description 22:39 min | |
| N Queen | Recursion | DSA series by Fraz | Notes available in description 48:49 min | |
Important DSA Video Lectures for Coding Interview Preparation
For anyone targeting software engineering roles at top tech companies, this course includes video lectures specifically aligned with the kinds of problems asked in coding interviews at companies like Google, Facebook, and Amazon. Topics like binary search interview questions, recursion-based problems, and heap applications are covered with a strong focus on problem-solving strategy. The lectures on OOP principles - inheritance, polymorphism, encapsulation, and abstraction - also prepare learners for system design and object-oriented programming rounds. These videos go beyond theory to teach you how to think algorithmically under interview conditions.
Strings
| Introduction to Strings: 4-Hour Complete Video | DSA Series for Beginners 266:35 min | |
| String Full Course for technical interviews 202:55 min | |
| Largest Odd Number in String | Strings - Easy | #LearnDSA | Leetcode 1903 09:23 min | |
| Valid Anagram | Strings - Easy | #LearnDSA | Leetcode 242 06:15 min | |
| Isomorphic Strings | Strings - Easy | #LearnDSA | Leetcode 205 15:13 min | |
| Consecutive Characters | Strings - Easy | Leetcode 1446 10:30 min | |
| Word Pattern | Strings - Easy | Leetcode 290 | Hashmap 13:36 min | |
| Maximum Nesting Depth of the Parentheses | Strings - Easy | #LearnDSA | Leetcode 1614 05:35 min | |
| Sum of Beauty of All Substrings | Strings - Medium | Leetcode 1781 | Learn DSA 16:11 min | |
| Longest Palindromic Substring | Leetcode 5 | Strings | Odd and even length approach 16:27 min | |
| Longest Palindromic Substring | Code explanation | Leetcode 5 02:33 min | |
| String to Integer atoi | Leetcode 8 | String 16:59 min | |
Learn LinkedList [Single LL, Doubly LL]
| Linked List Tutorial - Singly + Doubly + Circular (Theory + Code + Implementation) 115:57 min | |
| Introduction to Linked List | Need of Linked List | DSA Tutorials 22:11 min | |
| Types of Linked List in Data Structures | DSA Full Course 13:15 min | |
| Arrays vs Linked List | Data structures 21:20 min | |
| Linked List Implementation in C/C++ | Creation and Display | DSA Tutorials 29:01 min | |
| Insertion of a Node in Linked List(at Beginning,End,Specified Position)with Code | DSA Tutorials 27:07 min | |
| Deletion of a node from Linked List (from beginning, end, specified position) | DSA Tutorials 25:54 min | |
| Find length of Linked List- Iterative approach | DSA Tutorials 05:56 min | |
| Reverse a Linked List - Iterative Method | Data Structure Tutorials 18:44 min | |
| Introduction to Doubly Linked List in Data structures | DSA Tutorials 08:54 min | |
| Implementation of Doubly Linked List - Data Structures 21:14 min | |
| Insertion in Doubly Linked List(beginning, end, specific position) | Data Structures 35:15 min | |
| Deletion from Doubly Linked List (beginning,end,specific position) | Data Structures Tutorials 22:05 min | |
| Reverse a Doubly Linked List | Data Structures & Algorithm Tutorials 19:34 min | |
| Circular Linked List in Data Structure | Creation and Display | DSA Course 21:30 min | |
| Implementation of Circular linked list in C | Data Structure Tutorials 27:49 min | |
| Insertion in Circular Linked List | Data Structure Tutorials 19:45 min | |
| Deletion of a Node from Circular Linked List(beginning, end, given position) | DSA Tutorials 23:58 min | |
| Reverse a Circular Linked List | Data Structure Tutorials 17:32 min | |
| Implementation of Doubly Circular Linked List| Creation and Display | Data Structures 20:27 min | |
| Insertion in Doubly Circular Linked List | Data Structure & Algorithm Tutorials 25:49 min | |
| Deletion from Doubly Circular Linked List | Data Structure & Algorithm Course 21:17 min | |
Stack and Queues [Learning, Pre-In-Post-fix, Monotonic Stack, Implementation]
| Stack in Data Structure | Introduction to Stack | Data Structures Tutorials 17:40 min | |
| Implementation of Stack using Array | Data Structure and Algorithm Tutorials 17:27 min | |
| Stack implementation using Linked List | Data Structures and Algorithm Tutorials 27:01 min | |
| Infix Prefix and Postfix expressions | Data Structures Tutorials 14:14 min | |
| Infix to Postfix Conversion Rules using Stack | Data structures Tutorials 12:33 min | |
| Infix to Postfix using Stack | Data Structure and Algorithm 20:10 min | |
| Infix to Postfix conversion using Stack | Data structures and algorithms 15:57 min | |
| Infix to Prefix using Stack | Data Structures Tutorials 24:05 min | |
| Evaluation of Prefix and Postfix expressions using Stack | Data Structures 21:03 min | |
| Postfix Expression Evaluation using Stack | Data Structures and Algorithms 11:02 min | |
| Prefix to Infix Conversion | Postfix to Infix Conversion | Data structure Tutorials 10:27 min | |
| Expression Trees | Binary Expression Tree | Data Structures Tutorials 13:17 min | |
| Expression Tree from Postfix | Data Structures Tutorials 10:05 min | |
| Queue in Data Structure | Introduction to Queue | Data Structures Tutorials 20:19 min | |
| Implementation of Queue using Arrays | Data Structures & Algorithm Tutorials 23:06 min | |
| Queue Implementation using Linked List in C | Data Structure Tutorials 19:47 min | |
| Circular Queue in Data Structure | Circular Queue using Arrays in C | DSA Tutorials 24:19 min | |
| Circular Queue in Data Structure | Circular Queue using Linked List | DSA Tutorials 28:56 min | |
| Implement Queue using Stack in C| Data Structures Tutorials 29:06 min | |
| DEQUE in Data Structure | Introduction to DEQue - Double Ended Queue 12:45 min | |
| Implementation of DEQUE using Circular Array | Data Structures Tutorials 36:37 min | |
Crash Course Videos on Recursion and Advanced Problem Solving
The recursion module in this course acts as a focused crash course, guiding learners through foundational concepts like the recursion stack and recursion tree before advancing to complex applications like N-Queens, Rat in a Maze, and flood fill. These quick yet thorough video lessons are invaluable for developers who need to sharpen their problem-solving skills in a short time. The series also covers permutation and combination problems, power sets, and letter combinations - all common in competitive programming and technical interviews. Watching these lectures in sequence gives you a systematic framework for approaching any recursive problem confidently.
Binary Trees
| Tree in Data Structure | Introduction to Trees | Data Structures Tutorials 29:17 min | |
| Binary Tree in Data Structure| Types of Binary Tree| Data Structures Tutorials 24:11 min | |
| Binary Tree Implementation in C Program | Data Structures Tutorials 24:37 min | |
| Binary Tree Representation |Array representation of Binary Tree | Data Structure 17:50 min | |
| Binary Tree Traversals (Inorder, Preorder and Postorder) | Data structures and algorithms 11:07 min | |
| Binary Tree traversal | Preorder, Inorder, Postorder | Data Structures Tutorials 20:13 min | |
| Construct Binary Tree from Preorder and Inorder Traversal | Example | Data Structures Tutorials 09:45 min | |
| Construct Binary Tree from Postorder and Inorder with example | Data structures Course 07:34 min | |
| Construct Binary Tree from Preorder and Postorder traversal | Data Structure Tutorials 19:00 min | |
Binary Search Trees
| Binary Search Trees (BST) - Insertion and Deletion | DSA Full Course 16:41 min | |
| Construct Binary Search Tree(BST) from Preorder example |Data Structures & Algorithm 08:58 min | |
| Construct Binary Search Tree(BST) from Postorder Traversal | Data structures 11:27 min | |
| AVL Tree - Insertion, Rotations(LL, RR, LR, RL) with Example | Data Structure Tutorials 24:30 min | |
| AVL Tree Insertion | with Solved Example | Data Structures & Algorithm Tutorials 26:25 min | |
| AVL Tree Deletion in Data structures | with Example | DSA Tutorials 15:02 min | |
| Red Black tree | Introduction to Red Black trees | DSA Tutorials 33:00 min | |
| Red Black Tree Insertion | Insertion Algorithm | Data Structure Tutorials 27:41 min | |
| Red Black Tree Deletion | DSA Tutorials for Beginners 63:05 min | |
| Splay Tree Introduction | Data structure & Algorithm 28:32 min | |
| Splay Tree Insertion | Data structure 34:26 min | |
| Splay Trees Deletion | Bottom-up Splaying | Data Structure & Algorithm 13:24 min | |
| Splay Tree Deletion | Top Down Splaying | Data Structure & Algorithm 20:44 min | |
| Introduction to B-Trees | Data Structures & Algorithm Tutorials 09:43 min | |
| Insertion in B-tree of Order 3 | B-Tree Example | Data structures and algorithms 09:51 min | |
| Insertion in B-Tree of Order 5 | Data structures and algorithms Tutorials 15:57 min | |
| Insertion in B-Tree of Order 5 with Given Alphabets | Data structures and algorithms 17:40 min | |
| Insertion in B-Tree of Order 4 (Data Structure) 15:23 min | |
| B-Tree Deletion in Data Structures | DSA Tutorials 28:04 min | |
| B+ Tree Insertion | B+ Tree Creation example | Data Structure Tutorials 18:37 min | |
| B+ Tree Deletion| with example |Data structure & Algorithm Tutorials 16:16 min | |
| B+ Tree Insertion | Create B+ Tree of Order 5 | Data Structures Tutorials 11:56 min | |
Heaps
| Priority Queue In Data Structure | Priority Queue Explained | Data Structures Tutorial 53:43 min | |
| Concepts of Heap | Understanding heap 12:32 min | |
| Representation of Heap | Important Concepts 13:09 min | |
| Heapify Algorithm | Max Heapify | Min Heapify 16:29 min | |
| Build Heap Algorithm | Proof of O(N) Time Complexity 15:32 min | |
| Heap Algorithms | Extract Max | Increase Key | Decrease Key | Insert Element 20:09 min | |
| Heapsort Algorithm | CODE Implementation 15:35 min | |
| Heap Implementation | Push | Pop | CODE 19:49 min | |
| Last stone weight | Leetcode #1046 09:11 min | |
| Kth largest element in an array | Kth smallest element in an array 07:51 min | |
| Top K Frequent Elements | Leetcode #347 | Heap | Hashmap 18:25 min | |
| Sort K sorted array | Sort nearly sorted array 21:24 min | |
| Sliding Window Maximum | Leetcode #239 25:38 min | |
| Merge K sorted lists | Leetcode #23 22:21 min | |
| Find Median from Data Stream 29:28 min | |
Hashing (HashMap & Set)
| Hashing Techniques to Resolve Collision| Separate Chaining and Linear Probing | Data structure 25:51 min | |
| Hashing - Quadratic Probing | Collision Resolution Technique | Data structures and algorithms 15:58 min | |
| Double Hashing | Collision Resolution Technique | Data Structures and algorithms 26:52 min | |
| HashMaps & Dictionaries, Explained Simply 22:44 min | |
| Introduction to HashMap & HashTable 99:46 min | |
Graphs
| Graph Representation in Data Structure(Graph Theory)|Adjacency Matrix and Adjacency List 12:12 min | |
| BFS and DFS Graph Traversals| Breadth First Search and Depth First Search | Data structures 20:27 min | |
| Types of Edges in DFS | Edge Classification | Data Structures and Algorithms 25:53 min | |
| Minimum Spanning Tree | Properties of MST | Data Structures Tutorials 15:58 min | |
| Prim's Algorithm for Minimum Spanning Tree | Data Structures Tutorials 10:22 min | |
| Kruskals Algorithm for Minimum Spanning Tree- Greedy method | Data structures 09:11 min | |
| Minimum spanning Tree(MST) | UGC NET(Computer Science) Practice Question with Solution 07:33 min | |
| Cycle detection in Directed Graph |Data Structures and Algorithms Tutorials 10:36 min | |
| Detect Cycle in Undirected Graph | Data Structures and Algorithms 06:35 min | |
| Topological Sorting (with Examples) | How to find all Topological Orderings of a Graph 14:18 min | |
| Connected Components |How to find Connected Components in Graph | Graph Theory 20:37 min | |
| Bridges(Cut Edge) in a Graph | Find All Bridges in a Graph | Graph Theory 20:54 min | |
| Dijkstra Algorithm | Single Source Shortest Path| Greedy Method 34:36 min | |
| Bellman Ford Algorithm-Single Source Shortest Path | Dynamic Programming 15:43 min | |
| Floyd Warshall Algorithm All Pair Shortest Path algorithm | Data Structures and Algorithms 31:23 min | |
Greedy Algorithms
| Greedy Algorithms for Competitive Programming | Beginner to Advanced Course 45:15 min | |
| Increasing Array (CSES) | Greedy + Proof with Invariants 13:13 min | |
| Ferris Wheel (CSES) | Greedy Algorithms Explained with Invariants & Monovariants 14:19 min | |
| Greedy Algorithms Explained with Invariants & Monovariants 19:46 min | |
| Greedy Algorithm Explained with Full Code | Competitive Programming 12:18 min | |
| LeetCode 334 | Increasing Triplet Subsequence | O(N) Greedy Solution Explained | Coding Interview 16:12 min | |
| CSES Movie Festival | Greedy Algorithm Explained | Maximum Non-Overlapping Intervals 10:05 min | |
| CSES Two Sets | Greedy + Pattern Based Approach | Equal Sum Partition Problem Explained 17:38 min | |
| CSES Stick Lengths | Greedy Algorithm & Median Trick Explained | Minimum Cost Problem Solution 10:34 min | |
| CSES Towers Problem | Greedy + Binary Search | Competitive Programming 12:35 min | |
| CSES Maximum Subarray Sum | Kadane’s Algorithm Explained | Greedy Algorithms in C++ 11:25 min | |
| Codeforces 1400 | USB vs PS/2 | Greedy Algorithm Explained 14:43 min | |
| Codeforces 1500 | The Party and Sweets | Greedy Algorithm C++ Solution Explained 25:41 min | |
| Codeforces 1500 | Did We Get Everything Covered? | Greedy Algorithm Explained 20:53 min | |
| Codeforces 1400 | Grouping Increases | Greedy Algorithm Explained 12:28 min | |
| Codeforces 1400 | Matching Arrays | Greedy Algorithm Explained 18:17 min | |
| Codeforces 1600 | Least Prefix Sum | Greedy Algorithm with Priority Queues 17:59 min | |
| Codeforces 2000 | Money Buys Less Happiness Now | Greedy Algorithm 19:18 min | |
| CSES Missing Coin Sum | Greedy Algorithm Explained Step by Step 13:53 min | |
Dynamic Programming
| DP-1 Introduction to Dynamic Programming | Develop the DP Mindset | Competitive Programming | DSA 38:18 min | |
| DP-2 Dice Combinations | Problem Solving | Competitive Programming | DSA | CSES 12:29 min | |
| DP-3 Minimizing Coins | Problem Solving | Competitive Programming | DSA | CSES 14:14 min | |
| DP-4 Coin Combinations 1 | DP Problem Solving | Competitive Programming | DSA | CSES 08:58 min | |
| DP-5 Coin Combinations 2 | Problem Solving | Competitive Programming | DSA | CSES 19:43 min | |
| DP-6 Space Optimization in Dynamic Programming | Competitive Programming | DSA 15:15 min | |
| DP-7 Removing Digits | Problem Solving | Competitive Programming | DSA | CSES 09:16 min | |
| DP-8 Grid Problems in Dynamic Programming | Competitive Programming | DSA 39:51 min | |
| DP-9 Book Shop | Knapsack | Problem Solving | Competitive Programming | DSA | CSES 21:27 min | |
| DP-10 Array Description | Problem Solving | Competitive Programming | DSA | CSES 20:06 min | |
| DP-11 Counting Towers | Problem Solving | Competitive Programming | DSA | CSES 31:06 min | |
| DP-12 Edit Distance | Problem Solving | Competitive Programming | DSA | CSES 21:37 min | |
| DP-13 Rectangle Cutting | Problem Solving | Competitive Programming | DSA | CSES 20:53 min | |
Backtracking
| Introduction to Backtracking - Brute Force Approach 08:15 min | |
| N Queens Problem using Backtracking 13:41 min | |
| Sum Of Subsets Problem - Backtracking 12:19 min | |
| Graph Coloring Problem - Backtracking 15:52 min | |
| Hamiltonian Cycle - Backtracking 18:35 min | |
Tries
| Trie insertion and search 13:21 min | |
| Trie deletion and search 13:21 min | |
| Count number of strings with given prefix 08:48 min | |
| Auto complete feature using trie 12:59 min | |
| Add and search word | Data structure design | Trie + Backtracking 18:51 min | |
| Longest Duplicate Substring | TRIE | Rolling Hash | Binary Search | Leetcode #1044 29:42 min | |
| Max XOR of 2 numbers in an array | Leetcode #421 20:23 min | |
OOPs
| OOP 1 | Introduction & Concepts - Classes, Objects, Constructors, Keywords 102:27 min | |
| OOP 2 | Packages, Static, Singleton Class, In-built Methods 79:13 min | |
| OOP 3 | Principles - Inheritance, Polymorphism, Encapsulation, Abstraction 132:51 min | |
| OOP 4 | Access Control, In-built Packages, Object Class 50:45 min | |
| OOP 5 | Abstract Classes, Interfaces, Annotations 70:42 min | |
| OOP 6 | Generics, Custom ArrayList, Lambda Expressions, Exception Handling, Object Cloning 91:53 min | |
| OOP 7 | Collections Framework, Vector Class, Enums in Java 26:40 min | |
