Dynamic programming 
513 
0 
513 

Mathematics 
491 
0 
491 

Graph theory 
460 
0 
460 

Implementation 
347 
0 
347 

Graph traversal 
233 
0 
233 

Segment tree 
183 
0 
183 

Dynamic programming; multidimensional 
181 
0 
181 

Greedy 
156 
0 
156 

Geometry 
155 
0 
155 

Binary search 
147 
0 
147 

Number theory 
134 
0 
134 

Bruteforcing 
128 
0 
128 

Breadthfirst search 
126 
0 
126 

Sorting 
111 
0 
111 

Tree 
91 
0 
91 

Maximum flow 
74 
0 
74 

Dijkstra's 
72 
0 
72 

Depthfirst search 
68 
0 
68 

Disjoint set 
64 
0 
64 

Dynamic programming; 1dimensional 
61 
0 
61 

Backtracking 
58 
0 
58 

Combinatorics 
58 
0 
58 

Bipartite matching 
45 
0 
45 

Divide and conquer 
43 
0 
43 

Priority queue 
40 
0 
40 

Segment tree with lazy propagation 
38 
0 
38 

Stack 
38 
0 
38 

Line sweeping 
36 
0 
36 

Constructive 
35 
0 
35 

Dynamic programming; on trees 
34 
0 
34 

Strongly connected component 
33 
0 
33 

Arithmetic 
31 
0 
31 

Minimum spanning tree 
30 
0 
30 

Dynamic programming; using bitfield 
29 
0 
29 

Exponentiation by squaring 
29 
0 
29 

Parsing 
28 
0 
28 

Square root decomposition 
28 
0 
28 

Prefix sum 
28 
0 
28 

Twopointer 
27 
0 
27 

Floyd–Warshall 
26 
0 
26 

Arbitrary precision / Big integers 
26 
0 
26 

Offline queries 
26 
0 
26 

Topological sorting 
25 
0 
25 

Lowest common ancestor 
24 
0 
24 

Trie 
24 
0 
24 

Minimum cost maximum flow 
23 
0 
23 

Sieve of Eratosthenes 
22 
0 
22 

Simulation 
22 
0 
22 

Recursion 
21 
0 
21 

AdHoc 
21 
0 
21 

Bitmask 
19 
0 
19 

Convex hull 
19 
0 
19 

Fast Fourier transform 
19 
0 
19 

2SAT 
18 
0 
18 

Knuth–Morris–Pratt 
17 
0 
17 

Mo's 
17 
0 
17 

Sprague–Grundy theorem 
17 
0 
17 

Suffix array and LCP array 
17 
0 
17 

Hashing 
16 
0 
16 

Heavylight decomposition 
15 
0 
15 

Sparse array 
15 
0 
15 

Bellman–Ford 
14 
0 
14 

Inclusion and exclusion 
13 
0 
13 

Parallel binary search 
13 
0 
13 

Persistent segment tree 
13 
0 
13 

Convex hull trick 
13 
0 
13 

Ternary search 
13 
0 
13 

Euclidean algorithm 
12 
0 
12 

Line segment intersection check 
12 
0 
12 

Set / Map by trees 
12 
0 
12 

Game theory 
11 
0 
11 

Sliding window 
10 
0 
10 

Calculus 
10 
0 
10 

Chinese remainder theorem 
9 
0 
9 

Longest increasing sequence in O(n log n) 
9 
0 
9 

Divide and conquer optimization 
9 
0 
9 

Geometry; 3D 
9 
0 
9 

Case work 
9 
0 
9 

Articulation points and bridges 
8 
0 
8 

Extended Euclidean algorithm 
8 
0 
8 

Möbius inversion 
8 
0 
8 

Deque 
8 
0 
8 

Centroid decomposition 
7 
0 
7 

Meet in the middle 
7 
0 
7 

Rabin–Karp 
7 
0 
7 

Linear programming 
7 
0 
7 

Set / Map by hashing 
7 
0 
7 

AhoCorasick 
6 
0 
6 

Primality test 
6 
0 
6 

Fermat's little theorem 
6 
0 
6 

Rotating calipers 
6 
0 
6 

Splay tree 
6 
0 
6 

Dynamic programming; using a deque 
6 
0 
6 

Randomization 
6 
0 
6 

Burnside's lemma 
5 
0 
5 

Manacher 
5 
0 
5 

Offline dynamic connectivity 
5 
0 
5 

Linear algebra 
5 
0 
5 

Gaussian elimination 
4 
0 
4 

Regular Expression 
4 
0 
4 

Z 
4 
0 
4 

Euler tour 
4 
0 
4 

Euler characteristic (χ=VE+F) 
4 
0 
4 

Bidirectional search 
4 
0 
4 

Travelling salesman problem 
4 
0 
4 

Hall's theorem 
3 
0 
3 

Physics 
3 
0 
3 

Doubly connected edge list 
3 
0 
3 

Numerical analysis 
3 
0 
3 

Area of a polygon 
2 
0 
2 

Delaunay triangulation 
2 
0 
2 

Hungarian 
2 
0 
2 

Miller–Rabin 
2 
0 
2 

Palindrome tree 
2 
0 
2 

Pollard rho 
2 
0 
2 

Queue 
2 
0 
2 

Knuth optimization 
2 
0 
2 

Matroid 
2 
0 
2 

Dynamic programming; using connection profile 
2 
0 
2 

Lucas theorem 
2 
0 
2 

Heuristics 
2 
0 
2 

Blossom 
1 
0 
1 

Directed minimum spanning tree 
1 
0 
1 

Point in convex polygon check 
1 
0 
1 

Stoer–Wagner 
1 
0 
1 

Voronoi diagram 
1 
0 
1 

Redblack tree 
1 
0 
1 

Link/cut tree 
1 
0 
1 

Berlekamp–Massey 
1 
0 
1 

Geometry; hyperdimensional 
1 
0 
1 

Alien's trick 
1 
0 
1 
