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