Update README.

Author: trekhleb

README.md

@@ -81,16 +81,17 @@
 * **Greedy**
 * **Divide and Conquer**
 * **Dynamic Programming**
-   * [Levenshtein Distance](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/string/levenshtein-distance) - minimum edit distance between two sequences
-   * [Longest Common Subsequence](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/string/longest-common-subsequnce) (LCS)
-   * [Longest Common Substring](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/string/longest-common-substring)
-   * Increasing subsequence
-   * Longest Increasing subsequence
-   * Shortest common supersequence
-   * Knapsack problem
-   * Maximum subarray
-   * Maximum sum path
-   * Integer Partition
+  * [Fibonacci Number](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/math/fibonacci)
+  * [Levenshtein Distance](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/string/levenshtein-distance) - minimum edit distance between two sequences
+  * [Longest Common Subsequence](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/string/longest-common-subsequnce) (LCS)
+  * [Longest Common Substring](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/string/longest-common-substring)
+  * Increasing subsequence
+  * Longest Increasing subsequence
+  * Shortest common supersequence
+  * Knapsack problem
+  * Maximum subarray
+  * Maximum sum path
+  * Integer Partition
 * **Backtracking**
 * **Branch & Bound**