About This Course

DSA full course in Hindi playlist
DSA complete playlist in c++
Free DSA Course
C++ for beginner to Advance level.
Complete DSA Course in C++
Coder Army DSA Course
DSA in 2023
DSA Best playlist
DSA with C++
DSA by Rohit Negi
DSA in C++
DSA Rohit Negi
BAAP of All DSA course
180 Hard
180 Days of Code
Rohit Negi DSA
DSA Course in Hindi
DSA in JAVA
DSA in Python

Course Content

163 lessons

• 1. Lecture 01: Introduction To Programming for Beginners 0
• 2. Lecture 02: Introduction to FlowCharts and PseudoCode in Programming 0
• 3. Lecture 03: Start C++ from Zero and Write Your First Program 0
• 4. Lecture 04: If Else Statement in c++ || Loop in C++ 0
• 5. Lecture 05: For Loop in c++ Advance || Prime Number || Factorial || Fibonacci || Sum of n number 0
• 6. Lecture 06: Solve Any Pattern Problem With Simple Trick Part-1 0
• 7. Lecture 07: Solve Any Pattern Problem with Simple Trick Part-2 0
• 8. Lecture 08: Solve HARD Pattern Print Problem with Simple Trick 0
• 9. Lecture 09: Top 5 Advance Pattern Print Problems 0
• 10. Lecture 10: Operators in C++ with implementation 0
• 11. Lecture 11: While and Do while Loop || Switch || break || Continue in C++ 0
• 12. Lecture 12: Binary To Decimal || Decimal To Binary || Decimal To Octal || Binary To Octal Conversion 0
• 13. Lecture 13: Write Your First Program On LeetCode 0
• 14. Lecture 14: Functions in C++ || Pass by Value || Pass by Reference 0
• 15. C++ Series Problem Solving 0
• 16. Introduction To Arrays in C++ 0
• 17. Lecture 17: Master Arrays By Solving Problems 0
• 18. Lecture 18: Time and Space Complexity From Zero To Advance 0
• 19. Lecture 19: SELECTION SORT Algorithm with Theory and Code 0
• 20. Lecture 20: Bubble Sort with Theory and Code 0
• 21. Lecture 21: Insertion Sort with Theory and Code 0
• 22. Lecture 22: Binary Search with Theory and Code 0
• 23. Lecture 23: Binary Search Different Problem || Search Insert Position || Sqrt(x) || Count occurrence 0
• 24. Lecture 24: Search in a Rotated Array | Peak index in a Mountain Array | Kth Missing Positive Number 0
• 25. Lecture 25: Binary Search Top Interview Problem | Book Allocation | Painter Partition | Ship Package 0
• 26. Lecture 26: Binary Search Hard Interview Problem || Aggressive Cow || KOKO Eating Banana 0
• 27. Lecture 27: What is STL || Vector in C++ 0
• 28. Lecture 28: Two Pointer in C++ | TWO SUM | Pair Sum | Pair Difference | Move 0 to end 0
• 29. Lecture 29: Kadane's Algorithm || Prefix and Suffix Sum || Array into 2 equal Sum Subarray 0
• 30. Lecture 30: Trapping Rain Water || 3 SUM || 4 SUM 0
• 31. Lecture 31: Introduction To 2D Arrays in C++ 0
• 32. Lecture 32: 2D Arrays Interview Problems || Wave Form || Spiral Form || Transpose Matrix 0
• 33. Lecture 33: Rotate Image | Rotate by 90 degree | Rotate Matrix Element Clockwise |Rotate Matrix 180 0
• 34. Lecture 34: Binary Search in 2D Arrays || Search in a sorted row-col wise Matrix 0
• 35. Lecture 35: Majority Elements || Count Frequency of element | Find Missing and Repeating elements 0
• 36. Introductions To STRINGS in C++ 0
• 37. String Interviews Problem Solving || Sort a String 0
• 38. Lecture 38: Longest Palindrome || Sorting the Sentence 0
• 39. Lecture 39: Strings Interview Problems on LeetCode || Add Strings || Sort Vowels in a String 0
• 40. Lecture 40: Factorial of Large Number || Integer to Roman || Roman to Integer 0
• 41. Lecture 41: Sliding Window Protocol on Strings 0
• 42. Lecture 42: KMP Algorithm || Longest Prefix Suffix 0
• 43. Lecture 43: String Matching || KMP Algorithm 0
• 44. Lecture 44: Strings HARD Problems For Coding Round 0
• 45. Pointers in C++ || Introduction to Pointers in C+ 0
• 46. Pointers Relationship with array || Arithmetic Pointers 0
• 47. Lecture 47: Pointers with Character Arrays and Functions 0
• 48. Lecture 48: Double Pointer and Multiple Pointers in C++ 0
• 49. Lecture 49: Memory Management || Static vs Dynamic Memory Allocation 0
• 50. Lecture 50: Dynamic Memory Allocation of 2D and 3D Arrays in C++ 0
• 51. Lecture 51: Introduction To Recursion From Basic To Advance 0
• 52. Lecture 52: How To Solve Recursion Problem from 4 different Method 0
• 53. Lecture 53: Recursion: Factorial of a Number | Sum of N numbers | Power of number | Sum of Square 0
• 54. Lecture 54: Recursion Problems on Leetcode 0
• 55. Lecture 55: Recursion in Arrays 0
• 56. Lecture 56: Recursion in Strings 0
• 57. Lecture 57: Recursion in Binary Search 0
• 58. Lecture 58: Time Complexity and Space Complexity in Recursion 0
• 59. Lecture 59: Merge Sort Algorithm 0
• 60. Lecture 60: Quick Sort Algorithm 0
• 61. Lecture 61: Recursion on Subsequence || Print All Subsequence || Generate Parentheses 0
• 62. Lecture 62: Recursion on Subset Sum || Target Sum 0
• 63. Lecture 63: Recursion Perfect Sum Problem || Target Sum with Repetition 0
• 64. Lecture 64: Permutation of Arrays and Strings 0
• 65. Lecture 65: Permutation with repetition || Ways to Sum N 0
• 66. Lecture 66: Tower of Hanoi || Code part and Dry Run 0
• 67. Lecture 67: Josephus Problem || Predict the winner 0
• 68. Lecture 68: Recursion Rat in a Maze Problem 0
• 69. Lecture 69: Print N-bit binary numbers having more 1s than 0s 0
• 70. Lecture 70: Object Oriented Programming in C++ 0
• 71. Lecture 71: Constructor and Destructor in C++ 0
• 72. Lecture 72: Object Oriented Programming: Static data Member and Function | Encapsulation 0
• 73. Lecture 73: Inheritance | Access Modifier | Real Life Example 0
• 74. Lecture 74: Type of Inheritance in C++ | Single Inheritance | Multiple | Hybrid | Multipath 0
• 75. Lecture 75: Polymorphism and Virtual Function in C++ 0
• 76. Lecture 76: Exception Handling in C++ 0
• 77. Lecture 77: File Handling in C++ 0
• 78. Lecture 78: Introduction To Linked List | Traversal and Insertion in a Linked List 0
• 79. Lecture 79: Deletion in a Singly Linked List | Deletion in Constant Time 0
• 80. Lecture 80: Reverse a Linked List | Middle of Linked List | Rotate Linked List 0
• 81. Lecture 81: Linked List LeetCode Problem: Remove Every Kth Node | Rotate List | Palindrome List 0
• 82. Lecture 82: Introduction to Doubly Linked List || Insertion and Deletion in Doubly Linked List 0
• 83. Lecture 83: LinkedList Problems: Remove Duplicates | Merge 2 Sorted LinkedList | Sort a LinkedList 0
• 84. Lecture 84: Circular Linked List: Detect Loop in Linked List || Find Length of Loop 0
• 85. Lecture 85: Hard Problem: Detect and Remove Loop in LinkedList 0
• 86. Lecture 86: Add two numbers represented by linked lists | Reverse a Linked List in groups 0
• 87. Lecture 87: Hard Problem on Linked List: Flattening a Linked List | Merge K Sorted Linked List 0
• 88. Lecture 88: LinkedList Series End Here: Clone a linked list with next and random pointer 0
• 89. Coding Battles : Arrays vs. Linked Lists Showdown 0
• 90. Lecture 89: Introduction To STACK || Implement Stack Using Arrays and LinkedList 0
• 91. Lecture 90: STACK : Valid Parentheses | Print Bracket Number | Reverse Array | Get min at pop 0
• 92. Lecture 91: Stack Problem: Next Greater Element | Next Smaller Element | Stock Span Problem 0
• 93. Lecture 92: Stack Problem: Largest Rectangle in Histogram | Maximal Rectangle 0
• 94. Lecture 93: The Celebrity Problem 0
• 95. Lecture 94: Stack Hard: Maximum of minimum for every window Size | Get Minimum Element from Stack 0
• 96. Lecture 95: Implement two stacks in an array | N Stack in an Array 0
• 97. Lecture 96: Introduction To Queue || Implement Queue with Array and LinkedList || Circular Queue 0
• 98. Lecture 97: Print all Elements in Queue | Implement Queue using Stack | Implement Stack using Queue 0
• 99. Lecture 98: Queues with Sliding Window Problems 0
• 100. Introduction to Deque and implementation 0
• 101. Queue Hard: Sliding Window Maximum | Minimum Number of K Consecutive Bit Flips 0
• 102. Introduction To Trees | Binary Tree in Data Structure 0
• 103. Binary Tree in Data Structure | Binary Tree Traversal | How to Create Binary Tree | DSA 0
• 104. Binary Tree Problems For Technical Interview | Size of Binary Tree | Height of Binary Tree 0
• 105. Binary Tree Problems: Mirror Tree | Two Nodes are Cousins | Check for Balanced Tree | Spiral Form 0
• 106. Binary Tree: Left View of Binary Tree | Right View of Binary Tree | Top View of Binary Tree 0
• 107. Binary Tree: PreOrder Traversal Iterative | PostOrder Traversal Iterative | InOrder Traversal 0
• 108. Binary Tree Problems: Construct Tree from Inorder & Preorder | Tree from Postorder and Inorder 0
• 109. Binary Tree Traversal: Vertical Traversal of Binary Tree | Diagonal Traversal | Boundary Traversal 0
• 110. Morris Traversal : Inorder Traversal | Flatten Binary Tree to LinkedList | Post Order | PreOrder 0
• 111. Burning Tree || Maximum Path Sum between 2 Special Nodes 0
• 112. Binary Search Tree in Data Structure || Implementation, Insertion , Deletion and Search 0
• 113. Binary Search Tree Interview Problem | 5 Binary Search Tree Problems in One Shot 0
• 114. Binary Search Tree Problems for Coding Round 0
• 115. Binary Search Tree: LCA of BST | Find Common Nodes in 2 BST | Check whether BST contains Dead End 0
• 116. Binary Search Tree: Fixing Two nodes of a BST | Sorted Link List to BST | Merge two BST 0
• 117. Largest Binary Search Tree | Maximum Sum BST in Binary Tree | Leetcode 0
• 118. AVL Tree in Data Structure | AVL Tree Insertion | AVL Tree Search | AVL Tree Rotation 0
• 119. AVL Tree Deletion | (Theory + Dry Run + Code Implementation) 0
• 120. STL in C++ 0
• 121. Heap Data Structure | Insertion and Deletion in Max Heap 0
• 122. Heap Sort | Build Heap in C++ | Priority Queue 0
• 123. Heap 6 Interview Problem | Height of Heap | Minimum Cost of ropes | Magician and Chocolates 0
• 124. Kth smallest element in an array | Kth Largest element in an array | Heap | Priority Queue 0
• 125. Merge two binary Max heaps | Is Binary Tree Heap | BST to max heap 0
• 126. Heap Hard Problem: Kth element in Matrix (5 Approaches) | Find median in a stream 0
• 127. Heap Interview Problem: Merge K Sorted Linked List | Merge K Sorted Arrays 0
• 128. Heap: Smallest Range Covering Elements from K Lists | Construct Target Array With Multiple Sums 0
• 129. Sliding Window: Zero Sum Subarrays | Subarray Sum Equals K 0
• 130. Sliding Window: Subarray Sums Divisible by K | Subarray Product Less Than K 0
• 131. Sliding Window: Minimum Size Subarray Sum | Minimum Window Substring 0
• 132. Subarrays with K Different Integers | Count Subarrays Where Max Element Appears at Least K Times 0
• 133. Graph Data Structure | Real world Example to Explain Graph 0
• 134. Graph Representation in Data Structure | Adjacency Matrix and Adjacency List 0
• 135. BFS Traversal in Graph | DFS Traversal in Graph 0
• 136. Detect Cycle in an Undirected Graph | BFS + DFS 0
• 137. Topological Sort | Kahn's Algorithm 0
• 138. Detect Cycle in a Directed Graph | BFS + DFS 0
• 139. Bipartite Graph | BFS + DFS + Code + Real Life application 0
• 140. Graphs: Covid Spread | Find the number of Islands | Replace O's with X's 0
• 141. Graphs: Alien Dictionary | Parallel Courses 3 | Course Schedule | Prerequisite Tasks 0
• 142. Graph: Shortest Path in Undirected Graph 0
• 143. Graphs: Shortest Path in Directed Acyclic Graph 0
• 144. Dijkstra Algorithm | Intuition + Code + Dry Run + 2 Methods 0
• 145. Shortest Path in Weighted undirected graph 0
• 146. Bellman-Ford Algorithm | Distance from the Source 0
• 147. Floyd Warshall Algorithm | MultiSource Shortest Path Algorithm 0
• 148. Graphs: Knight Walk | Shortest Source to Destination Path in Binary Matrix | Find whether path exist 0
• 149. Euler Path and Euler Circuit in a Graph 0
• 150. Circle of Strings 0
• 151. Minimum Spanning Tree | Prim’s Algorithm 0
• 152. Kruskal's Algorithm | Disjoint set 0
• 153. Bridge in a Graph | Critical Connections in a Network 0
• 154. Articulation Point in a Graph | Tarjan's Algorithm 0
• 155. Hamiltonian Path | Hamiltonian Cycle 0
• 156. Strongly Connected Components | Kosaraju Algorithm | Tarjan Algorithm 0
• 157. BackTracking: N-Queens | M-Coloring Problem | Sudoku Solver 0
• 158. Greedy Algorithm From Basic To Advance 0
• 159. Hashing in Data Structure | Zero To Advance Level 0
• 160. Introduction To Dynamic Programming 0
• 161. Climbing Stairs | Dynamic Programming 0
• 162. Count number of hops | Min Cost Climbing Stairs 0
• 163. House Robber | House Robber 2 0

Student Reviews

No reviews yet.