Chapter 1

Amortized Analysis and Advanced Trees

Aggregate analysis, accounting method, potential method

medium • 1 min read

B-Trees, AVL Trees, Red-Black Trees

medium • 2 min read

Splay Trees and Treaps

medium • 3 min read

Fibonacci Heaps and Binomial Heaps

medium • 4 min read

Skip Lists and applications

medium • 5 min read

Chapter 2

Advanced Graph Algorithms

Network Flow: Ford-Fulkerson and Edmonds-Karp

medium • 1 min read

Maximum Bipartite Matching

medium • 2 min read

Strongly Connected Components

medium • 3 min read

All-Pairs Shortest Paths: Floyd-Warshall and Johnson's Algorithm

medium • 4 min read

Graph algorithms in social networks

medium • 5 min read

Chapter 3

String Matching and Randomized Algorithms

Rabin-Karp and Knuth-Morris-Pratt algorithms

medium • 1 min read

Suffix Trees and Suffix Arrays

medium • 2 min read

Las Vegas and Monte Carlo algorithms

medium • 3 min read

Randomized Quicksort and Min-Cut

medium • 4 min read

Applications of computational geometry

medium • 5 min read

Chapter 4

NP-Completeness and Approximation

Polynomial-time reductions and NP-Hardness

medium • 1 min read

Cook's Theorem and classical NP-Complete problems

medium • 2 min read

Approximation algorithms and approximation ratio

medium • 3 min read

Vertex Cover and Traveling Salesman Problem heuristics

medium • 4 min read

PTAS and FPTAS

medium • 5 min read

Chapter 5

Advanced Algorithm Paradigms

Dynamic Programming optimizations

medium • 1 min read

Greedy algorithms and Matroid theory

medium • 2 min read

Divide and conquer strategies for large datasets

medium • 3 min read

Online algorithms and competitive analysis

medium • 4 min read

Approaches for parameterized complexity

medium • 5 min read