Complete C++ Placement DSA Course

Complete C++ Placement DSA Course

CodeHelp - by Babbar via YouTube Direct link

Lecture 132: Buy and Sell Stock [Part 3] || DP Series

141 of 149
Previous
Next

141 of 149

Lecture 132: Buy and Sell Stock [Part 3] || DP Series

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Complete C++ Placement DSA Course

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

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free
Someone learning on their laptop while sitting on the floor.