Advanced
Some of these topics have not appeared in Platinum and probably never will (ex. Matroid Intersection).
Others have appeared in Old Gold or Platinum very infrequently (ex. BCC, Suffix Array).
Modules Progress
Problems Progress
Data Structures
Max Suffix Query with Insertions Only
Rare
A solution to USACO Gold - Springboards.
NaN
Wavelet Tree
Has Not Appeared
?
NaN
Counting Minimums with Segment Tree
Has Not Appeared
Querying for the minimum and number of occurences of minimum in a range
NaN
Segment Tree Beats
Rare
Perform chmin and chmax range updates
NaN
Persistent Data Structures
Rare
What if data structures could time travel?
NaN
Treaps
Not Frequent
A randomized binary search tree
NaN
Convexity
Graphs
Shortest Paths with Negative Edge Weights
Has Not Appeared
Returning to Bellman-Ford and Floyd-Warshall.
NaN
Eulerian Tours
Has Not Appeared
Visiting all edges of a graph exactly once.
NaN
BCCs and 2CCs
Rare
NaN
Strongly Connected Components
Rare
Subsets of nodes in directed graphs where each node in a subset can reach each other node in the subset.
NaN
Offline Deletion
Has Not Appeared
Erasing from non-amortized insert-only data structures.
NaN
Euler's Formula
Rare
A formula for finding the number of faces in a planar graph.
NaN
Critical
Rare
CSES Critical Cities and Extensions
NaN
Link Cut Tree
Rare
Dynamic operations on a rooted forest
NaN
Dynamic Programming
Flows
Polynomials
Strings
Misc. Topics
Extended Euclidean Algorithm
Rare
?
NaN
XOR Basis
Rare
?
NaN
Fracturing Search
Rare
A simple solution to "Robotic Cow Herd" that generalizes.
NaN
Game Theory
Has Not Appeared
?
NaN
Prefix Sums of Multiplicative Functions
Has Not Appeared
?
NaN
Matroid Intersection
Has Not Appeared
?
NaN
Interactive and Communication Problems
Rare
Some tips and tricks
NaN
Vectorization in C++
?
NaN