Update the bundle indexes and add in bundle dir as well.

hasanbal · hasanbal · commit 4bc1f3359e84 · 2023-01-29T17:32:02.000+03:00
diff --git a/README.md b/README.md
@@ -47,19 +47,21 @@ If you want to support the community as an Editor or Problem Setter, and get sch
 | Name | Topics |
 |------|-------|
 | [01-Intro](https://github.com/inzva/Algorithm-Program/tree/master/bundles/01-intro) | Big O Notation, Recursion, Builtin Data Structures|
-| [02-Algorithms-1](https://github.com/inzva/Algorithm-Program/tree/master/bundles/02-algorithms-1) | Sorting Algorithms, Search Algorithms|
-| [03-Math-1](https://github.com/inzva/Algorithm-Program/tree/master/bundles/03-math-1) | Number Theory, Factorization, Combinatorics, Exponentiation|
-| [04-Graph-1](https://github.com/inzva/Algorithm-Program/tree/master/bundles/04-graph-1) | Representing Graphs, Tree Traversals, Binary Search Tree, DFS, BFS, Union Find, Heap|
-| [05-DP-1](https://github.com/inzva/Algorithm-Program/tree/master/bundles/05-dp-1) | Greedy Algorithms, Memoization, Common DP Problems|
-| [06-Data-Structures-1](https://github.com/inzva/Algorithm-Program/tree/master/bundles/06-data-structures-1) | Stack, Queue, Deque, Linked List, Prefix Sum, Sparse Table, BIT, SQRT Decomposition, Segment Tree|
-| [07-Graph-2](https://github.com/inzva/Algorithm-Program/tree/master/bundles/07-graph-2) | Bipartate Checking, Topoligical Sort, Shortest Path, Minimum Spanning Tree|
-| [08-Data-Structures-2](https://github.com/inzva/Algorithm-Program/tree/master/bundles/08-data-structures-2) |Self Balancing Binary Trees, Lowest Common Ancestor in a Tree|
-| [09-Data-Structures-3](https://github.com/inzva/Algorithm-Program/tree/master/bundles/09-data-structures-3) |Segment Tree with Lazy Propogation, Binary Search on Segment Tree, Mo's Algorithm, Trie|
-| [10-DP-2/](https://github.com/inzva/Algorithm-Program/tree/master/bundles/10-dp-2) |Bitmask DP, DP on Rooted Trees, DP on DAGs, Digit DP, Tree Child-Sibling Notation|
-| [11-Graph-3](https://github.com/inzva/Algorithm-Program/tree/master/bundles/11-graph-3) |Bridges and Articulation Points, SCC, BCC, Max Flow|
-| [12-Math-3](https://github.com/inzva/Algorithm-Program/tree/master/bundles/12-math-3) |Vector Calculus, Area Calculation, Lines and Planes, Intersection, Convex Hull Problem, Rotating Calipers, Closest Pair Problem|
-| [13-graph-5](https://github.com/inzva/Algorithm-Program/tree/master/bundles/13-graph-5) |Segment Tree on a Tree, Heavy-Light Decomposition, Centroid Decomposition of a Tree, Subtrees' Set-Swap Technique|
-| [14-Algorithms-5](https://github.com/inzva/Algorithm-Program/tree/master/bundles/14-Algorithms-5) |KMP, Robin-Karp Algorithm, Suffix Array, Longest Common Prefix Array|
+| [02-Algorithms-1](https://github.com/inzva/Algorithm-Program/tree/master/bundles/02-algorithms-1) | Binary Search, Ternary Search, Sorting Algorithms, Quickselect, Divide and Conquer|
+| [03-Math-1](https://github.com/inzva/Algorithm-Program/tree/master/bundles/03-math-1) | Number Theory, Sieve of Eratosthenes, Inverse Modular, GCD, LCM, Factorization, Combinatorics, Exponentiation, Meet in the Middle|
+| [04-Graph-1](https://github.com/inzva/Algorithm-Program/tree/master/bundles/04-graph-1) | Representing Graphs, Tree Traversals (Preorder, Inorder, Postorder), Binary Search Tree, DFS, BFS, Union Find (DSU), Heap|
+| [05-DP-1](https://github.com/inzva/Algorithm-Program/tree/master/bundles/05-dp-1) | Greedy Algorithms, Dynamic Programming, Memoization, Knapsack, Coin Problem, LCS, LIS|
+| [06-Data-Structures-1](https://github.com/inzva/Algorithm-Program/tree/master/bundles/06-data-structures-1) | Stack, Queue, Deque, Linked List, Prefix Sum, Sparse Table, Binary Indexed Tree, SQRT Decomposition, Segment Tree|
+| [07-Graph-2](https://github.com/inzva/Algorithm-Program/tree/master/bundles/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](https://github.com/inzva/Algorithm-Program/tree/master/bundles/08-data-structures-2) | Self Balancing Binary Trees, Treap, AVL Tree, Red Black Tree, Lowest Common Ancestor|
+| [09-Data-Structures-3](https://github.com/inzva/Algorithm-Program/tree/master/bundles/09-data-structures-3) | Segment Tree with Lazy Propogation, Binary Search on Segment Tree, Mo's Algorithm, Trie|
+| [10-DP-2/](https://github.com/inzva/Algorithm-Program/tree/master/bundles/10-dp-2) | Bitmask DP, DP on Rooted Trees, DP on DAGs, Digit DP, Tree Child-Sibling Notation|
+| [11-Graph-3](https://github.com/inzva/Algorithm-Program/tree/master/bundles/11-graph-3) | Bridges and Articulation Points, Strongly Connected Components (SCC), BCC, Cycle Finding, Max Flow|
+| [12-Math-3](https://github.com/inzva/Algorithm-Program/tree/master/bundles/12-math-3) | Vector Calculus, Area Calculation, Lines and Planes, Intersection, Convex Hull Problem, Rotating Calipers, Closest Pair Problem|
+| [13-graph-5](https://github.com/inzva/Algorithm-Program/tree/master/bundles/13-graph-5) | Segment Tree on a Tree, Heavy-Light Decomposition, Centroid Decomposition of a Tree, Subtrees' Set-Swap Technique|
+| [14-Algorithms-5](https://github.com/inzva/Algorithm-Program/tree/master/bundles/14-Algorithms-5) |String Matching Algorithms: KMP, Robin-Karp Algorithm, Suffix Array, Longest Common Prefix Array|
+
+
 
 
 
diff --git a/bundles/README.md b/bundles/README.md
@@ -0,0 +1,19 @@
+**BUNDLES** 
+
+| Name | Topics |
+|------|-------|
+| [01-Intro](https://github.com/inzva/Algorithm-Program/tree/master/bundles/01-intro) | Big O Notation, Recursion, Builtin Data Structures|
+| [02-Algorithms-1](https://github.com/inzva/Algorithm-Program/tree/master/bundles/02-algorithms-1) | Binary Search, Ternary Search, Sorting Algorithms, Quickselect, Divide and Conquer|
+| [03-Math-1](https://github.com/inzva/Algorithm-Program/tree/master/bundles/03-math-1) | Number Theory, Sieve of Eratosthenes, Inverse Modular, GCD, LCM, Factorization, Combinatorics, Exponentiation, Meet in the Middle|
+| [04-Graph-1](https://github.com/inzva/Algorithm-Program/tree/master/bundles/04-graph-1) | Representing Graphs, Tree Traversals (Preorder, Inorder, Postorder), Binary Search Tree, DFS, BFS, Union Find (DSU), Heap|
+| [05-DP-1](https://github.com/inzva/Algorithm-Program/tree/master/bundles/05-dp-1) | Greedy Algorithms, Dynamic Programming, Memoization, Knapsack, Coin Problem, LCS, LIS|
+| [06-Data-Structures-1](https://github.com/inzva/Algorithm-Program/tree/master/bundles/06-data-structures-1) | Stack, Queue, Deque, Linked List, Prefix Sum, Sparse Table, Binary Indexed Tree, SQRT Decomposition, Segment Tree|
+| [07-Graph-2](https://github.com/inzva/Algorithm-Program/tree/master/bundles/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](https://github.com/inzva/Algorithm-Program/tree/master/bundles/08-data-structures-2) | Self Balancing Binary Trees, Treap, AVL Tree, Red Black Tree, Lowest Common Ancestor|
+| [09-Data-Structures-3](https://github.com/inzva/Algorithm-Program/tree/master/bundles/09-data-structures-3) | Segment Tree with Lazy Propogation, Binary Search on Segment Tree, Mo's Algorithm, Trie|
+| [10-DP-2/](https://github.com/inzva/Algorithm-Program/tree/master/bundles/10-dp-2) | Bitmask DP, DP on Rooted Trees, DP on DAGs, Digit DP, Tree Child-Sibling Notation|
+| [11-Graph-3](https://github.com/inzva/Algorithm-Program/tree/master/bundles/11-graph-3) | Bridges and Articulation Points, Strongly Connected Components (SCC), BCC, Cycle Finding, Max Flow|
+| [12-Math-3](https://github.com/inzva/Algorithm-Program/tree/master/bundles/12-math-3) | Vector Calculus, Area Calculation, Lines and Planes, Intersection, Convex Hull Problem, Rotating Calipers, Closest Pair Problem|
+| [13-graph-5](https://github.com/inzva/Algorithm-Program/tree/master/bundles/13-graph-5) | Segment Tree on a Tree, Heavy-Light Decomposition, Centroid Decomposition of a Tree, Subtrees' Set-Swap Technique|
+| [14-Algorithms-5](https://github.com/inzva/Algorithm-Program/tree/master/bundles/14-Algorithms-5) |String Matching Algorithms: KMP, Robin-Karp Algorithm, Suffix Array, Longest Common Prefix Array|
+
