1.
Introduction
2.
C++ Foundations Overview
2.1.
Your First C++ Program
2.2.
Control Flow
2.3.
Functions & Arrays
3.
Core Data Structures Overview
3.1.
STL Essentials
3.2.
Arrays & Prefix Sums
3.3.
Sorting & Searching
3.4.
Two Pointers & Sliding Window
3.5.
Monotonic Stack & Monotonic Queue
3.6.
Stacks, Queues & Deques
3.7.
Hashing Techniques
3.8.
Maps & Sets
3.9.
Introduction to Segment Trees
3.10.
Fenwick Tree (BIT)
3.11.
Binary Trees
4.
Greedy Algorithms Overview
4.1.
Greedy Fundamentals
4.2.
Greedy in USACO
5.
Graph Algorithms Overview
5.1.
Introduction to Graphs
5.2.
BFS & DFS
5.3.
Trees & Special Graphs
5.4.
Shortest Paths
6.
Dynamic Programming Overview
6.1.
Introduction to DP
6.2.
Classic DP Problems
6.3.
Advanced DP Patterns
7.
USACO Contest Guide Overview
7.1.
Understanding USACO
7.2.
Problem-Solving Strategies
7.3.
Ad Hoc Problems
8.
C++ Quick Reference
9.
USACO Problem Set
10.
Competitive Programming Tricks
11.
Algorithm Templates
12.
Math Foundations
13.
Debugging Guide
14.
Glossary
15.
Knowledge Map
Light
Rust
Coal
Navy
Ayu
C++ for Competitive Programming: A USACO Guide
STL Essentials