
- Home
- Books
- Algorithms & Data Structures
- Core Algorithms
- Guide to Competitive Programming,third edition
Guide to Competitive Programming by Antti Laaksonen is an algorithmic textbook for mastering programming contest challenges and technical interviews. Competing successfully in coding competitions requires implementing mathematically sound algorithms and optimal data structures within tight resource bounds. Laaksonen provides concise C++ implementations, mathematical proofs, and problem-solving strategies spanning dynamic programming, tree traversals, and network flows.
What you will learn
- Analyze algorithmic asymptotic time complexities and optimize C++ input-output operations
- Implement dynamic programming optimizations including coordinate compression and bitmask state representations
- Construct advanced range query structures with Fenwick trees, segment trees, and index trees
- Solve shortest path, maximum flow, and bipartite matching problems with Dijkstra, Bellman-Ford, and Dinic
- Query tree structures efficiently using binary lifting, lowest common ancestors, and heavy-light decomposition
- Apply number theory and combinatorics to calculate modular inverses, prime factorizations, and permutations
- Search string occurrences rapidly using polynomial hash functions, tries, and the Z-algorithm
Who this is for
Competitive programmers, software developers preparing for FAANG-level coding interviews, and students competing in ICPC or IOI. Solid proficiency in C++ and basic data structures is recommended.


