Gold

Divisibility

Rare

Using the information that A is a factor of B

Modular Arithmetic

Not Frequent

Working with remainders from division.

Introduction to DP

Very Frequent

Speeding up naive recursive solutions with memoization.

Knapsack DP

Not Frequent

Problems that can be modeled as filling a limited-size container with a subset of items.

Paths on Grids

Not Frequent

Counting the number of "special" paths on a grid, and how some string problems can be solved using grids.

(Optional) Longest Increasing Subsequence

Rare

Finding and using the LIS of an array

Breadth First Search (BFS)

Not Frequent

Traversing a graph in a way such that vertices closer to the starting vertex are processed first.

Disjoint Set Union

Somewhat Frequent

The Disjoint Set Union (DSU) data structure allows you to add edges to an initially empty graph and test whether two vertices of the graph are connected.

Topological Sort

Rare

An ordering of vertices in a directed acyclic graph that ensures that a node is visited before every node it has a directed edge to.

Shortest Paths with Non-Negative Edge Weights

Somewhat Frequent

Introduces Bellman-Ford, Floyd-Warshall, Dijkstra.

Minimum Spanning Trees

Not Frequent

A subset of the edges of a connected, undirected, edge-weighted graph that connects all the vertices to each other of minimum total weight, where no cycles are allowed.

Stacks

Rare

A data structures that only allows insertion and deletion at one end.

Sliding Window

Not Frequent

Maintaining data over consecutive subarrays.

Point Update Range Sum

Somewhat Frequent

Introduces Segment Tree, Binary Indexed Tree, and Order Statistic Tree (C++ only).

Euler Tour Technique

Not Frequent

Flattening a tree into an array to easily query and update subtrees.

DP on Trees - Introduction

Not Frequent

Using subtrees as subproblems.

(Optional) DP on Trees - Solving For All Roots

Rare

Tree DP that uses the subtree from excluding each node's subtree.

String Hashing

Rare

Quickly test equality of substrings with a small probability of failure.

(Optional) Unordered Sets & Maps

Rare

Maintaining collections of distinct elements with hashing.

(Optional) A Faster Hash Table in C++

Rare

Introduces gp_hash_table.