From 1f6a5641362d06531a1dda1eecf65e5deb8a8576 Mon Sep 17 00:00:00 2001
From: Oleksii Trekhleb <trehleb@gmail.com>
Date: Thu, 26 Apr 2018 07:42:11 +0300
Subject: [PATCH] Update README.

---
 README.md | 21 +++++++++++----------
 1 file changed, 11 insertions(+), 10 deletions(-)

diff --git a/README.md b/README.md
index 08eb442d..5ccb8ed6 100644
--- a/README.md
+++ b/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**