# Dynamic programming

UVa 10337 - Flight Planner
UVa 10721 - Bar Codes
UVa 10943 - How do you add

UVa 10003 - Cutting Sticks
UVa 10912 - Simple Minded Hashing
UVa 11420 - Chest of Drawers

# Dynamic programming (Longest Increasing Subsequence)

UVa 481 - What Goes Up
UVa 11456 - Trainsorting
UVa 11790 - Murcia's Skyline
UVa 10534 - Wavio Sequence

# Dynamic programming (0-1 Knapsack)

UVa 1213 - Sum of Different Primes
UVa 10616 - Divisible Group Sums
UVa 11566 - Let's Yum Cha

# Dynamic programming (Max 2D/3D Range Sum)

UVa 10827 - Maximum sum on a torus
UVa 11951 - Area
UVa 10755 - Garbage Heap

# Dynamic programming (Floyd Warshall’s Algorithm)

UVa 821 - Page Hopping
UVa 10171 - Meeting Prof. Miguel
UVa 11463 - Commandos

# Dynamic programming (Coin Change)

UVa 357 - Let Me Count The Ways
UVa 10306 - e-Coins
UVa 11517 - Exact Change

# Maximum flow

UVa 820 - Internet Bandwidth
UVa 11418 - Clever Naming Patterns
UVa 12873 - The Programmers

# Maximum flow

UVa 10330 - Power Transmission
UVa 11380 - Down Went The Titanic
UVa 11506 - Angry Programmer
UVa 12125 - March of the Penguins

# Computational Geometry (Convex Hull)

UVa 681 - Convex Hull Finding
UVa 1206 - Boundary Points
UVa 11096 - Nails

# Computational Geometry (Closest Pair problem)

UVa 10245 - The Closest Pair Problem
UVa 11378 - Bey Battle

# Minimum cost Maximum flow

UVa 10594 - Data Flow
UVa 10806 - Dijkstra, Dijkstra
UVa 10888 - Warehouse