Courses › C++
C++ Full Course & DSA
By Apna College · Hindi · Beginner
C++ basics, OOP, STL and DSA.
A free YouTube playlist, organised on Codify: your progress is saved, you can take timestamped notes and practise in the code editor under every video. All videos belong to their creator.
What this course covers (100 videos)
- 1. Introduction to C++ | Data Structures and Algorithms | College Placement Course | Lecture 1 (26:03)
- Lecture 1 : Flowchart & Pseudocode + Installation | DSA Series by Shradha Khapra Ma'am | C++ (1:25:52)
- Lecture 2 : Variable, Data Types & Operators | DSA Series by Shradha Ma'am | C++ (1:16:44)
- Lecture 3: Conditional Statements & Loops | DSA Series by Shradha Ma'am | C++ (1:34:39)
- Lecture 4: Patterns | DSA Series by Shradha Khapra Ma'am | C++ (1:31:07)
- Lecture 5: Functions | DSA Series by Shradha Khapra Ma'am | C++ (49:13)
- Binary Number System | DSA Series by Shradha Khapra Ma'am | C++ (37:20)
- Bitwise Operators, Data Type Modifiers & more | DSA Series by Shradha Khapra Ma'am | C++ (38:33)
- Array Data Structure - Part1 | DSA Series by Shradha Khapra Ma'am | C++ (54:07)
- Vectors in C++ | Arrays Part 2 | DSA Series by Shradha Ma'am | Lecture 9 (40:06)
- Kadane's Algorithm | Maximum Subarray Sum | DSA Series by Shradha Ma'am (23:29)
- Majority Element | Brute- Better-Best Approach | Moore's Voting Algorithm | & Pair Sum (39:10)
- Time & Space Complexity - DSA Series by Shradha Ma'am (1:25:41)
- Buy and Sell Stock Problem and Pow(X,N) Power exponential Problem - Leetcode | DSA Series (29:10)
- Container with Most Water Problem | Brute & Optimal Solution | Two Pointer Approach - Leetcode 11 (32:00)
- Product of Array Except Self | Brute to Optimal Solution | Leetcode 238 (29:30)
- Pointers in C++ | In Detail | DSA Series by Shradha Ma'am (46:08)
- Binary Search Algorithm - Iterative and Recursive Method | [Theory + Code] with Example (44:16)
- Search in Rotated Sorted Array | Binary Search | Leetcode 33 (19:30)
- Peak Index in Mountain Array | Binary Search | Leetcode 852 (23:34)
- Single Element in Sorted Array | Binary Search | DSA Series Lecture 20 (27:33)
- DSA Complete Series 🚀 : Data Structures & Algorithms | by Shradha Khapra Ma'am (5: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 (8:42)
- 2.3 If/else statement in C++ programming | Data Structure and Algorithm Course | Lecture 2.3 (7:51)
- 2.4 Introduction to Loops in C++ programming | Guaranteed Placement Course | Lecture 2.4 (9:38)
- 3.1 Break and Continue statement in C++ Programming | Guaranteed Placement Course | Lecture 3.1 (9:32)
- 3.2 Switch-Case statement in C++ Programming | Guaranteed Placement Course | Lecture 3.2 (6: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 (8: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 (8: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 (8:32)
- 8.3.2 Bubble Sort | Sorting in C++ | Guaranteed Placement Course (6:46)
- 8.3.3 Insertion Sort | Sorting Algorithms | C++ Placement Course | (9: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 (7: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 (8:33)
- Wave Sort | C++ Placement Course - 20.3 (7:30)
- Count Inversion - Merge Sort | C++ Placement Course - 19.3 (9:07)
- Object Oriented Programming in C++ | Important Concept | Lecture 21.1 (21:29)
- Inheritance in OOP's | C++ Placement Course | Lecture 21.3 (8: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 (6:22)
- Reverse a Linked List | C++ Placement Course | Lecture 22.3 (9:03)
- Reverse K Nodes in a Linked List | C++ Placement Course | Lecture 22.4 (6: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 (6:07)
- Find Intersection point of 2 Linked List | Lecture 22.8 (8:30)
- Merge 2 Sorted Linked List | C++ Placement Course | Lecture 22.9 (9: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 (6:14)
- 2021 - Top 5 Programming Language for College Students 2021 (9:28)
- Time Complexity using Masters Theorem | C++ Placement Course | Lecture 16.5 (6: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 (5:38)
- Reverse a Stack | C++ Placement Course | Lecture 23.3 (8:21)
- Introduction to Prefix, Infix and Postfix | C++ Placement Course | Lecture 23.4 (11:21)
- Prefix Expression Evaluation | C++ Placement Course | Lecture 23.5 (6:39)
- Postfix Expression Evaluation | C++ Placement Course | Lecture 23.6 (8:24)
- Infix to Postfix - Stack Challenges | C++ Placement Course | Lecture 23.7 (7:48)
- Infix to Prefix | C++ Placement Course | Lecture 23.8 (9:59)
- Balanced Parenthesis | C++ Placement Course | Lecture 23.9 (7: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 (6:17)