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

40Not Started

40 total

Problems Progress

0Completed

0In Progress

0Skipped

377Not Started

377 total

Data Structures

0/53

Max Suffix Query with Insertions Only

Rare

A solution to USACO Gold - Springboards.

Wavelet Tree

Has Not Appeared

Efficiently querying for the kth minimum element in a subarray.

Counting Minimums with Segment Tree

Has Not Appeared

Querying for the minimum and number of occurrences 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/33

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/85

Shortest Paths with Negative Edge Weights

Has Not Appeared

Returning to Bellman-Ford and Floyd-Warshall.

Eulerian Tours

Has Not Appeared

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.

Offline Deletion

Has Not Appeared

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

Finding nodes that must be visited along any path.

Link Cut Tree

Rare

Dynamic operations on a rooted forest

Dynamic Programming

0/29

DP on Trees - Combining Subtrees

Rare

DP on Broken Profile

Rare

Dynamic programming on grid boundary states.

Additional DP Optimizations and Techniques

Rare

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

Flows

0/30

Maximum Flow

Rare

Introduces maximum flow as well as flow with lower bounds.

Minimum Cut

Rare

Flow with Lower Bounds

Has Not Appeared

Minimum Cost Flow

Rare

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

Polynomials

0/12

Introduction to Fast Fourier Transform

Has Not Appeared

Quickly multiplying polynomials

More Complex Operations Using FFT

Has Not Appeared

Strings

0/65

String Searching

Rare

Knuth-Morris-Pratt and Z Algorithms (and a few more related topics).

Suffix Array

Rare

Quickly sorting suffixes of a string and its applications

String Suffix Structures

Has Not Appeared

Suffix Automata, Suffix Trees, and Palindromic Trees

Misc. Topics

0/83

Extended Euclidean Algorithm

Rare

Catalan Numbers

Rare

XOR Basis

Rare

Fracturing Search

Rare

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

Game Theory

Has Not Appeared

Solving games that are usually two-player to find the winner.

Prefix Sums of Number-Theoretic Functions (Part 1)

Has Not Appeared

Introduces Dirichlet convolution.
Updated: 10 hours ago

Prefix Sums of Number-Theoretic Functions (Part 2)

Has Not Appeared

How to count primes.
Updated: 12 hours ago

Matroid Intersection

Has Not Appeared

Randomness

Has Not Appeared

Using randomized algorithms to solve problems.

Interactive and Communication Problems

Rare

Some tips and tricks

Vectorization in C++

Has Not Appeared