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 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 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