| tsp | 9.8 | MST preorder approximation |
|---|
| vedurspa | 9.6 | Exact least-squares regression |
|---|
| atrivialpursuit | 9.1 | Prime factorisation and inclusion-exclusion |
|---|
| basincity | 8.2 | Kernelisation and branching |
|---|
| dimensionalanalysis | 8.1 | Exact Gaussian elimination |
|---|
| doublets | 7.8 | Wildcard indexing and BFS |
|---|
| anothersubstringqueryproblem | 7.7 | Suffix array, persistent segment tree |
|---|
| magicsequence | 7.4 | Radix sort |
|---|
| bigfactoring | 7.2 | Pollard rho and primality certificates |
|---|
| palindromes | 7.2 | Manacher’s algorithm, Fenwick sweeps |
|---|
| committeeassignment | 7.0 | Backtracking graph colouring |
|---|
| kingpinescape | 7.0 | DFS leaf pairing |
|---|
| securitybadge | 7.0 | Interval compression and graph reachability |
|---|
| helpfulcurrents | 6.9 | Grid-DAG path counting |
|---|
| roadtimes | 6.9 | Floyd–Warshall and linear programming |
|---|
| numbersetshard | 6.7 | Prime sieve and union–find |
|---|
| sumsets | 6.7 | Meet-in-the-middle pair-sum hashing |
|---|
| indoorienteering | 6.6 | Meet-in-the-middle tour search |
|---|
| worstweather | 6.6 | Binary search and range-max queries |
|---|
| catenyms | 6.5 | Hierholzer’s Euler trail |
|---|
| isahasa | 6.4 | Bitset transitive closure |
|---|
| antiarithmetic | 6.3 | Mirrored bitset scan |
|---|
| largesttriangle | 6.3 | Convex hull and rotating calipers |
|---|
| nonnegpartsums | 6.3 | Prefix sums and monotone deque |
|---|
| bitwise | 6.2 | Bitwise greedy, next-cut pointers |
|---|
| derangementrotations | 6.2 | GCD counting and modular exponentiation |
|---|
| darkness | 6.0 | Illumination filtering and minimum cut |
|---|
| xormax | 5.9 | Binary linear basis |
|---|
| knapsack2 | 5.8 | Residue-class cyclic relaxation |
|---|
| farmingmars | 5.7 | Mo’s offline range queries |
|---|
| bilateral | 5.6 | Bipartite matching and vertex cover |
|---|
| addemup | 5.5 | Sorting and binary search |
|---|
| baza | 5.5 | Trie with prefix counts |
|---|
| cudak | 5.4 | Digit dynamic programming |
|---|
| intersectingrectangles | 5.4 | Plane sweep with AVL trees |
|---|
| selfbalancingbst | 5.3 | Persistent order-statistic red-black trees |
|---|
| tugofwar | 5.3 | Cardinality-aware subset-sum dynamic programming |
|---|
| joggers | 5.2 | Greedy tree vertex cover (BFS order, bottom-up) |
|---|
| closestpair2 | 5.2 | Divide-and-conquer closest pair |
|---|
| loopycabdrivers | 5.1 | Strongly connected components |
|---|
| remainderreminder | 5.1 | Volume enumeration and generalised CRT |
|---|
| chesstournament | 5.0 | Union–find and topological sorting |
|---|
| slowleak | 5.0 | Floyd–Warshall and Dijkstra |
|---|
| zapis | 5.0 | Interval dynamic programming |
|---|
| hashing | 4.9 | Polynomial prefix hashing |
|---|
| candydistribution | 4.7 | Extended Euclidean algorithm |
|---|
| canonical | 4.7 | Coin-change dynamic programming |
|---|
| gcpc | 4.7 | Order-statistic AVL tree |
|---|
| segmentintersection | 4.7 | Exact cross-product intersection tests |
|---|
| primepower | 4.6 | Sieve and modular exponentiation |
|---|
| booking | 4.5 | Sorted event sweep |
|---|
| cardhand | 4.4 | Suit enumeration and LCS |
|---|
| equationsolver | 4.4 | Certified Gaussian elimination |
|---|
| polymul2 | 4.4 | Split-coefficient FFT convolution |
|---|
| suffixsorting | 4.4 | Prefix-doubling suffix array |
|---|
| intervalcover | 4.3 | Greedy interval covering |
|---|
| yatp | 4.3 | Centroid decomposition, Li Chao trees |
|---|
| cuboidslicinggame | 4.2 | Sprague–Grundy dynamic programming |
|---|
| excavatorexpedition | 4.1 | DAG longest-path dynamic programming |
|---|
| fulltank | 4.1 | Dijkstra on city–fuel states with a Fibonacci heap |
|---|
| stringmultimatching | 4.1 | Aho–Corasick multi-pattern matching |
|---|
| kattissquest | 4.0 | Van Emde Boas tree, heaps |
|---|
| ultraquicksort | 4.0 | Merge-sort inversion counting |
|---|
| bracketsequence | 3.9 | Stack-based expression evaluation |
|---|
| water | 3.9 | Incremental Edmonds–Karp flow |
|---|
| purplerain | 3.8 | Prefix-sum extrema |
|---|
| joinstrings | 3.6 | Linked-list splicing |
|---|
| canvas | 3.5 | Huffman-style greedy merging |
|---|
| pascal | 3.5 | Smallest-prime-factor trial division |
|---|
| timing | 3.5 | Certified floating-point simulation |
|---|
| bst | 3.4 | Red-black tree neighbour queries |
|---|
| chatter | 3.4 | Weighted-union linked lists |
|---|
| closestpair1 | 3.4 | Bucket sort and geometric sweep |
|---|
| knigsoftheforest | 3.4 | Max-heap tournament simulation |
|---|
| dirtydriving | 3.3 | Sorting and greedy scan |
|---|
| longincsubseq | 3.3 | Patience sorting with binary search |
|---|
| stringmatching | 3.3 | Knuth–Morris–Pratt string matching |
|---|
| arbitrage | 3.2 | Max-product Floyd–Warshall |
|---|
| knapsack | 3.1 | 0/1 knapsack dynamic programming |
|---|
| communicationssatellite | 2.9 | Dense Prim’s algorithm |
|---|
| mazemovement | 2.8 | Push–relabel maximum flow |
|---|
| median | 2.8 | Randomised quickselect |
|---|
| roberthood | 2.8 | Convex hull and rotating calipers |
|---|
| allpairspath | 2.7 | Johnson’s all-pairs shortest paths |
|---|
| relatives | 2.7 | Euler’s totient by trial division |
|---|
| generalchineseremainder | 2.6 | Generalised Chinese remainder theorem |
|---|
| unionfind | 2.6 | Union by rank, path compression |
|---|
| satisfiability | 2.6 | Exhaustive truth-assignment search |
|---|
| minspantree | 2.5 | Kruskal’s algorithm |
|---|
| convexhull | 2.4 | Andrew’s monotone chain |
|---|
| plot | 2.4 | Horner evaluation and forward differences |
|---|
| bank | 2.3 | Greedy scheduling with disjoint sets |
|---|
| ada | 2.2 | Newton forward differences |
|---|
| babelfish | 2.0 | FKS perfect hashing |
|---|
| shortestpath3 | 2.0 | Bellman–Ford with negative-cycle propagation |
|---|
| shortestpath1 | 2.0 | Dijkstra with binary heap |
|---|
| polygonarea | 1.8 | Shoelace formula |
|---|
| polymul1 | 1.7 | Schoolbook polynomial convolution |
|---|
| oddmanout | 1.5 | XOR reduction |
|---|
| cold | 1.2 | Single-pass counting |
|---|
