Category:Techniques

A

• Aho Corasick
• ASCII

B

• Balances
• Bellman Ford
• BFS
• Bi Connected Components
• Big Numbers
• Binary Search
• Bipartite Matching
• Brute Force

C

• Case Work
• Caterpillar Walk
• Center of Mass
• Combinatorics
• Constant Time Reduction
• Constant Time Update
• Convex Hull
• Convex Hull Optimization
• Convolution
• Coordinate Transformation
• Cross Product
• Custom Comparator

D

• DFA Minimization
• DFS
• Dijkstra
• Dimension Elimination
• Dimension Swapping
• Divide and Conquer
• Dynamic Programming

E

• Expected Value

F

• Fast Fourier Transform
• Fix a Variable
• Floyd Warshall

G

• Game Theory
• GCD
• Geometry
• Graph
• Greedy
• Grid

H

• Hashmap
• Hashset
• Huffman Coding
• Hungarian Algorithm

I

• In-Out Nodes
• Input
• Integral
• Interesting Points
• Interval Tree

J

• Javascript

K

• KNP

L

• Line Intersection
• Linear Equations
• Low Precision

M

• Math
• Max Flow
• Min Cost Max Flow
• Min Cut
• MiniMax
• Minimum Spanning Tree
• Modulus

N

• NP

O

• Output

P

• Path Reconstruction
• Polygon Area
• Polygon Containment
• Precomputation
• Prime Factorization
• Printf
• Probability

R

• Randomized Algorithms
• Rational Math
• Regex

S

• Satisfiability
• Select an Element
• Simulation
• Square Root Split
• Stack
• Stars and Bars
• State Explosion
• Strings
• Strongly Connected Components
• Sweep Line

T

• Ternary Search
• Topological Sort
• Topology
• Treeset

U

• Union Find

Z

• Z Algorithm