fix(book): Rename fibonacci-dynamic-programming

(fix typo)

Author: knoxknox

book/content/part04/dynamic-programming.asc

@@ -40,7 +40,7 @@ When we have recursive functions, doing duplicated work is the perfect place for
 .Recursive Fibonacci Implemenation using Dynamic Programming
 [source, javascript]
 ----
-include::{codedir}/algorithms/fibanacci-dynamic-programming.js[tag=snippet,indent=0]
+include::{codedir}/algorithms/fibonacci-dynamic-programming.js[tag=snippet,indent=0]
 ----
 
 This implementation checks if we already calculated the value, if so it will save it for later use.

deprecated-README.adoc

@@ -56,7 +56,7 @@ image::https://user-images.githubusercontent.com/418605/46118890-ba721180-c1d6-1
 * Divide and Conquer
   ** Fibonacci Numbers. https://github.com/amejiarosario/dsa.js/blob/master/src/algorithms/fibonacci-recursive.js[Code]
 * Dynamic Programming
-	** Fibonacci with memoization. https://github.com/amejiarosario/dsa.js/blob/master/src/algorithms/fibanacci-dynamic-programming.js[Code]
+	** Fibonacci with memoization. https://github.com/amejiarosario/dsa.js/blob/master/src/algorithms/fibonacci-dynamic-programming.js[Code]
 * Backtracking algorithms
 	** Word permutations. https://github.com/amejiarosario/dsa.js/blob/master/src/algorithms/permutations-backtracking.js[Code]
 

src/algorithms/fibanacci-dynamic-programming.js renamed to src/algorithms/fibonacci-dynamic-programming.js

@@ -1,7 +1,7 @@
 const implementations = [
   'fibonacci',
   'fibonacci-recursive',
-  'fibanacci-dynamic-programming',
+  'fibonacci-dynamic-programming',
 ];
 
 implementations.forEach((fileName) => {