Getting everything ready for you…

Loading courses, problems and your progress. This takes just a moment.

0s

Courses › DSA

Complete C++ Placement DSA Course

By CodeHelp - by Babbar · Hindi · Beginner

C++ fundamentals and full DSA for placements.

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. Lecture 1: Intro to Programming & Flowcharts (57:54)
  2. Lecture 2: Write Your First Program in C++ (56:00)
  3. Lecture 3: If-Else, While loop & Lots of Patterns (Part-1) (55:52)
  4. Lecture 4: Solving Pattern Questions (Part-2) (1:03:58)
  5. Lecture 5: Bitwise Operators, For Loops, Operator Precedence & Variable Scoping (1:15:44)
  6. Lecture 6: Binary & Decimal Number System (35:15)
  7. Lecture 7: LeetCode Problem Solving Session (42:43)
  8. Lecture 8: Switch Statement & Functions (1:24:59)
  9. Lecture 9: Introduction to Arrays in C++ (1:29:54)
  10. Lecture 10: Solving LeetCode/CodeStudio Questions [Arrays] (1:34:54)
  11. Lecture 11:Time & Space Complexity || How to avoid Time Limit Exceeded [TLE] (29:12)
  12. Lecture 12: Binary Search Explained in 1 Video [Theory + Code] (38:41)
  13. Lecture 13: Binary Search Interview Questions [Google, Amazon, Microsoft] || ProblemSet - 1 (41:33)
  14. Lecture14: Binary Search Interview Questions [Google, Amazon, Microsoft] || ProblemSet - 2 (55:35)
  15. Lecture 15: Book Allocation Problem || Aggressive Cows Problem || Binary Search Advanced Problems (1:05:13)
  16. Lecture16: Selection Sort [Theory + Code] || C++ Placement Series (34:29)
  17. CodeHelp Weekly Contest 1 is LIVE || Game starts Now (2:13)
  18. Lecture 17: BUBBLE SORT in 1 Video [Theory + Optimised Code] || Best/Worst Case Complexity (31:52)
  19. Lecture 18: INSERTION SORT in 1 Video [Theory + Code] || Best/Worst Case Complexity (34:04)
  20. Lecture19: C++ STL in 1 Video (Re-Uploaded) (1:01:51)
  21. Lecture 20: Solving LeetCode/CodeStudio Questions [Arrays] (35:38)
  22. Lecture21: Solving LeetCode/CodeStudio Questions [Arrays] (33:32)
  23. CodeHelp Weekly Contest 2 is LIVE || Contest 1 Results announced (3:22)
  24. Lecture22: All about Char Arrays, Strings & solving LeetCode Questions (1:53:20)
  25. Lecture 23: Introduction to 2D Arrays in C++ || LeetCode Questions (1:30:36)
  26. Lecture 24: Basic Maths for DSA || Sieve || Modular Arithmetics || Euclid’s Algorithm (44:08)
  27. DSA Placement course || Phase-1 Completed (0:55)
  28. Lecture 25: Pointers in C++ || Part-1 || DSA Placement Course - Love Babbar (44:11)
  29. Lecture 26: Pointers in C++ || Part-2 || DSA Placement Course - Love Babbar (1:03:59)
  30. Lecture27: Double Pointers in C++ || Pointers Practice MCQs (52:52)
  31. Lecture28: Reference Variable | Static vs Dynamic Memory | Part-1 (47:12)
  32. Lecture29: Dynamic Memory Allocation of 2D Arrays (22:53)
  33. Lecture30: Macros, Global Variables, Inline Functions & Default Args (39:23)
  34. Lecture 31: Learning Recursion the Best Way! | 10 Day Recursion Challenge (37:36)
  35. Lecture32: Understanding Recursion the easiest way || Day-2 || 10 Day Recursion Challenge (45:16)
  36. Lecture33: Recursion and Binary Search | Day-3 | 10 Days Recursion Challenge (43:14)
  37. Lecture34: Recursion with Strings | Day-4 | 10 Day Recursion Challenge (36:49)
  38. Lecture35: Merge Sort using Recursion | Day-5 | 10 Day Recursion Challenge (24:23)
  39. CodeHelp Weekly Contest 3 is LIVE || Contest 1 & 2 Gifts Sent !! (2:32)
  40. Lecture36: Quick Sort using Recursion | Day-6 | 10 Day Recursion Challenge (37:55)
  41. Lecture37: Recursion - Subsets / Subsequences of String [Theory + Code] (27:25)
  42. Lecture38: Phone Keypad Problem Recursion || C++ Placement Course (30:42)
  43. Lecture39: Permutations of a String || C++ Placement Course (21:50)
  44. Lecture40: Rat in a Maze Problem || C++ Placement Course 2022 (37:31)
  45. Lecture 41: Time & Space Complexity of Recursive Algorithms || C++ Placement Course (49:23)
  46. Lecture 42: OOPs Concepts in C++ || Part-1 (1:29:14)
  47. Lecture 43 : 4 Pillars of OOPs Concept -Inheritance, Polymorphism, Encapsulation & Abstraction (1:35:29)
  48. Lecture 44: Linked List & its types - Singly, Doubly, Circular etc. (2:21:18)
  49. Lecture 45: Linked List Questions: Reverse LL and find Middle of LL (52:40)
  50. CodeHelp Weekly Contest 4 is LIVE || Contest Editorial/Solutions (3:35)
  51. Lecture 46: Linked List Questions: Reverse LL in "K group" && Check LL is Circular or not (40:08)
  52. Lecture47: Detect & Remove Loop in Linked List [Approach Discussion + Optimised Implementation] (50:36)
  53. Lecture 48: Remove Duplicates from a Sorted/UnSorted Linked List (27:25)
  54. Lecture 49: Merge 2 Sorted Linked Lists || Sort 0s, 1s and 2s in Linked List (58:44)
  55. Lecture 50: Check Palindrome in Linked List || C++ Placement Course (22:38)
  56. Lecture 51: Add 2 Numbers represented by Linked Lists || C++ Placement Course (26:24)
  57. Lecture 52: Clone a Linked List with Random Pointers || C++ Placement Course (55:08)
  58. Lecture 53: Merge Sort in Linked List [ Theory + Implementation ] (27:49)
  59. Lecture 54: Introduction to Stacks [Theory + Implementation] || C++ Placement Course (43:11)
  60. Lecture 55: Stack Interview Questions || Placement Series by Love Babbar (1:35:53)
  61. Lecture 56: Largest Rectangular Area in Histogram [Optimised Approach] (28:31)
  62. Lecture 57: Stack - Celebrity Problem && Max Rectangle in Binary Matrix with all 1's (43:54)
  63. Lecture 58: "N" Stacks in an Array || Stack Hard Question (37:48)
  64. Lecture 59: Design Special Stack Problem || C++ Placement Course (29:29)
  65. Lecture 60: Queues in C++ [STL + Implementation + Types of Queues ] (1:05:02)
  66. Lecture 61: Queue FAANG Interview Questions || Placement Series by Love Babbar (2:23:55)
  67. Lecture 62: Binary Trees & its Representation || Different types of Traversals (55:06)
  68. CodeHelp Weekly Contest 5 is LIVE || Contest Editorial/Solutions (2:24)
  69. Lecture 63: Binary Tree FAANG Interview Questions || Part-1 (1:01:05)
  70. Lecture 64: Binary Tree FAANG Interview Questions || Part-2 (1:11:31)
  71. Lecture 65: Binary Tree FAANG Interview Questions || Part-3 (59:15)
  72. Lecture 66: Construct a Binary Tree from InOrder/PreOrder/PostOrder Traversal (36:35)
  73. Lecture 67: Minimum Time to BURN the Entire Binary Tree || C++ Placement Series (28:28)
  74. Lecture 68: Morris Traversal || Flatten a Binary tree to Linked List || C++ Placement Series (31:54)
  75. Lecture 69: Binary Search Tree & its Implementation || Insertion, Deletion & Searching a Node (1:05:47)
  76. Lecture 70: Binary SearchTree FAANG Interview Questions || Part-1 (37:55)
  77. Lecture 71: Binary SearchTree FAANG Interview Questions || Part-2 (48:19)
  78. Lecture 72: Merge 2 Binary Search Trees || C++ Placement Series (45:58)
  79. Lecture 73: Largest BST in a Binary Tree || C++ Placement Series (23:09)
  80. Lecture 74: Heaps in C++ || Heap Sort || Insertion/Deletion in Heap || Priority Queue STL (1:04:56)
  81. Lecture 75: Heaps in C++ || Interview Questions || Part - 1 (1:08:00)
  82. CodeHelp Weekly Contest 6 is LIVE || MacBook Giveaway Coming Soon (2:51)
  83. Lecture 76: Heaps in C++ || Interview Questions || Part - 2 (50:01)
  84. Lecture 77: Heaps Hard Interview Questions || Part - 3 (1:05:15)
  85. Lecture 78: Hashmaps in C++ || C++ Placement Series (1:03:27)
  86. CodeHelp Weekly Contest 7 is LIVE (1:20)
  87. Lecture 79: Trie & its Implementation || C++ Placement Series (48:20)
  88. Lecture 80: Longest Common Prefix Problem || Tries || C++ Placement Series (20:17)
  89. Lecture 81: Implement a Phone Directory Using Trie || C++ Placement Series (27:04)
  90. Lecture 82: Rat in Maze Problem || Backtracking Day 1 || C++ Placement Series (31:37)
  91. Lecture 83: N-Queen Problem || Backtracking Day 2 || C++ Placement Series (31:04)
  92. Lecture 84: Sudoku Solver Problem || Backtracking Day 3 || C++ Placement Series (23:10)
  93. Lecture 85: Introduction to Graphs || Creation and Implementation (33:29)
  94. Lecture 86: BFS Traversal in Graph || C++ Placement Series (23:39)
  95. Lecture 87: DFS Traversal in Graph || C++ Placement Series (14:18)
  96. Lecture 88: Cycle Detection in Undirected Graphs || Using BFS and DFS (32:03)
  97. Lecture 89: Cycle Detection in Directed Graphs || Placement Series (18:30)
  98. Lecture 90: Topological Sort ( Using DFS ) || Placement Series (20:09)
  99. Lecture 91: Topological Sort ( Using Kahn's Algorithm ) || Placement Series (17:02)
  100. CodeHelp Weekly Contest 9 is LIVE || C++ Placement Series (2:35)

More DSA courses