diff --git a/src/algorithms/graph/articulation-points/README.md b/src/algorithms/graph/articulation-points/README.md index 4c64d81e..aa6bede7 100644 --- a/src/algorithms/graph/articulation-points/README.md +++ b/src/algorithms/graph/articulation-points/README.md @@ -19,4 +19,4 @@ vertex removing which increases number of connected components. ## References - [GeeksForGeeks](https://www.geeksforgeeks.org/articulation-points-or-cut-vertices-in-a-graph/) -- [YouTube](https://www.youtube.com/watch?v=2kREIkF9UAs) +- [YouTube](https://www.youtube.com/watch?v=2kREIkF9UAs&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) diff --git a/src/algorithms/graph/bellman-ford/README.md b/src/algorithms/graph/bellman-ford/README.md index b28318b2..9c092265 100644 --- a/src/algorithms/graph/bellman-ford/README.md +++ b/src/algorithms/graph/bellman-ford/README.md @@ -18,4 +18,4 @@ Worst-case space complexity `O(|V|)` ## References - [Wikipedia](https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm) -- [On YouTube by Michael Sambol](https://www.youtube.com/watch?v=obWXjtg0L64) +- [On YouTube by Michael Sambol](https://www.youtube.com/watch?v=obWXjtg0L64&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) diff --git a/src/algorithms/graph/bridges/README.md b/src/algorithms/graph/bridges/README.md index 3fd721b0..08d919ff 100644 --- a/src/algorithms/graph/bridges/README.md +++ b/src/algorithms/graph/bridges/README.md @@ -21,6 +21,6 @@ An undirected connected graph with no cut edges ## References -- [GeeksForGeeks on YouTube](https://www.youtube.com/watch?time_continue=110&v=thLQYBlz2DM) +- [GeeksForGeeks on YouTube](https://www.youtube.com/watch?v=thLQYBlz2DM&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) - [Wikipedia](https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29#Tarjan.27s_Bridge-finding_algorithm) - [GeeksForGeeks](https://www.geeksforgeeks.org/bridge-in-a-graph/) diff --git a/src/algorithms/graph/detect-cycle/README.md b/src/algorithms/graph/detect-cycle/README.md index 8e8b681f..82641c78 100644 --- a/src/algorithms/graph/detect-cycle/README.md +++ b/src/algorithms/graph/detect-cycle/README.md @@ -52,9 +52,9 @@ General information: Cycles in undirected graphs: - [Detect Cycle in Undirected Graph on GeeksForGeeks](https://www.geeksforgeeks.org/detect-cycle-undirected-graph/) -- [Detect Cycle in Undirected Graph Algorithm on YouTube](https://www.youtube.com/watch?v=n_t0a_8H8VY) +- [Detect Cycle in Undirected Graph Algorithm on YouTube](https://www.youtube.com/watch?v=n_t0a_8H8VY&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) Cycles in directed graphs: - [Detect Cycle in Directed Graph on GeeksForGeeks](https://www.geeksforgeeks.org/detect-cycle-in-a-graph/) -- [Detect Cycle in Directed Graph Algorithm on YouTube](https://www.youtube.com/watch?v=rKQaZuoUR4M) +- [Detect Cycle in Directed Graph Algorithm on YouTube](https://www.youtube.com/watch?v=rKQaZuoUR4M&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) diff --git a/src/algorithms/graph/dijkstra/README.md b/src/algorithms/graph/dijkstra/README.md index 6fdacb0b..e1c5002f 100644 --- a/src/algorithms/graph/dijkstra/README.md +++ b/src/algorithms/graph/dijkstra/README.md @@ -21,5 +21,5 @@ and updates the neighbor's distance if smaller. Mark visited ## References - [Wikipedia](https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm) -- [On YouTube by Nathaniel Fan](https://www.youtube.com/watch?v=gdmfOwyQlcI) -- [On YouTube by Tushar Roy](https://www.youtube.com/watch?v=lAXZGERcDf4) +- [On YouTube by Nathaniel Fan](https://www.youtube.com/watch?v=gdmfOwyQlcI&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) +- [On YouTube by Tushar Roy](https://www.youtube.com/watch?v=lAXZGERcDf4&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) diff --git a/src/algorithms/graph/eulerian-path/README.md b/src/algorithms/graph/eulerian-path/README.md index 0f6b9466..597a9ef3 100644 --- a/src/algorithms/graph/eulerian-path/README.md +++ b/src/algorithms/graph/eulerian-path/README.md @@ -32,4 +32,4 @@ therefore, a solution does not exist. ## References - [Wikipedia](https://en.wikipedia.org/wiki/Eulerian_path) -- [YouTube](https://www.youtube.com/watch?v=vvP4Fg4r-Ns) +- [YouTube](https://www.youtube.com/watch?v=vvP4Fg4r-Ns&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) diff --git a/src/algorithms/graph/hamiltonian-cycle/README.md b/src/algorithms/graph/hamiltonian-cycle/README.md index 74d8ed15..ccd15481 100644 --- a/src/algorithms/graph/hamiltonian-cycle/README.md +++ b/src/algorithms/graph/hamiltonian-cycle/README.md @@ -44,5 +44,5 @@ then we return false. ## References - [Hamiltonian path on Wikipedia](https://en.wikipedia.org/wiki/Hamiltonian_path) -- [Hamiltonian path on YouTube](https://www.youtube.com/watch?v=dQr4wZCiJJ4) +- [Hamiltonian path on YouTube](https://www.youtube.com/watch?v=dQr4wZCiJJ4&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) - [Hamiltonian cycle on GeeksForGeeks](https://www.geeksforgeeks.org/backtracking-set-7-hamiltonian-cycle/) diff --git a/src/algorithms/graph/kruskal/README.md b/src/algorithms/graph/kruskal/README.md index 5ed128e7..eb8a0ebf 100644 --- a/src/algorithms/graph/kruskal/README.md +++ b/src/algorithms/graph/kruskal/README.md @@ -45,5 +45,5 @@ are two possibilities of minimum spanning tree of the given graph. - [Minimum Spanning Tree on Wikipedia](https://en.wikipedia.org/wiki/Minimum_spanning_tree) - [Kruskal's Algorithm on Wikipedia](https://en.wikipedia.org/wiki/Kruskal%27s_algorithm) -- [Kruskal's Algorithm on YouTube by Tushar Roy](https://www.youtube.com/watch?v=fAuF0EuZVCk) -- [Kruskal's Algorithm on YouTube by Michael Sambol](https://www.youtube.com/watch?v=71UQH7Pr9kU) +- [Kruskal's Algorithm on YouTube by Tushar Roy](https://www.youtube.com/watch?v=fAuF0EuZVCk&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) +- [Kruskal's Algorithm on YouTube by Michael Sambol](https://www.youtube.com/watch?v=71UQH7Pr9kU&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) diff --git a/src/algorithms/graph/prim/README.md b/src/algorithms/graph/prim/README.md index d9012c94..49061a27 100644 --- a/src/algorithms/graph/prim/README.md +++ b/src/algorithms/graph/prim/README.md @@ -43,5 +43,5 @@ are two possibilities of minimum spanning tree of the given graph. - [Minimum Spanning Tree on Wikipedia](https://en.wikipedia.org/wiki/Minimum_spanning_tree) - [Prim's Algorithm on Wikipedia](https://en.wikipedia.org/wiki/Prim%27s_algorithm) -- [Prim's Algorithm on YouTube by Tushar Roy](https://www.youtube.com/watch?v=oP2-8ysT3QQ) -- [Prim's Algorithm on YouTube by Michael Sambol](https://www.youtube.com/watch?v=cplfcGZmX7I) +- [Prim's Algorithm on YouTube by Tushar Roy](https://www.youtube.com/watch?v=oP2-8ysT3QQ&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) +- [Prim's Algorithm on YouTube by Michael Sambol](https://www.youtube.com/watch?v=cplfcGZmX7I&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) diff --git a/src/algorithms/graph/strongly-connected-components/README.md b/src/algorithms/graph/strongly-connected-components/README.md index 54faaad4..74f23ce0 100644 --- a/src/algorithms/graph/strongly-connected-components/README.md +++ b/src/algorithms/graph/strongly-connected-components/README.md @@ -13,4 +13,4 @@ Graph with strongly connected components marked ## References - [Wikipedia](https://en.wikipedia.org/wiki/Strongly_connected_component) -- [YouTube](https://www.youtube.com/watch?v=RpgcYiky7uw) +- [YouTube](https://www.youtube.com/watch?v=RpgcYiky7uw&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) diff --git a/src/algorithms/graph/topological-sorting/README.md b/src/algorithms/graph/topological-sorting/README.md index c911c1ca..f4653a8b 100644 --- a/src/algorithms/graph/topological-sorting/README.md +++ b/src/algorithms/graph/topological-sorting/README.md @@ -52,4 +52,4 @@ next dependency has its dependent packages to be installed in prior. ## References - [Wikipedia](https://en.wikipedia.org/wiki/Topological_sorting) -- [Topological Sorting on YouTube by Tushar Roy](https://www.youtube.com/watch?v=ddTC4Zovtbc) +- [Topological Sorting on YouTube by Tushar Roy](https://www.youtube.com/watch?v=ddTC4Zovtbc&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) diff --git a/src/algorithms/math/integer-partition/README.md b/src/algorithms/math/integer-partition/README.md index ee6a9f0a..6023e150 100644 --- a/src/algorithms/math/integer-partition/README.md +++ b/src/algorithms/math/integer-partition/README.md @@ -31,4 +31,4 @@ are conjugate partitions. ## References - [Wikipedia](https://en.wikipedia.org/wiki/Partition_(number_theory)) -- [YouTube](https://www.youtube.com/watch?v=ZaVM057DuzE) +- [YouTube](https://www.youtube.com/watch?v=ZaVM057DuzE&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) diff --git a/src/algorithms/search/binary-search/README.md b/src/algorithms/search/binary-search/README.md index 0b55e1aa..8de1f462 100644 --- a/src/algorithms/search/binary-search/README.md +++ b/src/algorithms/search/binary-search/README.md @@ -14,4 +14,5 @@ in the array. ## References -[Wikipedia](https://en.wikipedia.org/wiki/Binary_search_algorithm) +- [Wikipedia](https://en.wikipedia.org/wiki/Binary_search_algorithm) +- [YouTube](https://www.youtube.com/watch?v=P3YID7liBug&index=29&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) diff --git a/src/algorithms/sets/knapsack-problem/README.md b/src/algorithms/sets/knapsack-problem/README.md index 1c719d7b..1d86019f 100644 --- 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) diff --git a/src/algorithms/sets/longest-common-subsequnce/README.md b/src/algorithms/sets/longest-common-subsequnce/README.md index 8427072e..7c9328e0 100644 --- 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) diff --git a/src/algorithms/sets/longest-increasing-subsequence/README.md b/src/algorithms/sets/longest-increasing-subsequence/README.md index 1011a1b8..bcb2665c 100644 --- 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) diff --git a/src/algorithms/sets/maximum-subarray/README.md b/src/algorithms/sets/maximum-subarray/README.md index b2448dee..a254e1f8 100644 --- 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) diff --git a/src/algorithms/sorting/bubble-sort/README.md b/src/algorithms/sorting/bubble-sort/README.md index 2c0f767b..4861dc2e 100644 --- a/src/algorithms/sorting/bubble-sort/README.md +++ b/src/algorithms/sorting/bubble-sort/README.md @@ -11,4 +11,5 @@ are needed, which indicates that the list is sorted. ## References -[Wikipedia](https://en.wikipedia.org/wiki/Bubble_sort) +- [Wikipedia](https://en.wikipedia.org/wiki/Bubble_sort) +- [YouTube](https://www.youtube.com/watch?v=6Gv8vg0kcHc&index=27&t=0s&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) diff --git a/src/algorithms/sorting/merge-sort/README.md b/src/algorithms/sorting/merge-sort/README.md index 00d6b909..372cc2ac 100644 --- a/src/algorithms/sorting/merge-sort/README.md +++ b/src/algorithms/sorting/merge-sort/README.md @@ -24,4 +24,5 @@ emulate merge sort (top-down). ## References -[Wikipedia](https://en.wikipedia.org/wiki/Merge_sort) +- [Wikipedia](https://en.wikipedia.org/wiki/Merge_sort) +- [YouTube](https://www.youtube.com/watch?v=KF2j-9iSf4Q&index=27&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) diff --git a/src/algorithms/sorting/quick-sort/README.md b/src/algorithms/sorting/quick-sort/README.md index 6ec8ca5e..3021e6e2 100644 --- a/src/algorithms/sorting/quick-sort/README.md +++ b/src/algorithms/sorting/quick-sort/README.md @@ -25,4 +25,5 @@ The horizontal lines are pivot values. ## References -[Wikipedia](https://en.wikipedia.org/wiki/Quicksort) +- [Wikipedia](https://en.wikipedia.org/wiki/Quicksort) +- [YouTube](https://www.youtube.com/watch?v=SLauY6PpjW4&index=28&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) diff --git a/src/algorithms/string/knuth-morris-pratt/README.md b/src/algorithms/string/knuth-morris-pratt/README.md index 8f17c9e9..907ff60c 100644 --- a/src/algorithms/string/knuth-morris-pratt/README.md +++ b/src/algorithms/string/knuth-morris-pratt/README.md @@ -16,4 +16,4 @@ of previously matched characters. ## References - [Wikipedia](https://en.wikipedia.org/wiki/Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm) -- [YouTube](https://www.youtube.com/watch?v=GTJr8OvyEVQ) +- [YouTube](https://www.youtube.com/watch?v=GTJr8OvyEVQ&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) diff --git a/src/algorithms/string/levenshtein-distance/README.md b/src/algorithms/string/levenshtein-distance/README.md index 0ad2d5cb..00019e87 100644 --- a/src/algorithms/string/levenshtein-distance/README.md +++ b/src/algorithms/string/levenshtein-distance/README.md @@ -43,4 +43,4 @@ three edits: ## References - [Wikipedia](https://en.wikipedia.org/wiki/Levenshtein_distance) -- [YouTube](https://www.youtube.com/watch?v=We3YDTzNXEk) +- [YouTube](https://www.youtube.com/watch?v=We3YDTzNXEk&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) diff --git a/src/algorithms/string/longest-common-substring/README.md b/src/algorithms/string/longest-common-substring/README.md index 3b4dded3..9e63294f 100644 --- a/src/algorithms/string/longest-common-substring/README.md +++ b/src/algorithms/string/longest-common-substring/README.md @@ -21,4 +21,4 @@ ABABC ## References - [Wikipedia](https://en.wikipedia.org/wiki/Longest_common_substring_problem) -- [YouTube](https://www.youtube.com/watch?v=BysNXJHzCEs) +- [YouTube](https://www.youtube.com/watch?v=BysNXJHzCEs&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) diff --git a/src/algorithms/string/rabin-karp/README.md b/src/algorithms/string/rabin-karp/README.md index 800ec5b8..d6027eeb 100644 --- a/src/algorithms/string/rabin-karp/README.md +++ b/src/algorithms/string/rabin-karp/README.md @@ -22,4 +22,4 @@ strings, single-string searching algorithms are impractical. ## References - [Wikipedia](https://en.wikipedia.org/wiki/Rabin%E2%80%93Karp_algorithm) -- [YouTube](https://www.youtube.com/watch?v=H4VrKHVG5qI) +- [YouTube](https://www.youtube.com/watch?v=H4VrKHVG5qI&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) diff --git a/src/algorithms/uncategorized/n-queens/README.md b/src/algorithms/uncategorized/n-queens/README.md index 364277c6..703cf5e9 100644 --- a/src/algorithms/uncategorized/n-queens/README.md +++ b/src/algorithms/uncategorized/n-queens/README.md @@ -69,5 +69,5 @@ and return false. - [Wikipedia](https://en.wikipedia.org/wiki/Eight_queens_puzzle) - [GeeksForGeeks](https://www.geeksforgeeks.org/backtracking-set-3-n-queen-problem/) -- [On YouTube by Abdul Bari](https://www.youtube.com/watch?v=xFv_Hl4B83A) -- [On YouTube by Tushar Roy](https://www.youtube.com/watch?v=xouin83ebxE) +- [On YouTube by Abdul Bari](https://www.youtube.com/watch?v=xFv_Hl4B83A&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) +- [On YouTube by Tushar Roy](https://www.youtube.com/watch?v=xouin83ebxE&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8)