Complete C++ DSA Course | Data Structures & Algorithms Playlist
5.0
(4)
28 learners
What you'll learn
This course includes
- 63.5 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 132 lessons • 63.5 hours of video
Complete C++ DSA Course | Data Structures & Algorithms Playlist
132 lessons
• 63.5 hours
Complete C++ DSA Course | Data Structures & Algorithms Playlist
132 lessons
• 63.5 hours
- Lecture 1 : Flowchart & Pseudocode + Installation | DSA Series by Shradha Khapra Ma'am | C++01:25:52
- Lecture 2 : Variable, Data Types & Operators | DSA Series by Shradha Ma'am | C++01:16:44
- Lecture 3: Conditional Statements & Loops | DSA Series by Shradha Ma'am | C++01:34:39
- Lecture 4: Patterns | DSA Series by Shradha Khapra Ma'am | C++01:31:07
- Lecture 5: Functions | DSA Series by Shradha Khapra Ma'am | C++49:13
- Binary Number System | DSA Series by Shradha Khapra Ma'am | C++37:20
- Bitwise Operators, Data Type Modifiers & more | DSA Series by Shradha Khapra Ma'am | C++38:33
- Array Data Structure - Part1 | DSA Series by Shradha Khapra Ma'am | C++54:07
- Vectors in C++ | Arrays Part 2 | DSA Series by Shradha Ma'am | Lecture 940:06
- Kadane's Algorithm | Maximum Subarray Sum | DSA Series by Shradha Ma'am23:29
- Majority Element | Brute- Better-Best Approach | Moore's Voting Algorithm | & Pair Sum39:10
- Time & Space Complexity - DSA Series by Shradha Ma'am01:25:41
- Buy and Sell Stock Problem and Pow(X,N) Power exponential Problem - Leetcode | DSA Series29:10
- Container with Most Water Problem | Brute & Optimal Solution | Two Pointer Approach - Leetcode 1132:00
- Product of Array Except Self | Brute to Optimal Solution | Leetcode 23829:30
- Pointers in C++ | In Detail | DSA Series by Shradha Ma'am46:08
- Binary Search Algorithm - Iterative and Recursive Method | [Theory + Code] with Example44:16
- Search in Rotated Sorted Array | Binary Search | Leetcode 3319:30
- Peak Index in Mountain Array | Binary Search | Leetcode 85223:34
- Single Element in Sorted Array | Binary Search | DSA Series Lecture 2027:33
- Book Allocation or Allocate Books Problem | DSA Series - Binary Search32:59
- Painter's Partition Problem | DSA Placement Series - Binary Search | Lecture 2227:44
- Aggressive Cows Problem | DSA Placement Series - Binary Search | Lecture 2330:12
- Sorting Algorithms | Bubble Sort, Selection Sort & Insertion Sort | DSA Series by Shradha Ma'am34:33
- Sort an Array of 0s, 1s & 2s | DNF Sorting Algorithm | Leetcode 7533:39
- Merge Sorted Arrays Problem and Next Permutation Problem | DSA Series43:49
- C++ STL Complete Tutorial | Standard Template Library - One Shot01:27:20
- How to setup C++ compiler on Mac ? | Software Installation for Mac users01:40
- Strings & Character Arrays in C++ - Part 1 | DSA Placement Series30:03
- Valid Palindrome & Remove all Occurrences | Strings Part 2 | DSA Placement Series24:02
- Strings - Part 3 | Permutation in String | DSA Placement Series21:41
- Strings - Part 4 | Reverse Words in String | DSA Placement Series14:42
- String Compression problem - Lecture 32 | Leetcode 44319:29
- Maths for DSA - One Shot | Euclid's Algorithm | Sieve of Eratosthenes | Modular Arithmetics55:48
- 2D Arrays in C++ | Part 1 | DSA Series by Shradha Ma'am37:31
- Search a 2D Matrix - Variation I & II | 2D Arrays - Part 2 | DSA Series by Shradha Ma'am37:43
- Spiral Matrix | 2D Arrays - Part 3 | Leetcode 54 | DSA Series by Shradha Ma'am24:33
- Two Sum | Find Duplicate | Find Repeating & Missing Values | Hashing Problems53:30
- 3 Sum | Brute, Better & Optimized Approach with Codes | Leetcode 1543:43
- 4 Sum Problem | Optimal Approach | DSA Series by Shradha Ma'am23:02
- Subarray Sum Equals K | Brute-Better-Optimal approach34:45
- Recursion Tutorial - Basics to Advanced | Part 146:22
- Recursion Part 2 : Fibonacci numbers problem, Binary search problem, Find if array sorted problem41:30
- Recursion Part 3 : Backtracking in Detail | Print all Subsets | Subsets II42:20
- Permutations of an Array/String | Recursion & Backtracking22:55
- N-Queens Problem | using Backtracking | Leetcode Hard24:26
- Sudoku Solver Problem | using Backtracking | Leetcode Hard26:58
- Rat in a Maze Problem | Backtracking32:45
- Combination Sum Problem | Recursion & Backtracking23:35
- Palindrome Partitioning Problem | Recursion & Backtracking20:44
- Merge Sort Algorithm | Recursion & Backtracking32:04
- One Major update & reaching 1000M views03:50
- Quick Sort Algorithm - Lecture 51 of Complete DSA Placement Series26:23
- Count Inversions Problem | Brute and Optimal24:33
- KNIGHTS TOUR Problem - Backtracking | Leetcode 259622:32
- OOPs Tutorial in One Shot | Object Oriented Programming | in C++ Language | for Placement Interviews02:04:23
- Introduction to Linked List | Data Structures & Algorithms50:43
- Reverse a Linked List | DSA Series by @shradhaKD10:29
- Middle of a Linked List | DSA Series by @shradhaKD10:32
- Detect & Remove Cycle in Linked List | DSA Series by @shradhaKD30:24
- Merge Two Sorted Lists | DSA Series by @shradhaKD12:41
- Copy List with Random Pointer | DSA Series by @shradhaKD20:52
- Doubly Linked List Tutorial32:16
- Circular Linked List in Data Structures33:56
- Flatten a Doubly Linked List | Leetcode 430 | DSA Series by @shradhaKD24:47
- Reverse Nodes in K-Group | Linked List20:39
- Swap Nodes in Pairs | Linked List20:06
- Introduction to STACKS | Data Structures & Algorithms | Lecture 6622:11
- Valid Parentheses | Stack | Lecture 6716:25
- Stock Span Problem | Optimal Solution26:29
- Next Greater Element | Optimal Solution & Code23:32
- Previous Smaller Element | Optimal Solution & Code09:24
- Design a Min Stack | Optimal Solution & Code24:34
- Largest Rectangle in Histogram | Best Solution & Code32:56
- L73. Next Greater Element - II | Stack & Queue20:04
- L74. Trapping Rainwater Problem | Optimal Solution & Code30:50
- L75. The Celebrity Problem | Stack & Queue15:11
- L76. Implement LRU Cache | Linked List35:34
- New Chapter : Queue Data Structure18:55
- L78. Circular Queue in Data Strucuture18:37
- L79. Implement Queue using Stack & Stack using Queue15:47
- L80. First Unique Character in String | Easy - Leetcode38713:23
- L81. Sliding Window Maximum | Queue31:22
- L82. Gas Station | Greedy Approach | Leetcode 13422:16
- Binary Trees in Data Structures | Tree Traversal | DSA Placement Series01:14:15
- L.84 Height of a Binary Tree | Count of Nodes in a Binary Tree23:09
- L.85 Identical Tree (same tree) | Subtree of another Tree23:28
- L.86 Diameter of Binary Tree19:29
- Top View of a Binary Tree | DSA Series : L.8719:39
- Kth Level of a Binary Tree | DSA Series : L.8807:59
- Lowest Common Ancestor in Binary Tree | DSA Series : L.8918:20
- Build Tree from Preorder & Inorder | DSA Series : L.9020:59
- Transform to Sum Tree | DSA Series : L.9108:41
- Binary Tree Paths | DSA Series : L.9210:01
- Maximum Width of Binary Tree | DSA Series : L.9321:09
- Morris Inorder Traversal | DSA Series : L.9417:52
- Flatten Binary Tree to Linked List | DSA Series : L.9515:43
- Binary Search Trees (BSTs) | DSA Series : L.9643:16
- Sorted Array to Balanced BST | DSA Series : L.9708:44
- Validate Binary Search Tree | DSA Series : L.9812:41
- Min Distance between BST Nodes | DSA Series : L.9914:16
- Kth Smallest in BST | DSA Series : L.10012:42
- Lowest Common Ancestor in BST | DSA Series : L.10112:29
- Construct BST from Preorder | DSA Series : L.10219:10
- Merge Two Binary Search Trees | DSA Series : L.10316:39
- Recover BST | DSA Series : L.10424:03
- Largest BST in Binary Tree | DSA Series : L.10524:56
- Populate Next Right Pointers in Each Node | DSA Series : L.10611:12
- BST Iterator | DSA Series : L.10717:16
- Inorder Predecessor & Successor in BST | DSA Series : L.10819:50
- Introduction to Graphs | Data Structure & Algorithms26:08
- BFS Traversal in Graphs | Data Structure & Algorithms18:31
- DFS Traversal in Graphs | Data Structure & Algorithms14:03
- Detect a Cycle in Undirected Graph using DFS | Data Structure & Algorithms19:45
- Detect a Cycle in Undirected Graph using BFS | Data Structure & Algorithms18:23
- Number of Islands | Connected Components in Matrix | Leetcode 20017:05
- Rotting Oranges | Multi-source BFS | Leetcode 99426:22
- Detect a Cycle in Directed Graph using DFS | Lecture 11615:59
- Topological Sorting in Graph | using DFS | Lecture 11715:58
- Course Schedule Problem | using Graph & Topological Sort17:54
- Course Schedule II Problem | using Graph & Topological Sort19:33
- Flood Fill Algorithm | Graph Problem15:10
- Topological Sorting using Kahn's Algorithm | Graph - DSA Lecture 12118:47
- Dijkstra's Algorithm - Single Source Shortest Path - Greedy Method35:20
- Bellman Ford Algorithm - Single Source Shortest Path - Dynamic Programming23:38
- DSA Series Quick Update - 125 lectures | New DSA Sheet | DP, Heaps, Tries etc06:24
- Prim's Algorithm - Minimum Spanning Tree in Graph26:07
- Disjoint Set Union | With Rank/Size & Path Compression | Union Find34:04
- Kruskal's Algorithm - Minimum Spanning Tree in Graph29:07
- Number of Provinces | Graph Problem12:35
- Min Cost to Connect All Points | Graph Problem21:16
- Cheapest Flights Within K Stops | Graph Problem30:29
