Update README.

This commit is contained in:
Oleksii Trekhleb 2018-04-26 07:42:11 +03:00
parent 351f612af9
commit 1f6a564136

View File

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