Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
The largest LeetCode topics in the catalog, generated from the JSON templates so counts never go stale.
| Topic | Problems | Easy | Medium | Hard |
|---|---|---|---|---|
| Array | 781 | 154 | 465 | 162 |
| String | 380 | 100 | 201 | 79 |
| Hash Table | 300 | 72 | 181 | 47 |
| Dynamic Programming | 242 | 9 | 139 | 94 |
| Math | 229 | 56 | 123 | 50 |
| Depth-First Search | 200 | 34 | 132 | 34 |
| Sorting | 191 | 37 | 116 | 38 |
| Breadth-First Search | 158 | 17 | 103 | 38 |
| Tree | 149 | 35 | 101 | 13 |
| Greedy | 138 | 15 | 96 | 27 |
| Two Pointers | 132 | 39 | 85 | 8 |
| Binary Tree | 123 | 32 | 84 | 7 |
| Binary Search | 122 | 16 | 72 | 34 |
| Matrix | 122 | 17 | 74 | 31 |
| Stack | 101 | 20 | 56 | 25 |
| Bit Manipulation | 96 | 24 | 53 | 19 |
| Heap (Priority Queue) | 85 | 7 | 44 | 34 |
| Backtracking | 78 | 3 | 56 | 19 |
| Design | 76 | 13 | 48 | 15 |
| Simulation | 65 | 27 | 32 | 6 |
| Sliding Window | 63 | 6 | 44 | 13 |
| Prefix Sum | 62 | 3 | 46 | 13 |
| Linked List | 61 | 11 | 45 | 5 |
| Union-Find | 54 | 0 | 33 | 21 |
| Graph Theory | 52 | 1 | 31 | 20 |
| Counting | 49 | 18 | 26 | 5 |
| Recursion | 40 | 8 | 19 | 13 |
| Divide and Conquer | 33 | 4 | 21 | 8 |
| Trie | 33 | 2 | 19 | 12 |
| Binary Search Tree | 31 | 10 | 20 | 1 |
| Monotonic Stack | 31 | 2 | 18 | 11 |
| Queue | 28 | 7 | 14 | 7 |
| Graph | 26 | 0 | 17 | 9 |
| Ordered Set | 25 | 0 | 8 | 17 |
| Topological Sort | 21 | 0 | 13 | 8 |
| Memoization | 20 | 3 | 8 | 9 |
| Enumeration | 19 | 2 | 13 | 4 |
| Geometry | 17 | 4 | 9 | 4 |
| Segment Tree | 17 | 0 | 7 | 10 |
| Bitmask | 15 | 0 | 7 | 8 |
| Interactive | 14 | 3 | 6 | 5 |
| Number Theory | 14 | 2 | 7 | 5 |
| Shortest Path | 14 | 0 | 9 | 5 |
| Data Stream | 13 | 5 | 5 | 3 |
| Game Theory | 12 | 1 | 7 | 4 |
| String Matching | 12 | 7 | 3 | 2 |
| Binary Indexed Tree | 11 | 0 | 4 | 7 |
| Hash Function | 10 | 4 | 4 | 2 |
