# Advanced

Some 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

## Convexity

## Graphs

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

CSES Critical Cities and Extensions

Link Cut Tree

Rare

?

## Dynamic Programming

## Flows

## Polynomials

## Strings

## Misc. Topics

Extended Euclidean Algorithm

Rare

?

XOR Basis

Rare

?

Fracturing Search

Rare

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

Game Theory

Has Not Appeared

?

Prefix Sums of Multiplicative Functions

Has Not Appeared

?

Matroid Intersection

Has Not Appeared

?

Interactive and Communication Problems

Rare

Some tips and tricks