From d0bec91d0030f603a573fcba4626d6277b6d186d Mon Sep 17 00:00:00 2001 From: kiwib0y Date: Tue, 29 Aug 2023 11:34:13 +0200 Subject: [PATCH 1/4] Fix typo in line --- translations/README-bg.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/translations/README-bg.md b/translations/README-bg.md index a53b284..e2b5174 100644 --- a/translations/README-bg.md +++ b/translations/README-bg.md @@ -534,7 +534,7 @@ pобхождам графи. Ако трябваше да напиша сорт - [LeetCode](https://leetcode.com/) - Любимият ми сайт със задачи. Струва си парите за абонамент за времето, в което ще се подготвяте. - - Вижте клиповете на Nick White и FisherCoder Videos по-горе за насоки със някои задачи. + - Вижте клиповете на Nick White и FisherCoder Videos по-горе за насоки с някои задачи. - [HackerRank](https://www.hackerrank.com/) - [TopCoder](https://www.topcoder.com/) - [Geeks for Geeks](https://practice.geeksforgeeks.org/explore/?page=1) From 9e8b0ddea7576784fb5b135ae906e31591c043a8 Mon Sep 17 00:00:00 2001 From: kiwib0y Date: Tue, 29 Aug 2023 11:35:07 +0200 Subject: [PATCH 2/4] Fix indentation --- translations/README-bg.md | 122 +++++++++++++++++++------------------- 1 file changed, 60 insertions(+), 62 deletions(-) diff --git a/translations/README-bg.md b/translations/README-bg.md index e2b5174..dd7c1b1 100644 --- a/translations/README-bg.md +++ b/translations/README-bg.md @@ -335,7 +335,7 @@ pобхождам графи. Ако трябваше да напиша сорт Повече за вариантите: -- [Изберете правилния език за вашето интервю по програмиране](http://www.byte-by-byte.com/choose-the-right-language-for-your-coding-interview/) +- [Изберете правилния език за вашето интервю по програмиране](http://www.byte-by-byte.com/choose-the-right-language-for-your-coding-interview/) [Вижте ресурси за специфични езици тук](programming-language-resources.md) @@ -374,11 +374,11 @@ pобхождам графи. Ако трябваше да напиша сорт Изборът е ваш: -- Goodrich, Tamassia, and Mount - - [Data Structures and Algorithms in C++, 2nd Edition](https://www.amazon.com/Data-Structures-Algorithms-Michael-Goodrich/dp/0470383275) -- Sedgewick and Wayne - - [Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching](https://www.amazon.com/Algorithms-Parts-1-4-Fundamentals-Structure/dp/0201350882/) - - [Algorithms in C++ Part 5: Graph Algorithms](https://www.amazon.com/Algorithms-Part-Graph-3rd-Pt-5/dp/0201361183/) +- Goodrich, Tamassia, and Mount + - [Data Structures and Algorithms in C++, 2nd Edition](https://www.amazon.com/Data-Structures-Algorithms-Michael-Goodrich/dp/0470383275) +- Sedgewick and Wayne + - [Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching](https://www.amazon.com/Algorithms-Parts-1-4-Fundamentals-Structure/dp/0201350882/) + - [Algorithms in C++ Part 5: Graph Algorithms](https://www.amazon.com/Algorithms-Part-Graph-3rd-Pt-5/dp/0201361183/) ## Книги за подготовка за интервю @@ -386,12 +386,12 @@ pобхождам графи. Ако трябваше да напиша сорт Купих тези двете, дадоха ми предостатъчно упражнение. -- [Programming Interviews Exposed: Coding Your Way Through the Interview, 4th Edition](https://www.amazon.com/Programming-Interviews-Exposed-Through-Interview/dp/111941847X/) - - Отговори в C++ и Java - - Това е добра подготовка за "Cracking the Coding Interview" - - Не е прекалено сложна. Повечето проблеми са по-лесни от тези, които ще срещнете на интервю (от това, което аз съм прочел) -- [Cracking the Coding Interview, 6th Edition](http://www.amazon.com/Cracking-Coding-Interview-6th-Programming/dp/0984782850/) - - отговори в Java +- [Programming Interviews Exposed: Coding Your Way Through the Interview, 4th Edition](https://www.amazon.com/Programming-Interviews-Exposed-Through-Interview/dp/111941847X/) + - Отговори в C++ и Java + - Това е добра подготовка за "Cracking the Coding Interview" + - Не е прекалено сложна. Повечето проблеми са по-лесни от тези, които ще срещнете на интервю (от това, което аз съм прочел) +- [Cracking the Coding Interview, 6th Edition](http://www.amazon.com/Cracking-Coding-Interview-6th-Programming/dp/0984782850/) + - отговори в Java ### Ако имате изобилие от време: @@ -728,57 +728,55 @@ pобхождам графи. Ако трябваше да напиша сорт ## Дървета -- ### Дървета - бележки & основи +- ### Дървета - бележки & основи + - [ ] [Серия: Дървета (клип)](https://www.coursera.org/lecture/data-structures/trees-95qda) + - основна структура на дървото + - обхождане + - алгоритми за манипулиране + - [ ] [BFS(обхождане в ширина) and DFS(обхождане в дълбочина) (клип)](https://www.youtube.com/watch?v=uWL6FJhq5fM) + - бележки за BFS: + - level order (BFS, using queue) + - времева сложност O(n) + - пространствена сложност: в най-добрия случай: O(1), в най-лошия случай: O(n/2)=O(n) + - бележки за DFS: + - времева сложност: O(n) + - пространствена сложност: + в най-добрия случай: O(log n) - средна височина на дървото + в най-добрия случай: O(n) + - inorder (DFS: ляво, self, дясно) + - postorder (DFS: ляво, дясно, self) + - preorder (DFS: self, ляво, дясно) + - [ ] [[Review] Breadth-first search in 4 minutes (video)](https://youtu.be/HZ5YTanv5QE) + - [ ] [[Review] Depth-first search in 4 minutes (video)](https://youtu.be/Urx87-NMm6c) + - [ ] [[Review] Tree Traversal (playlist) in 11 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZO1JC2RgEi04nLy6D-rKk6b) - - [ ] [Серия: Дървета (клип)](https://www.coursera.org/lecture/data-structures/trees-95qda) - - основна структура на дървото - - обхождане - - алгоритми за манипулиране - - [ ] [BFS(обхождане в ширина) and DFS(обхождане в дълбочина) (клип)](https://www.youtube.com/watch?v=uWL6FJhq5fM) - - бележки за BFS: - - level order (BFS, using queue) - - времева сложност O(n) - - пространствена сложност: в най-добрия случай: O(1), в най-лошия случай: O(n/2)=O(n) - - бележки за DFS: - - времева сложност: O(n) - - пространствена сложност: - в най-добрия случай: O(log n) - средна височина на дървото - в най-добрия случай: O(n) - - inorder (DFS: ляво, self, дясно) - - postorder (DFS: ляво, дясно, self) - - preorder (DFS: self, ляво, дясно) - - [ ] [[Review] Breadth-first search in 4 minutes (video)](https://youtu.be/HZ5YTanv5QE) - - [ ] [[Review] Depth-first search in 4 minutes (video)](https://youtu.be/Urx87-NMm6c) - - [ ] [[Review] Tree Traversal (playlist) in 11 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZO1JC2RgEi04nLy6D-rKk6b) - -- ### Дървета за двоично търсене: BSTs - - - [ ] [Преговор над двоични дървета за търсене (клип)](https://www.youtube.com/watch?v=x6At0nzX92o&index=1&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6) - - [ ] [Въведение (клип)](https://www.coursera.org/learn/data-structures/lecture/E7cXP/introduction) - - [ ] [MIT (клип)](https://www.youtube.com/watch?v=9Jry5-82I68) - - C/C++: - - [ ] [Двоично дърво за търсене - имплементация в C/C++ (клип)](https://www.youtube.com/watch?v=COZK7NATh4k&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=28) - - [ ] [BST имплементация - memory allocation in stack and heap (клип)](https://www.youtube.com/watch?v=hWokyBoo0aI&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=29) - - [ ] [Намиране на мин. и макс. елемент в двоично дърво за търсенея (клип)](https://www.youtube.com/watch?v=Ut90klNN264&index=30&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P) - - [ ] [Намиране на височината на двоично дърво (клип)](https://www.youtube.com/watch?v=_pnqMz5nrRs&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=31) - - [ ] [Обхождане на двоично дърво - стратегии за обхождане по ширина и по дълбочина (клип)](https://www.youtube.com/watch?v=9RHO6jU--GU&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=32) - - [ ] [Двоично дърво: преминаване на порядъка на ниво (клип)](https://www.youtube.com/watch?v=86g8jAQug04&index=33&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P) - - [ ] [Обхождане на двоично дърво: Preorder, Inorder, Postorder (клип)](https://www.youtube.com/watch?v=gm8DUJJhmY4&index=34&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P) - - [ ] [Проверка дали двоично дърво е двоично дърво за търсене (клип)](https://www.youtube.com/watch?v=yEwSGhSsT0U&index=35&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P) - - [ ] [Изтриване на възел от двоично дърво за търсене (клип)](https://www.youtube.com/watch?v=gcULXE7ViZw&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=36) - - [ ] [Редовен наследник в двоично дърво (клип)](https://www.youtube.com/watch?v=5cPbNCrdotA&index=37&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P) - - [ ] Имплементирайте: - - [ ] insert // вкарване на стойност в дървото - - [ ] get_node_count // вземане на бройката на запазените стойности - - [ ] print_values // принтира стойностите в дървото от най-малкия до най-големия - - [ ] delete_tree - - [ ] is_in_tree // връща true ако дадената стойност съществува в дървото - - [ ] get_height // returns the height in nodes (single node's height is 1) - - [ ] get_min // връща най-малката стойност, съхранявана в дървото - - [ ] get_max // връща най-голямата стойност, съхранявана в дървото - - [ ] is_binary_search_tree - - [ ] delete_value - - [ ] get_successor // връща следващата най-голяма стойност след дадената, -1 ако такава не съществува +- ### Дървета за двоично търсене: BSTs + - [ ] [Преговор над двоични дървета за търсене (клип)](https://www.youtube.com/watch?v=x6At0nzX92o&index=1&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6) + - [ ] [Въведение (клип)](https://www.coursera.org/learn/data-structures/lecture/E7cXP/introduction) + - [ ] [MIT (клип)](https://www.youtube.com/watch?v=9Jry5-82I68) + - C/C++: + - [ ] [Двоично дърво за търсене - имплементация в C/C++ (клип)](https://www.youtube.com/watch?v=COZK7NATh4k&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=28) + - [ ] [BST имплементация - memory allocation in stack and heap (клип)](https://www.youtube.com/watch?v=hWokyBoo0aI&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=29) + - [ ] [Намиране на мин. и макс. елемент в двоично дърво за търсенея (клип)](https://www.youtube.com/watch?v=Ut90klNN264&index=30&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P) + - [ ] [Намиране на височината на двоично дърво (клип)](https://www.youtube.com/watch?v=_pnqMz5nrRs&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=31) + - [ ] [Обхождане на двоично дърво - стратегии за обхождане по ширина и по дълбочина (клип)](https://www.youtube.com/watch?v=9RHO6jU--GU&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=32) + - [ ] [Двоично дърво: преминаване на порядъка на ниво (клип)](https://www.youtube.com/watch?v=86g8jAQug04&index=33&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P) + - [ ] [Обхождане на двоично дърво: Preorder, Inorder, Postorder (клип)](https://www.youtube.com/watch?v=gm8DUJJhmY4&index=34&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P) + - [ ] [Проверка дали двоично дърво е двоично дърво за търсене (клип)](https://www.youtube.com/watch?v=yEwSGhSsT0U&index=35&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P) + - [ ] [Изтриване на възел от двоично дърво за търсене (клип)](https://www.youtube.com/watch?v=gcULXE7ViZw&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=36) + - [ ] [Редовен наследник в двоично дърво (клип)](https://www.youtube.com/watch?v=5cPbNCrdotA&index=37&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P) + - [ ] Имплементирайте: + - [ ] insert // вкарване на стойност в дървото + - [ ] get_node_count // вземане на бройката на запазените стойности + - [ ] print_values // принтира стойностите в дървото от най-малкия до най-големия + - [ ] delete_tree + - [ ] is_in_tree // връща true ако дадената стойност съществува в дървото + - [ ] get_height // returns the height in nodes (single node's height is 1) + - [ ] get_min // връща най-малката стойност, съхранявана в дървото + - [ ] get_max // връща най-голямата стойност, съхранявана в дървото + - [ ] is_binary_search_tree + - [ ] delete_value + - [ ] get_successor // връща следващата най-голяма стойност след дадената, -1 ако такава не съществува - ### Heap / Priority Queue / Binary Heap - визуализира се като дърво, но обикновенно е линейна структура (масив, свързан списък) From acc12e09a09c132aa138858731bf9aebb2ca2efb Mon Sep 17 00:00:00 2001 From: Michael Sambol Date: Sat, 6 Jan 2024 12:08:41 -0600 Subject: [PATCH 3/4] Update video count --- README.md | 2 +- translations/README-af.md | 2 +- translations/README-ar.md | 2 +- translations/README-bg.md | 2 +- translations/README-bn.md | 2 +- translations/README-cn.md | 2 +- translations/README-de.md | 2 +- translations/README-es.md | 2 +- translations/README-fa.md | 2 +- translations/README-fr.md | 2 +- translations/README-he.md | 2 +- translations/README-hi.md | 2 +- translations/README-id.md | 2 +- translations/README-it.md | 2 +- translations/README-ja.md | 2 +- translations/README-kh.md | 2 +- translations/README-ko.md | 2 +- translations/README-pl.md | 2 +- translations/README-ptbr.md | 2 +- translations/README-ru.md | 2 +- translations/README-th.md | 2 +- translations/README-tr.md | 2 +- translations/README-tw.md | 2 +- translations/README-uk.md | 2 +- translations/README-ur.md | 2 +- translations/README-uz.md | 2 +- translations/README-vi.md | 2 +- 27 files changed, 27 insertions(+), 27 deletions(-) diff --git a/README.md b/README.md index 6c53a3d..a2d9eed 100644 --- a/README.md +++ b/README.md @@ -1199,7 +1199,7 @@ Graphs can be used to represent many problems in computer science, so this secti - [ ] Series of 2-3 minutes short subject videos (23 videos) - [Videos](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (46 videos): +- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (48 videos): - [Videos](https://www.youtube.com/@MichaelSambol) - [Code Examples](https://github.com/msambol/dsa) - [ ] [Sedgewick Videos - Algorithms I](https://www.coursera.org/learn/algorithms-part1) diff --git a/translations/README-af.md b/translations/README-af.md index 804154d..a9c8f66 100644 --- a/translations/README-af.md +++ b/translations/README-af.md @@ -1201,7 +1201,7 @@ Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoor - [ ] Reeks van 2-3 minute kort onderwerp videos (23 videos) - [Videos](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -- [ ] Reeks van 2-5 minute kort onderwerp videos - Michael Sambol (46 videos): +- [ ] Reeks van 2-5 minute kort onderwerp videos - Michael Sambol (48 videos): - [Videos](https://www.youtube.com/@MichaelSambol) - [Code Examples](https://github.com/msambol/dsa) - [ ] [Sedgewick Videos - Algorithms I](https://www.coursera.org/learn/algorithms-part1) diff --git a/translations/README-ar.md b/translations/README-ar.md index a7e3c69..8012d11 100644 --- a/translations/README-ar.md +++ b/translations/README-ar.md @@ -1277,7 +1277,7 @@ Graphs can be used to represent many problems in computer science, so this secti - [ ] Series of 2-3 minutes short subject videos (23 videos) - [Videos](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (46 videos): +- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (48 videos): - [Videos](https://www.youtube.com/@MichaelSambol) - [Code Examples](https://github.com/msambol/dsa) - [ ] [Sedgewick Videos - Algorithms I](https://www.coursera.org/learn/algorithms-part1) diff --git a/translations/README-bg.md b/translations/README-bg.md index 5c32b86..708fc92 100644 --- a/translations/README-bg.md +++ b/translations/README-bg.md @@ -1213,7 +1213,7 @@ pобхождам графи. Ако трябваше да напиша сорт - [ ] Серия от 2-3 минутни кратки клипове по различни теми (23 клипа) - [Клипове](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -- [ ] Серия от 2-5 минутни кратки клипове по различни теми - Michael Sambol (46 клипа): +- [ ] Серия от 2-5 минутни кратки клипове по различни теми - Michael Sambol (48 клипа): - [Клипове](https://www.youtube.com/@MichaelSambol) - [Code Examples](https://github.com/msambol/dsa) - [ ] [Sedgewick Videos - Алгоритми I](https://www.coursera.org/learn/algorithms-part1) diff --git a/translations/README-bn.md b/translations/README-bn.md index 9d4ef81..28d3553 100644 --- a/translations/README-bn.md +++ b/translations/README-bn.md @@ -1490,7 +1490,7 @@ https://github.com/jwasham/coding-interview-university - শর্ট সাবজেক্টের ২-৩ মিনিটের সিরিজ (২৩ টি ভিডিও) -[ভিডিও] (https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -- 2-5 মিনিটের সংক্ষিপ্ত বিষয় ভিডিওর সিরিজ-মাইকেল সাম্বোল - Michael Sambol (46 টি ভিডিও): +- 2-5 মিনিটের সংক্ষিপ্ত বিষয় ভিডিওর সিরিজ-মাইকেল সাম্বোল - Michael Sambol (48 টি ভিডিও): - [ভিডিও](https://www.youtube.com/@MichaelSambol) - [Code Examples](https://github.com/msambol/dsa) - [সেজেজউইক ভিডিও-অ্যালগোরিদম আই] (https://www.coursera.org/learn/algorithms-part1) diff --git a/translations/README-cn.md b/translations/README-cn.md index 2e6beed..e95106a 100644 --- a/translations/README-cn.md +++ b/translations/README-cn.md @@ -1154,7 +1154,7 @@ - [ ] 一系列2-3分钟的短主题视频（共23个视频） - [视频链接](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -- [ ] 一系列2-5分钟的短主题视频 - Michael Sambol（共46个视频）： +- [ ] 一系列2-5分钟的短主题视频 - Michael Sambol（共48个视频）： - [视频链接](https://www.youtube.com/@MichaelSambol) - [代码示例](https://github.com/msambol/dsa) - [ ] [Sedgewick的算法课程视频 - 算法I](https://www.coursera.org/learn/algorithms-part1) diff --git a/translations/README-de.md b/translations/README-de.md index 937a4b2..6cfdc56 100644 --- a/translations/README-de.md +++ b/translations/README-de.md @@ -1367,7 +1367,7 @@ Graphen können genutzt werden, um damit viele verschiedene Probleme in der Info - [ ] Reihe mit kurzen 2-3 Minuten Videos (23 videos) - [Videos](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -- [ ] Reihe mit kurzen 2-5 Minuten Videos - Michael Sambol (46 videos): +- [ ] Reihe mit kurzen 2-5 Minuten Videos - Michael Sambol (48 videos): - [Videos](https://www.youtube.com/@MichaelSambol) - [Code Examples](https://github.com/msambol/dsa) - [ ] [Sedgewick Videos - Algorithms I](https://www.coursera.org/learn/algorithms-part1) diff --git a/translations/README-es.md b/translations/README-es.md index 830d1ac..b1bbafd 100644 --- a/translations/README-es.md +++ b/translations/README-es.md @@ -1302,7 +1302,7 @@ Es bueno si quieres repasar frecuentemente. - [ ] Series de videos cortos sobre temas de 2-3 minutos (23 videos) - [Videos](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -- [ ] Series de videos cortos sobre temas de 2-5 minutos - Michael Sambol (46 videos): +- [ ] Series de videos cortos sobre temas de 2-5 minutos - Michael Sambol (48 videos): - [Videos](https://www.youtube.com/@MichaelSambol) - [Code Examples](https://github.com/msambol/dsa) diff --git a/translations/README-fa.md b/translations/README-fa.md index 7cb3895..866f91c 100644 --- a/translations/README-fa.md +++ b/translations/README-fa.md @@ -1181,7 +1181,7 @@ Choose one: - [ ] Series of 2-3 minutes short subject videos (23 videos) - [Videos](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (46 videos): +- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (48 videos): - [Videos](https://www.youtube.com/@MichaelSambol) - [Code Examples](https://github.com/msambol/dsa) - [ ] [Sedgewick Videos - Algorithms I](https://www.coursera.org/learn/algorithms-part1) diff --git a/translations/README-fr.md b/translations/README-fr.md index 85902de..2a5e2e9 100644 --- a/translations/README-fr.md +++ b/translations/README-fr.md @@ -1275,7 +1275,7 @@ You'll get more graph practice in Skiena's book (see Books section below) and th - [ ] Series of 2-3 minutes short subject videos (23 videos) - [Videos](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (46 videos): +- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (48 videos): - [Videos](https://www.youtube.com/@MichaelSambol) - [Code Examples](https://github.com/msambol/dsa) diff --git a/translations/README-he.md b/translations/README-he.md index 43ded72..f0d632c 100644 --- a/translations/README-he.md +++ b/translations/README-he.md @@ -1286,7 +1286,7 @@ You'll get more graph practice in Skiena's book (see Books section below) and th - [ ] Series of 2-3 minutes short subject videos (23 videos) - [סרטונים](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (46 videos): +- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (48 videos): - [סרטונים](https://www.youtube.com/@MichaelSambol) - [Code Examples](https://github.com/msambol/dsa) diff --git a/translations/README-hi.md b/translations/README-hi.md index 520d340..a2de5e8 100644 --- a/translations/README-hi.md +++ b/translations/README-hi.md @@ -1202,7 +1202,7 @@ Anki प्रारूप में मेरा फ्लैशकार्ड - [ ] 2-3 मिनट के लघु विषय वीडियो की श्रृंखला (23 वीडियो) - [वीडियो](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -- [ ] 2-5 मिनट के लघु विषय वीडियो की श्रृंखला - Michael Sambol (46 वीडियो): +- [ ] 2-5 मिनट के लघु विषय वीडियो की श्रृंखला - Michael Sambol (48 वीडियो): - [वीडियो](https://www.youtube.com/@MichaelSambol) - [Code Examples](https://github.com/msambol/dsa) - [ ] [सेजविक वीडियो - एल्गोरिदम I](https://www.coursera.org/learn/algorithms-part1) diff --git a/translations/README-id.md b/translations/README-id.md index 51e1b09..20badf9 100644 --- a/translations/README-id.md +++ b/translations/README-id.md @@ -1200,7 +1200,7 @@ Graf (Graphs) dapat digunakan untuk merepresentasikan banyak masalah dalam ilmu - [ ] Seri video subjek pendek berdurasi 2-3 menit (23 video) - [Video](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -- [ ] Seri video subjek pendek berdurasi 2-5 menit - Michael Sambol (46 video): +- [ ] Seri video subjek pendek berdurasi 2-5 menit - Michael Sambol (48 video): - [Video](https://www.youtube.com/@MichaelSambol) - [Code Examples](https://github.com/msambol/dsa) - [ ] [Video Sedgewick - Algoritma I](https://www.coursera.org/learn/algorithms-part1) diff --git a/translations/README-it.md b/translations/README-it.md index 14a87f3..73bfe42 100644 --- a/translations/README-it.md +++ b/translations/README-it.md @@ -1208,7 +1208,7 @@ I grafi possono essere usati per rappresentare molti problemi in informatica, pe - [ ] Series of 2-3 minutes short subject video (23 video) - [video](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -- [ ] Series of 2-5 minutes short subject video - Michael Sambol (46 video): +- [ ] Series of 2-5 minutes short subject video - Michael Sambol (48 video): - [video](https://www.youtube.com/@MichaelSambol) - [code examples](https://github.com/msambol/dsa) - [ ] [Sedgewick video - Algorithms I](https://www.coursera.org/learn/algorithms-part1) diff --git a/translations/README-ja.md b/translations/README-ja.md index ef2b0fa..7f01ffd 100644 --- a/translations/README-ja.md +++ b/translations/README-ja.md @@ -1110,7 +1110,7 @@ Anki 形式のフラッシュカード データベース: https://ankiweb.net/s - [ ] 2 ～ 3 分の短い主題ビデオ シリーズ (23 動画) - [ビデオ](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -- [ ] 2 ～ 5 分のシリーズ短い主題のビデオ - Michael Sambol (動画 46 件): +- [ ] 2 ～ 5 分のシリーズ短い主題のビデオ - Michael Sambol (動画 48 件): - [ビデオ](https://www.youtube.com/@MichaelSambol) - [コード例](https://github.com/msambol/dsa) - [ ] [セッジウィック ビデオ - アルゴリズム I](https://www.coursera.org/learn/algorithms-part1) diff --git a/translations/README-kh.md b/translations/README-kh.md index e6bca72..2b05dda 100644 --- a/translations/README-kh.md +++ b/translations/README-kh.md @@ -1266,7 +1266,7 @@ Graphs អាចត្រូវបានប្រើដើម្បីបង្ - [ ] Series of 2-3 minutes short subject videos (23 វីដេអូ) - [វីដេអូ](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (46 វីដេអូ): +- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (48 វីដេអូ): - [វីដេអូ](https://www.youtube.com/@MichaelSambol) - [Code Examples](https://github.com/msambol/dsa) - [ ] [វីដេអូ Sedgewick - Algorithms I](https://www.coursera.org/learn/algorithms-part1) diff --git a/translations/README-ko.md b/translations/README-ko.md index 4d8a537..66c2089 100644 --- a/translations/README-ko.md +++ b/translations/README-ko.md @@ -1285,7 +1285,7 @@ Skiena의 책(아래의 책 섹션 참조)과 인터뷰 책에서 더 많은 그 - [ ] 2-3분 분량의 주제별 짧은 영상 시리즈 (23 videos) - [Videos](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -- [ ] 2-5분 분량의 주제별 짧은 영상 시리즈 - Michael Sambol (46 videos): +- [ ] 2-5분 분량의 주제별 짧은 영상 시리즈 - Michael Sambol (48 videos): - [Videos](https://www.youtube.com/@MichaelSambol) - [Code Examples](https://github.com/msambol/dsa) - [ ] [Sedgewick Videos - Algorithms I](https://www.coursera.org/learn/algorithms-part1) diff --git a/translations/README-pl.md b/translations/README-pl.md index 98295aa..3ed30ea 100644 --- a/translations/README-pl.md +++ b/translations/README-pl.md @@ -1239,7 +1239,7 @@ Trie to drzewo węzłów, które obsługuje operacje Znajdź i Wstaw [etc (...)] - [ ] Seria 2-3 minutowych, krótkich filmów tematycznych (23 wideo) - [Videos](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -- [ ] Seria 2–5 minutowych, krótkich filmów tematycznych - Michael Sambol (46 wideo): +- [ ] Seria 2–5 minutowych, krótkich filmów tematycznych - Michael Sambol (48 wideo): - [Wideo](https://www.youtube.com/@MichaelSambol) - [Code Examples](https://github.com/msambol/dsa) - [ ] [Sedgewick Videos - Algorytmy I](https://www.coursera.org/learn/algorithms-part1) diff --git a/translations/README-ptbr.md b/translations/README-ptbr.md index 69a3947..1408609 100644 --- a/translations/README-ptbr.md +++ b/translations/README-ptbr.md @@ -1308,7 +1308,7 @@ Você ganhará mais prática com grafos no livro do Skiena (veja a seção de li - [ ] Séries de vídeos curtos (2 - 3 minutos) sobre o assunto (23 vídeos) - [Vídeos](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -- [ ] Séries de vídeos curtos (2 - 5 minutos) sobre o assunto - Michael Sambol (46 vídeos): +- [ ] Séries de vídeos curtos (2 - 5 minutos) sobre o assunto - Michael Sambol (48 vídeos): - [Vídeos](https://www.youtube.com/@MichaelSambol) - [Code Examples](https://github.com/msambol/dsa) diff --git a/translations/README-ru.md b/translations/README-ru.md index 1fb7e91..3bf2126 100644 --- a/translations/README-ru.md +++ b/translations/README-ru.md @@ -1288,7 +1288,7 @@ Google не возьмёт тебя на работу. - [ ] Серия 2-3 минутных короткие видео по темам (23 видео) - [Видео](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -- [ ] Серия коротких 2-5 минутных видео - Michael Sambol (46 видео): +- [ ] Серия коротких 2-5 минутных видео - Michael Sambol (48 видео): - [Видео](https://www.youtube.com/@MichaelSambol) - [Code Examples](https://github.com/msambol/dsa) diff --git a/translations/README-th.md b/translations/README-th.md index 3c507b3..bc75d66 100644 --- a/translations/README-th.md +++ b/translations/README-th.md @@ -1282,7 +1282,7 @@ You'll get more graph practice in Skiena's book (see Books section below) and th - [ ] Series of 2-3 minutes short subject videos (23 videos) - [Videos](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (46 videos): +- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (48 videos): - [Videos](https://www.youtube.com/@MichaelSambol) - [Code Examples](https://github.com/msambol/dsa) diff --git a/translations/README-tr.md b/translations/README-tr.md index 81f9c9f..0d1bf43 100644 --- a/translations/README-tr.md +++ b/translations/README-tr.md @@ -1254,7 +1254,7 @@ Graflar, bilgisayar bilimlerinde birçok sorunu temsil etmek için kullanılabil - [ ] Series of 2-3 minutes short subject videos (23 videos) - [Videos](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (46 videos): +- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (48 videos): - [Videos](https://www.youtube.com/@MichaelSambol) - [Code Examples](https://github.com/msambol/dsa) - [ ] [Sedgewick Videos - Algorithms I](https://www.coursera.org/learn/algorithms-part1) diff --git a/translations/README-tw.md b/translations/README-tw.md index 3508158..f7bcf7e 100644 --- a/translations/README-tw.md +++ b/translations/README-tw.md @@ -1232,7 +1232,7 @@ - [ ] 2-3分鐘快速複習影片系列(23個影片) - [影片](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -- [ ] 2-5分鐘快速複習影片系列-Michael Sambol (46個影片) +- [ ] 2-5分鐘快速複習影片系列-Michael Sambol (48個影片) - [影片](https://www.youtube.com/@MichaelSambol) - [Code Examples](https://github.com/msambol/dsa) - [ ] [Sedgewick Videos - Algorithms I](https://www.coursera.org/learn/algorithms-part1) diff --git a/translations/README-uk.md b/translations/README-uk.md index 00c9464..72be106 100644 --- a/translations/README-uk.md +++ b/translations/README-uk.md @@ -1332,7 +1332,7 @@ You'll get more graph practice in Skiena's book (see Books section below) and th - [ ] Series of 2-3 minutes short subject videos (23 videos) - [Videos](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (46 videos): +- [ ] Series of 2-5 minutes short subject videos - Michael Sambol (48 videos): - [Videos](https://www.youtube.com/@MichaelSambol) - [Code Examples](https://github.com/msambol/dsa) diff --git a/translations/README-ur.md b/translations/README-ur.md index 702cb98..2599309 100644 --- a/translations/README-ur.md +++ b/translations/README-ur.md @@ -1183,7 +1183,7 @@ If you need more detail on this subject, see "Sorting" section in [Additional De - [ ] 2-3 منٹ کی مختصر سبجیکٹ ویڈیوز کی سیریز (23 ویڈیوز) - [ویڈیوز](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -- [ ] 2-5 منٹ کی مختصر موضوع ویڈیوز کی سیریز - مائیکل سمبول (46 ویڈیوز): +- [ ] 2-5 منٹ کی مختصر موضوع ویڈیوز کی سیریز - مائیکل سمبول (48 ویڈیوز): - [ویڈیوز](https://www.youtube.com/@MichaelSambol) - [Code Examples](https://github.com/msambol/dsa) - [ ] [Sedgewick Videos - Algorithms I](https://www.coursera.org/learn/algorithms-part1) diff --git a/translations/README-uz.md b/translations/README-uz.md index d4e4426..7b73aa5 100644 --- a/translations/README-uz.md +++ b/translations/README-uz.md @@ -1243,7 +1243,7 @@ Computer science da graflar bir talay masalalarni tasvirlashda ishlatiladi. Shun - [ ] 2-3 minutlik qisqa mavzuga oid videolar seriyasi (23 video) - [Videos](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -- [ ] 2-5 minutlik qisqa mavzuga oid videolar seriyasi - Michael Sambol (46 video): +- [ ] 2-5 minutlik qisqa mavzuga oid videolar seriyasi - Michael Sambol (48 video): - [Videos](https://www.youtube.com/@MichaelSambol) - [Code Examples](https://github.com/msambol/dsa) - [ ] [Sedgewick Videos - Algorithms I](https://www.coursera.org/learn/algorithms-part1) diff --git a/translations/README-vi.md b/translations/README-vi.md index 4662c9e..a156ead 100644 --- a/translations/README-vi.md +++ b/translations/README-vi.md @@ -1244,7 +1244,7 @@ Bạn sẽ biết thêm nhiều ứng dụng của đồ thị trong sách của - [ ] Các video ngắn 2-3 phút (23 video) - [Videos](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22) -- [ ] Các video ngắn 2-5 phút - Michael Sambol (46 video) +- [ ] Các video ngắn 2-5 phút - Michael Sambol (48 video) - [Videos](https://www.youtube.com/@MichaelSambol) - [Code Examples](https://github.com/msambol/dsa) - [ ] [Sedgewick Videos - Algorithms I](https://www.coursera.org/learn/algorithms-part1) From 681c4b73669069b13e63d06a1a0f3d41971ce3e7 Mon Sep 17 00:00:00 2001 From: Michael Sambol Date: Sat, 6 Jan 2024 12:14:40 -0600 Subject: [PATCH 4/4] Update algo analysis playlist --- README.md | 2 +- translations/README-af.md | 2 +- translations/README-ar.md | 2 +- translations/README-bg.md | 2 +- translations/README-bn.md | 2 +- translations/README-cn.md | 2 +- translations/README-de.md | 2 +- translations/README-el.md | 2 +- translations/README-es.md | 2 +- translations/README-fa.md | 2 +- translations/README-fr.md | 2 +- translations/README-he.md | 2 +- translations/README-hi.md | 2 +- translations/README-id.md | 2 +- translations/README-it.md | 2 +- translations/README-ja.md | 2 +- translations/README-kh.md | 2 +- translations/README-ko.md | 2 +- translations/README-pl.md | 2 +- translations/README-ptbr.md | 2 +- translations/README-ru.md | 2 +- translations/README-th.md | 2 +- translations/README-tr.md | 2 +- translations/README-tw.md | 2 +- translations/README-uk.md | 2 +- translations/README-ur.md | 2 +- translations/README-uz.md | 2 +- translations/README-vi.md | 2 +- 28 files changed, 28 insertions(+), 28 deletions(-) diff --git a/README.md b/README.md index a2d9eed..60b1445 100644 --- a/README.md +++ b/README.md @@ -569,7 +569,7 @@ But don't forget to do coding problems from above while you learn! - [Computational Complexity: Section 1](https://www.topcoder.com/thrive/articles/Computational%20Complexity%20part%20one) - [Computational Complexity: Section 2](https://www.topcoder.com/thrive/articles/Computational%20Complexity%20part%20two) - [ ] [Cheat sheet](http://bigocheatsheet.com/) -- [ ] [[Review] Big-O notation in 5 minutes (video)](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) Well, that's about enough of that. diff --git a/translations/README-af.md b/translations/README-af.md index a9c8f66..cab069d 100644 --- a/translations/README-af.md +++ b/translations/README-af.md @@ -571,7 +571,7 @@ Maar moet nie vergeet om kode probleme op te los terwyl jy leer nie! - [Computational Complexity: Section 1](https://www.topcoder.com/thrive/articles/Computational%20Complexity%20part%20one) - [Computational Complexity: Section 2](https://www.topcoder.com/thrive/articles/Computational%20Complexity%20part%20two) - [ ] [Cheat sheet](http://bigocheatsheet.com/) -- [ ] [[Review] Big-O notation in 5 minutes (video)](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) Well, dis genoeg van daardie. diff --git a/translations/README-ar.md b/translations/README-ar.md index 8012d11..6aaa53a 100644 --- a/translations/README-ar.md +++ b/translations/README-ar.md @@ -525,7 +525,7 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input - [Computational Complexity: Section 1](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-1/) - [Computational Complexity: Section 2](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-2/) - [ ] [Cheat sheet](http://bigocheatsheet.com/) -- [ ] [[Review] Big-O notation in 5 minutes (video)](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) ## Data Structures diff --git a/translations/README-bg.md b/translations/README-bg.md index 708fc92..241d25b 100644 --- a/translations/README-bg.md +++ b/translations/README-bg.md @@ -565,7 +565,7 @@ pобхождам графи. Ако трябваше да напиша сорт - [Computational Complexity: Section 1](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-1/) - [Computational Complexity: Section 2](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-2/) - [ ] [Пищови](http://bigocheatsheet.com/) -- [ ] [[Review] Big-O notation in 5 minutes (video)](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) Е, това е достатъчно за тази тема. diff --git a/translations/README-bn.md b/translations/README-bn.md index 28d3553..fea6714 100644 --- a/translations/README-bn.md +++ b/translations/README-bn.md @@ -673,7 +673,7 @@ https://github.com/jwasham/coding-interview-university - [Computational Complexity: Section 1](https://www.topcoder.com/thrive/articles/Computational%20Complexity%20part%20one) - [Computational Complexity: Section 2](https://www.topcoder.com/thrive/articles/Computational%20Complexity%20part%20two) - [ ] [Cheat sheet](http://bigocheatsheet.com/) -- [ ] [[Review] Big-O notation in 5 minutes (video)](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) ওয়েল, যে যথেষ্ট যে সম্পর্কে. diff --git a/translations/README-cn.md b/translations/README-cn.md index e95106a..ccb3e86 100644 --- a/translations/README-cn.md +++ b/translations/README-cn.md @@ -525,7 +525,7 @@ - [计算复杂性：第1部分](https://www.topcoder.com/thrive/articles/Computational%20Complexity%20part%20one) - [计算复杂性：第2部分](https://www.topcoder.com/thrive/articles/Computational%20Complexity%20part%20two) - [ ] [速查表](http://bigocheatsheet.com/) -- [ ] [[复习] 5分钟内了解大O符号（视频）](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) 好吧，差不多就到这里了。 diff --git a/translations/README-de.md b/translations/README-de.md index 6cfdc56..e57346e 100644 --- a/translations/README-de.md +++ b/translations/README-de.md @@ -549,7 +549,7 @@ Schreib Code auf einer Tafel oder auf Papier, aber nicht am Computer. Teste mit - [Computational Complexity: Section 1](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-1/) - [Computational Complexity: Section 2](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-2/) - [ ] [Spickzettel](http://bigocheatsheet.com/) -- [ ] [[Review] Big-O notation in 5 minutes (video)](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) diff --git a/translations/README-el.md b/translations/README-el.md index a3057e1..c679fd7 100644 --- a/translations/README-el.md +++ b/translations/README-el.md @@ -456,7 +456,7 @@ - [Computational Complexity: Section 1](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-1/) - [Computational Complexity: Section 2](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-2/) - [ ] [Cheat sheet](http://bigocheatsheet.com/) -- [ ] [[Review] Big-O notation in 5 minutes (video)](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) Εάν μερικές διαλέξεις είναι πολύ μαθηματικές, μπορείς να μεταβείς προς τα κάτω και να παρακολουθήσεις μερικά βίντεο σχετικά με τα διακριτά μαθηματικά για να πάρεις όλες τις γνώσεις που απαιτούνται. diff --git a/translations/README-es.md b/translations/README-es.md index b1bbafd..995fce0 100644 --- a/translations/README-es.md +++ b/translations/README-es.md @@ -520,7 +520,7 @@ Escriba código en un pizarrón o en papel, pero no en la computadora. Pruebe co - [Computational Complexity: Section 1](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-1/) - [Computational Complexity: Section 2](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-2/) - [ ] [Cheat sheet](http://bigocheatsheet.com/) -- [ ] [[Review] Big-O notation in 5 minutes (video)](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) Si algunas de las lecturas son muy matemáticas, puede saltar a la parte inferior y ver las matemáticas discretas para tener el conocimiento base. diff --git a/translations/README-fa.md b/translations/README-fa.md index 866f91c..dfcaa1a 100644 --- a/translations/README-fa.md +++ b/translations/README-fa.md @@ -552,7 +552,7 @@ Choose one: - [Computational Complexity: Section 1](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-1/) - [Computational Complexity: Section 2](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-2/) - [ ] [Cheat sheet](http://bigocheatsheet.com/) -- [ ] [[Review] Big-O notation in 5 minutes (video)](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) بسیارخب، فکر کنم در همین حد کافی باشه. diff --git a/translations/README-fr.md b/translations/README-fr.md index 2a5e2e9..964d90b 100644 --- a/translations/README-fr.md +++ b/translations/README-fr.md @@ -560,7 +560,7 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input - [Computational Complexity: Section 1](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-1/) - [Computational Complexity: Section 2](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-2/) - [ ] [Cheat sheet](http://bigocheatsheet.com/) -- [ ] [[Review] Big-O notation in 5 minutes (video)](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) If some of the lectures are too mathy, you can jump down to the bottom and watch the discrete mathematics videos to get the background knowledge. diff --git a/translations/README-he.md b/translations/README-he.md index f0d632c..2b02e12 100644 --- a/translations/README-he.md +++ b/translations/README-he.md @@ -571,7 +571,7 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input - [Computational Complexity: Section 1](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-1/) - [Computational Complexity: Section 2](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-2/) - [ ] [Cheat sheet](http://bigocheatsheet.com/) -- [ ] [[Review] Big-O notation in 5 minutes (video)](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) If some of the lectures are too mathy, you can jump down to the bottom and diff --git a/translations/README-hi.md b/translations/README-hi.md index a2de5e8..531af59 100644 --- a/translations/README-hi.md +++ b/translations/README-hi.md @@ -579,7 +579,7 @@ Anki प्रारूप में मेरा फ्लैशकार्ड - [कम्प्यूटेशनल जटिलता: सेक्शन 1](https://www.topcoder.com/thrive/articles/Computational%20Complexity%20part%20one) - [कम्प्यूटेशनल जटिलता: धारा 2](https://www.topcoder.com/thrive/articles/Computational%20Complexity%20part%20two) - [ ] [चीट शीट] (http://bigocheatsheet.com/) -- [ ] [[Review] Big-O notation in 5 minutes (video)](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) खैर, बस इतना ही काफी है। diff --git a/translations/README-id.md b/translations/README-id.md index 20badf9..5c480e3 100644 --- a/translations/README-id.md +++ b/translations/README-id.md @@ -442,7 +442,7 @@ Menulis kode pada papan tulis atau kertas, bukan komputer. Uji dengan beberapa s - [Computational Complexity: Section 1](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-1/) - [Computational Complexity: Section 2](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-2/) - [ ] [Cheat sheet](http://bigocheatsheet.com/) -- [ ] [[Review] Big-O notation in 5 minutes (video)](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) ## Struktur Data diff --git a/translations/README-it.md b/translations/README-it.md index 73bfe42..d3c97f1 100644 --- a/translations/README-it.md +++ b/translations/README-it.md @@ -575,7 +575,7 @@ Ma non dimenticare di esercitarti con i problemi, anche durante lo studio! - [Complessità Computazionale: Sezione 1 (Articolo in Inglese)](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-1/) - [Complessità Computazionale: Sezione 2 (Articolo in Inglese)](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-2/) - [ ] [Cheat-Sheet](http://bigocheatsheet.com/) -- [ ] [[Review] Big-O notation in 5 minutes (video)](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) Bene, direi che può bastare. diff --git a/translations/README-ja.md b/translations/README-ja.md index 7f01ffd..e77a518 100644 --- a/translations/README-ja.md +++ b/translations/README-ja.md @@ -481,7 +481,7 @@ Anki 形式のフラッシュカード データベース: https://ankiweb.net/s - [計算の複雑さ: セクション 1](https://www.topcoder.com/thrive/articles/Computational%20Complexity%20part%20one) - [計算の複雑さ: セクション 2](https://www.topcoder.com/thrive/articles/Computational%20Complexity%20part%20two) - [ ] [チートシート](http://bigocheatsheet.com/) -- [ ] [【復習】5分でわかるBig-O記譜法（動画）](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) まあ、それだけで十分です。 diff --git a/translations/README-kh.md b/translations/README-kh.md index 2b05dda..2cf649e 100644 --- a/translations/README-kh.md +++ b/translations/README-kh.md @@ -496,7 +496,7 @@ Data Structure ទាំងអស់ដែលខ្ញុំធ្លាប់ - [ភាពស្មុគស្មាញនៃការគណនា៖ ផ្នែកទី ១](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-1/) - [ភាពស្មុគស្មាញនៃការគណនា៖ ផ្នែកទី ២](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-2/) - [ ] [សន្លឹកជំនួយ](http://bigocheatsheet.com/) -- [ ] [[Review] Big-O notation in 5 minutes (video)](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) --- diff --git a/translations/README-ko.md b/translations/README-ko.md index 66c2089..3329d42 100644 --- a/translations/README-ko.md +++ b/translations/README-ko.md @@ -531,7 +531,7 @@ Anki 형식의 내 요약집 데이터베이스: https://ankiweb.net/shared/info - [Computational Complexity: Section 1](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-1/) - [Computational Complexity: Section 2](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-2/) - [ ] [Cheat sheet](http://bigocheatsheet.com/) -- [ ] [[Review] Big-O notation in 5 minutes (video)](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) ## 자료구조 diff --git a/translations/README-pl.md b/translations/README-pl.md index 3ed30ea..c9a81d0 100644 --- a/translations/README-pl.md +++ b/translations/README-pl.md @@ -483,7 +483,7 @@ Napisz kod na tablicy lub papierze, a nie na komputerze. Testuj z niektórymi pr - [Computational Complexity: Section 1](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-1/) - [Computational Complexity: Section 2](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-2/) - [ ] [Ściągawka](http://bigocheatsheet.com/) -- [ ] [[Review] Big-O notation in 5 minutes (video)](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) ## Struktury danych diff --git a/translations/README-ptbr.md b/translations/README-ptbr.md index 1408609..b5cda2a 100644 --- a/translations/README-ptbr.md +++ b/translations/README-ptbr.md @@ -512,7 +512,7 @@ Escreva código em um quadro branco ou papel, não em um computador. Teste com u - [Computational Complexity: Section 1](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-1/) (Complexidade Computacional: Seção 1) - [Computational Complexity: Section 2](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-2/) (Complexidade Computacional: Seção 2) - [ ] [Cheat sheet](http://bigocheatsheet.com/) (Folha de Consultas) -- [ ] [[Review] Big-O notation in 5 minutes (video)](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) Se alguma das aulas forem muito "matemáticas", você pode pular para o final e diff --git a/translations/README-ru.md b/translations/README-ru.md index 3bf2126..0b6f308 100644 --- a/translations/README-ru.md +++ b/translations/README-ru.md @@ -565,7 +565,7 @@ Google не возьмёт тебя на работу. - [Вычислительная сложность: Часть 1](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-1/) - [Вычислительная сложность: Часть 2](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-2/) - [ ] [Шпаргалка](http://bigocheatsheet.com/) -- [ ] [[Review] Big-O notation in 5 minutes (video)](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) Если в некоторых лекциях слишком много математики, вы можете ниже найти и посмотреть лекции по дискретной математике для получения базовых знаний. diff --git a/translations/README-th.md b/translations/README-th.md index bc75d66..9b6379f 100644 --- a/translations/README-th.md +++ b/translations/README-th.md @@ -492,7 +492,7 @@ There are a lot of distractions that can take up valuable time. Focus and concen - [Computational Complexity: Section 1](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-1/) - [Computational Complexity: Section 2](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-2/) - [ ] [Cheat sheet](http://bigocheatsheet.com/) -- [ ] [[Review] Big-O notation in 5 minutes (video)](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) If some of the lectures are too mathy, you can jump down to the bottom and diff --git a/translations/README-tr.md b/translations/README-tr.md index 0d1bf43..706b52b 100644 --- a/translations/README-tr.md +++ b/translations/README-tr.md @@ -510,7 +510,7 @@ Kodları beyaz tahtaya ya da kağıda yazın, bilgisayara değil. Örnek girdile - [Computational Complexity: Section 1](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-1/) - [Computational Complexity: Section 2](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-2/) - [ ] [Cheat sheet](http://bigocheatsheet.com/) -- [ ] [[Review] Big-O notation in 5 minutes (video)](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) ## Veri Yapıları diff --git a/translations/README-tw.md b/translations/README-tw.md index f7bcf7e..7022250 100644 --- a/translations/README-tw.md +++ b/translations/README-tw.md @@ -482,7 +482,7 @@ - [Computational Complexity: Section 1](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-1/) - [Computational Complexity: Section 2](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-2/) - [ ] [Cheat sheet](http://bigocheatsheet.com/) -- [ ] [[Review] Big-O notation in 5 minutes (video)](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) ## 資料結構 - ### 陣列 diff --git a/translations/README-uk.md b/translations/README-uk.md index 72be106..d7fc004 100644 --- a/translations/README-uk.md +++ b/translations/README-uk.md @@ -539,7 +539,7 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input - [Computational Complexity: Section 1](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-1/) - [Computational Complexity: Section 2](https://www.topcoder.com/community/data-science/data-science-tutorials/computational-complexity-section-2/) - [ ] [Cheat sheet](http://bigocheatsheet.com/) -- [ ] [[Review] Big-O notation in 5 minutes (video)](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) If some of the lectures are too mathy, you can jump down to the bottom and diff --git a/translations/README-ur.md b/translations/README-ur.md index 2599309..8ed5285 100644 --- a/translations/README-ur.md +++ b/translations/README-ur.md @@ -555,7 +555,7 @@ - [Computational Complexity: Section 1](https://www.topcoder.com/thrive/articles/Computational%20Complexity%20part%20one) - [Computational Complexity: Section 2](https://www.topcoder.com/thrive/articles/Computational%20Complexity%20part%20two) - [ ] [Cheat sheet](http://bigocheatsheet.com/) -- [ ] [[Review] Big-O notation in 5 minutes (video)](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) یہ اس کے بارے میں کافی ہے. diff --git a/translations/README-uz.md b/translations/README-uz.md index 7b73aa5..ed9e722 100644 --- a/translations/README-uz.md +++ b/translations/README-uz.md @@ -486,7 +486,7 @@ Birinchi kodizni doskada yoki qog'ozda yozing, kompyuterda emas. Og'zaki test qi - [Computational Complexity: Section 1](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-1/) - [Computational Complexity: Section 2](https://www.topcoder.com/community/competitive-programming/tutorials/computational-complexity-section-2/) - [ ] [Cheat varaq](http://bigocheatsheet.com/) -- [ ] [[Review] Big-O notation in 5 minutes (video)](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) ## Ma'lumotlar tuzilmasi (Data structures) diff --git a/translations/README-vi.md b/translations/README-vi.md index a156ead..3e14a27 100644 --- a/translations/README-vi.md +++ b/translations/README-vi.md @@ -571,7 +571,7 @@ Nhưng đừng quên làm các bài toán lập trình ở phía trên trong khi - [Computational Complexity: Section 1](https://www.topcoder.com/thrive/articles/Computational%20Complexity%20part%20one) - [Computational Complexity: Section 2](https://www.topcoder.com/thrive/articles/Computational%20Complexity%20part%20two) - [ ] [Cheat sheet](http://bigocheatsheet.com/) -- [ ] [[Review] Big-O notation in 5 minutes (video)](https://youtu.be/__vX2sjlpXU) +- [ ] [[Review] Analyzing Algorithms (playlist) in 18 minutes (video)](https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv) Ồ, chắc cũng đủ rồi.