Added in assignment 5 for algorithm techniques:
1. Find the largest square submatrix containing only 1s in the following file:
2. Find the longest common subsequence among the first two lines in the following file (note that the file has exactly two lines)
3. Assume that U.S. currency consists of a 1, 5, 10, 18, and 25 cent piece. Note the new 18 cent piece. Show the optimal way (minimum number of coins) to make change for 1, 2, ... 100 cents.