Complete DSA with C++ Sigma 10
By Apna Collage
Categories: DSA
Course Content
1. Welcome to C++ DSA Batch!
-
00. Topic List.png
00:00 -
01. Welcome PDF.pdf
00:00
2. Course Introduction
-
00. Topic List.png
00:00 -
01. Message from the Teacher.mp4
00:00 -
02. Placements & Internships.mp4
00:00 -
03. About the Lectures.mp4
00:00 -
04. Pre-requisites.mp4
00:00 -
05. What to Install-.mp4
00:00
3. Installation Resources
-
00. Topic List.png
00:00 -
01. Installation Guide Cpp.pdf
00:00 -
02. Using Replit.mp4
00:00 -
03. For Mac Users – Setting up C++.mp4
00:00 -
04. Using VS Code.mp4
00:00
4. Flowcharts & Pseudocode
-
00. Topic List.png
00:00 -
01. What are Flowcharts-.mp4
00:00 -
02. Components of Flowchart.mp4
00:00 -
03. Sum of 2 Numbers.mp4
00:00 -
04. Calculate Simple Interest.mp4
00:00 -
05. Max of 2 Numbers.mp4
00:00 -
06. Print N Natural Numbers.mp4
00:00 -
07. Sum of N Natural Numbers.mp4
00:00 -
08. Flowchart Qs.pdf
00:00 -
09. Flowchart_Solutions.pdf
00:00
5. Variables & Data Types
-
00. Topic List.png
00:00 -
01. Boilerplate Code in C++.mp4
00:00 -
02. How does code run-.mp4
00:00 -
03. Preprocessor Directive.mp4
00:00 -
04. Main Function in C++.mp4
00:00 -
05. What is Namespace-.mp4
00:00 -
07. Print the Pattern.mp4
00:00 -
08. Variables in C++.mp4
00:00 -
09. Naming Conventions.mp4
00:00 -
11. Data Types in C++.mp4
00:00 -
12. Comments.mp4
00:00 -
13. Input in C++.mp4
00:00 -
14. Print Average Marks.mp4
00:00 -
15. Variables & Data Types Questions.pdf
00:00 -
16. Variables & Data Types Ans.pdf
00:00
6. Operators
-
00. Topic List.png
00:00 -
06. Unary Arithmetic Operators.mp4
00:00 -
07. Assignment Operators.mp4
00:00 -
08. Relational Operators.mp4
00:00 -
09. Logical Operators.mp4
00:00 -
10. Operators Questions.pdf
00:00 -
11. Operators Ans.pdf
00:00 -
01. Constants.mp4
00:00 -
02. Implicit Type Conversion.mp4
00:00 -
03. Explicit Typecasting.mp4
00:00 -
04. Practice Qs.mp4
00:00 -
05. Arithmetic Operators.mp4
00:00
7. Loops
-
00. Topic List.png
00:00 -
01. for Loop (in Detail).mp4
00:00 -
02. Print -apna college-.mp4
00:00 -
03. Print N Natural Numbers.mp4
00:00 -
04. Sum of N Natural Numbers.mp4
00:00 -
05. while Loop.mp4
00:00 -
06. Practice Qs.mp4
00:00 -
07. Practice Qs.mp4
00:00 -
08. do while Loop.mp4
00:00 -
09. break Statement.mp4
00:00 -
10. Practice Qs (break).mp4
00:00 -
11. continue Statement.mp4
00:00 -
12. Practice Qs (continue).mp4
00:00 -
13. Check for Prime.mp4
00:00 -
14. Check for Prime (Optimized).mp4
00:00 -
15. Loops Questions.pdf
00:00 -
16. Loops Ans.pdf
00:00
8. Functions
-
00. Topic List.png
00:00 -
01. Nested Loops.mp4
00:00 -
02. Nested Loops (Dry Run).mp4
00:00 -
03. Star Pattern.mp4
00:00 -
04. Inverted Star Pattern.mp4
00:00 -
05. Half Pyramid Pattern.mp4
00:00 -
06. Character Pyramid Pattern.mp4
00:00 -
07. Hollow Rectangle Pattern.mp4
00:00 -
08. Inverted & Rotated Half-Pyramid Pattern.mp4
00:00 -
09. Floyd’s Triangle Pattern.mp4
00:00 -
10. Diamond Pattern.mp4
00:00 -
11. Butterfly Pattern.mp4
00:00 -
12. Pattern Slides cpp.pdf
00:00 -
13. Patterns Questions.pdf
00:00 -
14. Patterns Ans.pdf
00:00
8. Patterns
-
00. Topic List.png
00:00 -
01. What are Functions-.mp4
00:00 -
02. Forward Declaration.mp4
00:00 -
03. Syntax with Parameters.mp4
00:00 -
04. Practice Qs.mp4
00:00 -
05. Practice Qs (Factorial).mp4
00:00 -
06. Function call in Memory.mp4
00:00 -
07. Scope (Local & Global).mp4
00:00 -
08. Practice Qs (Prime Number).mp4
00:00 -
09. Practice Qs (Binomial Coefficient).mp4
00:00 -
10. Function Overloading.mp4
00:00 -
11. Practice Qs (Primes in Range).mp4
00:00 -
12. Functions Questions.pdf
00:00 -
13. Functions Ans.pdf
00:00
9. Introduction to Pointers
-
00. Topic List.png
00:00 -
01. Basic Concepts of Memory.mp4
00:00 -
02. AddressOf (&) Operator.mp4
00:00 -
03. What are Pointers-.mp4
00:00 -
04. Dereference Operator.mp4
00:00 -
05. Null Pointers.mp4
00:00 -
06. Passing Arguments (Value vs Reference).mp4
00:00 -
07. Reference Variables.mp4
00:00 -
08. Practice Qs.mp4
00:00 -
09. Practice Qs.mp4
00:00 -
10. Pointers Questions.pdf
00:00 -
11. Pointers Ans.pdf
00:00
10. Arrays (Part I)
-
00. Topic List.png
00:00 -
07. Linear Search.mp4
00:00 -
08. Reverse an Array.mp4
00:00 -
09. Binary Search.mp4
00:00 -
10. Binary Search Code.mp4
00:00 -
11. Binary Search (Time Complexity).mp4
00:00 -
12. Array Pointer.mp4
00:00 -
13. Pointer Arithmetic 1.mp4
00:00 -
14. Pointer Arithmetic 2.mp4
00:00 -
15. Pointer Arithmetic 3.mp4
00:00 -
16. Pointer Arithmetic 4.mp4
00:00 -
01. Basics of Array.mp4
00:00 -
02. Creating an Array.mp4
00:00 -
03. Output & Input Array.mp4
00:00 -
04. Find Largest in Array.mp4
00:00 -
05. Arrays are passed by Reference.mp4
00:00 -
06. Space and Time Complexity.pdf
00:00
11. Arrays (Part II)
-
00. Topic List.png
00:00 -
01. Print Subarrays.mp4
00:00 -
02. Max Sum Subarray (Brute Force).mp4
00:00 -
03. Max Sum Subarray (Slightly Optimized).mp4
00:00 -
04. Kadane’s Algorithm for Max Sum Subarray.mp4
00:00 -
05. Buy & Sell Stocks.mp4
00:00 -
06. Buy & Sell Stocks (Code).mp4
00:00 -
07. Trapping Rainwater.mp4
00:00 -
08. Trapping Rainwater (Code).mp4
00:00 -
09. Arrays_Questions.pdf
00:00 -
10. Arrays Ans.pdf
00:00
12. Basic Sorting Algorithms
-
00. Topic List.png
00:00 -
01. Bubble Sort.mp4
00:00 -
02. Bubble Sort (Code).mp4
00:00 -
03. Selection Sort.mp4
00:00 -
04. Selection Sort (Code).mp4
00:00 -
05. Insertion Sort.mp4
00:00 -
06. Insertion Sort (Code).mp4
00:00 -
07. Counting Sort.mp4
00:00 -
08. Counting Sort (Code).mp4
00:00 -
09. In-built Sort in C++.mp4
00:00 -
10. Practice Qs.mp4
00:00 -
11. Sorting_Algos Questions.pdf
00:00
13. 2D Arrays
-
00. Topic List.png
00:00 -
01. Introduction to 2D Arrays.mp4
00:00 -
02. Input & Output a 2D Array.mp4
00:00 -
03. 2D Arrays in Memory.mp4
00:00 -
04. Spiral Matrix.mp4
00:00 -
05. Spiral Matrix (Code).mp4
00:00 -
06. Diagonal Sum.mp4
00:00 -
07. Diagonal Sum (Code).mp4
00:00 -
08. Search in Sorted Matrix.mp4
00:00 -
09. Search in Sorted Matrix (Code).mp4
00:00
14.Char Arrays & String
-
00. Topic List.png
00:00 -
01. Revisit Char Data Type.mp4
00:00 -
02. Character Array.mp4
00:00 -
03. Input Char Array.mp4
00:00 -
04. Convert to UpperCase.mp4
00:00 -
05. Reverse a Char Array.mp4
00:00 -
06. Valid Palindrome.mp4
00:00 -
07. cstring Functions.mp4
00:00 -
08. OOPs Intro (for Strings).mp4
00:00 -
09. C++ Strings.mp4
00:00 -
10. for each Loop.mp4
00:00 -
11. String Member Functions.mp4
00:00 -
12. Valid Anagram.mp4
00:00 -
13. Valid Anagram (Code).mp4
00:00 -
14. String_Questions.pdf
00:00 -
15. Strings Ans.pdf
00:00
15.Vectors
-
00. Topic List.png
00:00 -
01. Creating a Dynamic Array.mp4
00:00 -
02. Dynamic Memory Allocation.mp4
00:00 -
03. Static vs Dynamic Allocation.mp4
00:00 -
04. Memory Leak.mp4
00:00 -
05. 2D Dynamic Arrays.mp4
00:00 -
06. What is STL-.mp4
00:00 -
07. Vector Introduction.mp4
00:00 -
08. Vector Implementation in Memory.mp4
00:00 -
09. Pair Sum.mp4
00:00 -
10. 2D Vectors.mp4
00:00 -
11. Practice Qs.mp4
00:00 -
12. Vectors Questions.pdf
00:00 -
13. Vectors Ans.pdf
00:00
16.Bit Manipulation
-
00. Topic List.jpg
00:00 -
01. Bitwise Operators.mp4
00:00 -
02. One’s Complement.mp4
00:00 -
03. Bitwise Shift Operators.mp4
00:00 -
04. Practice Qs.mp4
00:00 -
05. Check if Odd or Even.mp4
00:00 -
06. Get ith Bit.mp4
00:00 -
07. Set ith Bit.mp4
00:00 -
08. Clear ith Bit.mp4
00:00 -
09. Check for Power of 2.mp4
00:00 -
10. Update ith Bit.mp4
00:00 -
11. Clear Last i Bits.mp4
00:00 -
12. Count Set Bits.mp4
00:00 -
13. Fast Exponentiation.mp4
00:00 -
14. Fast Exponentiation (Code).mp4
00:00 -
15. Bit Manipulation Questions.pdf
00:00 -
16. Bit Manipulation Ans.pdf
00:00
17.OOPS (Part 1)
-
00. Topic List.png
00:00 -
00. Topic List.png
00:00 -
01. Classes & Objects.mp4
00:00 -
02. Access Modifiers.mp4
00:00 -
03. Getters & Setters.mp4
00:00 -
04. Encapsulation.mp4
00:00 -
05. Constructor.mp4
00:00 -
06. Practice Qs.mp4
00:00 -
07. Copy Constructor.mp4
00:00 -
08. Shallow & Deep Copy.mp4
00:00 -
09. Destructor.mp4
00:00 -
10. Inheritance.mp4
00:00 -
11. Mode of Inheritance.mp4
00:00 -
12. Single Inheritance.mp4
00:00 -
13. Multi-level Inheritance.mp4
00:00 -
13. OOPS – 2 Questions.pdf
00:00 -
14. Multiple Inheritance.mp4
00:00 -
14. OOPS – 2 Ans.pdf
00:00 -
15. Hierarchical & Hybrid Inheritance.mp4
00:00
18.OOPS (Part 2)
-
00. Topic List.png
00:00 -
01. Polymorphism.mp4
00:00 -
02. Function Overloading.mp4
00:00 -
03. Operator Overloading.mp4
00:00 -
04. Function Overriding.mp4
00:00 -
05. Virtual Functions.mp4
00:00 -
06. Abstraction.mp4
00:00 -
07. Pure Virtual Function.mp4
00:00 -
08. Static Keyword.mp4
00:00 -
09. Static Objects.mp4
00:00 -
10. Friend Functions & Class.mp4
00:00 -
11. Practice Qs.mp4
00:00 -
12. Practice Qs.mp4
00:00 -
13. OOPS – 2 Questions.pdf
00:00 -
14. OOPS – 2 Ans.pdf
00:00
19.Recursion (Part 1)
-
00. Topic List.png
00:00 -
01. What is Recursion-.mp4
00:00 -
02. Dive Deep into Recursion.mp4
00:00 -
03. Recursion in Memory.mp4
00:00 -
04. Numbers in Decreasing Order.mp4
00:00 -
05. Dry Run with Call Stack.mp4
00:00 -
06. Stack Overflow.mp4
00:00 -
07. Sum of N Natural Numbers.mp4
00:00 -
08. Nth Fibonacci.mp4
00:00 -
09. Nth Fibonacci (Code).mp4
00:00 -
10. Check if Array Sorted.mp4
00:00 -
11. First Occurrence.mp4
00:00 -
12. Last Occurrence.mp4
00:00 -
13. Print X to the power N.mp4
00:00 -
14. X to the power N (Code).mp4
00:00
20. Recursion (Part 2)
-
00. Topic List.jpg
00:00 -
01. Tiling Problem.mp4
00:00 -
02. Tiling Problem (Code).mp4
00:00 -
03. Remove Duplicates in String.mp4
00:00 -
04. Remove Duplicates (Code).mp4
00:00 -
05. Friends Pairing Problem.mp4
00:00 -
06. Friends Pairing (Code).mp4
00:00 -
07. Binary String Problem.mp4
00:00 -
08. Binary String (Code).mp4
00:00 -
09. Binary String (Dry Run).mp4
00:00 -
10. Recursion Qs.pdf
00:00 -
11. Recursion Ans.pdf
00:00
21.Divide & Conquer
-
00. Topic List.png
00:00 -
01. Merge Sort Algorithm.mp4
00:00 -
02. Merge _ Combine Step.mp4
00:00 -
03. Merge Sort (Code).mp4
00:00 -
04. Merge Sort (Summary).mp4
00:00 -
05. Quick Sort Algorithm.mp4
00:00 -
06. Quick Sort (Code).mp4
00:00 -
07. Worst Case Time Complexity – Quick Sort.mp4
00:00 -
08. Search in Rotated Sorted Array.mp4
00:00 -
09. Rotated Sorted (Pseudocode).mp4
00:00 -
10. Rotated Sorted (Code).mp4
00:00 -
11. DivideAndConquer Questions.pdf
00:00
22.Time & Space Complexity (Part 1)
-
00. Topic List.jpg
00:00 -
01. Introduction.mp4
00:00 -
02. What is Time Complexity-.mp4
00:00 -
03. Constant Time Complexity.mp4
00:00 -
04. Big O Notation.mp4
00:00 -
05. Big O from Functions.mp4
00:00 -
06. Big O Math Formula (Optional).mp4
00:00 -
07. Other Notations.mp4
00:00 -
08. What is Space Complexity-.mp4
00:00 -
09. Common Time Complexities.mp4
00:00 -
10. Constant & Linear TC.mp4
00:00 -
11. Quadratic TC.mp4
00:00 -
12. Practice Qs 1.mp4
00:00 -
13. Practice Qs 2.mp4
00:00 -
14. Practice Qs 3.mp4
00:00 -
15. Bubble Sort Analysis.mp4
00:00 -
16. Understanding Log.pdf
00:00 -
17. Logarithmic TC (Binary Search Analysis).mp4
00:00 -
18. O(n) vs O(logn) – Linear vs Log.mp4
00:00
23.Time & Space Complexity (Part 2)
-
00. Topic List.jpg
00:00 -
01. Recursion Time Complexity.mp4
00:00 -
02. Recursive Sum of N Numbers.mp4
00:00 -
03. Recursive Factorial of N.mp4
00:00 -
04. Recursive Nth Fibonacci.mp4
00:00 -
05. Masters Theorem.pdf
00:00 -
06. Merge Sort Analysis.mp4
00:00 -
07. Power Function Analysis.mp4
00:00 -
08. Practice Qs.mp4
00:00 -
09. How to approach Coding Qs-.mp4
00:00 -
10. TIME COMPLEXITY Questions.pdf
00:00 -
11. TIME COMPLEXITY Solutions.pdf
00:00
24.Backtracking
-
00. Topic List.png
00:00 -
01. Introduction.mp4
00:00 -
02. Backtracking on Arrays.mp4
00:00 -
03. Find Subsets.mp4
00:00 -
04. Find Subsets (Code).mp4
00:00 -
05. Find Permutations.mp4
00:00 -
06. Find Permutations (Code).mp4
00:00 -
07. N Queens Qs Discussion.mp4
00:00 -
08. N Queens (Approach).mp4
00:00 -
09. isSafe in N Queens (Approach).mp4
00:00 -
10. N Queens (Time Complexity).mp4
00:00 -
11. N Queens Variations.mp4
00:00 -
12. Grid Ways.mp4
00:00 -
13. Grid Ways (Code).mp4
00:00 -
14. Grid Ways (Dry Run).mp4
00:00 -
15. Grid Ways (Time Complexity).mp4
00:00 -
16. Grid Ways (Optimization).mp4
00:00 -
17. Sudoku Solver.mp4
00:00 -
18. Sudoku Solver (Code).mp4
00:00 -
19. isSafe in Sudoku Solver.mp4
00:00 -
20. BACKTRACKING Questions.pdf
00:00 -
21. Backtracking Solutions.pdf
00:00
25.Linked List (Part 1)
-
00. Topic List.png
00:00 -
01. Introduction to Linked List.mp4
00:00 -
02. LL Implementation.mp4
00:00 -
03. Push Front in LL.mp4
00:00 -
04. Push Back in LL.mp4
00:00 -
05. Print LL.mp4
00:00 -
06. Insert in Middle of a LL.mp4
00:00 -
07. Deleting the Linked List.mp4
00:00 -
08. Pop Front in LL.mp4
00:00 -
09. Pop Back in LL.mp4
00:00 -
10. Iterative Search in LL.mp4
00:00 -
11. Recursive Search in LL.mp4
00:00 -
12. Reverse a Linked List.mp4
00:00 -
13. Find & Remove Nth Node from End.mp4
00:00 -
14. Find & Remove Nth (Code).mp4
00:00 -
15. Self Practice Qs.pdf
00:00
26.Linked List (Part 2)
-
00. Topic List.png
00:00 -
01. Detect Cycle in a LL.mp4
00:00 -
02. Detect a Cycle (Code).mp4
00:00 -
03. Removing Cycle in LL.mp4
00:00 -
04. Removing Cycle (Code).mp4
00:00 -
05. Removing Cycle (Math Proof).mp4
00:00 -
06. List in STL.mp4
00:00 -
07. Merge Sort on a LL.mp4
00:00 -
08. Merge Sort (Split At Mid).mp4
00:00 -
09. Merging 2 Sorted Lists.mp4
00:00 -
10. Zig Zag Linked List.mp4
00:00 -
11. Zig Zag LL (Alternate Merging).mp4
00:00 -
12. Doubly Linked List (Push Front).mp4
00:00 -
13. Doubly Linked List (Pop Front).mp4
00:00 -
14. Linked List Questions.pdf
00:00
27.Stacks (Part 1)
-
00. Topic List.png
00:00 -
01. Introduction to Stack.mp4
00:00 -
02. Stack using Vector.mp4
00:00 -
03. Stack using Vector & Class Template.mp4
00:00 -
04. Stack using LinkedList.mp4
00:00 -
05. Stack in STL.mp4
00:00 -
06. Push at Bottom of Stack.mp4
00:00 -
07. Push at Bottom (Code).mp4
00:00 -
08. Reverse a String using Stack.mp4
00:00 -
09. Reverse a Stack.mp4
00:00 -
10. Stock Span.mp4
00:00 -
11. Stock Span (Approach).mp4
00:00 -
12. Stock Span (Code).mp4
00:00
28.Stacks (Part 2)
-
00. Topic List.png
00:00 -
01. Next Greater Element.mp4
00:00 -
02. Next Greater Element (Code).mp4
00:00 -
03. Valid Parentheses.mp4
00:00 -
04. Valid Parentheses (Code).mp4
00:00 -
05. Duplicate Parentheses.mp4
00:00 -
06. Duplicate Parentheses (Code).mp4
00:00 -
07. Max Area in Histogram.mp4
00:00 -
08. Max Area in Histogram (nextSmaller Logic).mp4
00:00 -
09. Max Area in Histogram (Code).mp4
00:00 -
10. Stacks Questions.pdf
00:00
29.Queue
-
07. First non-repeating letter.mp4
00:00 -
08. First non-repeating letter (Code).mp4
00:00 -
09. Interleave 2 Queues.mp4
00:00 -
10. Interleave 2 Queues (Code).mp4
00:00 -
11. Queue Reversal.mp4
00:00 -
12. Double Ended Queue.mp4
00:00 -
13. Queue using Deque.mp4
00:00 -
14. Stack using Deque.mp4
00:00 -
15. Queue Questions.pdf
00:00 -
00. Topic List.png
00:00 -
01. Queue Introduction.mp4
00:00 -
02. Implementation using LinkedList.mp4
00:00 -
03. Circular Queue using Array.mp4
00:00 -
04. Queue in STL.mp4
00:00 -
05. Queue using 2 Stacks.mp4
00:00 -
06. Stack using 2 Queues.mp4
00:00
30.Greedy Algorithms
-
00. Topic List.png
00:00 -
01. Greedy Approach Introduction.mp4
00:00 -
02. Activity Selection Problem.mp4
00:00 -
03. Activity Selection (Approach).mp4
00:00 -
04. Activity Selection (Code).mp4
00:00 -
05. Activity Selection (Proof).mp4
00:00 -
06. Pairs in C++.mp4
00:00 -
07. Fractional Knapsack.mp4
00:00 -
08. Fractional Knapsack (Code).mp4
00:00 -
09. Min Absolute Difference of Pairs.mp4
00:00 -
10. Max Chain Length.mp4
00:00 -
11. Max Chain Length (Code).mp4
00:00 -
12. Indian Coins.mp4
00:00 -
13. Indian Coins (Code).mp4
00:00 -
14. Job Sequencing Problem.mp4
00:00 -
15. Job Sequencing Variation.mp4
00:00 -
16. Greedy Questions.pdf
00:00 -
17. Greedy Solutions.pdf
00:00
31.Binary Trees (Part 1)
-
00. Topic List.png
00:00 -
01. Binary Trees Introduction.mp4
00:00 -
02. Levels & Subtrees.mp4
00:00 -
03. Practice Quiz.mp4
00:00 -
04. Build Tree from Preorder.mp4
00:00 -
05. Preorder Traversal.mp4
00:00 -
06. Inorder Traversal.mp4
00:00 -
07. Postorder Traversal.mp4
00:00 -
08. Level Order Traversal.mp4
00:00 -
09. Height of Binary Tree.mp4
00:00 -
10. Height of BT (Code).mp4
00:00 -
11. Count of Nodes in BT.mp4
00:00 -
12. Sum of Nodes in BT.mp4
00:00
32. Binary Trees (Part 2)
-
00. Topic List.png
00:00 -
01. Diameter of a Tree ( Approach 1 ).mp4
00:00 -
02. Diameter of a Tree ( Code ).mp4
00:00 -
03. Diameter of a Tree ( Approach 2 ).mp4
00:00 -
04. Diameter of a Tree ( Code 2 ).mp4
00:00 -
05. Subtree of another Tree.mp4
00:00 -
06. Subtree of another Tree (isIdentical).mp4
00:00 -
07. Map in C++.mp4
00:00 -
08. Top View of a Tree (Horizontal Distance).mp4
00:00 -
09. Top View of a Tree ( Approach ).mp4
00:00 -
10. Top View of a Tree ( Code ).mp4
00:00
33. Binary Trees (Part 3)
-
00. Topic List.png
00:00 -
01. Kth Level of a Tree.mp4
00:00 -
02. Lowest Common Ancestor.mp4
00:00 -
03. Lowest Common Ancestor (Code).mp4
00:00 -
04. LCA (Approach 2).mp4
00:00 -
05. LCA (Approach 2) Code.mp4
00:00 -
06. Min Distance between Nodes.mp4
00:00 -
07. Kth Ancestor of a Node.mp4
00:00 -
08. Kth Ancestor (Code).mp4
00:00 -
09. Transform to Sum Tree.mp4
00:00 -
10. Binary Trees Questions.pdf
00:00 -
11. Binary Trees Ans.pdf
00:00
34. BST (Part 1)
-
00. Topic List.png
00:00 -
01. BST Introduction.mp4
00:00 -
02. Search in BST.mp4
00:00 -
03. Insert & Build a BST.mp4
00:00 -
04. Search in BST (Code).mp4
00:00 -
05. Delete a Node in BST.mp4
00:00 -
06. Inorder Successor.mp4
00:00 -
07. Delete a Node (Code).mp4
00:00 -
08. Print in Range.mp4
00:00 -
09. Root to Leaf Path.mp4
00:00 -
10. Validate BST.mp4
00:00 -
11. Validate BST (Code).mp4
00:00
35. BST (Part 2)
-
00. Topic List.png
00:00 -
01. Sorted Array to Balanced BST.mp4
00:00 -
02. Sorted Array to Balanced BST (Code).mp4
00:00 -
03. BST to Balanced BST.mp4
00:00 -
04. BST to Balanced BST (Code).mp4
00:00 -
05. Largest BST in BT.mp4
00:00 -
06. Largest BST in BT (Code).mp4
00:00 -
07. Merge 2 BSTs.mp4
00:00 -
08. BST Questions Cpp.pdf
00:00 -
09. BST Ans Cpp.pdf
00:00 -
10. Self Practice.pdf
00:00
36. Heaps (Part 1)
-
00. Topic List.png
00:00 -
01. Heaps & Priority Queue (Introduction).mp4
00:00 -
02. PQ in C++ STL.mp4
00:00 -
03. What are Heaps-.mp4
00:00 -
04. Building Heaps.mp4
00:00 -
05. Push in Heap.mp4
00:00 -
06. Push in Heap (Code).mp4
00:00 -
07. Pop in Heap.mp4
00:00 -
08. Pop in Heap (Code).mp4
00:00 -
09. Pop in Heap (Dry Run).mp4
00:00 -
10. PQ for Objects.mp4
00:00 -
11. PQ for Pairs.mp4
00:00
37. Heaps (Part 2)
-
04. MCM Code (Recursion).mp4
00:00 -
05. MCM (Memoization).mp4
00:00 -
06. MCM (Tabulation).mp4
00:00 -
07. MCM Code (Tabulation).mp4
00:00 -
08. Minimum Partitioning.mp4
00:00 -
09. Minimum Partitioning (Code).mp4
00:00 -
10. DP Questions.pdf
00:00 -
00. Topic List.png
00:00 -
01. Segment Trees Introduction.mp4
00:00 -
02. Meaning & Count of Nodes.mp4
00:00 -
03. Creating Segment Tree.MP4
00:00
38. Hashing (Part 1)
-
00. Topic List.png
00:00 -
01. Heap Sort (Building maxHeap).mp4
00:00 -
02. Heap Sort (Sorting).mp4
00:00 -
03. Nearby Cars.mp4
00:00 -
04. Nearby Cars (Code).mp4
00:00 -
05. Connect N Ropes.mp4
00:00 -
06. Connect N Ropes (Code).mp4
00:00 -
07. Weakest Soldier.mp4
00:00 -
08. Weakest Soldier (Code).mp4
00:00 -
09. Sliding Window Maximum.mp4
00:00 -
10. Sliding Window Maximum (Code).mp4
00:00 -
00. Topic List.png
00:00 -
01. Introduction.mp4
00:00 -
02. Hash Table Data Structure.mp4
00:00
39. Hashing (Part 2)
-
03. Hashing (Hash Function).mp4
00:00 -
04. Collisions.mp4
00:00 -
05. Building Hash Table.mp4
00:00 -
06. Insert in Hash Table.mp4
00:00 -
07. Rehashing.mp4
00:00 -
08. Search in Hash Table.mp4
00:00 -
09. STL Containers.mp4
00:00 -
10. Unordered Maps.mp4
00:00 -
11. Maps.mp4
00:00 -
12. Unordered Sets.mp4
00:00 -
13. Sets.mp4
00:00 -
00. Topic List.png
00:00 -
01. Majority Element.mp4
00:00 -
02. Majority Element (Code).mp4
00:00
40. Tries
-
03. Valid Anagram.mp4
00:00 -
04. Valid Anagram (Code).mp4
00:00 -
05. Count Distinct.mp4
00:00 -
06. Union & Intersection.mp4
00:00 -
07. Itinerary from Tickets.mp4
00:00 -
08. Itinerary from Tickets (Code).mp4
00:00 -
09. Zero Sum Largest Subarray.mp4
00:00 -
10. Zero Sum Largest Subarray (Code).mp4
00:00 -
11. K Sum Subarray Count.mp4
00:00 -
12. K Sum Subarray Count (Code).mp4
00:00 -
13. Hashing Questions final.pdf
00:00 -
00. Topic List.png
00:00 -
01. Tries Introduction.mp4
00:00 -
02. Search in Trie.mp4
00:00 -
03. Building a Trie DS.mp4
00:00 -
04. Insert in Trie.mp4
00:00
41. Graphs (Part 1)
-
05. Search in Trie.mp4
00:00 -
06. Word Break Problem.mp4
00:00 -
07. Word Break (Code).mp4
00:00 -
08. Prefix Problem.mp4
00:00 -
09. Prefix (Code).mp4
00:00 -
10. StartsWith Problem.mp4
00:00 -
11. Count Unique Substrings.mp4
00:00 -
12. Count Unique Substrings (Code).mp4
00:00 -
13. Longest Word with all Prefix.mp4
00:00 -
14. Longest Word (Code).mp4
00:00 -
15. Tries Questions.pdf
00:00 -
00. Topic List.png
00:00
42. Graphs (Part 2)
-
06. LCS (Memoization).mp4
00:00 -
07. LCS (Tabulation).mp4
00:00 -
00. Topic List.png
00:00 -
01. Longest Common Substring.mp4
00:00 -
02. Longest Common Substring (Code).mp4
00:00 -
03. Longest Increasing Subsequence.mp4
00:00 -
04. Longest Increasing Subsequence (Code).mp4
00:00 -
05. Edit Distance.mp4
00:00 -
06. Edit Distance (Code).mp4
00:00 -
00. Topic List.png
00:00 -
01. WildCard Matching.mp4
00:00 -
02. WildCard Matching (Bottom Up).mp4
00:00 -
03. Catalan’s Number.mp4
00:00
43. Graphs (Part 3)
-
01. Introduction to Graphs.mp4
00:00 -
02. Types of Graphs.mp4
00:00 -
03. Graph using Adjacency List.mp4
00:00 -
04. Graph using Adjacency Matrix.mp4
00:00 -
05. Edge List & Implicit Graph.mp4
00:00 -
06. Building a Graph (Adjacency List).mp4
00:00 -
07. Breadth First Traversal (BFS).mp4
00:00 -
08. BFS Code.mp4
00:00 -
09. Depth First Traversal (DFS).mp4
00:00 -
10. DFS Code.mp4
00:00
44. Graphs (Part 4)
-
03. MCM (with Recursion).mp4
00:00 -
04. Nth Catalan (Recursion).mp4
00:00 -
05. Nth Catalan (Memoization).mp4
00:00 -
06. Nth Catalan (Tabulation).mp4
00:00 -
07. Count BSTs from Nodes.mp4
00:00 -
08. Mountain Ranges.mp4
00:00 -
09. Catalan Variations & Applications.pdf
00:00 -
00. Topic List.png
00:00 -
01. Matrix Concepts (Basic Math).mp4
00:00 -
02. Matrix Chain Multiplication.mp4
00:00
45. Graphs (Part 5)
-
07. Cycle Detection Code (Directed).mp4
00:00 -
08. Cycle Detection Dry Run (Directed).mp4
00:00 -
09. Bipartite Graph.mp4
00:00 -
10. Bipartite Graph (Code).mp4
00:00 -
11. Bipartite Graph (Approach 2).mp4
00:00 -
12. All Paths Problem.mp4
00:00 -
00. Topic List.png
00:00 -
01. What is Topological Sorting-.mp4
00:00 -
02. Topological Sorting (DFS).mp4
00:00 -
03. Topological Sorting Code (DFS).mp4
00:00
46. Dynamic Programming (DP Part 1)
-
04. Course Schedule I.mp4
00:00 -
05. Course Schedule II.mp4
00:00 -
06. Kahn’s Algorithm (Indegree).mp4
00:00 -
07. Topoplogical Sorting (Kahn’s Algorithm).mp4
00:00 -
08. Kahn’s Algorithm Code.mp4
00:00 -
09. Kahn’s Algo for Cycle Detection.mp4
00:00 -
00. Topic List.png
00:00 -
01. Dijkstra’s Algorithm (Edge Relaxation).mp4
00:00 -
02. Dijkstra’s Algorithm (Approach).mp4
00:00 -
03. Dijkstra’s Algorithm (Code).mp4
00:00 -
04. BellmanFord Algorithm (Approach).mp4
00:00 -
05. BellmanFord Algorithm (Code).mp4
00:00
47. DP (Part 2)
-
11. Has Path Problem.mp4
00:00 -
00. Topic List.png
00:00 -
01. Disconnected Components.mp4
00:00 -
02. Cycle in Graphs.mp4
00:00 -
03. Cycle Detection (Undirected).mp4
00:00 -
04. Cycle Detection Code (Undirected).mp4
00:00 -
05. Undirected approach for Directed.mp4
00:00 -
06. Cycle Detection (Directed).mp4
00:00
48. DP (Part 3)
-
06. What is MST-.mp4
00:00 -
07. Prim’s Algorithm.mp4
00:00 -
08. Prim’s Algorithm (Code).mp4
00:00 -
09. Min Cost to Connect Points.mp4
00:00 -
00. Topic List.png
00:00 -
01. Cheapest Flights within K Stops.mp4
00:00 -
02. Cheapest Flights (Code).mp4
00:00 -
03. Disjoint Set (Union Find).mp4
00:00
49. DP (Part 4)
-
04. Disjoint Set (Code).mp4
00:00 -
05. Kruskal’s Algorithm.mp4
00:00 -
06. Kruskal’s Algorithm (Code).mp4
00:00 -
07. Flood Fill Algorithm.mp4
00:00 -
08. Flood Fill (Code).mp4
00:00 -
09. Graphs Questions.pdf
00:00 -
00. Topic List.png
00:00
50. DP (Part 5)
-
04. Creating Segment Tree (Approach).MP4
00:00 -
05. Creating Segment Tree (Code).MP4
00:00 -
06. Queries on Segment Tree.mp4
00:00 -
07. Queries on Segment Tree (Code).mp4
00:00 -
08. Update on Segment Tree.mp4
00:00 -
09. Update on Segment Tree (Code).mp4
00:00 -
10. Range Max ST (Creation).mp4
00:00 -
11. Range Max ST (Query).mp4
00:00 -
12. Range Max ST (Update).mp4
00:00 -
13. Range Min (Approach).mp4
00:00
51. DP (Part 6)
-
01. DP Introduction.mp4
00:00 -
02. DP using Fibonacci Concept.mp4
00:00 -
03. What is DP-.mp4
00:00 -
04. Fibonacci using Tabulation.mp4
00:00 -
05. Types of DP.mp4
00:00 -
06. Important DP Concepts.mp4
00:00 -
07. Climbing Stairs (Recursion).mp4
00:00 -
08. Climbing Stairs (Memoization).mp4
00:00 -
09. Climbing Stairs (Tabulation).mp4
00:00 -
10. Variation of Climbing Stairs.mp4
00:00 -
Join Our Course telegram channel.pdf
00:00
52. Segment Trees
-
00. Topic Li.png
00:00 -
01. Knapsack Problems.mp4
00:00 -
02. 0-1 Knapsack.mp4
00:00 -
03. 0-1 Knapsack (Recursion Code).mp4
00:00 -
04. 0-1 Knapsack (Memoization).mp4
00:00 -
05. 0-1 Knapsack (Tabulation).mp4
00:00 -
06. Target Sum Subset.mp4
00:00 -
07. Unbounded Knapsack.mp4
00:00 -
00. Topic List.png
00:00 -
01. Coin Change Problem.mp4
00:00 -
02. Coin Change (Code).mp4
00:00 -
03. Rod Cutting Problem.mp4
00:00 -
04. Rod Cutting (Code).mp4
00:00 -
05. Longest Common Subsequence.mp4
00:00
Earn a certificate
Add this certificate to your resume to demonstrate your skills & increase your chances of getting noticed.
