| Lecture 1: Intro to Programming & Flowcharts |
L1 Code |
H1 |
PDF |
PDF |
| Lecture 2: Write Your First Program in C++ |
L2 Code |
H2 |
PDF |
PDF |
| Lecture 3: If-Else, While loop & Lots of Patterns |
L3 Code |
H3 |
PDF |
PDF |
| Lecture 4: Solving Pattern Questions |
L4 Code |
H4 |
PDF |
PDF |
| Lecture 5: Bitwise Operators, For Loops, Operator Precedence & Variable Scoping |
L5 Code |
H5 |
PDF |
PDF |
| Lecture 6: Binary & Decimal Number System |
L6 Code |
H6 |
PDF |
PDF |
| Lecture 7: LeetCode Problem Solving Session |
L7 Code |
- |
PDF |
PDF |
| Lecture 8: Switch Statement & Functions |
L8 Code |
H8 |
PDF |
PDF |
| Lecture 9: Introduction to Arrays in C++ |
L9 Code |
H9 |
PDF |
PDF |
| Lecture 10: Solving LeetCode/CodeStudio Questions |
L10 Code |
H10 |
PDF |
PDF |
| Lecture 11: Time & Space Complexity |
- |
- |
PDF |
PDF |
| Lecture 12: Binary Search Explained in 1 Video |
L12 Code |
- |
PDF |
PDF |
| Lecture 13: Binary Search Interview Questions Part-1 |
L13 Code |
H13 |
PDF |
PDF |
| Lecture 14: Binary Search Interview Questions Part-2 |
L14 Code |
- |
PDF |
- |
| Lecture 15: Book Allocation Problem |
L15 Code |
H15 |
PDF |
- |
| Lecture 16: Selection Sort |
L16 Code |
H16 |
PDF |
PDF |
| Lecture 17: Bubble Sort |
L17 Code |
H17 |
PDF |
- |
| Lecture 18: Insertion Sort |
L18 Code |
- |
PDF |
- |
| Lecture 19: C++ STL |
L19 Code |
- |
- |
- |
| Lecture 20: Solving LeetCode/CodeStudio Questions (Arrays) |
L20 Code |
H20 |
PDF |
- |
| Lecture 21: Solving LeetCode/CodeStudio Questions (Arrays) |
L21 Code |
- |
PDF |
- |
| Lecture22: All about Char Arrays, Strings |
L22 Code |
H22 |
PDF |
- |
| Lecture 23: Introduction to 2D Arrays |
L23 Code |
H23 |
PDF |
- |
| Lecture 24: Basic Maths For DSA |
L24 Code |
H24 |
PDF |
- |
| Lecture 25: Pointers in C++ (Part 1) |
L25 Code |
H25 |
PDF |
- |
| Lecture 26: Pointers in C++ (Part 2) |
L26 Code |
H26 |
PDF |
- |
| Lecture 27: Double Pointer in C++ |
L27 Code |
- |
PDF |
- |
| Lecture 28: Reference Variable & Static vs Dynamic Memory |
L28 Code |
H28 |
PDF |
- |
| Lecture 29: Dynamic Memory Allocation of 2D Arrays |
L29 Code |
H29 |
PDF |
- |
| Lecture 30 : Macros, Global Variables, Inline Func |
L30 Code |
H30 |
PDF |
- |
| Lecture 31: Learning Recursion |
L31 Code |
H31 |
PDF |
PDF |
| Lecture 32: Understanding Recursion |
L32 Code |
H32 |
PDF |
PDF |
| Lecture 33: Recursion and Binary Search |
L33 Code |
H33 |
PDF |
PDF |
| Lecture 34: Recursion with Strings |
L34 Code |
H34 |
PDF |
PDF |
| Lecture 35: Merge Sort Using Recursion |
L35 Code |
H35 |
PDF |
PDF |
| Lecture 36: Quick Sort Using Recursion |
L36 Code |
H36 |
PDF |
PDF |
| Lecture 37: Recursion - Subsets / Subsequences |
L37 Code |
- |
PDF |
PDF |
| Lecture 38: Phone Keypad Problem Recursion |
L38 Code |
- |
PDF |
PDF |
| Lecture 39: Permutations of a String |
L39 Code |
- |
PDF |
PDF |
| Lecture 40: Rat in a Maze Problem |
L40 Code |
- |
PDF |
PDF |
| Lecture 41: Time & Space Complexity of Recursive Algorithms |
- |
H41 |
PDF |
PDF |
| Lecture 42: OOPs Conecept in C++ |
L42 Code |
H42 |
PDF |
- |
| Lecture 43: 4 Pillars of OOPs Concept |
L43 Code |
H43 |
PDF |
- |
| Lecture 44: Linked List & its types |
L44 Code |
H44 |
PDF |
- |
| Lecture 45: Linked List Questions: Reverse LL & Middle of LL |
L45 Code |
H45 |
PDF |
- |
| Lecture 46: Linked List Questions: Reverse LL in K group |
L46 Code |
- |
PDF |
- |
| Lecture 47: Detect & Remove Loop in Linked List |
L47 Code |
- |
PDF |
- |
| Lecture 48 : Remove Duplicates from a Sorted/UnSorted List |
L48 Code |
H48 |
PDF |
- |
| Lecture 49: Merge 2 Sorted Linked Lists |
L49 Code |
- |
PDF |
- |
| Lecture 50: Check Palindrome in Linked List |
L50 Code |
- |
PDF |
- |
| Lecture 51: Add 2 Numbers represented by Linked Lists |
L51 Code |
- |
PDF |
- |
| Lecture 52: Clone a Linked List with Random Pointers |
L52 Code |
- |
PDF |
- |
| Lecture 53: Merge Sort in Linked List |
L53 Code |
- |
PDF |
- |
| Lecture 54: Introduction to Stacks |
L54 Code |
- |
PDF |
- |
| Lecture 55: Stack Interview Questions |
L55 Code |
- |
PDF |
- |
| Lecture 56: Largest Rectangular Area in Histogram |
L56 Code |
- |
PDF |
- |
| Lecture 57: Stack - Celebrity Problem |
L57 Code |
- |
PDF |
- |
| Lecture 58: "N" Stacks in an Array |
L58 Code |
- |
PDF |
- |
| Lecture 59: Design Special Stack Problem |
L59 Code |
- |
PDF |
- |
| Lecture 60: Queues in C++ |
L60 Code |
- |
PDF |
- |
| Lecture 61: Queue FAANG Interview Questions |
L61 Code |
- |
PDF |
- |
| Lecture 62: Binary Trees & its Representation |
L62 Code |
H62 |
PDF |
- |
| Lecture 63: Binary Tree FAANG Interview Questions Part 1 |
L63 Code |
- |
PDF |
- |
| Lecture 64: Binary Tree FAANG Interview Questions Part 2 |
L64 Code |
- |
PDF |
- |
| Lecture 65: Binary Tree FAANG Interview Questions Part 3 |
L65 Code |
- |
PDF |
- |
| Lecture 66: Construct BT from InOrder/PreOrder/PostOrder |
L66 Code |
- |
PDF |
- |
| Lecture 67: Minimum Time to BURN the Entire Tree |
L67 Code |
- |
PDF |
- |
| Lecture 68: Morris Traversal - Flatten a Binary tree to LL |
L68 Code |
H68 |
PDF |
- |
| Lecture 69: Binary Search Tree & its Implementation |
L69 Code |
H69 |
- |
- |
| Lecture 70: Binary Search Tree Questions Part 1 |
L70 Code |
- |
PDF |
- |
| Lecture 71: Binary Search Tree Questions Part 2 |
L71 Code |
- |
PDF |
- |
| Lecture 72: Merge 2 Binary Search Trees |
L72 Code |
- |
PDF |
- |
| Lecture 73: Largest BST in a Binary Tree |
L73 Code |
- |
PDF |
- |
| Lecture 74 : Heaps in C++ |
L74 Code |
- |
PDF |
- |
| Lecture 75: Heaps in C++ Questions Part - 1 |
L75 Code |
- |
PDF |
- |
| Lecture 76: Heaps in C++ Questions Part - 2 |
L76 Code |
- |
PDF |
- |
| Lecture 77: Heaps in C++ Questions Part - 3 |
L77 Code |
- |
PDF |
- |
| Lecture 78: Hashmaps in C++ |
L78 Code |
- |
PDF |
- |
| Lecture 79: Trie & its Implementation |
L79 Code |
- |
PDF |
- |
