Course Hive
Courses
Summaries
Continue with Google
or

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
  • 1. Introduction to C++ | Data Structures and Algorithms | College Placement Course | Lecture 126:03
  • DSA Complete Series 🚀 : Data Structures & Algorithms | by Shradha Khapra Ma'am05:53
  • VS Code Installation for C++ in Windows | Step by step process explanation10:15
  • 2.1 Data Types & Type Modifiers | Data Structures & Algorithms Course in C++ | Lecture 2.111:09
  • 2.2 Input/Output in C++ | Data Structures and Algorithm Course in C++ | Lecture 2.208:42
  • 2.3 If/else statement in C++ programming | Data Structure and Algorithm Course | Lecture 2.307:51
  • 2.4 Introduction to Loops in C++ programming | Guaranteed Placement Course | Lecture 2.409:38
  • 3.1 Break and Continue statement in C++ Programming | Guaranteed Placement Course | Lecture 3.109:32
  • 3.2 Switch-Case statement in C++ Programming | Guaranteed Placement Course | Lecture 3.206:58
  • 3.3 Operators in C++ Programming | Guaranteed Placement Course | 3.329:58
  • 4.1 Awesome Pattern Questions -1 | Guaranteed Placement Course23:37
  • 4.2 Advanced Pattern Questions in C++ | Guaranteed Placement Course | Lecture 4.228:08
  • 5.1 Binary Number System | Guaranteed Placement Course | Lecture 5.108:45
  • 5.2 How to reverse a number | Check if a number is Prime or Armstrong | C++ Placement Course | # 5.210:45
  • 6.1 Functions in C++ | Guaranteed Placement Course08:11
  • 6.2 Functions Challenges | C++ Guaranteed Course | Lecture 6.213:13
  • 6.3 Advanced Placement Questions on Functions | C++ Placement Course32:15
  • 7.1 Time Complexity | C++ Placement Course30:45
  • 8.1 Introduction to Arrays in C++ | Guaranteed Placement Course12: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 Course08:32
  • 8.3.2 Bubble Sort | Sorting in C++ | Guaranteed Placement Course06:46
  • 8.3.3 Insertion Sort | Sorting Algorithms | C++ Placement Course |09:37
  • 8.4 Array Challenges | C++ Placement Course39:41
  • 8.5 Arrays - Q's asked by Top MNC's | C++ Placement Course23:51
  • 8.6 Subarrays - Challenges | Questions asked by Top MNC's | C++ Placement Course32:18
  • 9.1 Two Dimensional Arrays | 2D Arrays | C++ Placement Course21:24
  • 9.2 "2D Array" Challenges | Asked by Top MNC's | C++ Placement Course24:03
  • 10. Character Arrays | C++ Placement Course12:53
  • 11. Pointers in C++ | Guaranteed Placement Course19:03
  • 12. Stack & Heap | C++ Placement Course11:02
  • 13. Strings in C++ | Guaranteed Placement Course | Lecture 1323:40
  • 13.2 Strings Challenges | C++ Placement Course11:52
  • 14.1 BIT Manipulation in 11 minutes | C++ Placement Course10:46
  • 14.2 BIT Manipulation Challenges | C++ Placement Course15:30
  • 14.3 BIT Manipulation | Challenges - Part 2 | Questions asked by Top MNC's20:08
  • 15.1 Sieve of Eratosthenes | Challenge | C++ Placement Course10:47
  • 15.2 Inclusion- Exclusion Principle | GCD | C++ Placement Course07:07
  • 16.1 Recursion - Introduction | C++ Placement Course23:51
  • 16.2 Recursion - Challenges | C++ Placement Course17:40
  • 7 Best Problems on Recursion | Recursion in C++ | Placement Course | Lec 16.334:05
  • Advanced Recursion Problems | C++ Placement Course | Lecture 16.416:29
  • Recursion | Last Lecture on Advanced Problems | Lecture 16.419:23
  • Backtracking - Rat in a Maze | C++ Placement Course | Lecture 18.118:27
  • Permutation - Return all possible permutations | C++ Placement Course | Lecture 1714:39
  • N-Queen Problem - Backtracking | C++ Placement Course - 18.217:14
  • Merge Sort | Code and Explanation | C++ Course - 19.117:10
  • Quick Sort | Code and Explanation | C++ Course - 19.215:24
  • Vectors and Pair | C++ Course - 1915:30
  • Count Sort | C++ Placement Course | Lecture 20.111:18
  • DNF Sort | C++ Placement Course | Lecture 20.208:33
  • Wave Sort | C++ Placement Course - 20.307:30
  • Count Inversion - Merge Sort | C++ Placement Course - 19.309:07
  • Object Oriented Programming in C++ | Important Concept | Lecture 21.121:29
  • Inheritance in OOP's | C++ Placement Course | Lecture 21.308:45
  • Polymorphism in Object Oriented Programming | C++ Placement Course Lecture 21.410:09
  • Introduction to Linked List | C++ Placement Course | Lecture 2215:17
  • Deletion in Linked List | C++ Placement Course | Lecture 22.206:22
  • Reverse a Linked List | C++ Placement Course | Lecture 22.309:03
  • Reverse K Nodes in a Linked List | C++ Placement Course | Lecture 22.406:43
  • Detection and Removal of Cycle in Linked List | Lecture 22.514:11
  • Doubly Linked List | Data Structures & Algorithms | C++ Placement Course | Lecture 22.612:01
  • Append Last K Nodes of a Linked List | C++ Placement Course | Lecture 22.706:07
  • Find Intersection point of 2 Linked List | Lecture 22.808:30
  • Merge 2 Sorted Linked List | C++ Placement Course | Lecture 22.909:02
  • Circular Linked List - C++ Placement Course | Lecture 22.1013:22
  • Put Even Position Nodes after Odd Position Nodes | C++ Placement Course | Lecture 22.1106:14
  • 2021 - Top 5 Programming Language for College Students 202109:28
  • Time Complexity using Masters Theorem | C++ Placement Course | Lecture 16.506:55
  • Stack Data Structure - Introduction | C++ Placement Course | Lecture 23.110:14
  • Reverse a Sentence using Stacks | Stack Challenge | C++ Placement Course | Lecture 23.205:38
  • Reverse a Stack | C++ Placement Course | Lecture 23.308:21
  • Introduction to Prefix, Infix and Postfix | C++ Placement Course | Lecture 23.411:21
  • Prefix Expression Evaluation | C++ Placement Course | Lecture 23.506:39
  • Postfix Expression Evaluation | C++ Placement Course | Lecture 23.608:24
  • Infix to Postfix - Stack Challenges | C++ Placement Course | Lecture 23.707:48
  • Infix to Prefix | C++ Placement Course | Lecture 23.809:59
  • Balanced Parenthesis | C++ Placement Course | Lecture 23.907:45
  • Introduction to Queue Data Structure | C++ Placement Course | Lecture 24.111:42
  • Linked List Implementation of Queues | C++ Placement Course | Lecture 24.206:17
  • Queue using Stack | C++ Placement Course | Lecture 24.307:57
  • Stack using Queue | C++ Placement Course | Lecture 24.407:40
  • Stacking using Queues (Method 2) | C++ Placement Course | Lecture 24.4.207:21
  • Sliding Window Maximum using Deque | C++ Placement Course | Lecture 25.109:40
  • Largest Rectangle Code | C++ Placement Course | Lecture 25.205:11
  • Trapping Rainwater | C++ Placement Course | Lecture 25.304:52
  • Redundant Parenthesis | C++ Placement Course | Lecture 25.405:07
  • The Stock Span Problem | C++ Placement Course | Lecture 25.505:29
  • Two Pointers | Three Sum Problem | C++ Placement Course | Lecture 26.106:29
  • Max Consecutive Ones | C++ Placement Course | Lecture 26.207:37
  • Longest substring without repeating characters | C++ Placement Course | Lecture 26.306:31
  • Binary Tree Introduction | C++ Placement Course | Lecture 27.109:43
  • Binary Tree Traversals| Preorder, Inorder, Postorder Traversal | C++ Placement Course | Lecture 27.215:59
  • Build Tree from Preorder and Inorder | C++ Placement Course | Lecture 27.315:40
  • Build Tree Postorder and Inorder | C++ Placement Course | Lecture 27.416:33
  • Level Order Traversal , Sum at Kth Level In Binary Tree | C++ Placement Course | Lecture 27.512:15
  • Count and Sum of Nodes | C++ Placement Course | Lecture 27.604:31
  • Height and Diameter in Binary Tree | C++ Placement Course | Lecture 27.711:49
  • Sum Replacement in Binary Tree | C++ Placement Course | Lecture 27.808:47
  • Height Balanced Binary Tree | C++ Placement Course | Lecture 27.915:46
  • Right View of Binary Tree | C++ Placement Course | Lecture 27.1007:23
  • Left View of Binary Trees | C++ Placement Course | Lecture 27.1107:30
  • Shortest Distance between 2 Nodes | C++ Placement Course | Lecture 27.1211:41
  • Flatten a Binary Tree | C++ Placement Course | Lecture 27.1311:37
  • Nodes at Distance K in Binary Tree | C++ Placement Course | Lecture 27.1415:11
  • Lowest Common Ancestor in Binary Tree | C++ Placement Course | Lecture 27.1520:45
  • Max Sum Path from One Node to Another in Binary Tree | C++ Placement Course | Lecture 27.1615:19
  • Binary Search Trees | Introduction & Build | C++ Placement Course | Lecture 28.115:00
  • Search and Delete in Binary Search Tree | C++ Placement Course | Lecture 28.225:29
  • Construct Binary Search Tree from Preorder | C++ Placement Course | Lecture 28.316:40
  • Check for Binary Search Tree | C++ Placement Course | Lecture 28.413:46
  • Build Balanced BST from Sorted Array | C++ Placement Course | Lecture 28.511:30
  • Catalan Numbers Application | C++ Placement Course | Lecture 28.626:45
  • Zig Zag Traversal Binary Search Tree | C++ Placement Course | Lecture 28.718:31
  • Identical Binary Search Tree | C++ Placement Course | Lecture 28.816:09
  • Largest Binary Search Tree in BT | C++ Placement Course | Lecture 28.1023:28
  • Recover Binary Search Tree | C++ Placement Course | Lecture 28.1120:49
  • Set & Multiset | Standard Template Library | C++ Placement Course | Lecture 28.1212:18
  • Place Elements to Maximise Minimum Distance | C++ Placement Course | Lecture 29.115:49
  • Page Allocation Problem | C++ Placement Course | Lecture 29.218:18
  • Painters Partition Problem | C++ Placement Course | Lecture 29.314:04
  • Search in Sorted & Rotated Array | C++ Placement Course | Lecture 29.411:50
  • Find the Peak Element | C++ Placement Course | Lecture 29.510:11
  • Max Sum Subarray | Sliding Window Challenge | C++ Placement Course | Lecture 30.114:10
  • Minimum Subarray Size | Sliding Window Challenge | C++ Placement Course | Lecture 30.218:14
  • Form Number Divisible by 3 | Sliding Window Challenge | C++ Placement Course | Lecture 30.314:31
  • Subarray with Palindromic Concatenation | C++ Placement Course | Lecture 30.415:24
  • Perfect Numbers in Subarrays | C++ Placement Course | Lecture 30.517:07
  • Heap Intro Final Export for Upload03:55
  • HeapsSort | C++ Placement Course | Lecture 31.208:20
  • Heap STL | C++ Placement Course | Lecture 31.304:02
  • Heaps - Median of Running Stream | C++ Placement Course | Lecture 31.410:26
  • Heaps - Merge K sorted Arrays | C++ Placement Course09:43
  • Heap -Smallest Sequence with sum K | C++ Placement Course | Lecture 31.606:01
  • Hashing - Introduction to Hasing | C++ Placement Coure | Lecture 32.104:47
  • Hashing STL - C++ Placement Course | Lecture 32.203:26
  • Hashing - Count frequency of elements | C++ Placement Course | Lecture 32.304:07
  • Hashing - Vertical Order Print | C++ Placement Course | Lecture 32.410:36
  • Hashing - Number of Subarrays with Sum Zero | C++ Placement Course | Lec 32.507:51
  • Hashing - Sliding Window Technique | C++ Placement Course06:09
  • Hashing - TOP K MOST FREQUENT ELEMENTS | C++ Placement Course | Lecture 32.708:17
  • Sudoku Solver - Hashing | C++ Placement Course | Lecture 32.811:34
  • Greedy Algorithm - Introduction | C++ Placement Course Lecture 33.103:03
  • Indian Coin Change - Greedy Algorithm | C++ Placement Course | Lecture 33.205:52
  • Activity Selection Problem - Greedy Algorithm | C++ Placement Course | Lecture 33.308:38
  • Fractional Knapsack - Greedy Algorithm | C++ Placement Course | Lecture 33.407:41
  • Optimal Pattern Merge - Greedy Algorithm | C++ Placement Course | Lecture 33.505:58
  • Expedi - Greedy Algorithm | C++ Placement Course | Lecture 33.622:25
  • Maximum and Minimum Difference - Greedy Algorithm | C++ Placement Course | Lecture 33.709:36
  • Graphs - Introduction | C++ Placement Course | Lecture 34.107:23
  • Dynamic Programming - Introduction | C++ Placement Course | Lecture 35.107:22
  • Graph Terminologies | C++ Placement Course | Lecture 34.208:25
  • Graphs - Representation | C++ Placement Course | Lecture 34.309:30
  • BFS - Breadth First Search | C++ Placement Course | Lecture 34.404:19
  • DFS - Depth First Search | C++ Placement Course | Lecture 34.505:02
  • Graphs - Topological Sort | C++ Placement Course | Lecture 34.611:38
  • Cycle Detection in Undirected Graphs | C++ Placement Course | Lecture 34.706:53
  • Cycle Detection in Directed Graph | C++ Placement Course | Lecture 34.806:34
  • Connected Components | C++ Placement Course | Lecture 34.910:31
  • Bipartite Graph - C++ Placement Course | Lecture 34.1008:15
  • Disjoint Set Union - Graphs | C++ Placement Course | Lecture 34.1109:40
  • Cycle Detection in Undirected Graph using DSU | C++ Placement Course | Lecture 34.1208:37
  • Cycle Detection in Undirected Graph using DSU | C++ Placement Course | Lecture 34.1208:37
  • Kruskal's Algorithm | C++ Placement Course | Lecture 34.1307:52
  • Prims Algorithm | C++ Placement Course | Lecture 34.1408:19
  • Dijkstra's Algorithm | C++ Placement Course | Lecture 34.1509:12
  • Bellman Ford Algorithm | C++ Placement Course | Lecture 34.1607:28
  • Floyd Warshall Algorithm | C++ Placement Course | Lecture 34.1707:10
  • Snakes and Ladders - Graphs | C++ Placement Course | Lecture 34.1811:11
  • Graphs - Surrounded Region | C++ Placement Course | Lecture 34.1907:23
  • Fibonacci Sequence - Dynamic Programming | C++ Placement Course | Lecture 35.206:28
  • Minimum Number of Squares - Dynamic Programming | C++ Placement Course | Lecture 35.310:17
  • Coin Change Problem - Dynamic Programming | C++ Placement Course | Lecture 35.420:57
  • 01 Knapsack - Dynamic Programming | C++ Placement Course | Lecture 35.712:08
  • Longest Increasing Subsequence - Dynamic Programming | C++ Placement Course | Lecture 35.811:03
  • Longest Common Subsequence - Dynamic Programming | C++ Placement Course | Lecture 35.913:20
  • Matrix Chain Multiplication - Dynamic Programming | C++ Placement Course | Lecture 35.1016:16
  • Minimum Jumps to Reach End - Dynamic Programming | C++ Placement Course | Lecture 35.1107:42
  • Optimal Game Strategy - Dynamic Programming | C++ Placement Course | Lecture 35.1207:14
  • Number of Subsequences - Dynamic Programming | C++ Placement Course | Lecture 35.1310:03
  • Count Number of Binary Strings - Dynamic Programming | C++ Placement Course | Lecture 35.1408:44
  • 0-N Knapsack - Dynamic Programming | C++ Placement Course | Lecture 35.1507:12
  • Kadane Algorithm - Dynamic Programming | C++ Placement Course | Lecture 35.506:28
  • Maximum Length of Bitonic Subsequence - Dynamic Programming | C++ Placement Course | Lecture 35.1907:46
  • Friends Paring Problem - Dynamic Programming | C++ Placement Course | Lecture 35.2005:10
  • Ugly Numbers - Dynamic Programming | C++ Placement Course | Lecture 35.1805:20
  • LCS with 3 Strings - Dynamic Programming | C++ Placement Course | Lecture 35.1608:49
  • K-Ordered LCS - Dynamic Programming | C++ Placement Course | Lecture 35.1709:11
  • Tries - Introduction | C++ Placement Course | Lecture 36.106:14
  • XOR SubArray - Tries Challenges | C++ Placement Course | Lecture36.210:24
  • Trie bash - Challenge | C++ Placement Course | Lecture 36.309:21
  • Digital Dictionary - Tries Challenges | C++ Placement Course | Lecture 36.410:32
  • Extended Euclid Algorithm - Number Theory Advanced | C++ Placement Course | Lecture 37.109:18
  • Multiplicative Modulo Inverse - Number Theory Advanced | Lecture 37.210:06
  • Euler Totient Function - Number Theory Advanced | C++ Placement Course | Lecture 37.307:55
  • Binary Exponentiation - Number Theory Advanced | C++ Placement Course | Lecture 37.408:57
  • Fermat Little and Wilson Theorem - Number Theory Advanced | C++ Placement Course | Lecture 37.507:05
  • Boring Factorials SPOJ - Number Theory Advanced | C++ Placement Course | Lecture 37.608:03
  • Introduction, Fibonacci in Log(n) - Matrix Exponentiation | C++ Placement Course | Lecture 38.123:31
  • String Hashing - String Algorithms | C++ Placement Course | Lecture 39.112:47
  • SubStr() Function - String Algorithm | C++ Placement Course | Lecture 39.203:25
  • KMP Algorithms - String Algorithm | C++ Placement Course | Lecture 39.317:04
  • Rabin Karp - String Algorithms | C++ Placement Course | Lecture 39.404:48
  • Guide to Interactive Problems | C++ Placement Course | Lecture 4311:11
  • Segment Tree - Introduction and Build | C++ Placement Course | Lecture 40.121:26
  • Query in Segment Tree | C++ Placement Course | Lecture 40.212:04
  • Maximum and Minimum Queries/Update | C++ Placement Course | Lecture 40.418:13
  • Number of minimums on a segment | C++ Placement Course | Lecture 40.512:39
  • User Snippets in VSCode | C++ Placement Course | Lecture 40.603:48
  • Segment with Max Sum | C++ Placement Course | Lecture 40.715:00
  • Kth One - Segment Tree | C++ Placement Course | Lecture 40.815:23
  • First Element at Least X - Segment Tree | C++ Placement Course | Lecture 40.910:59
  • Nested Segments - Segment Tree | C++ Placement Course | Lecture 40.1211:19
  • Intersecting Segments - Segment Tree | C++ Placement Course | Lecture 40.1311:49
  • Fenwick Tree - Introduction | C++ Placement Course | Lecture 41.110:21
  • Point & Range Updates - Fenwick Tree | C++ Placement Course | Lecture 41.213:25
  • Count Inversion - Fenwick Tree | C++ Placement Course | Lecture 41.309:05
  • Square Root Decomposition - Introduction | C++ Placement Course | Lecture 42.110:45
  • RMQSQ - Spoj | C++ Placement Course | Lecture 42.207:29
  • Mo's Algorithm - Square Root Decomposition | Lecture 42.319:06
  • DQueary - SPOJ | C++ Placement Course | Lecture 42.414:00
  • Policy Based Data Structures | C++ Placement Course | Lecture 4409:39

You may also be interested in

Curso de Oratória de Alta Performance

Curso de Oratória de Alta Performance

⭐ 5.0
0 ratings
2 hours
Videos for Spanish Speakers Who are Learning English as a Second Language.

Videos for Spanish Speakers Who are Learning English as a Second Language.

⭐ 5.0
2 ratings
8.5 hours
Curso psicología de la autorrealización Antonio Blay

Curso psicología de la autorrealización Antonio Blay

⭐ 5.0
1 ratings
20.5 hours
Cursos

Cursos

⭐ 5.0
0 ratings
17.5 hours
Curso - Excel Avanzado.

Curso - Excel Avanzado.

⭐ 4.0
3 ratings
1 hours
Infectious diseases | Health & Medicine | Khan Academy

Infectious diseases | Health & Medicine | Khan Academy

⭐ 4.0
0 ratings
11 hours
New and Noteworthy

New and Noteworthy

⭐ 4.0
1 ratings
16.5 hours
Complete SmartPlant Instrumentation (SPI - INtools) Course

Complete SmartPlant Instrumentation (SPI - INtools) Course

⭐ 4.0
1 ratings
5.3 hours

FAQs

Suggest a Youtube Course

Our catalog is built based on the recommendations and interests of students like you.

Course Hive
Download now and unlock unlimited audiobooks — 100% free
Explore Now