Commit f966ef5
File tree
- src/algorithms
- graph
- articulation-points
- bellman-ford
- bridges
- detect-cycle
- dijkstra
- eulerian-path
- hamiltonian-cycle
- kruskal
- prim
- strongly-connected-components
- topological-sorting
- math/integer-partition
- search/binary-search
- sets
- knapsack-problem
- longest-common-subsequnce
- longest-increasing-subsequence
- maximum-subarray
- sorting
- bubble-sort
- merge-sort
- quick-sort
- string
- knuth-morris-pratt
- levenshtein-distance
- longest-common-substring
- rabin-karp
- uncategorized/n-queens
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -19,4 +19,4 @@ vertex removing which increases number of connected components. | |||
| 19 | 19 | ## References | |
| 20 | 20 | ||
| 21 | 21 | - [GeeksForGeeks](https://www.geeksforgeeks.org/articulation-points-or-cut-vertices-in-a-graph/) | |
| 22 | - - [YouTube](https://www.youtube.com/watch?v=2kREIkF9UAs) | ||
| 22 | + - [YouTube](https://www.youtube.com/watch?v=2kREIkF9UAs&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) | ||
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -18,4 +18,4 @@ Worst-case space complexity `O(|V|)` | |||
| 18 | 18 | ## References | |
| 19 | 19 | ||
| 20 | 20 | - [Wikipedia](https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm) | |
| 21 | - - [On YouTube by Michael Sambol](https://www.youtube.com/watch?v=obWXjtg0L64) | ||
| 21 | + - [On YouTube by Michael Sambol](https://www.youtube.com/watch?v=obWXjtg0L64&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) | ||
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -21,6 +21,6 @@ An undirected connected graph with no cut edges | |||
| 21 | 21 | ||
| 22 | 22 | ## References | |
| 23 | 23 | ||
| 24 | - - [GeeksForGeeks on YouTube](https://www.youtube.com/watch?time_continue=110&v=thLQYBlz2DM) | ||
| 24 | + - [GeeksForGeeks on YouTube](https://www.youtube.com/watch?v=thLQYBlz2DM&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) | ||
| 25 | 25 | - [Wikipedia](https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29#Tarjan.27s_Bridge-finding_algorithm) | |
| 26 | 26 | - [GeeksForGeeks](https://www.geeksforgeeks.org/bridge-in-a-graph/) | |
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -52,9 +52,9 @@ General information: | |||
| 52 | 52 | Cycles in undirected graphs: | |
| 53 | 53 | ||
| 54 | 54 | - [Detect Cycle in Undirected Graph on GeeksForGeeks](https://www.geeksforgeeks.org/detect-cycle-undirected-graph/) | |
| 55 | - - [Detect Cycle in Undirected Graph Algorithm on YouTube](https://www.youtube.com/watch?v=n_t0a_8H8VY) | ||
| 55 | + - [Detect Cycle in Undirected Graph Algorithm on YouTube](https://www.youtube.com/watch?v=n_t0a_8H8VY&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) | ||
| 56 | 56 | ||
| 57 | 57 | Cycles in directed graphs: | |
| 58 | 58 | ||
| 59 | 59 | - [Detect Cycle in Directed Graph on GeeksForGeeks](https://www.geeksforgeeks.org/detect-cycle-in-a-graph/) | |
| 60 | - - [Detect Cycle in Directed Graph Algorithm on YouTube](https://www.youtube.com/watch?v=rKQaZuoUR4M) | ||
| 60 | + - [Detect Cycle in Directed Graph Algorithm on YouTube](https://www.youtube.com/watch?v=rKQaZuoUR4M&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) | ||
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -21,5 +21,5 @@ and updates the neighbor's distance if smaller. Mark visited | |||
| 21 | 21 | ## References | |
| 22 | 22 | ||
| 23 | 23 | - [Wikipedia](https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm) | |
| 24 | - - [On YouTube by Nathaniel Fan](https://www.youtube.com/watch?v=gdmfOwyQlcI) | ||
| 25 | - - [On YouTube by Tushar Roy](https://www.youtube.com/watch?v=lAXZGERcDf4) | ||
| 24 | + - [On YouTube by Nathaniel Fan](https://www.youtube.com/watch?v=gdmfOwyQlcI&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) | ||
| 25 | + - [On YouTube by Tushar Roy](https://www.youtube.com/watch?v=lAXZGERcDf4&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) | ||
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -32,4 +32,4 @@ therefore, a solution does not exist. | |||
| 32 | 32 | ## References | |
| 33 | 33 | ||
| 34 | 34 | - [Wikipedia](https://en.wikipedia.org/wiki/Eulerian_path) | |
| 35 | - - [YouTube](https://www.youtube.com/watch?v=vvP4Fg4r-Ns) | ||
| 35 | + - [YouTube](https://www.youtube.com/watch?v=vvP4Fg4r-Ns&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) | ||
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -44,5 +44,5 @@ then we return false. | |||
| 44 | 44 | ## References | |
| 45 | 45 | ||
| 46 | 46 | - [Hamiltonian path on Wikipedia](https://en.wikipedia.org/wiki/Hamiltonian_path) | |
| 47 | - - [Hamiltonian path on YouTube](https://www.youtube.com/watch?v=dQr4wZCiJJ4) | ||
| 47 | + - [Hamiltonian path on YouTube](https://www.youtube.com/watch?v=dQr4wZCiJJ4&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) | ||
| 48 | 48 | - [Hamiltonian cycle on GeeksForGeeks](https://www.geeksforgeeks.org/backtracking-set-7-hamiltonian-cycle/) | |
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -45,5 +45,5 @@ are two possibilities of minimum spanning tree of the given graph. | |||
| 45 | 45 | ||
| 46 | 46 | - [Minimum Spanning Tree on Wikipedia](https://en.wikipedia.org/wiki/Minimum_spanning_tree) | |
| 47 | 47 | - [Kruskal's Algorithm on Wikipedia](https://en.wikipedia.org/wiki/Kruskal%27s_algorithm) | |
| 48 | - - [Kruskal's Algorithm on YouTube by Tushar Roy](https://www.youtube.com/watch?v=fAuF0EuZVCk) | ||
| 49 | - - [Kruskal's Algorithm on YouTube by Michael Sambol](https://www.youtube.com/watch?v=71UQH7Pr9kU) | ||
| 48 | + - [Kruskal's Algorithm on YouTube by Tushar Roy](https://www.youtube.com/watch?v=fAuF0EuZVCk&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) | ||
| 49 | + - [Kruskal's Algorithm on YouTube by Michael Sambol](https://www.youtube.com/watch?v=71UQH7Pr9kU&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) | ||
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -43,5 +43,5 @@ are two possibilities of minimum spanning tree of the given graph. | |||
| 43 | 43 | ||
| 44 | 44 | - [Minimum Spanning Tree on Wikipedia](https://en.wikipedia.org/wiki/Minimum_spanning_tree) | |
| 45 | 45 | - [Prim's Algorithm on Wikipedia](https://en.wikipedia.org/wiki/Prim%27s_algorithm) | |
| 46 | - - [Prim's Algorithm on YouTube by Tushar Roy](https://www.youtube.com/watch?v=oP2-8ysT3QQ) | ||
| 47 | - - [Prim's Algorithm on YouTube by Michael Sambol](https://www.youtube.com/watch?v=cplfcGZmX7I) | ||
| 46 | + - [Prim's Algorithm on YouTube by Tushar Roy](https://www.youtube.com/watch?v=oP2-8ysT3QQ&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) | ||
| 47 | + - [Prim's Algorithm on YouTube by Michael Sambol](https://www.youtube.com/watch?v=cplfcGZmX7I&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) | ||
Lines changed: 1 addition & 1 deletion
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -13,4 +13,4 @@ Graph with strongly connected components marked | |||
| 13 | 13 | ## References | |
| 14 | 14 | ||
| 15 | 15 | - [Wikipedia](https://en.wikipedia.org/wiki/Strongly_connected_component) | |
| 16 | - - [YouTube](https://www.youtube.com/watch?v=RpgcYiky7uw) | ||
| 16 | + - [YouTube](https://www.youtube.com/watch?v=RpgcYiky7uw&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) | ||
0 commit comments