C++ Full Course | C++ Tutorial | Data Structures & Algorithms
4.0
(0)
10 learners
What you'll learn
This course includes
- 61.5 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 222 lessons • 61.5 hours of video
C++ Full Course | C++ Tutorial | Data Structures & Algorithms
222 lessons
• 44 hours
C++ Full Course | C++ Tutorial | Data Structures & Algorithms
222 lessons
• 44 hours
- 1. Introduction to C++ | Data Structures and Algorithms | College Placement Course | Lecture 1 26:03
- DSA Complete Series 🚀 : Data Structures & Algorithms | by Shradha Khapra Ma'am 05:53
- VS Code Installation for C++ in Windows | Step by step process explanation 10:15
- 2.1 Data Types & Type Modifiers | Data Structures & Algorithms Course in C++ | Lecture 2.1 11:09
- 2.2 Input/Output in C++ | Data Structures and Algorithm Course in C++ | Lecture 2.2 08:42
- 2.3 If/else statement in C++ programming | Data Structure and Algorithm Course | Lecture 2.3 07:51
- 2.4 Introduction to Loops in C++ programming | Guaranteed Placement Course | Lecture 2.4 09:38
- 3.1 Break and Continue statement in C++ Programming | Guaranteed Placement Course | Lecture 3.1 09:32
- 3.2 Switch-Case statement in C++ Programming | Guaranteed Placement Course | Lecture 3.2 06:58
- 3.3 Operators in C++ Programming | Guaranteed Placement Course | 3.3 29:58
- 4.1 Awesome Pattern Questions -1 | Guaranteed Placement Course 23:37
- 4.2 Advanced Pattern Questions in C++ | Guaranteed Placement Course | Lecture 4.2 28:08
- 5.1 Binary Number System | Guaranteed Placement Course | Lecture 5.1 08:45
- 5.2 How to reverse a number | Check if a number is Prime or Armstrong | C++ Placement Course | # 5.2 10:45
- 6.1 Functions in C++ | Guaranteed Placement Course 08:11
- 6.2 Functions Challenges | C++ Guaranteed Course | Lecture 6.2 13:13
- 6.3 Advanced Placement Questions on Functions | C++ Placement Course 32:15
- 7.1 Time Complexity | C++ Placement Course 30:45
- 8.1 Introduction to Arrays in C++ | Guaranteed Placement Course 12:32
- 8.2 Searching in Arrays | Linear and Binary Search | C++ Placement Course | 13:26
- 8.3.1 Sorting in Arrays | Selection Sort | C++ Placement Course 08:32
- 8.3.2 Bubble Sort | Sorting in C++ | Guaranteed Placement Course 06:46
- 8.3.3 Insertion Sort | Sorting Algorithms | C++ Placement Course | 09:37
- 8.4 Array Challenges | C++ Placement Course 39:41
- 8.5 Arrays - Q's asked by Top MNC's | C++ Placement Course 23:51
- 8.6 Subarrays - Challenges | Questions asked by Top MNC's | C++ Placement Course 32:18
- 9.1 Two Dimensional Arrays | 2D Arrays | C++ Placement Course 21:24
- 9.2 "2D Array" Challenges | Asked by Top MNC's | C++ Placement Course 24:03
- 10. Character Arrays | C++ Placement Course 12:53
- 11. Pointers in C++ | Guaranteed Placement Course 19:03
- 12. Stack & Heap | C++ Placement Course 11:02
- 13. Strings in C++ | Guaranteed Placement Course | Lecture 13 23:40
- 13.2 Strings Challenges | C++ Placement Course 11:52
- 14.1 BIT Manipulation in 11 minutes | C++ Placement Course 10:46
- 14.2 BIT Manipulation Challenges | C++ Placement Course 15:30
- 14.3 BIT Manipulation | Challenges - Part 2 | Questions asked by Top MNC's 20:08
- 15.1 Sieve of Eratosthenes | Challenge | C++ Placement Course 10:47
- 15.2 Inclusion- Exclusion Principle | GCD | C++ Placement Course 07:07
- 16.1 Recursion - Introduction | C++ Placement Course 23:51
- 16.2 Recursion - Challenges | C++ Placement Course 17:40
- 7 Best Problems on Recursion | Recursion in C++ | Placement Course | Lec 16.3 34:05
- Advanced Recursion Problems | C++ Placement Course | Lecture 16.4 16:29
- Recursion | Last Lecture on Advanced Problems | Lecture 16.4 19:23
- Backtracking - Rat in a Maze | C++ Placement Course | Lecture 18.1 18:27
- Permutation - Return all possible permutations | C++ Placement Course | Lecture 17 14:39
- N-Queen Problem - Backtracking | C++ Placement Course - 18.2 17:14
- Merge Sort | Code and Explanation | C++ Course - 19.1 17:10
- Quick Sort | Code and Explanation | C++ Course - 19.2 15:24
- Vectors and Pair | C++ Course - 19 15:30
- Count Sort | C++ Placement Course | Lecture 20.1 11:18
- DNF Sort | C++ Placement Course | Lecture 20.2 08:33
- Wave Sort | C++ Placement Course - 20.3 07:30
- Count Inversion - Merge Sort | C++ Placement Course - 19.3 09:07
- Object Oriented Programming in C++ | Important Concept | Lecture 21.1 21:29
- Inheritance in OOP's | C++ Placement Course | Lecture 21.3 08:45
- Polymorphism in Object Oriented Programming | C++ Placement Course Lecture 21.4 10:09
- Introduction to Linked List | C++ Placement Course | Lecture 22 15:17
- Deletion in Linked List | C++ Placement Course | Lecture 22.2 06:22
- Reverse a Linked List | C++ Placement Course | Lecture 22.3 09:03
- Reverse K Nodes in a Linked List | C++ Placement Course | Lecture 22.4 06:43
- Detection and Removal of Cycle in Linked List | Lecture 22.5 14:11
- Doubly Linked List | Data Structures & Algorithms | C++ Placement Course | Lecture 22.6 12:01
- Append Last K Nodes of a Linked List | C++ Placement Course | Lecture 22.7 06:07
- Find Intersection point of 2 Linked List | Lecture 22.8 08:30
- Merge 2 Sorted Linked List | C++ Placement Course | Lecture 22.9 09:02
- Circular Linked List - C++ Placement Course | Lecture 22.10 13:22
- Put Even Position Nodes after Odd Position Nodes | C++ Placement Course | Lecture 22.11 06:14
- 2021 - Top 5 Programming Language for College Students 2021 09:28
- Time Complexity using Masters Theorem | C++ Placement Course | Lecture 16.5 06:55
- Stack Data Structure - Introduction | C++ Placement Course | Lecture 23.1 10:14
- Reverse a Sentence using Stacks | Stack Challenge | C++ Placement Course | Lecture 23.2 05:38
- Reverse a Stack | C++ Placement Course | Lecture 23.3 08:21
- Introduction to Prefix, Infix and Postfix | C++ Placement Course | Lecture 23.4 11:21
- Prefix Expression Evaluation | C++ Placement Course | Lecture 23.5 06:39
- Postfix Expression Evaluation | C++ Placement Course | Lecture 23.6 08:24
- Infix to Postfix - Stack Challenges | C++ Placement Course | Lecture 23.7 07:48
- Infix to Prefix | C++ Placement Course | Lecture 23.8 09:59
- Balanced Parenthesis | C++ Placement Course | Lecture 23.9 07:45
- Introduction to Queue Data Structure | C++ Placement Course | Lecture 24.1 11:42
- Linked List Implementation of Queues | C++ Placement Course | Lecture 24.2 06:17
- Queue using Stack | C++ Placement Course | Lecture 24.3 07:57
- Stack using Queue | C++ Placement Course | Lecture 24.4 07:40
- Stacking using Queues (Method 2) | C++ Placement Course | Lecture 24.4.2 07:21
- Sliding Window Maximum using Deque | C++ Placement Course | Lecture 25.1 09:40
- Largest Rectangle Code | C++ Placement Course | Lecture 25.2 05:11
- Trapping Rainwater | C++ Placement Course | Lecture 25.3 04:52
- Redundant Parenthesis | C++ Placement Course | Lecture 25.4 05:07
- The Stock Span Problem | C++ Placement Course | Lecture 25.5 05:29
- Two Pointers | Three Sum Problem | C++ Placement Course | Lecture 26.1 06:29
- Max Consecutive Ones | C++ Placement Course | Lecture 26.2 07:37
- Longest substring without repeating characters | C++ Placement Course | Lecture 26.3 06:31
- Binary Tree Introduction | C++ Placement Course | Lecture 27.1 09:43
- Binary Tree Traversals| Preorder, Inorder, Postorder Traversal | C++ Placement Course | Lecture 27.2 15:59
- Build Tree from Preorder and Inorder | C++ Placement Course | Lecture 27.3 15:40
- Build Tree Postorder and Inorder | C++ Placement Course | Lecture 27.4 16:33
- Level Order Traversal , Sum at Kth Level In Binary Tree | C++ Placement Course | Lecture 27.5 12:15
- Count and Sum of Nodes | C++ Placement Course | Lecture 27.6 04:31
- Height and Diameter in Binary Tree | C++ Placement Course | Lecture 27.7 11:49
- Sum Replacement in Binary Tree | C++ Placement Course | Lecture 27.8 08:47
- Height Balanced Binary Tree | C++ Placement Course | Lecture 27.9 15:46
- Right View of Binary Tree | C++ Placement Course | Lecture 27.10 07:23
- Left View of Binary Trees | C++ Placement Course | Lecture 27.11 07:30
- Shortest Distance between 2 Nodes | C++ Placement Course | Lecture 27.12 11:41
- Flatten a Binary Tree | C++ Placement Course | Lecture 27.13 11:37
- Nodes at Distance K in Binary Tree | C++ Placement Course | Lecture 27.14 15:11
- Lowest Common Ancestor in Binary Tree | C++ Placement Course | Lecture 27.15 20:45
- Max Sum Path from One Node to Another in Binary Tree | C++ Placement Course | Lecture 27.16 15:19
- Binary Search Trees | Introduction & Build | C++ Placement Course | Lecture 28.1 15:00
- Search and Delete in Binary Search Tree | C++ Placement Course | Lecture 28.2 25:29
- Construct Binary Search Tree from Preorder | C++ Placement Course | Lecture 28.3 16:40
- Check for Binary Search Tree | C++ Placement Course | Lecture 28.4 13:46
- Build Balanced BST from Sorted Array | C++ Placement Course | Lecture 28.5 11:30
- Catalan Numbers Application | C++ Placement Course | Lecture 28.6 26:45
- Zig Zag Traversal Binary Search Tree | C++ Placement Course | Lecture 28.7 18:31
- Identical Binary Search Tree | C++ Placement Course | Lecture 28.8 16:09
- Largest Binary Search Tree in BT | C++ Placement Course | Lecture 28.10 23:28
- Recover Binary Search Tree | C++ Placement Course | Lecture 28.11 20:49
- Set & Multiset | Standard Template Library | C++ Placement Course | Lecture 28.12 12:18
- Place Elements to Maximise Minimum Distance | C++ Placement Course | Lecture 29.1 15:49
- Page Allocation Problem | C++ Placement Course | Lecture 29.2 18:18
- Painters Partition Problem | C++ Placement Course | Lecture 29.3 14:04
- Search in Sorted & Rotated Array | C++ Placement Course | Lecture 29.4 11:50
- Find the Peak Element | C++ Placement Course | Lecture 29.5 10:11
- Max Sum Subarray | Sliding Window Challenge | C++ Placement Course | Lecture 30.1 14:10
- Minimum Subarray Size | Sliding Window Challenge | C++ Placement Course | Lecture 30.2 18:14
- Form Number Divisible by 3 | Sliding Window Challenge | C++ Placement Course | Lecture 30.3 14:31
- Subarray with Palindromic Concatenation | C++ Placement Course | Lecture 30.4 15:24
- Perfect Numbers in Subarrays | C++ Placement Course | Lecture 30.5 17:07
- Heap Intro Final Export for Upload 03:55
- HeapsSort | C++ Placement Course | Lecture 31.2 08:20
- Heap STL | C++ Placement Course | Lecture 31.3 04:02
- Heaps - Median of Running Stream | C++ Placement Course | Lecture 31.4 10:26
- Heaps - Merge K sorted Arrays | C++ Placement Course 09:43
- Heap -Smallest Sequence with sum K | C++ Placement Course | Lecture 31.6 06:01
- Hashing - Introduction to Hasing | C++ Placement Coure | Lecture 32.1 04:47
- Hashing STL - C++ Placement Course | Lecture 32.2 03:26
- Hashing - Count frequency of elements | C++ Placement Course | Lecture 32.3 04:07
- Hashing - Vertical Order Print | C++ Placement Course | Lecture 32.4 10:36
- Hashing - Number of Subarrays with Sum Zero | C++ Placement Course | Lec 32.5 07:51
- Hashing - Sliding Window Technique | C++ Placement Course 06:09
- Hashing - TOP K MOST FREQUENT ELEMENTS | C++ Placement Course | Lecture 32.7 08:17
- Sudoku Solver - Hashing | C++ Placement Course | Lecture 32.8 11:34
- Greedy Algorithm - Introduction | C++ Placement Course Lecture 33.1 03:03
- Indian Coin Change - Greedy Algorithm | C++ Placement Course | Lecture 33.2 05:52
- Activity Selection Problem - Greedy Algorithm | C++ Placement Course | Lecture 33.3 08:38
- Fractional Knapsack - Greedy Algorithm | C++ Placement Course | Lecture 33.4 07:41
- Optimal Pattern Merge - Greedy Algorithm | C++ Placement Course | Lecture 33.5 05:58
- Expedi - Greedy Algorithm | C++ Placement Course | Lecture 33.6 22:25
- Maximum and Minimum Difference - Greedy Algorithm | C++ Placement Course | Lecture 33.7 09:36
- Graphs - Introduction | C++ Placement Course | Lecture 34.1 07:23
- Dynamic Programming - Introduction | C++ Placement Course | Lecture 35.1 07:22
- Graph Terminologies | C++ Placement Course | Lecture 34.2 08:25
- Graphs - Representation | C++ Placement Course | Lecture 34.3 09:30
- BFS - Breadth First Search | C++ Placement Course | Lecture 34.4 04:19
- DFS - Depth First Search | C++ Placement Course | Lecture 34.5 05:02
- Graphs - Topological Sort | C++ Placement Course | Lecture 34.6 11:38
- Cycle Detection in Undirected Graphs | C++ Placement Course | Lecture 34.7 06:53
- Cycle Detection in Directed Graph | C++ Placement Course | Lecture 34.8 06:34
- Connected Components | C++ Placement Course | Lecture 34.9 10:31
- Bipartite Graph - C++ Placement Course | Lecture 34.10 08:15
- Disjoint Set Union - Graphs | C++ Placement Course | Lecture 34.11 09:40
- Cycle Detection in Undirected Graph using DSU | C++ Placement Course | Lecture 34.12 08:37
- Cycle Detection in Undirected Graph using DSU | C++ Placement Course | Lecture 34.12 08:37
- Kruskal's Algorithm | C++ Placement Course | Lecture 34.13 07:52
- Prims Algorithm | C++ Placement Course | Lecture 34.14 08:19
- Dijkstra's Algorithm | C++ Placement Course | Lecture 34.15 09:12
- Bellman Ford Algorithm | C++ Placement Course | Lecture 34.16 07:28
- Floyd Warshall Algorithm | C++ Placement Course | Lecture 34.17 07:10
- Snakes and Ladders - Graphs | C++ Placement Course | Lecture 34.18 11:11
- Graphs - Surrounded Region | C++ Placement Course | Lecture 34.19 07:23
- Fibonacci Sequence - Dynamic Programming | C++ Placement Course | Lecture 35.2 06:28
- Minimum Number of Squares - Dynamic Programming | C++ Placement Course | Lecture 35.3 10:17
- Coin Change Problem - Dynamic Programming | C++ Placement Course | Lecture 35.4 20:57
- 01 Knapsack - Dynamic Programming | C++ Placement Course | Lecture 35.7 12:08
- Longest Increasing Subsequence - Dynamic Programming | C++ Placement Course | Lecture 35.8 11:03
- Longest Common Subsequence - Dynamic Programming | C++ Placement Course | Lecture 35.9 13:20
- Matrix Chain Multiplication - Dynamic Programming | C++ Placement Course | Lecture 35.10 16:16
- Minimum Jumps to Reach End - Dynamic Programming | C++ Placement Course | Lecture 35.11 07:42
- Optimal Game Strategy - Dynamic Programming | C++ Placement Course | Lecture 35.12 07:14
- Number of Subsequences - Dynamic Programming | C++ Placement Course | Lecture 35.13 10:03
- Count Number of Binary Strings - Dynamic Programming | C++ Placement Course | Lecture 35.14 08:44
- 0-N Knapsack - Dynamic Programming | C++ Placement Course | Lecture 35.15 07:12
- Kadane Algorithm - Dynamic Programming | C++ Placement Course | Lecture 35.5 06:28
- Maximum Length of Bitonic Subsequence - Dynamic Programming | C++ Placement Course | Lecture 35.19 07:46
- Friends Paring Problem - Dynamic Programming | C++ Placement Course | Lecture 35.20 05:10
- Ugly Numbers - Dynamic Programming | C++ Placement Course | Lecture 35.18 05:20
- LCS with 3 Strings - Dynamic Programming | C++ Placement Course | Lecture 35.16 08:49
- K-Ordered LCS - Dynamic Programming | C++ Placement Course | Lecture 35.17 09:11
- Tries - Introduction | C++ Placement Course | Lecture 36.1 06:14
- XOR SubArray - Tries Challenges | C++ Placement Course | Lecture36.2 10:24
- Trie bash - Challenge | C++ Placement Course | Lecture 36.3 09:21
- Digital Dictionary - Tries Challenges | C++ Placement Course | Lecture 36.4 10:32
- Extended Euclid Algorithm - Number Theory Advanced | C++ Placement Course | Lecture 37.1 09:18
- Multiplicative Modulo Inverse - Number Theory Advanced | Lecture 37.2 10:06
- Euler Totient Function - Number Theory Advanced | C++ Placement Course | Lecture 37.3 07:55
- Binary Exponentiation - Number Theory Advanced | C++ Placement Course | Lecture 37.4 08:57
- Fermat Little and Wilson Theorem - Number Theory Advanced | C++ Placement Course | Lecture 37.5 07:05
- Boring Factorials SPOJ - Number Theory Advanced | C++ Placement Course | Lecture 37.6 08:03
- Introduction, Fibonacci in Log(n) - Matrix Exponentiation | C++ Placement Course | Lecture 38.1 23:31
- String Hashing - String Algorithms | C++ Placement Course | Lecture 39.1 12:47
- SubStr() Function - String Algorithm | C++ Placement Course | Lecture 39.2 03:25
- KMP Algorithms - String Algorithm | C++ Placement Course | Lecture 39.3 17:04
- Rabin Karp - String Algorithms | C++ Placement Course | Lecture 39.4 04:48
- Guide to Interactive Problems | C++ Placement Course | Lecture 43 11:11
- Segment Tree - Introduction and Build | C++ Placement Course | Lecture 40.1 21:26
- Query in Segment Tree | C++ Placement Course | Lecture 40.2 12:04
- Maximum and Minimum Queries/Update | C++ Placement Course | Lecture 40.4 18:13
- Number of minimums on a segment | C++ Placement Course | Lecture 40.5 12:39
- User Snippets in VSCode | C++ Placement Course | Lecture 40.6 03:48
- Segment with Max Sum | C++ Placement Course | Lecture 40.7 15:00
- Kth One - Segment Tree | C++ Placement Course | Lecture 40.8 15:23
- First Element at Least X - Segment Tree | C++ Placement Course | Lecture 40.9 10:59
- Nested Segments - Segment Tree | C++ Placement Course | Lecture 40.12 11:19
- Intersecting Segments - Segment Tree | C++ Placement Course | Lecture 40.13 11:49
- Fenwick Tree - Introduction | C++ Placement Course | Lecture 41.1 10:21
- Point & Range Updates - Fenwick Tree | C++ Placement Course | Lecture 41.2 13:25
- Count Inversion - Fenwick Tree | C++ Placement Course | Lecture 41.3 09:05
- Square Root Decomposition - Introduction | C++ Placement Course | Lecture 42.1 10:45
- RMQSQ - Spoj | C++ Placement Course | Lecture 42.2 07:29
- Mo's Algorithm - Square Root Decomposition | Lecture 42.3 19:06
- DQueary - SPOJ | C++ Placement Course | Lecture 42.4 14:00
- Policy Based Data Structures | C++ Placement Course | Lecture 44 09:39
Take this course with you
Download the app to continue lessons from your phone anytime.
