|
2 | 2 | This repository contains LeetCode resources to ace your coding interviews. |
3 | 3 |
|
4 | 4 | ## Fundamental Knowledge |
5 | | -- [Linked List]() |
6 | | -- [Hash Tables]() |
7 | | -- [Recursion]() |
8 | | -- [Sorting]() |
9 | | -- [Binary Search]() |
10 | | -- [Stacks]() |
11 | | -- [Queues]() |
12 | | -- [Trees]() |
13 | | -- [Trees]() |
| 5 | +- [Hash Tables](https://www.interviewcake.com/concept/java/hash-map) |
| 6 | +- [Linked List](https://leetcode.com/discuss/study-guide/1800120/Become-Master-In-Linked-List) |
| 7 | +- [Recursion](https://leetcode.com/discuss/study-guide/1733447/Become-Master-In-Recursion) |
| 8 | +- [Sorting](https://medium.com/basecs/sorting-out-the-basics-behind-sorting-algorithms-b0a032873add) |
| 9 | +- [Binary Search](https://leetcode.com/discuss/general-discussion/786126/Python-Powerful-Ultimate-Binary-Search-Template.-Solved-many-problems) |
| 10 | +- [Stacks](https://medium.com/basecs/stacks-and-overflows-dbcf7854dc67) |
| 11 | +- [Queues](https://medium.com/basecs/to-queue-or-not-to-queue-2653bcde5b04) |
| 12 | +- [Trees](https://leetcode.com/discuss/study-guide/1820334/Become-Master-in-Tre) |
| 13 | +- [Tries](https://leetcode.com/discuss/general-discussion/931977/beginner-friendly-guide-to-trie-tutorial-practice-problems) |
14 | 14 | - [Backtracking](https://medium.com/leetcode-patterns/leetcode-pattern-3-backtracking-5d9e5a03dc26) |
15 | | -- [Heaps]() |
16 | | -- [Graph Theory]() |
| 15 | +- [Heaps](https://medium.com/basecs/learning-to-love-heaps-cef2b273a238) |
| 16 | +- [Graph Theory](https://medium.com/basecs/a-gentle-introduction-to-graph-theory-77969829ead8) |
17 | 17 | - [Dynaymic Programming](https://leetcode.com/discuss/general-discussion/458695/dynamic-programming-patterns) |
18 | | -- [Bit Manipulation]() |
19 | | -- [Breadth First Search]() |
20 | | -- [Depth First Search]() |
| 18 | +- [Breadth First Search](https://medium.com/basecs/breaking-down-breadth-first-search-cebe696709d9) |
| 19 | +- [Depth First Search](https://medium.com/basecs/deep-dive-through-a-graph-dfs-traversal-8177df5d0f13) |
21 | 20 |
|
22 | 21 | ## Patterns |
23 | 22 | - [14 Coding Interview Patterns](https://www.teamblind.com/blog/top-leetcode-patterns-coding-interview-questions/) |
24 | | -- [Sliding Window]() |
25 | | -- [Two Pointers]() |
26 | | -- [Fast & Slow Pointers]() |
27 | | -- [Merge Intervals]() |
28 | | -- [Cyclic Sort]() |
29 | | -- [Reverse Linked List]() |
30 | | -- [Heaps]() |
31 | | -- [Two Heaps]() |
32 | | -- [Subsets]() |
33 | | -- [Modified Binary Search]() |
34 | | -- [Top K Elements]() |
35 | | -- [K-way merge]() |
36 | | -- [Topological Sort]() |
| 23 | +- [Sliding Window](https://medium.com/leetcode-patterns/leetcode-pattern-2-sliding-windows-for-strings-e19af105316b) |
| 24 | +- [Two Pointers](https://leetcode.com/discuss/study-guide/1688903/Solved-all-two-pointers-problems-in-100-days) |
| 25 | +- [Merge Intervals](https://medium.com/codex/grokking-the-coding-interview-pattern-merge-interval-6e6b1e9e038c) |
| 26 | +- [Cyclic Sort](https://leetcode.com/discuss/study-guide/2958275/cyclic-sort-important-pattern) |
| 27 | +- [Monotonic Stack](https://leetcode.com/discuss/study-guide/2347639/A-comprehensive-guide-and-template-for-monotonic-stack-based-problems) |
| 28 | +- [Two Heaps](https://leetcode.com/discuss/general-discussion/1127238/master-heap-by-solving-23-questions-in-4-patterns-category) |
| 29 | +- [Subsets](https://leetcode.com/discuss/general-discussion/1125779/Dynamic-programming-on-subsets-with-examples-explained) |
| 30 | +- [Modified Binary Search](https://leetcode.com/discuss/general-discussion/691825/Binary-Search-for-Beginners-Problems-or-Patterns-or-Sample-solutions) |
| 31 | +- [Top K Elements](https://github.com/Chanda-Abdul/Several-Coding-Patterns-for-Solving-Data-Structures-and-Algorithms-Problems-during-Interviews/blob/main/%E2%9C%85%20Pattern%2013:%20Top%20'K'%20Elements.md) |
| 32 | +- [K-way merge](https://github.com/Chanda-Abdul/Several-Coding-Patterns-for-Solving-Data-Structures-and-Algorithms-Problems-during-Interviews/blob/main/%E2%9C%85%20Pattern%2014%3A%20K-way%20merge.md) |
| 33 | +- [DFS Pattern](https://github.com/Chanda-Abdul/Several-Coding-Patterns-for-Solving-Data-Structures-and-Algorithms-Problems-during-Interviews/blob/main/%E2%9C%85%20%20Pattern%2008%3ATree%20Depth%20First%20Search.md) |
| 34 | +- [BFS Pattern](https://github.com/Chanda-Abdul/Several-Coding-Patterns-for-Solving-Data-Structures-and-Algorithms-Problems-during-Interviews/blob/main/%E2%9C%85%20%20Pattern%2007%3A%20Tree%20Breadth%20First%20Search.md) |
| 35 | +- [Topological Sort](https://medium.com/basecs/spinning-around-in-cycles-with-directed-acyclic-graphs-a233496d4688) |
37 | 36 |
|
38 | 37 | ## Roadmap |
39 | 38 |
|
|
0 commit comments