-
Section 2: Essential C and C++ Concepts
28 Lessons-
StartLesson 3. Arrays Basics
-
StartLesson 4. Practice : Arrays Basics
-
StartLesson 5. Structures
-
StartLesson 6. Practice - Structures
-
StartLesson 7. Pointers
-
StartLesson 8. Practice - Pointers
-
StartLesson 9. Reference in C++
-
StartLesson 10. Practice - Reference
-
StartLesson 11. Pointer to Structure
-
StartLesson 12. Practice - Pointer to Structure
-
StartLesson 13. Functions
-
StartLesson 14. Practice - Functions
-
StartLesson 15. Parameter Passing Methods
-
StartLesson 16. Practice - Parameter Passing Methods
-
StartLesson 17. Array as Parameter
-
StartLesson 18. Practice : Array as Parameter
-
StartLesson 19. Structure as Parameter
-
StartLesson 20. Practice : Structure as Parameter
-
StartLesson 21. Structures and Functions (Must Watch)
-
StartLesson 22. Converting a C program to a C++ class (Must Watch)
-
StartLesson 23. Practice : Monolithic Program
-
StartLesson 24. Practice : Modular Program
-
StartLesson 25. Practice : Structure and Functions
-
StartLesson 26. Practice : Object-Oriented Program
-
StartLesson 27. C++ Class and Constructor
-
StartLesson 28. Practice : C++ Class
-
StartLesson 29. Template classes
-
StartLesson 30. Practice : Template Class
-
-
Section 3: Required Setup for Programming
7 Lessons -
Section 4: Introduction
7 Lessons -
Section 5: Recursion
34 Lessons-
StartLesson 45. How Recursion Works ( Tracing )
-
StartLesson 46. Generalising Recursion
-
StartLesson 47. How Recursion uses Stack
-
StartLesson 48. Recurrence Relation - Time Complexity of Recursion
-
StartLesson 49. Lets Code Recursion
-
StartLesson 50. Static and Global Variables in Recursion
-
StartLesson 51. Let's Code Static and Global in Recursion
-
StartLesson 52. Tail Recursion
-
StartLesson 53. Head Recursion
-
StartLesson 54. Tree Recursion
-
StartLesson 55. Let's Code Tree Recursion
-
StartLesson 56. Indirect Recursion
-
StartLesson 57. Let's Code Indirect Recursion
-
StartLesson 58. Nested Recursion
-
StartLesson 59. Let's Code Nested Recursion
-
StartLesson 60. Sum of Natural Number using Recursion
-
StartLesson 61. Let's Code Sum of N using Recursion
-
StartLesson 62. Factorial using Recursion
-
StartLesson 63. Let's Code Factorial using Recursion
-
StartLesson 64. Power using Recursion
-
StartLesson 65. Let's Code Power using Recursion
-
StartLesson 66. Taylor Series using Recursion
-
StartLesson 67. Let's Code Taylor Series using Recursion
-
StartLesson 68. Taylor Series using Horner's Rule
-
StartLesson 69. Let's Code Taylor Series Horner's Rule - Recursion
-
StartLesson 70. Let's Code Taylor Series Iterative
-
StartLesson 71. Fibonacci Series using Recursion - Memoization
-
StartLesson 72. Let's Code Fibonacci
-
StartLesson 73. nCr using Recursion
-
StartLesson 74. Lets Code nCr using Recursion
-
StartLesson 75. Tower of Hanoi Problem
-
StartLesson 76. Let's Code Tower of Hanoi
-
StartLesson Quiz 1: Recursion
-
StartLesson 77. Quiz 1 Solutions
-
-
Section 6: Arrays Representations
16 Lessons-
StartLesson 78. Introduction to Array
-
StartLesson 79. Declarations of Array
-
StartLesson 80. Demo - Array Declaration
-
StartLesson 81. Static vs Dynamic Arrays
-
StartLesson 82. Demo - Static vs Dynamic Array
-
StartLesson 83. How to Increase Array Size
-
StartLesson 84. Demo - Increasing Array Size
-
StartLesson 85. 2D Arrays
-
StartLesson 86. Demo - 2D Array
-
StartLesson 87. Array Representation by Compiler
-
StartLesson 88. Row Major Formula for 2D Arrays
-
StartLesson 89. Column Major Formula for 2D Arrays
-
StartLesson 90. Formulas for nD Arrays
-
StartLesson 91. Formulas for 3D Arrays
-
StartQuiz 2: Arrays Representation
-
StartLesson 92. Solutions for Quiz 2
-
-
Section 7: Array ADT
38 Lessons-
StartLesson 93. Array ADT
-
StartLesson 94. Demo - Array ADT
-
StartLesson 95. Inserting in an Array
-
StartLesson 96. Let's Code Insert
-
StartLesson 97. Deleting from Array
-
StartLesson 98. Let's Code Delete
-
StartLesson 99. Linear Search
-
StartLesson 100. Improving Linear Search
-
StartLesson 101. Let's Code Linear Search
-
StartLesson 102. Binary Search
-
StartLesson 103. Binary Search Algorithm
-
StartLesson 104 Lets Code Binary Search
-
StartLesson 105. Analysis of Binary Search
-
StartLesson 106. Average Case Analysis of Binary Search
-
StartLesson 107. Get() Set() Avg() Max() Functions on Array
-
StartLesson 108 Lets Code Get() Set() Max() on Array
-
StartLesson 109. Reverse and Shift an Array
-
StartLesson 110. Lets Code Reversing an Array
-
StartLesson 111. Check if Array is Sorted
-
StartLesson 112. Lets Code to check if Array is sorted
-
StartLesson 113. Merging Arrays
-
StartLesson 114. Lets Code to Merge Arrays
-
StartLesson 115. Set Operations on Array - Union,Intersection and Difference
-
StartLesson 116. Lets Code Set operations on Array
-
StartLesson 117. Lets Code a Menu Driven Program for Arrays
-
StartLesson 118. Let's convert C program for Array to C++
-
StartLesson 119. Let's Put all together in C++ program for Array
-
StartLesson 120. Student Challenge : Finding Single Missing Element in an Array
-
StartLesson 121. Student Challenge : Finding Multiple Missing Elements in an Array
-
StartLesson 122. Student Challenge : Finding Missing Element in an Array Method 2
-
StartLesson 123. Student Challenge Finding Duplicates in a Sorted Array
-
StartLesson 124. Student Challenge : Finding Duplicates in Sorted Array using Hashing
-
StartLesson 125. Student Challenge : Finding Duplicates in a Unsorted Array
-
StartLesson 126. Student Challenge : Finding a Pair of Elements with sum K
-
StartLesson 127. Student Challenge : Finding a Pair of Elements with sum K in Sorted Array
-
StartLesson 128. Student Challenge : Finding Max and Min in a single Scan
-
StartQuiz 3: Array ADT
-
StartLesson 129. Solutions for Quiz 3
-
-
Section 8: Strings
11 Lessons-
StartLesson 130. Introduction to Strings
-
StartLesson 131. Finding Length of a String
-
StartLesson 132. Changing Case of a String
-
StartLesson 133. Counting Words and Vowels in a String
-
StartLesson 134. Validating a String
-
StartLesson 135. Reversing a String
-
StartLesson 136. Comparing Strings and Checking Palindrome
-
StartLesson 137. Finding Duplicates in a String
-
StartLesson 138. Finding Duplicates in a String using Bitwise Operations
-
StartLesson 139. Checking if 2 Strings are Anagram (distinct letters)
-
StartLesson 140. Permutation of String
-
-
Section 9: Matrices
18 Lessons-
StartLesson 141. Section Introduction
-
StartLesson 142. Diagonal Matrix
-
StartLesson 143. Let's Code Diagonal Matrix
-
StartLesson 144. C++ class for Diagonal Matrix
-
StartLesson 145. Let's Code C++ class for Diagonal mat
-
StartLesson 146. Lower Triangular Matrix Row-Major Mapping
-
StartLesson 147. Lower Triangular Matrix Column-Major Mapping
-
StartLesson 148. Let's Code Lower Triangular Matrix in C
-
StartLesson 149. Let's Code Lower Triangular Matrix in C++
-
StartLesson 150. Upper Triangular Matrix Row-Major Mapping
-
StartLesson 151. Upper Triangular Matrix Column-Major Mapping
-
StartLesson 152. Symmetric Matrix
-
StartLesson 153. Tri-Diagonal and Tri-Band Matrix
-
StartLesson 154. Toeplitz Matrix
-
StartLesson 155. Menu Driven Program for Matrices
-
StartLesson 156. Menu Driven Program for Matrices using Functions
-
StartLesson 157. How to Write C++ Classes for All Matrices
-
StartQuiz 4: Matrices
-
-
Section 10: Sparse Matrix and Polynomial Representation
12 Lessons-
StartLesson 158. Sparse Matrix Representation
-
StartLesson 159. Addition of Sparse Matrices
-
StartLesson 160. Array Representation of Sparse Matrix
-
StartLesson 161. Let's Code to Create Sparse Matrix
-
StartLesson 162. Program for Adding Sparse Matrix
-
StartLesson 163. Let's Code to Add Sparse Matrix
-
StartLesson 164. Let's Code Sparse Matrix using C++
-
StartLesson 165. Let's Code Sparse Matrix using C++ Continued.....
-
StartLesson 166. Polynomial Representation
-
StartLesson 167. Polynomial Evaluation
-
StartLesson 168. Polynomial Addition
-
StartLesson 169. Let's Code Polynomial
-
-
Section 11: Linked List
58 Lessons-
StartLesson 170. Why we need Dynamic Data Structure Linked List
-
StartLesson 171. About Linked List
-
StartLesson 172. More About Linked List
-
StartLesson 173. Display Linked List
-
StartLesson 174. Let's Code Display for Linked List
-
StartLesson 175. Recursive Display of Linked List
-
StartLesson 176. Let's Code Recursive Display for Linked List
-
StartLesson 177. Counting Nodes in a Linked List
-
StartLesson 178. Sum of All Elements in a Linked List
-
StartLesson 179. Let's Code Count and Sum
-
StartLesson 180. Maximum Element in a Linked List
-
StartLesson 181. Let's Code Max for Linked List
-
StartLesson 182. Searching in a Linked List
-
StartLesson 183. Improve Searching in Linked List
-
StartLesson 184. Let's Code Searching in Linked List
-
StartLesson 185. Inserting in a Linked List
-
StartLesson 186. Let's Code Insert for Linked List
-
StartLesson 187. Creating a Linked List using Insert
-
StartLesson 188. Creating a Linked List by Inserting at Last
-
StartLesson 189. Inserting in a Sorted Linked List
-
StartLesson 190. Let's Code Insert in Sorted Linked List
-
StartLesson 191. Deleting from Linked List
-
StartLesson 192. Let's Code Delete on Linked List
-
StartLesson 193. Check if a Linked List is Sorted
-
StartLesson 194. Let's Code to check if Linked List is Sorted
-
StartLesson 195. Remove Duplicates from Linked List
-
StartLesson 196. Let's Code to Remove Duplicates from Linked List
-
StartLesson 197. Reversing a Linked List
-
StartLesson 198. Reversing using Sliding Pointers
-
StartLesson 199. Recursive Reverse for Linked List
-
StartLesson 200. Let's Code Reversing a Linked List
-
StartLesson 201. Concatenating 2 Linked Lists
-
StartLesson 202. Merging 2 Linked Lists
-
StartLesson 203. Let's Code to Concatenate and Merge Linked Lists
-
StartLesson 204. Check for LOOP in Linked List
-
StartLesson 205. Let's Code to Check LOOP
-
StartLesson 206. Let's Code a C++ class for Linked List
-
StartLesson 207. Circular Linked List
-
StartLesson 208. Display Circular Linked List
-
StartLesson 209. Let’s Code Circular Linked List
-
StartLesson 210. Inserting in a Circular Linked List
-
StartLesson 211. Let's Code Insert for a Circular Linked List
-
StartLesson 212. Deleting From Circular Linked List
-
StartLesson 213. Let's Code for Circular Linked List
-
StartLesson 214. Doubly Linked List
-
StartLesson 215. Let's Code Doubly Linked List
-
StartLesson 216. Insert in a Doubly Linked List
-
StartLesson 217. Let's Code Insert for Doubly Linked List
-
StartLesson 218. Deleting from Doubly Linked List
-
StartLesson 219. Let's Code Delete for Doubly Linked List
-
StartLesson 220. Reverse a Doubly Linked List
-
StartLesson 221. Let's Code Reverse for Doubly Linked List
-
StartLesson 222. Circular Doubly Linked List
-
StartLesson 223. Comparison of Linked List
-
StartLesson 224. Comparison of Array with Linked List
-
StartLesson 225. Student Challenge : Finding Middle Element of a Linked List.
-
StartLesson 226. Student Challenge : Finding Intersecting point of Two Linked List
-
StartQuiz 5: Linked List
-
-
Section 13: Stack
23 Lessons-
StartLesson 230. Introduction to Stack
-
StartLesson 231. Stack using Array
-
StartLesson 232. Implementation os Stack using Array
-
StartLesson 233. Let's Code Stack using Array
-
StartLesson 234. Stack using Linked List
-
StartLesson 235. Stack Operations using Linked List
-
StartLesson 236. Let's Code Stack using Linked List
-
StartLesson 237. Let's Code C++ class for Stack using Linked List
-
StartLesson 238. Parenthesis Matching
-
StartLesson 239. Program for Parenthesis Matching
-
StartLesson 240. Let's Code Parenthesis Matching
-
StartLesson 241. More on Parenthesis Matching
-
StartLesson 242. Infix to Postfix Conversion
-
StartLesson 243. Associativity and Unary Operators
-
StartLesson 244. Infix to Postfix using Stack Method 1
-
StartLesson 245. Infix to Postfix using Stack Method 2
-
StartLesson 246. Program for Infix to Postfix Conversion
-
StartLesson 247. Let's Code Infix to Postfix Conversion
-
StartLesson 248. Student Challenge: Infix to Postfix with Associativity and Parenthesis
-
StartLesson 249. Evaluation of Postfix Expression
-
StartLesson 250. Program for Evaluation of Postfix
-
StartLesson 251. Let's Code Evaluation of Postfix
-
StartQuiz 6: Stack
-
-
Section 14: Queues
15 Lessons-
StartLesson 252. Queue ADT
-
StartLesson 253. Queue using Single Pointer
-
StartLesson 254. Queue using Two Pointers
-
StartLesson 255. Implementing Queue using Array
-
StartLesson 256. Let's Code Queue using Array
-
StartLesson 257. Let's Code Queue in C++
-
StartLesson 258. Drawback of Queue using Array
-
StartLesson 259. Circular Queue
-
StartLesson 260. Let's Code Circular Queue
-
StartLesson 261. Queue using Linked List
-
StartLesson 262. Let's Code Queue using Linked List
-
StartLesson 263. Double Ended Queue DEQUEUE
-
StartLesson 264. Priority Queues
-
StartLesson 265. Queue using 2 Stacks
-
StartQuiz 7: Queue
-
-
Section 15: Trees
34 Lessons-
StartLesson 266. Terminology
-
StartLesson 267. Number of Binary Trees using N Nodes
-
StartLesson 268. Height vs Nodes in Binary Tree
-
StartLesson 269. Internal Nodes vs External Nodes in Binary Tree
-
StartLesson 270. Strict Binary Tree
-
StartLesson 271. Height vs Node of Strict Binary Tree
-
StartLesson 272. Internal vs External Nodes of Strict Binary Trees
-
StartLesson 273. n-ary Trees
-
StartLesson 274. Analysis of n-Ary Trees
-
StartLesson 275. Representation of Binary Tree
-
StartLesson 276. Linked Representation of Binary Tree
-
StartLesson 277. Full vs Complete Binary Tree
-
StartLesson 278. Strict vs Complete Binary Tree
-
StartLesson 279. Binary Tree Traversals
-
StartLesson 280. Binary Tree Traversal Easy Method 1
-
StartLesson 281. Binary Tree Traversal Easy Method 2
-
StartLesson 282. Binary Tree Traversal Easy Method 3
-
StartLesson 283. Creating Binary Tree
-
StartLesson 284. Program to Create Binary Tree
-
StartLesson 285. Let's Code Creating Binary Tree
-
StartLesson 286. Let's Code Creating Binary Tree in C++
-
StartLesson 287. Preorder Tree Traversal
-
StartLesson 288. Inorder Tree Traversals Functions
-
StartLesson 289. Iterative Preorder
-
StartLesson 290. Iterative Inorder
-
StartLesson 291. Let's Code Iterative Traversals
-
StartLesson 292. Level Order Traversal
-
StartLesson 293. Let's Code Level Order Traversal
-
StartLesson 294. Can we Generate Tree from Traversals
-
StartLesson 295. Generating Tree from Traversals
-
StartLesson 296. Height and Count of Binary Tree
-
StartLesson 297. Let's Code Height and Count
-
StartLesson 298. Student Challenge : Count Leaf Nodes of a Binary Tree
-
StartQuiz 8: Binary Trees
-
-
Section 16: Binary Search Trees
12 Lessons-
StartLesson 299. BST intro
-
StartLesson 300. Searching in a Binary Search Tree
-
StartLesson 301. Inserting in a Binary Search Tree
-
StartLesson 302. Recursive Insert in Binary Search Tree
-
StartLesson 303. Creating a Binary Search Tree
-
StartLesson 304. Let's code Binary Search Tree
-
StartLesson 305. Deleting from Binary Search Tree
-
StartLesson 306. Let's Code Recursive Insert and Delete on BST
-
StartLesson 307. Generating BST from Preorder
-
StartLesson 308. Program for Generating BST from Preorder
-
StartLesson 309. Drawbacks of Binary Search Tree
-
StartQuiz 9: Binary Search Trees
-
-
Section 17: AVL Trees
8 Lessons-
StartLesson 310. Introduction to AVL Trees
-
StartLesson 311. Inserting in AVL with Rotations
-
StartLesson 312. General form of AVL Rotations
-
StartLesson 313. Let's Code LL Rotation on AVL
-
StartLesson 314. Let's Code LR Rotation on AVL
-
StartLesson 315. Generating AVL Tree
-
StartLesson 316. Deletion from AVL Tree with Rotations
-
StartLesson 317. Height Analysis of AVL Trees
-
-
Section 18: Search Trees
9 Lessons-
StartLesson 318. 2-3 Trees
-
StartLesson 319. 2-3-4 Trees
-
StartLesson 320. Re-Black Trees Introduction
-
StartLesson 321. Red-Black Tree creation
-
StartLesson 322. Red-Black Trees vs 2-3-4 Trees
-
StartLesson 323. Creating Red-Black Tree similar to Creating 2-3-4 Tree
-
StartLesson 324. Red-Black Tree Deletion Cases
-
StartLesson 325. Red-Black Tree Deletion Examples
-
StartLesson 326. Red-Black Tree vs 2-3-4 Tree Deletion
-
-
Section 19: Heap
8 Lessons-
StartLesson 327. Introduction to Heap
-
StartLesson 328. Inserting in a Heap
-
StartLesson 329. Program to Insert in a Heap
-
StartLesson 330. Creating a Heap
-
StartLesson 331. Deleting from Heap and Heap Sort
-
StartLesson 332. Let's Code Heap Sort
-
StartLesson 333. Heapify - Faster Method for creating Heap
-
StartLesson 334. Heap as Priority Queue
-
-
Section 20: Sorting Techniques
29 Lessons-
StartLesson 335. Criteria used for Analysing Sorts
-
StartLesson 336. Bubble Sort
-
StartLesson 337. Let's Code Bubble Sort
-
StartLesson 338. Insertion Sort
-
StartLesson 339. Insertion Sort Continued....
-
StartLesson 340. Program for Insertion Sort
-
StartLesson 341. Analysis of Insertion Sort
-
StartLesson 342. Let's Code Insertion Sort
-
StartLesson 343. Comparing Bubble and Insertion Sort
-
StartLesson 344. Selection Sort
-
StartLesson 345. Program for Selection Sort
-
StartLesson 346. Analysis of Selection Sort
-
StartLesson 347. Let's Code Selection Sort
-
StartLesson 348. Idea behind Quick Sort
-
StartLesson 349. Quick Sort
-
StartLesson 350. Analysis of Quick Sort
-
StartLesson 351. Analysis of Quick Sort Continued.....
-
StartLesson 352. Let's Code Quick Sort
-
StartLesson 353. Merging
-
StartLesson 354. Iterative Merge Sort
-
StartLesson 355. Let's Code Iterative Merge Sort
-
StartLesson 356. Recursive Merge Sort
-
StartLesson 357. Let's Code Recursive Merge Sort
-
StartLesson 358. Count Sort
-
StartLesson 359. Let's Code Count Sort
-
StartLesson 360. Radix Sort
-
StartLesson 361. Bin / Bucket Sort
-
StartLesson 362. Shell Sort
-
StartLesson 363. Let's Code Shell Sort
-
-
Section 21: Hashing Technique
9 Lessons-
StartLesson 364. Introduction to Hashing
-
StartLesson 365. Chaining
-
StartLesson 366. Let's Code Chaining
-
StartLesson 367. Linear Probing
-
StartLesson 368. Let's Code Linear Probing
-
StartLesson 369. Quadratic Probing
-
StartLesson 370. Double Hashing
-
StartLesson 371. Hash Function Ideas
-
StartQuiz 10: Hashing
-
-
Section 22: Graphs
17 Lessons-
StartLesson 372. Introduction to Graphs
-
StartLesson 373. Representation of Undirected Graph
-
StartLesson 374. Representation of Directed Graphs
-
StartLesson 375. Breadth First Search
-
StartLesson 376. Program for BFS
-
StartLesson 377. Depth First Search
-
StartLesson 378. Program for DFS
-
StartLesson 379. Let's Code BFS & DFS
-
StartLesson 380. Spanning Trees
-
StartLesson 381. Prim's Minimum Cost Spanning Tree
-
StartLesson 382. Prim's Program
-
StartLesson 383. Let's Code Prim's using
-
StartLesson 384. Kruskal's Minimum Cost Spanning Tree
-
StartLesson 385. Disjoint Subsets
-
StartLesson 386. Kruskal's Program
-
StartLesson 387. Let's Code Kruskla's Program
-
StartQuiz 11: Graphs
-
-
Section 23: Asymptotic Notations
1 Lesson-
StartLesson 388. Asymptotic Notations Big Oh , Omega , Theta
-
-
All Lecture PDF's
144 Lessons-
Start49 TailHead
-
Start51. StaticGlobal
-
Start55.TreeRecursion
-
Start57. Indirect+Recursion
-
Start59. Nested+Recursion
-
Start61. Sum+of+N+
-
Start63. Factorial
-
Start65. Power
-
Start67. Taylor+Series
-
Start69. Taylor
-
Start70. Tayloer+Series+Iterative
-
Start72. Fibonacci
-
Start74. Combination
-
Start76. Tower+of+Hanoi
-
Start82. Static+Dyn+Array
-
Start84. Array+Size
-
Start86. 2D+Array
-
Start94. DemoArrayADTC++
-
Start96. Insert
-
Start98. Delete
-
Start101. LinearSearch
-
Start104. BinarySearch
-
Start108. Get+Set
-
Start110. Reverse+Array
-
Start112. isSorted
-
Start114.1 MergeArraysC++
-
Start114.2 MergeArraysC
-
Start116. Set+Operations (2)
-
Start117. +Array+Menu+C (2)
-
Start118. +Array+C+++class
-
Start119. +Array+C+++#2
-
Start143. Diag+Matrix+C (2)
-
Start145. Diag+Matrix+Cpp (1)
-
Start148. +Lower+Triangular+C (3)
-
Start149. LTMatrixC++ (1)
-
Start161.+Sparse+Matrix+C (1)
-
Start163.+Sparse+Matrix+C (1)
-
Start165.+Sparse+Matrix+C++ (4)
-
Start169. +Polynomial (1)
-
Start174.1 DisplayLLC++ (1)
-
Start174.2 DisplayLLC (1)
-
Start176. Create+and+Display+LL
-
Start179. +Count+SumLinked+List
-
Start181. Max+LL
-
Start184. +Search+LL
-
Start186. +Insert+in+LL (1)
-
Start190.1 +SortedInsert+LL (1)
-
Start190.2 +Create+LL+using+Insert (1)
-
Start192. +Deleteing+LL
-
Start194. +isSorted+LL (1)
-
Start196. +Remove+Duplicate+LL
-
Start200. +Reverse+LL (1)
-
Start203. +Merge+LL
-
Start205. +isLoop+LL
-
Start206. +LinkedList+CPP
-
Start209.1 CircularLLC++
-
Start209.2 CircularLLC (1)
-
Start213. +Circluar+Linked+List (2)
-
Start221.1 ReverseDLLC++ (2)
-
Start221.2 ReverseLLC (1)
-
Start225. MiddleElementLLC++ (1)
-
Start226. InstersectingPointOf2LLC++ (1)
-
Start229. +Polynomial+Linked+List (1)
-
Start233.1 +Stack+Array
-
Start233.2 StackUsingArrayC++
-
Start236.+Stack+LL+C
-
Start236.PostfixEvaluationUsingLLStack&STLC++
-
Start237.1 StackUsingLLC++
-
Start237.2 StackLLC
-
Start239.1 ParanthesisMatchingC++
-
Start239.2 ParenthesisMatchingC
-
Start240. BalancedParenthesisUsingLLBasedStackC++ (1)
-
Start241. ExtendedBalancedParenthesisUsingSTLStack&MapC++ (1)
-
Start247. +InToPost
-
Start248.1 InfixToPostfixUsingSTLStackC++
-
Start248.2 InfixToPostfixC
-
Start251.1 PostfixEvaluationUsingLLStack&STLC++
-
Start251.2 PostfixEvalutionC
-
Start256. +Queue+using+Array+C
-
Start257.1 QueueUsingArrayC++
-
Start257.2 QueueUsingArrayC
-
Start260.1 CircularQueueUsingArrayC++
-
Start260.2 CircularQueueC
-
Start262.1 QueueUsingLLC++
-
Start262.2 QueueUsingLLC
-
Start263. DequeueUsingArrayC++
-
Start265. QueueUsing2STLStacksC++
-
Start285.1 CreateTreeUsingArrayQueueC++
-
Start285.2 Tree
-
Start286.1 +TreeCpp
-
Start286.2 TreeCPP+Complete
-
Start286.3 TreeClassUsingArrayQueueC++
-
Start286.4 TreeClassUsingSTLQueueC++
-
Start291.TreeIterativeOrderTraversalUsingSTLStackC++
-
Start293.1 LevelOrderTraversalC++
-
Start293.2 LevelOrderTraversalC
-
Start295.GeneratingTreeFromTraversalC++
-
Start296 .Height&CountofBinaryTreeC++
-
Start297 Tree+Count+and+Height
-
Start298.CountLeafofBinaryTreeC++
-
Start304. BSTInsertInorder&SearchC++
-
Start306. RecursiveInsert&DeleteonBSTC++
-
Start308. BSTfromPreorderUsingSTLStackC++
-
Start313.1 LL&RRRotationonAVLTreeC++
-
Start313.2 LL&LRRotationonAVLTreeC
-
Start314.1 LR&RRRotationonAVLTreeC++
-
Start314.2 RR&RLRotationonAVLTreeC
-
Start316. DeletionfromAVLTreeWithRotationC++
-
Start329. InsertinHeapC++
-
Start330. CreateHeapUsingSTLVectorC++
-
Start332. HeapSort+New
-
Start333. HeapifyFunctionFasterMethodtoCreateHeapC++
-
Start337.1 BubbleSortC++
-
Start337.2 BubbleSortC
-
Start342.1 InsertionSortC++
-
Start342.2 InsertionSortC
-
Start347.1 SelectionSortC++
-
Start347.2 SelectionSortC
-
Start352.1 QuickSortUsingINT_MAXOrInfinityC++
-
Start352.2 QuickSortC
-
Start353.1 MergingFunctionC++
-
Start353.2 MergingFunctionC
-
Start355.1 IterativeMergeSortC++
-
Start355.2 IMergeSortNEW
-
Start357.1 RecursiveMergeSortC++
-
Start357.2 RecursiveMergeSortC
-
Start359.1 CountSortFunctionC++
-
Start359.2 CountSortFunctionC
-
Start360. RadixSortUsingLLC++
-
Start361. BinSortBasedonLLC++
-
Start363.1 ShellSortC++
-
Start363.2 ShellSortC
-
Start366.1 HashTableClassChainingC++
-
Start366.2 HashingC
-
Start368.1 HashTableLinearProbingC++
-
Start368.2 LinearProbingC
-
Start369. HashTableQuadraticProbingC++
-
Start370. DoubleHashingC++
-
Start376. BreadthFirstSearchUsingSTLQueueC++
-
Start378.1 DepthFirstSearchUsingRecursionC++
-
Start378.2 DepthFirstSearchUsingSTLStackC++
-
Start379. Graph+BFS+DFS
-
Start383. PrimMinSpanningTreeFunctionC++
-
Start387. KrushalsMinCostSpanningTreeFunctionC++
-
Mastering Data Structures & Algorithms using C and C++
Learn, Analyse and implement Data Structures using C and C++. Learn Recursion and Sorting.
What you'll Learn
- Various popular data Structures and their Algorithms.
- Develop your Analytical skills on Data Structure and use List item three.
- Learn Recursive Algorithms on Data Structures.
- Learn about various Sorting Algorithms.
- Learn implementation of Data Structures using C and C++
Course Summary:
You may be new to Data Structure or you have already Studied and Implemented
Data Structures but still you feel you need to learn more about Data Structure in
detail so that it helps you solve challenging problems and used Data Structure
efficiently. This 53 hours of course covers each topic in greater details, every topic
is covered on Whiteboard which will improve your Problem Solving and
Analytical Skills. Every Data Structure is discussed, analysed and
implemented with a Practice line-by-line coding.
₹550
Course Curriculum
Reviews