Update READMEs.

2026-03-13 08:51:02 +08:00 · 2018-05-21 21:48:35 +03:00
parent 2185212527
commit f966ef5d5d
25 changed files with 34 additions and 30 deletions
--- a/src/algorithms/sets/knapsack-problem/README.md
+++ b/src/algorithms/sets/knapsack-problem/README.md
@@ -66,4 +66,4 @@ and ![unbounded knapsack](https://wikimedia.org/api/rest_v1/media/math/render/sv
 ## References

 - [Wikipedia](https://en.wikipedia.org/wiki/Knapsack_problem)
- [0/1 Knapsack Problem on YouTube](https://www.youtube.com/watch?v=8LusJS5-AGo)
+- [0/1 Knapsack Problem on YouTube](https://www.youtube.com/watch?v=8LusJS5-AGo&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8)
--- a/src/algorithms/sets/longest-common-subsequnce/README.md
+++ b/src/algorithms/sets/longest-common-subsequnce/README.md
@@ -22,4 +22,4 @@ made to a revision-controlled collection of files.
 ## References

 - [Wikipedia](https://en.wikipedia.org/wiki/Longest_common_subsequence_problem)
- [YouTube](https://www.youtube.com/watch?v=NnD96abizww)
+- [YouTube](https://www.youtube.com/watch?v=NnD96abizww&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8)
--- a/src/algorithms/sets/longest-increasing-subsequence/README.md
+++ b/src/algorithms/sets/longest-increasing-subsequence/README.md
@@ -43,4 +43,4 @@ input sequence.
 ## References

 - [Wikipedia](https://en.wikipedia.org/wiki/Longest_increasing_subsequence)
- [Dynamic Programming Approach on YouTube](https://www.youtube.com/watch?v=CE2b_-XfVDk)
+- [Dynamic Programming Approach on YouTube](https://www.youtube.com/watch?v=CE2b_-XfVDk&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8)
--- a/src/algorithms/sets/maximum-subarray/README.md
+++ b/src/algorithms/sets/maximum-subarray/README.md
@@ -16,4 +16,4 @@ with the largest sum is `4, −1, 2, 1`, with sum `6`.
 ## References

 - [Wikipedia](https://en.wikipedia.org/wiki/Maximum_subarray_problem)
- [YouTube](https://www.youtube.com/watch?v=ohHWQf1HDfU)
+- [YouTube](https://www.youtube.com/watch?v=ohHWQf1HDfU&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8)