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