Introduction -- Hash tables -- Trees and recursion -- Memoization and dynamic programming -- Advanced memoization and dynamic programming -- Graphs and breadth-first search -- Shortest paths in weights graphs -- Binary search -- Heaps and segment trees -- Union-find -- Randomization -- Afterword -- Algorithm runtime -- Because I can't resist -- Problem credits

"An introduction to solving problems with algorithms and data structures, using competitive programming examples. Topics covered include recursion, dynamic programming, graphs, greedy algorithms, heaps, hash tables, segment trees, and other data structures for efficiently handling data"-Provided by publisher"--