Merge branch 'main' into main
This commit is contained in:
Shaon Sikder
GitHub
commit
652349d14a
|
|
@ -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.
|
||||
|
||||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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.
|
||||
|
||||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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
|
||||
|
||||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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
|
||||
|
||||
### Ако имате изобилие от време:
|
||||
|
||||
|
|
@ -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)
|
||||
|
|
@ -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)
|
||||
|
||||
Е, това е достатъчно за тази тема.
|
||||
|
||||
|
|
@ -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
|
||||
- визуализира се като дърво, но обикновенно е линейна структура (масив, свързан списък)
|
||||
|
|
@ -1213,7 +1211,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)
|
||||
|
|
|
|||
|
|
@ -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)
|
||||
|
||||
ওয়েল, যে যথেষ্ট যে সম্পর্কে.
|
||||
|
||||
|
|
@ -1489,8 +1489,8 @@ https://github.com/jwasham/coding-interview-university
|
|||
আপনি প্রায়শই একটি রিফ্রেশার চাইলে এটি দুর্দান্ত।
|
||||
|
||||
- শর্ট সাবজেক্টের ২-৩ মিনিটের সিরিজ (২৩ টি ভিডিও)
|
||||
- [ভিডিও] (https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22)
|
||||
- 2-5 মিনিটের সংক্ষিপ্ত বিষয় ভিডিওর সিরিজ-মাইকেল সাম্বোল - Michael Sambol (46 টি ভিডিও):
|
||||
-[ভিডিও] (https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22)
|
||||
- 2-5 মিনিটের সংক্ষিপ্ত বিষয় ভিডিওর সিরিজ-মাইকেল সাম্বোল - Michael Sambol (48 টি ভিডিও):
|
||||
- [ভিডিও](https://www.youtube.com/@MichaelSambol)
|
||||
- [Code Examples](https://github.com/msambol/dsa)
|
||||
- [সেজেজউইক ভিডিও-অ্যালগোরিদম আই] (https://www.coursera.org/learn/algorithms-part1)
|
||||
|
|
|
|||
|
|
@ -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)
|
||||
|
||||
好吧，差不多就到这里了。
|
||||
|
||||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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)
|
||||
|
||||
|
||||
</details>
|
||||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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)
|
||||
|
||||
|
||||
Εάν μερικές διαλέξεις είναι πολύ μαθηματικές, μπορείς να μεταβείς προς τα κάτω και να παρακολουθήσεις μερικά βίντεο σχετικά με τα διακριτά μαθηματικά για να πάρεις όλες τις γνώσεις που απαιτούνται.
|
||||
|
|
|
|||
|
|
@ -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.
|
||||
|
|
@ -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)
|
||||
|
||||
|
|
|
|||
|
|
@ -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)
|
||||
|
||||
بسیارخب، فکر کنم در همین حد کافی باشه.
|
||||
|
||||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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.
|
||||
|
|
@ -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)
|
||||
|
||||
|
|
|
|||
|
|
@ -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
|
||||
|
|
@ -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)
|
||||
|
||||
|
|
|
|||
|
|
@ -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)
|
||||
|
||||
खैर, बस इतना ही काफी है।
|
||||
|
||||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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
|
||||
|
||||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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.
|
||||
|
||||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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)
|
||||
|
||||
|
||||
まあ、それだけで十分です。
|
||||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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)
|
||||
|
||||
---
|
||||
|
||||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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)
|
||||
|
||||
## 자료구조
|
||||
|
||||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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
|
||||
|
||||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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
|
||||
|
|
@ -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)
|
||||
|
||||
|
|
|
|||
|
|
@ -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)
|
||||
|
||||
Если в некоторых лекциях слишком много математики, вы можете ниже найти и посмотреть
|
||||
лекции по дискретной математике для получения базовых знаний.
|
||||
|
|
@ -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)
|
||||
|
||||
|
|
|
|||
|
|
@ -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
|
||||
|
|
@ -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)
|
||||
|
||||
|
|
|
|||
|
|
@ -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ı
|
||||
|
||||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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)
|
||||
|
||||
## 資料結構
|
||||
- ### 陣列
|
||||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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
|
||||
|
|
@ -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)
|
||||
|
||||
|
|
|
|||
|
|
@ -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)
|
||||
|
||||
یہ اس کے بارے میں کافی ہے.
|
||||
|
||||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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)
|
||||
|
||||
|
|
@ -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)
|
||||
|
|
|
|||
|
|
@ -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.
|
||||
|
||||
|
|
@ -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)
|
||||
|
|
|
|||
Loading…
Reference in New Issue