C++ Full Course | C++ Tutorial | Data Structures & Algorithms

1. Introduction to C++ | Data Structures and Algorithms | College Placement Course | Lecture 1

Lecture 1 : Flowchart & Pseudocode + Installation | DSA Series by Shradha Khapra Ma'am | C++

Lecture 2 : Variable, Data Types & Operators | DSA Series by Shradha Ma'am | C++

Lecture 3: Conditional Statements & Loops | DSA Series by Shradha Ma'am | C++

Lecture 4: Patterns | DSA Series by Shradha Khapra Ma'am | C++

Lecture 5: Functions | DSA Series by Shradha Khapra Ma'am | C++

Binary Number System | DSA Series by Shradha Khapra Ma'am | C++

Bitwise Operators, Data Type Modifiers & more | DSA Series by Shradha Khapra Ma'am | C++

Array Data Structure - Part1 | DSA Series by Shradha Khapra Ma'am | C++

Vectors in C++ | Arrays Part 2 | DSA Series by Shradha Ma'am | Lecture 9

Kadane's Algorithm | Maximum Subarray Sum | DSA Series by Shradha Ma'am

Majority Element | Brute- Better-Best Approach | Moore's Voting Algorithm | & Pair Sum

Time & Space Complexity - DSA Series by Shradha Ma'am

Buy and Sell Stock Problem and Pow(X,N) Power exponential Problem - Leetcode | DSA Series

Container with Most Water Problem | Brute & Optimal Solution | Two Pointer Approach - Leetcode 11

Product of Array Except Self | Brute to Optimal Solution | Leetcode 238

Pointers in C++ | In Detail | DSA Series by Shradha Ma'am

Binary Search Algorithm - Iterative and Recursive Method | [Theory + Code] with Example

Search in Rotated Sorted Array | Binary Search | Leetcode 33

Peak Index in Mountain Array | Binary Search | Leetcode 852

Single Element in Sorted Array | Binary Search | DSA Series Lecture 20

DSA Complete Series 🚀 : Data Structures & Algorithms | by Shradha Khapra Ma'am

VS Code Installation for C++ in Windows | Step by step process explanation

2.1 Data Types & Type Modifiers | Data Structures & Algorithms Course in C++ | Lecture 2.1

2.2 Input/Output in C++ | Data Structures and Algorithm Course in C++ | Lecture 2.2

2.3 If/else statement in C++ programming | Data Structure and Algorithm Course | Lecture 2.3

2.4 Introduction to Loops in C++ programming | Guaranteed Placement Course | Lecture 2.4

3.1 Break and Continue statement in C++ Programming | Guaranteed Placement Course | Lecture 3.1

3.2 Switch-Case statement in C++ Programming | Guaranteed Placement Course | Lecture 3.2

3.3 Operators in C++ Programming | Guaranteed Placement Course | 3.3

4.1 Awesome Pattern Questions -1 | Guaranteed Placement Course

4.2 Advanced Pattern Questions in C++ | Guaranteed Placement Course | Lecture 4.2

5.1 Binary Number System | Guaranteed Placement Course | Lecture 5.1

5.2 How to reverse a number | Check if a number is Prime or Armstrong | C++ Placement Course | # 5.2

6.1 Functions in C++ | Guaranteed Placement Course

6.2 Functions Challenges | C++ Guaranteed Course | Lecture 6.2

6.3 Advanced Placement Questions on Functions | C++ Placement Course

7.1 Time Complexity | C++ Placement Course

8.1 Introduction to Arrays in C++ | Guaranteed Placement Course

8.2 Searching in Arrays | Linear and Binary Search | C++ Placement Course |

8.3.1 Sorting in Arrays | Selection Sort | C++ Placement Course

8.3.2 Bubble Sort | Sorting in C++ | Guaranteed Placement Course

8.3.3 Insertion Sort | Sorting Algorithms | C++ Placement Course |

8.4 Array Challenges | C++ Placement Course

8.5 Arrays - Q's asked by Top MNC's | C++ Placement Course

8.6 Subarrays - Challenges | Questions asked by Top MNC's | C++ Placement Course

9.1 Two Dimensional Arrays | 2D Arrays | C++ Placement Course

9.2 "2D Array" Challenges | Asked by Top MNC's | C++ Placement Course

10. Character Arrays | C++ Placement Course

11. Pointers in C++ | Guaranteed Placement Course

12. Stack & Heap | C++ Placement Course

13. Strings in C++ | Guaranteed Placement Course | Lecture 13

13.2 Strings Challenges | C++ Placement Course

14.1 BIT Manipulation in 11 minutes | C++ Placement Course

14.2 BIT Manipulation Challenges | C++ Placement Course

14.3 BIT Manipulation | Challenges - Part 2 | Questions asked by Top MNC's

15.1 Sieve of Eratosthenes | Challenge | C++ Placement Course

15.2 Inclusion- Exclusion Principle | GCD | C++ Placement Course

16.1 Recursion - Introduction | C++ Placement Course

16.2 Recursion - Challenges | C++ Placement Course

7 Best Problems on Recursion | Recursion in C++ | Placement Course | Lec 16.3

Advanced Recursion Problems | C++ Placement Course | Lecture 16.4

Recursion | Last Lecture on Advanced Problems | Lecture 16.4

Backtracking - Rat in a Maze | C++ Placement Course | Lecture 18.1

Permutation - Return all possible permutations | C++ Placement Course | Lecture 17

N-Queen Problem - Backtracking | C++ Placement Course - 18.2

Merge Sort | Code and Explanation | C++ Course - 19.1

Quick Sort | Code and Explanation | C++ Course - 19.2

Vectors and Pair | C++ Course - 19

Count Sort | C++ Placement Course | Lecture 20.1

DNF Sort | C++ Placement Course | Lecture 20.2

Wave Sort | C++ Placement Course - 20.3

Count Inversion - Merge Sort | C++ Placement Course - 19.3

Object Oriented Programming in C++ | Important Concept | Lecture 21.1

Private video

Inheritance in OOP's | C++ Placement Course | Lecture 21.3

Polymorphism in Object Oriented Programming | C++ Placement Course Lecture 21.4

Introduction to Linked List | C++ Placement Course | Lecture 22

Deletion in Linked List | C++ Placement Course | Lecture 22.2

Reverse a Linked List | C++ Placement Course | Lecture 22.3

Reverse K Nodes in a Linked List | C++ Placement Course | Lecture 22.4

Detection and Removal of Cycle in Linked List | Lecture 22.5

Doubly Linked List | Data Structures & Algorithms | C++ Placement Course | Lecture 22.6

Append Last K Nodes of a Linked List | C++ Placement Course | Lecture 22.7

Find Intersection point of 2 Linked List | Lecture 22.8

Merge 2 Sorted Linked List | C++ Placement Course | Lecture 22.9

Circular Linked List - C++ Placement Course | Lecture 22.10

Put Even Position Nodes after Odd Position Nodes | C++ Placement Course | Lecture 22.11

2021 - Top 5 Programming Language for College Students 2021

Time Complexity using Masters Theorem | C++ Placement Course | Lecture 16.5

Stack Data Structure - Introduction | C++ Placement Course | Lecture 23.1

Reverse a Sentence using Stacks | Stack Challenge | C++ Placement Course | Lecture 23.2

Reverse a Stack | C++ Placement Course | Lecture 23.3

Introduction to Prefix, Infix and Postfix | C++ Placement Course | Lecture 23.4

Prefix Expression Evaluation | C++ Placement Course | Lecture 23.5

Postfix Expression Evaluation | C++ Placement Course | Lecture 23.6

Infix to Postfix - Stack Challenges | C++ Placement Course | Lecture 23.7

Infix to Prefix | C++ Placement Course | Lecture 23.8

Balanced Parenthesis | C++ Placement Course | Lecture 23.9

Introduction to Queue Data Structure | C++ Placement Course | Lecture 24.1

Linked List Implementation of Queues | C++ Placement Course | Lecture 24.2

Queue using Stack | C++ Placement Course | Lecture 24.3

Stack using Queue | C++ Placement Course | Lecture 24.4

Stacking using Queues (Method 2) | C++ Placement Course | Lecture 24.4.2

Sliding Window Maximum using Deque | C++ Placement Course | Lecture 25.1

Largest Rectangle Code | C++ Placement Course | Lecture 25.2

Trapping Rainwater | C++ Placement Course | Lecture 25.3

Redundant Parenthesis | C++ Placement Course | Lecture 25.4

The Stock Span Problem | C++ Placement Course | Lecture 25.5

Two Pointers | Three Sum Problem | C++ Placement Course | Lecture 26.1

Max Consecutive Ones | C++ Placement Course | Lecture 26.2

Longest substring without repeating characters | C++ Placement Course | Lecture 26.3

Binary Tree Introduction | C++ Placement Course | Lecture 27.1

Binary Tree Traversals| Preorder, Inorder, Postorder Traversal | C++ Placement Course | Lecture 27.2

Build Tree from Preorder and Inorder | C++ Placement Course | Lecture 27.3

Build Tree Postorder and Inorder | C++ Placement Course | Lecture 27.4

Level Order Traversal , Sum at Kth Level In Binary Tree | C++ Placement Course | Lecture 27.5

Count and Sum of Nodes | C++ Placement Course | Lecture 27.6

Height and Diameter in Binary Tree | C++ Placement Course | Lecture 27.7

Sum Replacement in Binary Tree | C++ Placement Course | Lecture 27.8

Height Balanced Binary Tree | C++ Placement Course | Lecture 27.9

Right View of Binary Tree | C++ Placement Course | Lecture 27.10

Left View of Binary Trees | C++ Placement Course | Lecture 27.11

Shortest Distance between 2 Nodes | C++ Placement Course | Lecture 27.12

Flatten a Binary Tree | C++ Placement Course | Lecture 27.13

Nodes at Distance K in Binary Tree | C++ Placement Course | Lecture 27.14

Lowest Common Ancestor in Binary Tree | C++ Placement Course | Lecture 27.15

Max Sum Path from One Node to Another in Binary Tree | C++ Placement Course | Lecture 27.16

Binary Search Trees | Introduction & Build | C++ Placement Course | Lecture 28.1

Search and Delete in Binary Search Tree | C++ Placement Course | Lecture 28.2

Construct Binary Search Tree from Preorder | C++ Placement Course | Lecture 28.3

Check for Binary Search Tree | C++ Placement Course | Lecture 28.4

Build Balanced BST from Sorted Array | C++ Placement Course | Lecture 28.5

Catalan Numbers Application | C++ Placement Course | Lecture 28.6

Zig Zag Traversal Binary Search Tree | C++ Placement Course | Lecture 28.7

Identical Binary Search Tree | C++ Placement Course | Lecture 28.8

Largest Binary Search Tree in BT | C++ Placement Course | Lecture 28.10

Recover Binary Search Tree | C++ Placement Course | Lecture 28.11

Set & Multiset | Standard Template Library | C++ Placement Course | Lecture 28.12

Place Elements to Maximise Minimum Distance | C++ Placement Course | Lecture 29.1

Page Allocation Problem | C++ Placement Course | Lecture 29.2

Painters Partition Problem | C++ Placement Course | Lecture 29.3

Search in Sorted & Rotated Array | C++ Placement Course | Lecture 29.4

Find the Peak Element | C++ Placement Course | Lecture 29.5

Max Sum Subarray | Sliding Window Challenge | C++ Placement Course | Lecture 30.1

Minimum Subarray Size | Sliding Window Challenge | C++ Placement Course | Lecture 30.2

Form Number Divisible by 3 | Sliding Window Challenge | C++ Placement Course | Lecture 30.3

Subarray with Palindromic Concatenation | C++ Placement Course | Lecture 30.4

Perfect Numbers in Subarrays | C++ Placement Course | Lecture 30.5

Heap Intro Final Export for Upload

HeapsSort | C++ Placement Course | Lecture 31.2

Heap STL | C++ Placement Course | Lecture 31.3

Heaps - Median of Running Stream | C++ Placement Course | Lecture 31.4

Heaps - Merge K sorted Arrays | C++ Placement Course

Heap -Smallest Sequence with sum K | C++ Placement Course | Lecture 31.6

Hashing - Introduction to Hasing | C++ Placement Coure | Lecture 32.1

Hashing STL - C++ Placement Course | Lecture 32.2

Hashing - Count frequency of elements | C++ Placement Course | Lecture 32.3

Hashing - Vertical Order Print | C++ Placement Course | Lecture 32.4

Hashing - Number of Subarrays with Sum Zero | C++ Placement Course | Lec 32.5

Hashing - Sliding Window Technique | C++ Placement Course

Hashing - TOP K MOST FREQUENT ELEMENTS | C++ Placement Course | Lecture 32.7

Sudoku Solver - Hashing | C++ Placement Course | Lecture 32.8

Greedy Algorithm - Introduction | C++ Placement Course Lecture 33.1

Indian Coin Change - Greedy Algorithm | C++ Placement Course | Lecture 33.2

Activity Selection Problem - Greedy Algorithm | C++ Placement Course | Lecture 33.3

Fractional Knapsack - Greedy Algorithm | C++ Placement Course | Lecture 33.4

Optimal Pattern Merge - Greedy Algorithm | C++ Placement Course | Lecture 33.5

Expedi - Greedy Algorithm | C++ Placement Course | Lecture 33.6

Maximum and Minimum Difference - Greedy Algorithm | C++ Placement Course | Lecture 33.7

Graphs - Introduction | C++ Placement Course | Lecture 34.1

Dynamic Programming - Introduction | C++ Placement Course | Lecture 35.1

Graph Terminologies | C++ Placement Course | Lecture 34.2

Graphs - Representation | C++ Placement Course | Lecture 34.3

BFS - Breadth First Search | C++ Placement Course | Lecture 34.4

DFS - Depth First Search | C++ Placement Course | Lecture 34.5

Graphs - Topological Sort | C++ Placement Course | Lecture 34.6

Cycle Detection in Undirected Graphs | C++ Placement Course | Lecture 34.7

Cycle Detection in Directed Graph | C++ Placement Course | Lecture 34.8

Connected Components | C++ Placement Course | Lecture 34.9

Bipartite Graph - C++ Placement Course | Lecture 34.10

Disjoint Set Union - Graphs | C++ Placement Course | Lecture 34.11

Cycle Detection in Undirected Graph using DSU | C++ Placement Course | Lecture 34.12

Cycle Detection in Undirected Graph using DSU | C++ Placement Course | Lecture 34.12

Kruskal's Algorithm | C++ Placement Course | Lecture 34.13

Prims Algorithm | C++ Placement Course | Lecture 34.14

Dijkstra's Algorithm | C++ Placement Course | Lecture 34.15

Bellman Ford Algorithm | C++ Placement Course | Lecture 34.16

Floyd Warshall Algorithm | C++ Placement Course | Lecture 34.17

Snakes and Ladders - Graphs | C++ Placement Course | Lecture 34.18

Graphs - Surrounded Region | C++ Placement Course | Lecture 34.19

Fibonacci Sequence - Dynamic Programming | C++ Placement Course | Lecture 35.2

Minimum Number of Squares - Dynamic Programming | C++ Placement Course | Lecture 35.3

Coin Change Problem - Dynamic Programming | C++ Placement Course | Lecture 35.4

01 Knapsack - Dynamic Programming | C++ Placement Course | Lecture 35.7

Longest Increasing Subsequence - Dynamic Programming | C++ Placement Course | Lecture 35.8

Longest Common Subsequence - Dynamic Programming | C++ Placement Course | Lecture 35.9

Matrix Chain Multiplication - Dynamic Programming | C++ Placement Course | Lecture 35.10

Minimum Jumps to Reach End - Dynamic Programming | C++ Placement Course | Lecture 35.11

Optimal Game Strategy - Dynamic Programming | C++ Placement Course | Lecture 35.12

Number of Subsequences - Dynamic Programming | C++ Placement Course | Lecture 35.13

Count Number of Binary Strings - Dynamic Programming | C++ Placement Course | Lecture 35.14

0-N Knapsack - Dynamic Programming | C++ Placement Course | Lecture 35.15

Kadane Algorithm - Dynamic Programming | C++ Placement Course | Lecture 35.5

Maximum Length of Bitonic Subsequence - Dynamic Programming | C++ Placement Course | Lecture 35.19

Friends Paring Problem - Dynamic Programming | C++ Placement Course | Lecture 35.20

Ugly Numbers - Dynamic Programming | C++ Placement Course | Lecture 35.18

LCS with 3 Strings - Dynamic Programming | C++ Placement Course | Lecture 35.16

K-Ordered LCS - Dynamic Programming | C++ Placement Course | Lecture 35.17

Tries - Introduction | C++ Placement Course | Lecture 36.1

XOR SubArray - Tries Challenges | C++ Placement Course | Lecture36.2

Trie bash - Challenge | C++ Placement Course | Lecture 36.3

Digital Dictionary - Tries Challenges | C++ Placement Course | Lecture 36.4

Extended Euclid Algorithm - Number Theory Advanced | C++ Placement Course | Lecture 37.1

Multiplicative Modulo Inverse - Number Theory Advanced | Lecture 37.2

Euler Totient Function - Number Theory Advanced | C++ Placement Course | Lecture 37.3

Binary Exponentiation - Number Theory Advanced | C++ Placement Course | Lecture 37.4

Fermat Little and Wilson Theorem - Number Theory Advanced | C++ Placement Course | Lecture 37.5

Boring Factorials SPOJ - Number Theory Advanced | C++ Placement Course | Lecture 37.6

Introduction, Fibonacci in Log(n) - Matrix Exponentiation | C++ Placement Course | Lecture 38.1

String Hashing - String Algorithms | C++ Placement Course | Lecture 39.1

SubStr() Function - String Algorithm | C++ Placement Course | Lecture 39.2

KMP Algorithms - String Algorithm | C++ Placement Course | Lecture 39.3

Rabin Karp - String Algorithms | C++ Placement Course | Lecture 39.4

Guide to Interactive Problems | C++ Placement Course | Lecture 43

Segment Tree - Introduction and Build | C++ Placement Course | Lecture 40.1

Query in Segment Tree | C++ Placement Course | Lecture 40.2

Private video

Maximum and Minimum Queries/Update | C++ Placement Course | Lecture 40.4

Number of minimums on a segment | C++ Placement Course | Lecture 40.5

User Snippets in VSCode | C++ Placement Course | Lecture 40.6

Segment with Max Sum | C++ Placement Course | Lecture 40.7

Kth One - Segment Tree | C++ Placement Course | Lecture 40.8

First Element at Least X - Segment Tree | C++ Placement Course | Lecture 40.9

Private video

Private video

Nested Segments - Segment Tree | C++ Placement Course | Lecture 40.12

Intersecting Segments - Segment Tree | C++ Placement Course | Lecture 40.13

Fenwick Tree - Introduction | C++ Placement Course | Lecture 41.1

Point & Range Updates - Fenwick Tree | C++ Placement Course | Lecture 41.2

Count Inversion - Fenwick Tree | C++ Placement Course | Lecture 41.3

Square Root Decomposition - Introduction | C++ Placement Course | Lecture 42.1

RMQSQ - Spoj | C++ Placement Course | Lecture 42.2

Mo's Algorithm - Square Root Decomposition | Lecture 42.3

DQueary - SPOJ | C++ Placement Course | Lecture 42.4

Policy Based Data Structures | C++ Placement Course | Lecture 44

Private video

Book Allocation or Allocate Books Problem | DSA Series - Binary Search

Painter's Partition Problem | DSA Placement Series - Binary Search | Lecture 22

Aggressive Cows Problem | DSA Placement Series - Binary Search | Lecture 23