-
Ad hoc
-
Edit Distance
-
Integer partition
-
Josephus Problem
-
Knapsack
-
Binary Knapsack
-
Counting Knapsack
-
Infinite Items Knapsack
-
-
Longest Common Subsequence
-
Longest Common Substring
-
Longest Increasing Subsequence
-
Matrix Multiplication
-
Maximum Sum Contiguous Subsequence
-
Maximum Sum Sub-rectangle
-
Minimax
-
Optimal Search Tree
-
2-SAT
-
Bipartite Matching
-
DFS
-
Finding Articulation Points
-
Finding Bridges
-
Flood Fill
-
Job Scheduling
-
Markov Chain
-
Maximum Flow
-
Ford-Fulkerson
-
Min Cost
- Cycle Canceling
-
-
Minimum Spanning Tree
-
Kruskal
-
Prim
-
-
Shortest Path
-
Bellman Ford
-
BFS
-
Dijkstra
-
Floyd-Warshall
-
-
Strongly Connected Components
-
Topological Sorting
-
Tree Isomorphism
-
Big Integer
-
Extended Euclid
-
GCD
-
Geometry
-
3D Line Detection
-
Convex Hull
-
Enclosing Circle
-
Great-Circle Distance
-
Mirror
-
Point Sort
-
Point to Line
-
Segment Rotation
-
Segments Angle
-
Square Distance
-
Prime Factorization
-
Euler's Totient
-
Probability
-
Sieve
-
Ad hoc
- UVA 136 - Ugly Numbers
- UVA 160 - Factors and Factorials
- UVA 458 - The Decoder
- UVA 494 - Kindergarten Counting Game
- UVA 573 - The Snail
- UVA 579 - ClockHands
- UVA 579 - ClockHands
- UVA 591 - Box of Bricks
- UVA 10018 - Reverse and Add
- UVA 10035 - Primary Arithmetic
- UVA 10189 - Minesweeper
- UVA 10300 - Ecological Premium
- UVA 10694 - f91
- UVA 10783 - Odd Sum
- UVA 11494 - Queen
- UVA 11597 - Spanning Subtree
- UVA 12148 - Electricity
- UVA 12155 - ASCII Diamondi
- UVA 12195 - Jingle Composing
- UVA 12196 - Klingon Levels
- UVA 12482 - Short Story Competition
- UVA 12485 - Perfect Choir
- UVA 12488 - Start Grid
- UVA 12490 - Integral
- UVA 12492 - Rubik Cycle
-
Binary Manipulation
-
Binary Search
-
Fenwick Tree
-
Greed
-
Linked List
-
Permutation Cycle
-
Priority queue
-
Segment Tree
-
2D
-
Lazy Propagation
-
Range Maximum Query
-
Sort
-
STL map
-
String Matching
-
KMP
-
Suffix Array
-
Circular
-
Longest Common Prefix
-
-
Trie
-
-
String parsing
-
Union-Find