diff --git a/README.md b/README.md index c0f8b9b..69caf2c 100644 --- a/README.md +++ b/README.md @@ -154,6 +154,8 @@ For instance, take into account the snaptshot above. If you already know how to * [Coursera - Algorithms - Part 1 - Elementary data structures, sorting, and searching algorithms](https://www.coursera.org/learn/algorithms-part1) πŸ†“ πŸŽ“ πŸ“Ό * [Coursera - Algorithms - Part 2 - Graph and string-processing algorithms](https://www.coursera.org/learn/algorithms-part2) πŸ†“ πŸŽ“ πŸ“Ό * [Courated List of the 10 best free resources](https://medium.freecodecamp.org/these-are-the-best-free-courses-to-learn-data-structures-and-algorithms-in-depth-4d52f0d6b35a) πŸ“° πŸ†“ + * Locks + * [Let's talk locks! - Kavya Joshi](https://www.youtube.com/watch?v=tjpncm3xTTc) πŸ“Ό πŸ†“ * Alternative Data Structures * [β€œEsoteric Data Structures and Where to Find Them” - Allan Deutsch](https://www.youtube.com/watch?v=-8UZhDjgeZU) πŸ“Ό πŸ†“ * 0:36 Slot map diff --git a/resources/topic-graph.mmd b/resources/topic-graph.mmd index a99fc4e..c3db52f 100644 --- a/resources/topic-graph.mmd +++ b/resources/topic-graph.mmd @@ -26,6 +26,7 @@ graph TD ALG --> SRT[Sorting] ALG --> CPX[Complexity] PT --> DS[Data Scructures] + DS --> Lock[Lock] DS --> Graph[Graph] DS --> T3[Tree] DS --> HS[Hash] diff --git a/resources/topic-graph.png b/resources/topic-graph.png index cbfd039..bfebea1 100644 Binary files a/resources/topic-graph.png and b/resources/topic-graph.png differ