
- Home
- Books
- Algorithms & Data Structures
- Core Algorithms
- Competitive Programming 3
Competitive Programming 3 by Steven Halim and Felix Halim is a comprehensive guide to mastering algorithmic problem solving and programming contest techniques. Success in algorithmic contests demands identifying problem paradigms, choosing optimal data structures, and implementing bug-free C++ code within strict execution time limits. The authors present an exhaustive collection of classic problems categorized across data structures, graph theory, dynamic programming, and computational geometry.
What you will learn
- Implement linear and non-linear data structures including union-find disjoint sets, Fenwick trees, and segment trees
- Master problem-solving paradigms including complete search, divide and conquer, greedy algorithms, and dynamic programming
- Solve shortest path, minimum spanning tree, and network flow problems with Dijkstra, Bellman-Ford, Kruskal, and Edmonds-Karp
- Model combinatorial and number-theoretic challenges using prime factorization, modular arithmetic, and combinatorics
- Process strings with suffix tries, suffix trees, and the Knuth-Morris-Pratt string matching algorithm
- Calculate geometric properties and polygon intersections using computational geometry algorithms
Who this is for
Competitive programmers, computer science students preparing for ICPC or IOI competitions, and software engineers targeting algorithmic interview rounds. Solid proficiency in C++ and fundamental data structures is assumed.


