BUNDLES
| Name | Topics |
|---|---|
| 01-Intro | Big O Notation, Recursion, Builtin Data Structures |
| 02-Algorithms-1 | Binary Search, Ternary Search, Sorting Algorithms, Quickselect, Divide and Conquer |
| 03-Math-1 | Number Theory, Sieve of Eratosthenes, Inverse Modular, GCD, LCM, Factorization, Combinatorics, Exponentiation, Meet in the Middle |
| 04-Graph-1 | Representing Graphs, Tree Traversals (Preorder, Inorder, Postorder), Binary Search Tree, DFS, BFS, Union Find (DSU), Heap |
| 05-DP-1 | Greedy Algorithms, Dynamic Programming, Memoization, Knapsack, Coin Problem, LCS, LIS |
| 06-Data-Structures-1 | Stack, Queue, Deque, Linked List, Prefix Sum, Sparse Table, Binary Indexed Tree, SQRT Decomposition, Segment Tree |
| 07-Graph-2 | Bipartate Checking, Topoligical Sort, Shortest Path (Dijkstra, Floyd-Warshall, Bellman Ford), Minimum Spanning Tree (Prim's, Kruskal's) |
| 08-Data-Structures-2 | Self Balancing Binary Trees, Treap, AVL Tree, Red Black Tree, Lowest Common Ancestor |
| 09-Data-Structures-3 | Segment Tree with Lazy Propogation, Binary Search on Segment Tree, Mo's Algorithm, Trie |
| 10-DP-2/ | Bitmask DP, DP on Rooted Trees, DP on DAGs, Digit DP, Tree Child-Sibling Notation |
| 11-Graph-3 | Bridges and Articulation Points, Strongly Connected Components (SCC), BCC, Cycle Finding, Max Flow |
| 12-Math-3 | Vector Calculus, Area Calculation, Lines and Planes, Intersection, Convex Hull Problem, Rotating Calipers, Closest Pair Problem |
| 13-graph-5 | Segment Tree on a Tree, Heavy-Light Decomposition, Centroid Decomposition of a Tree, Subtrees' Set-Swap Technique |
| 14-Algorithms-5 | String Matching Algorithms: KMP, Robin-Karp Algorithm, Suffix Array, Longest Common Prefix Array |