Competitive Programming 4 - Book 1: The Lower Bound of Programming Contests in the 2020s
by Steven Halim, Felix Halim, Suhendry Effendy · Lulu (self-published)
Fourth edition (2020) of the ICPC-oriented textbook, split into two volumes. Book 1 covers data structures, problem-solving paradigms and graph algorithms, and classifies thousands of UVa and Kattis exercises by technique.
This link may earn us a small commission at no extra cost to you. Affiliate disclosure
More resources on Competitive Programming
LeetCode
Online judge with thousands of algorithm and data-structure problems sorted by difficulty, topic and company, plus timed contests, discussion threads and study plans. Regular practice builds fluency with common interview problem patterns and writing correct, efficient code under time pressure.
CP-Algorithms - Minimum-cost flow (successive shortest path)
Article explaining the successive shortest path algorithm for minimum-cost flow, an extension of Edmonds-Karp that augments along cheapest paths, covering directed and undirected graphs, complexity analysis, an SPFA-based implementation, and practice problems. Readers can implement min-cost max-flow for contest problems.
Errichto Algorithms (YouTube)
YouTube channel by a Polish competitive programmer. It has lectures on dynamic programming, binary search and other techniques, recorded live contest solving with commentary, and advice on how to practice and move up in rating. Watching an elite contestant solve problems live teaches contest strategy and thought process that text resources cannot.
Codeforces EDU: ITMO Academy Pilot Course
Free Codeforces course by ITMO University teachers. Video lectures and theory notes cover binary search, two pointers, segment trees, suffix arrays, disjoint sets and more, and each lesson has step-by-step problem sets judged on Codeforces. Rigorous lecture-plus-practice format for the intermediate data-structure techniques that sit between USACO Silver/Gold and Codeforces Div 1.
CSES Problem Set
About 400 classic algorithm problems with an online judge, grouped by technique: sorting and searching, dynamic programming, graphs, range queries, trees, mathematics, strings and geometry. Each problem isolates one standard technique for practice. The canonical technique-by-technique practice set. It turns the Handbook's theory into drilled skill with no filler problems.