Hi I have been actively using leetcode for almost 6 months now and have solved 300+ problems and getting better day by day. I wanted to share some of my findings from leetcode discussion treasure.
I have collected various lists of question by pattern and concepts. I hope these lists below help you in preparation journey.
| Concepts | Links |
|---|---|
| String | here |
| Binary Search | imp |
| Two Pointers | vv-imp |
| Two Pointers - Fast-Slow | v-imp |
| Sliding Window | imp |
| Heap - Top K Pattern | vv-imp |
| Heap - Merge Pattern | vv-imp |
| Heap - Two Heap Pattern | vv-imp |
| Heap - Min Pattern | vv-imp |
| Tree | imp |
| Fenwick Tree | here |
| Graph | imp |
| Bridges & Articulation Point Graph | here |
| DSU | here |
| Recursion/Backtracking | here |
| Dynamic Programing | |
| Classical DP | vv-imp |
| Knapsack DP | vv-imp |
| Decision Making DP | vv-imp |
| Distinct Ways DP | vv-imp |
| Max Min DP | vv-imp |
| Grid DP | vv-imp |
| Math realted DP | here |
| Dp on Strings | vv-imp |
| Graph/ Tree DP | here |
| Bit Manipulation Dp | here |
| Interval DP | here |
| Merging Interval DP | here |
| Multi Dimesion DP | here |
| Digit DP | here |
I have also learnt some algorithms which made some questions very easy for me to solve, shared the list below.
| Category | Algorithm Type | Resource |
|---|---|---|
| Pattern Matching | Z-Algorithm | UC Davis lectures (gold standard lectures) |
| Prefix Function | Fluent Algorithms YT Channel | |
| Trie | Easy to learn | |
| Palindrome | Manacher's Algorithm (O(n)) | IDeserve YT Channel |
| Graph | Morris Traversal | Kashish Mehndiratta YT Channel |
| DSU (Disjoint Set Union) | Tushar Roy | |
| Kruskal's Algorithm | Just an extension of DSU | |
| 0-1 BFS | Pepcoding or Luv YT channel | |
| Other Graph Concepts | William Fiset, CodeNCode, Striver, Utkarsh Gupta | |
| Optimization | DP/Recursion/Heap/Stack/Sliding Window | Aditya Verma (Legend), Pepcoding |
| Segment Tree | Utkarsh Gupta free live classes on Unacademy |
Other resources to learn algorithms
Tip: Learn algorithms with black box method

you can learn concepts of most algorithms and solve problems with them without actually knowing the internal working, but eventual learn the internal working. Refer below

By this method you can cover a lot of breadth and depth concurrently
I use this personally, this was inspired from colin galen.
All The Best !!!