Love Babbar CPP DSA Course

Checkout Course Flow From Here 👈

Checkout GFG Solutions From Here 👈

Checkout LeetCode Solutions From Here 👈

Checkout CodingNinjas Solutions From Here 👈

Coding Ninjas Resources

• Basics of C++
• OOPs in C++
• Data Structure & Algorithm
• Competitive Programming

Lectures	Lecture Codes	Homework	Hands On PDF	Handwritten Notes
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	-
Lecture 80: Longest Common Prefix Problem	L80 Code	-	PDF	-
Lecture 81: Implement a Phone Directory Using Trie	L81 Code	-	PDF	-
Lecture 82: Rat in Maze Problem	L82 Code	-	PDF	-
Lecture 83: N-Queen Problem	L83 Code	-	PDF	-
Lecture 84: Sudoku Solver Problem	L84 Code	-	PDF	-
Lecture 85: Introduction to Graphs	L85 Code	-	PDF	-
Lecture 86: BFS Traversal in Graph	L86 Code	-	PDF	-
Lecture 87: DFS Traversal in Graph	L87 Code	-	PDF	-
Lecture 88: Cycle Detection in Undirected Graphs	L88 Code	-	PDF	-
Lecture 89: Cycle Detection in Directed Graphs	L89 Code	-	PDF	-
Lecture 90: Topological Sort (Using DFS)	L90 Code	-	PDF	-
Lecture 91: Topological Sort (Using Kahn's Algorithm)	L91 Code	-	PDF	-
Lecture 92: Cycle Detection in Directed Graph Using BFS	L92 Code	-	PDF	-
Lecture 93: Shortest Path in Undirected Graphs	L93 Code	-	PDF	-
Lecture 94: Shortest Path in Directed Acyclic Graphs	L94 Code	-	PDF	-
Lecture 95: Dijkstra's Algorithm	L95 Code	-	PDF	-
Lecture 96: Minimum Spanning Tree	L96 Code	-	PDF	-
Lecture 97: Kruskal's Algorithm	L97 Code	-	PDF	-
Lecture 98: Bridges in a Graph	L98 Code	-	PDF	-
Lecture 99: Articulation Points in Graphs	L99 Code	-	PDF	-
Lecture 100: Kosaraju's Algorithm For Strongly Connected Components	L100 Code	-	PDF	-
Lecture 101: Bellman Ford Algorithm	L101 Code	-	PDF	-
Lecture 102: Introduction to Dynamic Programming	L102 Code	-	PDF	-
Lecture 103: Minimum Cost Climbing Stairs	L103 Code	-	PDF	-
Lecture 104: Minimum Number of Coins	L104 Code	-	PDF	-
Lecture 105: Maximum Sum of Non-Adjacent Elements	L105 Code	-	PDF	-
Lecture 106: House Robbery Problem	L106 Code	-	PDF	-
Lecture 107: Cut Rod into Segments of X, Y, Z	L107 Code	-	PDF	-
Lecture 108: Count derangements	L108 Code	-	PDF	-
Lecture 109: Painting Fence Algorithm	L109 Code	-	PDF	-
Lecture 110: 0/1 KnapSack Problem	L110 Code	-	PDF	-
Lecture 111: Combination Sum IV Problem	L111 Code	-	PDF	-
Lecture 112: Perfect Squares Problem	L112 Code	-	PDF	-
Lecture 113: Minimum Cost for Tickets Part-1	L113 Code	-	PDF	-
Lecture 114: Minimum Cost for Tickets Part-2	L114 Code	-	PDF	-
Lecture 115: Largest Square area in Matrix	L115 Code	-	PDF	-
Lecture 116: Min Score Triangulation of Polygon	L116 Code	-	PDF	-
Lecture 117: Minimum Sideways Jump LeetCode	L117 Code	-	PDF	-
Lecture 118: Reducing Dishes LeetCode	L118 Code	-	PDF	-
Lecture 119: Longest Increasing Subsequence + Russian Doll LeetCode	L119 Code	-	PDF	-
Lecture 120: Maximum Height by Stacking Cuboid	L120 Code	-	PDF	-
Lecture 121: Pizza with 3n Slices	L121 Code	-	PDF	-
Lecture 122: Number of Dice Rolls with Target Sum	L122 Code	-	PDF	-
Lecture 123: Partition Equal Subset Sum	L123 Code	-	PDF	-
Lecture 124: Minimum Swaps to make Subsequences Increasing	L124 Code	-	PDF	-
Lecture 125: Longest Arithmetic Subsequence	L125 Code	-	PDF	-
Lecture 126: Longest AP with given Difference "d"	L126 Code	-	PDF	-
Lecture 127: Unique Binary Search Trees	L127 Code	-	PDF	-
Lecture 128: Guess Number Higher or Lower	L128 Code	-	PDF	-
Lecture 129: Minimum Cost Tree From Leaf Values	L129 Code	-	PDF	-
Lecture 130: Buy and Sell Stock Part 1	L130 Code	-	PDF	-
Lecture 131: Buy and Sell Stock Part 2	L131 Code	-	PDF	-
Lecture 132: Buy and Sell Stock Part 3	L132 Code	-	PDF	-
Lecture 133: Buy and Sell Stock Part 4	L133 Code	-	-	-
Lecture 134: Buy and Sell Stock Part 5	L134 Code	-	-	-
Lecture 135: Longest Common Subsequence	L135 Code	-	PDF	-
Lecture 136: Longest Palindromic Subsequence	L136 Code	-	PDF	-
Lecture 137: EDIT Distance	L137 Code	-	PDF	-
Lecture 138: Maximum Rectangle with all 1's	L138 Code	-	PDF	-
Lecture 139: Wildcard Pattern Matching	L139 Code	-	PDF	-
Lecture 140: Greedy Algorithms	L140 Code	-	PDF	-