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

0Completed

0In Progress

0Skipped

37Not Started

37 total

Problems Progress

0Completed

0In Progress

0Skipped

319Not Started

319 total

Data Structures

0/44

Max Suffix Query with Insertions Only

Rare

A solution to USACO Gold - Springboards.

Wavelet Tree

Counting Minimums with Segment Tree

Querying for the minimum and number of occurences of minimum in a range

Segment Tree Beats

Rare

Perform chmin and chmax range updates

Persistent Data Structures

Rare

What if data structures could time travel?

Treaps

Not Frequent

A randomized binary search tree

Convexity

0/31

LineContainer

Rare

Convex Containers

Lagrangian Relaxation

Rare

aka Aliens Trick

Slope Trick

Rare

Slope trick refers to a way to manipulate piecewise linear convex functions. Includes a simple solution to USACO Landscaping.

Graphs

0/69

Shortest Paths with Negative Edge Weights

Returning to Bellman-Ford and Floyd-Warshall.
Updated: 2 weeks ago

Eulerian Tours

Visiting all edges of a graph exactly once.

BCCs and 2CCs

Rare

Strongly Connected Components

Rare

Subsets of nodes in directed graphs where each node in a subset can reach each other node in the subset.
Updated: 3 weeks ago

Offline Deletion

Erasing from non-amortized insert-only data structures.

Euler's Formula

Rare

A formula for finding the number of faces in a planar graph.

Critical

Rare

CSES Critical Cities and Extensions

Link Cut Tree

Rare

Dynamic operations on a rooted forest

Dynamic Programming

0/31

DP on Trees - Combining Subtrees

Rare

Additional DP Optimizations and Techniques

Rare

Additional dynamic programming techniques and optimizations like Knuth's optimization.

Sum over Subsets DP

Rare

Taking bitmask DP to the next level.

Flows

0/28

Maximum Flow

Rare

Introduces maximum flow as well as flow with lower bounds.

Minimum Cut

Rare

Flow with Lower Bounds

Minimum Cost Flow

Rare

Triangle Inequality, Johnson's Algorithm, and Min Cost Flow

Polynomials

0/11

Introduction to Fast Fourier Transform

Quickly multiplying polynomials

More Complex Operations Using FFT

Strings

0/60

String Searching

Rare

Knuth-Morris-Pratt and Z Algorithms (and a few more related topics).
Updated: 3 weeks ago

Suffix Array

Rare

Quickly sorting suffixes of a string and its applications
Updated: 3 days ago

String Suffix Structures

Suffix Automata, Suffix Trees, and Palindromic Trees

Misc. Topics

0/51

Extended Euclidean Algorithm

Rare

XOR Basis

Rare

Fracturing Search

Rare

A simple solution to "Robotic Cow Herd" that generalizes.

Game Theory

Prefix Sums of Multiplicative Functions

Matroid Intersection

Interactive and Communication Problems

Rare

Some tips and tricks

Vectorization in C++