Recursion and dynamic programming

1. ✔ Given any amount of cents the code will return an array with the minimum amount of coins that add up to the required amount. The array should be arranged from highest to lowest value coin. - coinChanger
2. ✔ Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.) - editDistance