Complete C++ Placement DSA Course

CodeHelp - by Babbar via YouTube

Start learning Write review

Master data structures and algorithms through this comprehensive C++ programming course designed specifically for placement preparation. Learn fundamental programming concepts starting with flowcharts and basic C++ syntax, then progress through advanced topics including arrays, binary search, sorting algorithms, and the C++ Standard Template Library. Develop proficiency in essential data structures such as linked lists, stacks, queues, binary trees, binary search trees, heaps, hashmaps, and tries through hands-on implementation and problem-solving sessions. Explore advanced algorithmic concepts including recursion, backtracking, graph algorithms (BFS, DFS, shortest path algorithms, minimum spanning trees), and dynamic programming with extensive coverage of optimization techniques. Practice solving real interview questions from top tech companies like Google, Amazon, and Microsoft while mastering time and space complexity analysis. Build expertise in object-oriented programming principles, memory management with pointers and dynamic allocation, and advanced topics like greedy algorithms and pattern matching to prepare thoroughly for technical interviews and competitive programming challenges.

Syllabus

Lecture 1: Intro to Programming & Flowcharts
Lecture 2: Write Your First Program in C++
Lecture 3: If-Else, While loop & Lots of Patterns (Part-1)
Lecture 4: Solving Pattern Questions (Part-2)
Lecture 5: Bitwise Operators, For Loops, Operator Precedence & Variable Scoping
Lecture 6: Binary & Decimal Number System
Lecture 7: LeetCode Problem Solving Session
Lecture 8: Switch Statement & Functions
Lecture 9: Introduction to Arrays in C++
Lecture 10: Solving LeetCode/CodeStudio Questions [Arrays]
Lecture 11:Time & Space Complexity || How to avoid Time Limit Exceeded [TLE]
Lecture 12: Binary Search Explained in 1 Video [Theory + Code]
Lecture 13: Binary Search Interview Questions [Google, Amazon, Microsoft] || ProblemSet - 1
Lecture14: Binary Search Interview Questions [Google, Amazon, Microsoft] || ProblemSet - 2
Lecture 15: Book Allocation Problem || Aggressive Cows Problem || Binary Search Advanced Problems
Lecture16: Selection Sort [Theory + Code] || C++ Placement Series
CodeHelp Weekly Contest 1 is LIVE || Game starts Now
Lecture 17: BUBBLE SORT in 1 Video [Theory + Optimised Code] || Best/Worst Case Complexity
Lecture 18: INSERTION SORT in 1 Video [Theory + Code] || Best/Worst Case Complexity
Lecture19: C++ STL in 1 Video (Re-Uploaded)
Lecture 20: Solving LeetCode/CodeStudio Questions [Arrays]
Lecture21: Solving LeetCode/CodeStudio Questions [Arrays]
CodeHelp Weekly Contest 2 is LIVE || Contest 1 Results announced
Lecture22: All about Char Arrays, Strings & solving LeetCode Questions
Lecture 23: Introduction to 2D Arrays in C++ || LeetCode Questions
Lecture 24: Basic Maths for DSA || Sieve || Modular Arithmetics || Euclid’s Algorithm
DSA Placement course || Phase-1 Completed
Lecture 25: Pointers in C++ || Part-1 || DSA Placement Course - Love Babbar
Lecture 26: Pointers in C++ || Part-2 || DSA Placement Course - Love Babbar
Lecture27: Double Pointers in C++ || Pointers Practice MCQs
Lecture28: Reference Variable | Static vs Dynamic Memory | Part-1
Lecture29: Dynamic Memory Allocation of 2D Arrays
Lecture30: Macros, Global Variables, Inline Functions & Default Args
Lecture 31: Learning Recursion the Best Way! | 10 Day Recursion Challenge
Lecture32: Understanding Recursion the easiest way || Day-2 || 10 Day Recursion Challenge
Lecture33: Recursion and Binary Search | Day-3 | 10 Days Recursion Challenge
Lecture34: Recursion with Strings | Day-4 | 10 Day Recursion Challenge
Lecture35: Merge Sort using Recursion | Day-5 | 10 Day Recursion Challenge
CodeHelp Weekly Contest 3 is LIVE || Contest 1 & 2 Gifts Sent !!
Lecture36: Quick Sort using Recursion | Day-6 | 10 Day Recursion Challenge
Lecture37: Recursion - Subsets / Subsequences of String [Theory + Code]
Lecture38: Phone Keypad Problem Recursion || C++ Placement Course
Lecture39: Permutations of a String || C++ Placement Course
Lecture40: Rat in a Maze Problem || C++ Placement Course 2022
Lecture 41: Time & Space Complexity of Recursive Algorithms || C++ Placement Course
Lecture 42: OOPs Concepts in C++ || Part-1
Lecture 43 : 4 Pillars of OOPs Concept -Inheritance, Polymorphism, Encapsulation & Abstraction
Lecture 44: Linked List & its types - Singly, Doubly, Circular etc.
Lecture 45: Linked List Questions: Reverse LL and find Middle of LL
CodeHelp Weekly Contest 4 is LIVE || Contest Editorial/Solutions
Lecture 46: Linked List Questions: Reverse LL in "K group" && Check LL is Circular or not
Lecture47: Detect & Remove Loop in Linked List [Approach Discussion + Optimised Implementation]
Lecture 48: Remove Duplicates from a Sorted/UnSorted Linked List
Lecture 49: Merge 2 Sorted Linked Lists || Sort 0s, 1s and 2s in Linked List
Lecture 50: Check Palindrome in Linked List || C++ Placement Course
Lecture 51: Add 2 Numbers represented by Linked Lists || C++ Placement Course
Lecture 52: Clone a Linked List with Random Pointers || C++ Placement Course
Lecture 53: Merge Sort in Linked List [ Theory + Implementation ]
Lecture 54: Introduction to Stacks [Theory + Implementation] || C++ Placement Course
Lecture 55: Stack Interview Questions || Placement Series by Love Babbar
Lecture 56: Largest Rectangular Area in Histogram [Optimised Approach]
Lecture 57: Stack - Celebrity Problem && Max Rectangle in Binary Matrix with all 1's
Lecture 58: "N" Stacks in an Array || Stack Hard Question
Lecture 59: Design Special Stack Problem || C++ Placement Course
Lecture 60: Queues in C++ [STL + Implementation + Types of Queues ]
Lecture 61: Queue FAANG Interview Questions || Placement Series by Love Babbar
Lecture 62: Binary Trees & its Representation || Different types of Traversals
CodeHelp Weekly Contest 5 is LIVE || Contest Editorial/Solutions
Lecture 63: Binary Tree FAANG Interview Questions || Part-1
Lecture 64: Binary Tree FAANG Interview Questions || Part-2
Lecture 65: Binary Tree FAANG Interview Questions || Part-3
Lecture 66: Construct a Binary Tree from InOrder/PreOrder/PostOrder Traversal
Lecture 67: Minimum Time to BURN the Entire Binary Tree || C++ Placement Series
Lecture 68: Morris Traversal || Flatten a Binary tree to Linked List || C++ Placement Series
Lecture 69: Binary Search Tree & its Implementation || Insertion, Deletion & Searching a Node
Lecture 70: Binary SearchTree FAANG Interview Questions || Part-1
Lecture 71: Binary SearchTree FAANG Interview Questions || Part-2
Lecture 72: Merge 2 Binary Search Trees || C++ Placement Series
Lecture 73: Largest BST in a Binary Tree || C++ Placement Series
Lecture 74: Heaps in C++ || Heap Sort || Insertion/Deletion in Heap || Priority Queue STL
Lecture 75: Heaps in C++ || Interview Questions || Part - 1
CodeHelp Weekly Contest 6 is LIVE || MacBook Giveaway Coming Soon
Lecture 76: Heaps in C++ || Interview Questions || Part - 2
Lecture 77: Heaps Hard Interview Questions || Part - 3
Lecture 78: Hashmaps in C++ || C++ Placement Series
CodeHelp Weekly Contest 7 is LIVE
Lecture 79: Trie & its Implementation || C++ Placement Series
Lecture 80: Longest Common Prefix Problem || Tries || C++ Placement Series
Lecture 81: Implement a Phone Directory Using Trie || C++ Placement Series
Lecture 82: Rat in Maze Problem || Backtracking Day 1 || C++ Placement Series
Lecture 83: N-Queen Problem || Backtracking Day 2 || C++ Placement Series
Lecture 84: Sudoku Solver Problem || Backtracking Day 3 || C++ Placement Series
Lecture 85: Introduction to Graphs || Creation and Implementation
Lecture 86: BFS Traversal in Graph || C++ Placement Series
Lecture 87: DFS Traversal in Graph || C++ Placement Series
Lecture 88: Cycle Detection in Undirected Graphs || Using BFS and DFS
Lecture 89: Cycle Detection in Directed Graphs || Placement Series
Lecture 90: Topological Sort ( Using DFS ) || Placement Series
Lecture 91: Topological Sort ( Using Kahn's Algorithm ) || Placement Series
CodeHelp Weekly Contest 9 is LIVE || C++ Placement Series
Lecture 92: Cycle Detection in Directed Graph || Using BFS
Lecture 93: Shortest Path in Undirected Graphs || C++ Placement Series
Lecture 94: Shortest Path in Directed Acyclic Graphs || C++ Placement Series
Lecture 95: Dijkstra's Algorithm || C++ Placement Series
Lecture 96: Minimum Spanning Tree || Prim's Algorithm
Lecture 97: Kruskal's Algorithm || Disjoint Set || Union by Rank & Path Compression
Lecture 98: Bridges in a Graph || C++ Placement Series
Lecture 99: Articulation Points in Graphs || C++ Placement Series
Lecture 100: Kosaraju's Algorithm for Strongly Connected Components || C++ Placement Series
Lecture 101: Bellman Ford Algorithm || C++ Placement Series
Lecture 102: Introduction to Dynamic Programming | Memoization | Tabulation | Space Optimisation
Lecture 103: Minimum Cost Climbing Stairs || DP Series
Lecture 104: Minimum Number of Coins || DP Series
Lecture 105: Maximum Sum of Non-Adjacent Elements || DP Series
Lecture 106: House Robbery Problem || DP Series
Lecture 107: Cut Rod into Segments of X, Y, Z || DP Series
Lecture 108: Count derangements || DP Series
Lecture 109: Painting Fence Algorithm || DP Series
Lecture 110: 0/1 KnapSack Problem || learn 2-D DP Concept || DP Series
Lecture 111: Combination Sum IV Problem || DP Series
Lecture 112: Perfect Squares Problem || DP Series
Lecture 113: Minimum Cost for Tickets || Part-1 || DP Series
Lecture 114: Minimum Cost for Tickets || Part-2 || DP Series
Lecture 115: Largest Square area in Matrix || DP Series
Lecture 116: Min Score Triangulation of Polygon || DP Series
Lecture 117: Minimum Sideways Jump LeetCode || 2D-DP || DP Series
Lecture 118: Reducing Dishes LeetCode || 2D-DP || DP Series
Lecture 119: Longest Increasing Subsequence + Russian Doll LeetCode || DP + Binary Search
Lecture 120: Maximum Height by Stacking Cuboid || DP Series
Lecture 121: Pizza with 3n Slices || 2D - DP || DP Series
Lecture 122: Number of Dice Rolls with Target Sum || DP Series
Lecture 123: Partition Equal Subset Sum || DP Series
Lecture 124: Minimum Swaps to make Subsequences Increasing || DP Series
Lecture 125: Longest Arithmetic Subsequence || DP Series
Lecture 126: Longest AP with given Difference "d" || DP Series
Lecture 127: Unique Binary Search Trees || Catalan Number
Lecture 128: Guess Number Higher or Lower || DP Series
Lecture 129: Minimum Cost Tree From Leaf Values || DP Series
Lecture 130: Buy and Sell Stock [Part 1] || DP Series
Lecture 131: Buy and Sell Stock [Part 2] || DP Series
Lecture 132: Buy and Sell Stock [Part 3] || DP Series
Lecture 133: Buy and Sell Stock [Part 4] || DP Series
Lecture 134: Buy and Sell Stock [Part 5] || DP Series
Lecture 135: Longest Common Subsequence || DP on Strings
Lecture 136: Longest Palindromic Subsequence || DP on Strings
Lecture 137: EDIT Distance || DP on Strings
Lecture 138: Maximum Rectangle with all 1's || DP Series
Lecture 139: Wildcard Pattern Matching || DP Series
Lecture 140: GREEDY ALGORITHMS in 1 VIDEO