search_problems
Find LeetCode problems by filtering with categories, tags, difficulty levels, or keywords. Supports pagination for efficient navigation through search results.
Instructions
Searches for LeetCode problems based on multiple filter criteria including categories, tags, difficulty levels, and keywords, with pagination support
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| category | No | Problem category filter (e.g., 'algorithms', 'database', 'shell') to narrow down the problem domain | all-code-essentials |
| difficulty | No | Problem difficulty level filter to show only problems of a specific difficulty | |
| limit | No | Maximum number of problems to return in a single request (for pagination) | |
| offset | No | Number of problems to skip (for pagination) | |
| searchKeywords | No | Keywords to search in problem titles and descriptions | |
| tags | No | List of topic tags to filter problems by (e.g., ['array', 'dynamic-programming', 'tree']) |
Input Schema (JSON Schema)
{
"$schema": "http://json-schema.org/draft-07/schema#",
"additionalProperties": false,
"properties": {
"category": {
"default": "all-code-essentials",
"description": "Problem category filter (e.g., 'algorithms', 'database', 'shell') to narrow down the problem domain",
"enum": [
"all-code-essentials",
"algorithms",
"database",
"pandas",
"javascript",
"shell",
"concurrency"
],
"type": "string"
},
"difficulty": {
"description": "Problem difficulty level filter to show only problems of a specific difficulty",
"enum": [
"EASY",
"MEDIUM",
"HARD"
],
"type": "string"
},
"limit": {
"default": 10,
"description": "Maximum number of problems to return in a single request (for pagination)",
"type": "number"
},
"offset": {
"description": "Number of problems to skip (for pagination)",
"type": "number"
},
"searchKeywords": {
"description": "Keywords to search in problem titles and descriptions",
"type": "string"
},
"tags": {
"description": "List of topic tags to filter problems by (e.g., ['array', 'dynamic-programming', 'tree'])",
"items": {
"enum": [
"array",
"string",
"hash-table",
"dynamic-programming",
"math",
"sorting",
"greedy",
"depth-first-search",
"binary-search",
"database",
"tree",
"breadth-first-search",
"matrix",
"bit-manipulation",
"two-pointers",
"binary-tree",
"heap-priority-queue",
"prefix-sum",
"stack",
"simulation",
"graph",
"counting",
"sliding-window",
"design",
"backtracking",
"enumeration",
"linked-list",
"union-find",
"ordered-set",
"monotonic-stack",
"number-theory",
"trie",
"segment-tree",
"recursion",
"divide-and-conquer",
"queue",
"combinatorics",
"binary-search-tree",
"bitmask",
"memoization",
"geometry",
"binary-indexed-tree",
"hash-function",
"topological-sort",
"string-matching",
"shortest-path",
"rolling-hash",
"game-theory",
"data-stream",
"interactive",
"monotonic-queue",
"brainteaser",
"doubly-linked-list",
"merge-sort",
"randomized",
"quickselect",
"counting-sort",
"iterator",
"probability-and-statistics",
"concurrency",
"bucket-sort",
"suffix-array",
"line-sweep",
"minimum-spanning-tree",
"shell",
"reservoir-sampling",
"strongly-connected-component",
"eulerian-circuit",
"radix-sort",
"biconnected-component",
"rejection-sampling"
],
"type": "string"
},
"type": "array"
}
},
"type": "object"
}