LCS, dynamic programming
Graph traversal
BFS
Prim minimum-cost spanning tree algorithm
Prim minimum-cost spanning tree algorithm
Easy math
LCS
Sieve of Eratosthenes on H-number (of form 4k+1)
Easy but take care case n = 0