> ## Documentation Index
> Fetch the complete documentation index at: https://leetcode-py.wisl.dev/llms.txt
> Use this file to discover all available pages before exploring further.

> ## Agent Instructions
> leetcode-py is a Python LeetCode practice environment generator with one CLI: lcpy. It is not a service or platform.
> Each problem is a directory under leetcode/ with README.md, solution.py, test_solution.py, helpers.py, and playground.ipynb. lcpy gen creates them from JSON templates bundled with the package.
> Examples are backed by tests; copy them verbatim.

# LeetCode Problem Catalog: All Topics

> The largest LeetCode topics in the catalog, generated from the JSON templates so counts never go stale.

The 48 largest topics across 1404 problems, generated straight from the templates so counts never go stale. Niche topics with fewer than 10 problems (73 of them) are left off this list; you will see them named on the problem pages they belong to.

<div className="sd-catalog-table">
  | Topic | Problems | Easy | Medium | Hard |
  | - | - | - | - | - |
  | [Array](/catalog/topics/array) | 781 | 154 | 465 | 162 |
  | [String](/catalog/topics/string) | 380 | 100 | 201 | 79 |
  | [Hash Table](/catalog/topics/hash-table) | 300 | 72 | 181 | 47 |
  | [Dynamic Programming](/catalog/topics/dynamic-programming) | 242 | 9 | 139 | 94 |
  | [Math](/catalog/topics/math) | 229 | 56 | 123 | 50 |
  | [Depth-First Search](/catalog/topics/depth-first-search) | 200 | 34 | 132 | 34 |
  | [Sorting](/catalog/topics/sorting) | 191 | 37 | 116 | 38 |
  | [Breadth-First Search](/catalog/topics/breadth-first-search) | 158 | 17 | 103 | 38 |
  | [Tree](/catalog/topics/tree) | 149 | 35 | 101 | 13 |
  | [Greedy](/catalog/topics/greedy) | 138 | 15 | 96 | 27 |
  | [Two Pointers](/catalog/topics/two-pointers) | 132 | 39 | 85 | 8 |
  | [Binary Tree](/catalog/topics/binary-tree) | 123 | 32 | 84 | 7 |
  | [Binary Search](/catalog/topics/binary-search) | 122 | 16 | 72 | 34 |
  | [Matrix](/catalog/topics/matrix) | 122 | 17 | 74 | 31 |
  | [Stack](/catalog/topics/stack) | 101 | 20 | 56 | 25 |
  | [Bit Manipulation](/catalog/topics/bit-manipulation) | 96 | 24 | 53 | 19 |
  | [Heap (Priority Queue)](/catalog/topics/heap-priority-queue) | 85 | 7 | 44 | 34 |
  | [Backtracking](/catalog/topics/backtracking) | 78 | 3 | 56 | 19 |
  | [Design](/catalog/topics/design) | 76 | 13 | 48 | 15 |
  | [Simulation](/catalog/topics/simulation) | 65 | 27 | 32 | 6 |
  | [Sliding Window](/catalog/topics/sliding-window) | 63 | 6 | 44 | 13 |
  | [Prefix Sum](/catalog/topics/prefix-sum) | 62 | 3 | 46 | 13 |
  | [Linked List](/catalog/topics/linked-list) | 61 | 11 | 45 | 5 |
  | [Union-Find](/catalog/topics/union-find) | 54 | 0 | 33 | 21 |
  | [Graph Theory](/catalog/topics/graph-theory) | 52 | 1 | 31 | 20 |
  | [Counting](/catalog/topics/counting) | 49 | 18 | 26 | 5 |
  | [Recursion](/catalog/topics/recursion) | 40 | 8 | 19 | 13 |
  | [Divide and Conquer](/catalog/topics/divide-and-conquer) | 33 | 4 | 21 | 8 |
  | [Trie](/catalog/topics/trie) | 33 | 2 | 19 | 12 |
  | [Binary Search Tree](/catalog/topics/binary-search-tree) | 31 | 10 | 20 | 1 |
  | [Monotonic Stack](/catalog/topics/monotonic-stack) | 31 | 2 | 18 | 11 |
  | [Queue](/catalog/topics/queue) | 28 | 7 | 14 | 7 |
  | [Graph](/catalog/topics/graph) | 26 | 0 | 17 | 9 |
  | [Ordered Set](/catalog/topics/ordered-set) | 25 | 0 | 8 | 17 |
  | [Topological Sort](/catalog/topics/topological-sort) | 21 | 0 | 13 | 8 |
  | [Memoization](/catalog/topics/memoization) | 20 | 3 | 8 | 9 |
  | [Enumeration](/catalog/topics/enumeration) | 19 | 2 | 13 | 4 |
  | [Geometry](/catalog/topics/geometry) | 17 | 4 | 9 | 4 |
  | [Segment Tree](/catalog/topics/segment-tree) | 17 | 0 | 7 | 10 |
  | [Bitmask](/catalog/topics/bitmask) | 15 | 0 | 7 | 8 |
  | [Interactive](/catalog/topics/interactive) | 14 | 3 | 6 | 5 |
  | [Number Theory](/catalog/topics/number-theory) | 14 | 2 | 7 | 5 |
  | [Shortest Path](/catalog/topics/shortest-path) | 14 | 0 | 9 | 5 |
  | [Data Stream](/catalog/topics/data-stream) | 13 | 5 | 5 | 3 |
  | [Game Theory](/catalog/topics/game-theory) | 12 | 1 | 7 | 4 |
  | [String Matching](/catalog/topics/string-matching) | 12 | 7 | 3 | 2 |
  | [Binary Indexed Tree](/catalog/topics/binary-indexed-tree) | 11 | 0 | 4 | 7 |
  | [Hash Function](/catalog/topics/hash-function) | 10 | 4 | 4 | 2 |
</div>


This documentation is built and hosted on [Mintlify](https://mintlify.com), a developer documentation platform.