Advanced Algorithms
Explore cutting-edge algorithms and advanced computational techniques
Course Content
1. Advanced Graph Theory
Bipartite graphs, Eulerian graphs, biconnected components and strongly connected components
2. Advanced Graph Algorithms
Minimum spanning tree, second MST, single-source shortest paths, k-shortest paths, differential constraints, layered graphs
3. Difference Arrays & Doubling
1D/multi-dimensional/tree difference arrays, advanced doubling algorithms (ST table, LCA)
4. Union-Find (Disjoint Set)
Advanced union-find data structure with path compression and union by rank optimizations
6. Binary Trie (01-Trie)
Binary trie data structure for XOR operations and bit manipulation problems
7. Data Structure Optimized DP
Using advanced data structures to optimize dynamic programming solutions