Data Structures and Algorithms practiced in Python.
- Week 1: Inversions Counter (through Merge Sort)
- Week 2: Quick Sort
- Week 3: Graph Min Cut (Random Contraction)
- Week 4: Graph Strong Connected Components (DFS)
- Week 5: Graph Dijkstra's Shortest Path (with Heap)
- Week 6: Median Maintenance (with min and max Heaps)
- Week 7: Graph Prim's Minimum Spanning Tree (Greedy Algorithm)
- Week 8: Kruskal's Max Space Clustering (Greedy Algorithm)
- Week 9: Maximum Weight Independence Set (Dynamic Programming)
- Week 10: Knapsack Problem (Dynamic Programming)