Topics
This is a list of important topics in LeetCode, along with their difficulty to learn and the expected return on investment (ROI) for technical interviews.
| Topic | Difficulty to Learn | Return on Investment |
|---|---|---|
| Two Pointers | Medium | High |
| Tree BFS | Medium | High |
| Graph BFS | Medium | High |
| Tree DFS | Medium | High |
| Graph DFS | Medium | Medium |
| Combinatorial DFS | Medium | Medium |
| Heap | Medium | Medium |
| Binary Search | High | Medium |
| Divide and Conquer | Medium | Low |
| Linked List | High | High |
| Hash | High | High |
| Dynamic Programming | Medium | Medium |
| Trie | Medium | Low |
| Union Find | High | High |
| Greedy | High | Medium |
Explanation
- Difficulty to Learn: This is a subjective assessment of how difficult each topic is to understand and implement. Topics marked as “High” might require more practice and experience to master.
- Return on Investment: This is a rough estimate of how often these topics appear in coding interviews and how valuable they are for solving problems efficiently.