The 3n + 1 problem
|
Sol, Memotization
|
|
Ackermann Functions
|
Sol, Memotization
|
|
DDF
|
Sol, Memotization
|
|
Contracting
Integers (6)
|
Sol,
Com |
Checked |
Stacking Boxes
|
Sol, Longest asc/des subsequence
|
|
History Grading
|
Sol, Longest asc/des subsequence
|
|
| Testing the
Catcher |
Sol, Longest asc/des subsequence, Com |
Checked |
Compromise
|
Sol, Longest common subsequence
|
|
| Budget Travel |
Sol, 1D minimize, Com |
Checked |
Arbritage
|
Sol, 2D minimize
|
|
String Distance
|
Sol, 2D minimize
|
|
Always on the Run
|
Sol, 2D minimize
|
|
e-Coins
|
Sol, 2D minimize
|
|
| Unidirectional TSP
|
Sol,
2D minimize, Com |
Checked |
Maximum Sum
|
Sol, 2D maximize
|
|
Longest Run on a Snowboard
|
Sol, 2D maximize
|
|
Triangles
|
Sol, 2D maximize
|
|
| Help
the Museum |
Sol, 2D maximize
|
|
Dollars
|
Sol, Change making
|
|
Towards
Zero
|
Sol, Com
|
|