Gold
The topics below are not exhaustive for this division.
Contest problems may contain topics not covered in the guide, or topics listed under different divisions!
Modules Progress
Problems Progress
Math
Dynamic Programming
Most Gold and Platinum contests have at least one DP problem.
Introduction to DP
Very Frequent
Speeding up naive recursive solutions with memoization.
Updated: Last week
Knapsack DP
Not Frequent
Problems that can be modeled as filling a limited-size container with items.
Updated: Last week
Paths on Grids
Not Frequent
Counting the number of "special" paths on a grid, and how some string problems can be solved using grids.
Updated: Last week
Longest Increasing Subsequence
Has Not Appeared
Finding and using the longest increasing subsequence of an array.
Updated: Last week
Bitmask DP
Not Frequent
DP problems that require iterating over subsets.
Range DP
Rare
Solving a DP problem on every contiguous subarray of the original array.
Updated: Last week
Digit DP
Rare
Finding the number of integers in a range that have a property.
Updated: Last week
Graphs
Most Silver to Platinum contests have at least one graph problem.
Shortest Paths with Unweighted Edges
Not Frequent
Introduces how BFS can be used to find shortest paths in unweighted graphs.
Disjoint Set Union
Somewhat Frequent
The Disjoint Set Union (DSU) data structure, which allows you to add edges to a graph and test whether two vertices of the graph are connected.
Updated: Last week
Topological Sort
Rare
Ordering the vertices of a directed acyclic graph such that each vertex is visited before its children.
Updated: Last week
Shortest Paths with Non-Negative Edge Weights
Not Frequent
Bellman-Ford, Floyd-Warshall, and Dijkstra.
Minimum Spanning Trees
Not Frequent
Finding a subset of the edges of a connected, undirected, edge-weighted graph that connects all the vertices to each other of minimum total weight.
Updated: Last week
Data Structures
Stacks
Rare
A data structure that only allows insertion and deletion at one end.
Updated: Last week
Sliding Window
Not Frequent
Maintaining data over consecutive subarrays.
Updated: 2 days ago
Point Update Range Sum
Somewhat Frequent
Segment Tree, Binary Indexed Tree, and Order Statistic Tree (in C++).
Updated: Last week
Trees
Euler Tour Technique
Not Frequent
Flattening a tree into an array to easily query and update subtrees.
Updated: Last week
DP on Trees - Introduction
Not Frequent
Using subtrees as subproblems.
Updated: Last week
DP on Trees - Solving For All Roots
Rare
Tree DP problems involving rerooting.
Updated: Last week
Additional Topics
Rarely required.
Conclusion
Congratulations on making it this far!