Problems

Counting sort and radix sort #sorting #networks #bit tricks

Binary search #searching #binary search #sorting

Bit tricks #bit tricks #simulation #operating systems

Bloom filter #probabilistic #membership #estimation

k-means #clustering #nearest neighbour #images

Amortized analysis Bit tricks #amortized #bit tricks #simulation

Bipartite matching #matching #graph #images

Bloom filter #probabilistic #membership #hashing

Consistent hashing Binary search #load balancing #binary search #caching

Binary search on the answer #binary search #greedy #classic

How to benchmark honestly #measurement #sorting #analytics

CRDT #distributed systems #replication #hash table

Bidirectional search Dijkstra's algorithm #shortest path #weighted graph #heap

Retry with jitter #simulation #randomized #hash table

Complexity from measurements Big O #measurement #estimation #numerical precision

A* Dijkstra's algorithm #shortest path #heuristic #weighted graph

Depth-first search #traversal #connectivity #graph

The Bellman–Ford algorithm #shortest path #dynamic programming #weighted graph

Binary search on the answer #binary search #greedy #maps and navigation

Breadth-first search #shortest path #traversal #graph

DBSCAN #clustering #points #geodata

Disjoint set union #disjoint sets #connectivity #images

Count-Min Sketch #frequencies #streaming #counting

Dynamic array #array #amortized #binary search

Delaunay triangulation and Voronoi diagram #points #hulls #counting

Boyer–Moore #string matching #precomputation #measurement

k-means #clustering #iterative #points

Bridges and articulation points Depth-first search #connectivity #graph #traversal

Choosing a data structure Binary heap #heap #hash table #scheduling

Closest pair of points #nearest neighbour #points #hashing

Coordinate compression #array #disjoint sets #sorting

AVL tree #search tree #tree #sliding window

Dynamic programming #dynamic programming #counting #DAG

Binary heap #heap #scheduling #streaming

Edit distance #dynamic programming #similarity #bioinformatics

Convex hull #hulls #points #polygon

Decision tree #classification #tree #greedy

Dijkstra's algorithm #shortest path #weighted graph #heap

B-tree #tree #databases #external memory

Binary search #binary search #searching #estimation

Backtracking #backtracking #heuristic #games

Chinese remainder theorem #number theory #precomputation

Count-Min Sketch #frequencies #sketch #streaming

Bisection and Newton's method Binary search on the answer #root finding #binary search #numerical precision

Bridges and articulation points Depth-first search #connectivity #graph #traversal

Edit distance #similarity #hashing #precomputation

Divide and conquer #divide and conquer #recursion #matrix

Counting sort and radix sort #sorting #suffix structures #string matching

Digit DP #dynamic programming #counting

BK-tree Edit distance #similarity #nearest neighbour #tree

The Bellman–Ford algorithm #shortest path #weighted graph #graph

Decision tree #classification #tree #greedy

Perceptron and backpropagation #gradient #matrix #classification

Chinese remainder theorem #counting #linear algebra #number theory

Retry with jitter #DAG #dynamic programming #graph

Cache-friendly data #cache-friendly #simulation #matrix

Bipartite matching #matching #graph #scheduling

Bidirectional search Breadth-first search #shortest path #traversal #graph

Backtracking #backtracking #coloring #graph

The Burrows–Wheeler transform #suffix structures #string matching #counting

Cuckoo hashing Disjoint set union #hashing #graph #connectivity

Dynamic programming #dynamic programming #counting #prefix sums

Breadth-first search #shortest path #traversal #queue

Dijkstra's algorithm #shortest path #weighted graph #heap

B-tree #tree #databases #external memory

Coordinate compression #range queries #offline queries #sweep line

Big O #estimation #counting #number theory

Bisection and Newton's method #root finding #iterative #numerical precision

Digit DP #dynamic programming #counting #prefix sums

CRDT #distributed systems #linked list #hash table

Dijkstra's algorithm #shortest path #weighted graph #heap

Contraction hierarchies Bidirectional search #shortest path #precomputation #heap

Disjoint set union #disjoint sets #connectivity #offline queries

Dynamic array #array #amortized #simulation

DBSCAN Binary search #clustering #points #sorting

Convex hull #hulls #points #two pointers

Boyer–Moore #string matching #precomputation #contests

Binary heap #heap #sliding window #streaming

Depth-first search #traversal #dependency order #stack

Divide and conquer #divide and conquer #recursion #tree

Closest pair of points #nearest neighbour #points #divide and conquer

Dinic's algorithm Bipartite matching #matching #flows #graph

Binary search tree #search tree #tree #stack

Delaunay triangulation and Voronoi diagram #nearest neighbour #points #polygon

Bitmask DP Bit tricks #dynamic programming #bit tricks #optimization

Centroid decomposition Breadth-first search #tree #divide and conquer #graph

Convex hull trick #dynamic programming #optimization #scheduling

Branch and bound #branch and bound #graph #coloring

The Aho–Corasick algorithm #string matching #automaton #trie

AVL tree #search tree #tree #bit tricks

Knuth and divide-and-conquer optimisations #dynamic programming #optimization

Knuth and divide-and-conquer optimisations #dynamic programming #divide and conquer #optimization

Dinic's algorithm Breadth-first search #flows #connectivity #graph

Convex hull trick #segment tree #optimization #finance

A* Breadth-first search #shortest path #heuristic #games

Bitmask DP #dynamic programming #bit tricks #optimization

Binary search tree #search tree #tree #linked list

The Burrows–Wheeler transform #suffix structures #string matching #backtracking