mirror of
https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git
synced 2024-12-26 07:01:18 +08:00
Update README.
This commit is contained in:
parent
351f612af9
commit
1f6a564136
21
README.md
21
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**
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user