Leetcode: Search Problems
Leetcode via Parse · developer_tools
Search and filter LeetCode problems. Supports keyword search, difficulty filtering, topic tag filtering, category filtering, and offset-based pagination. Returns problems sorted by question number. Each problem includes acceptance rate, difficulty, question ID, paid-only status, title, slug, and topic tags. Search LeetCode problems with filters, list programming contests, and look up public user profiles. Fulfilled by Parse from leetcode.com.
- developer-tools
- education
- leetcode
- leetcode-com
- other
- parse
- platform-key
Price and execution
- Price
- $0.02 USD credits / call
- Trust tier
- Verified
- Execution
- Managed call
- Capability group
- developer_tools
Interface snapshot
- Protocol
- HTTP operation
- Operation
- GET /scraper/e4e91877-8a33-4462-b5ed-1a5cd60da1f0/search_problems
- Interface artifact
- sha256:00bb4093ce71d5c96b68702a46dabd642d7c5ee8c2f3cd498a3cbd76ba4e4436
- Manifest digest
- sha256:ec7daaa03a8c4508af63c7ed87e677db468ba588d6c8bcdda61d9b47a9f29c0c
Request fields
- skip (integer): Number of problems to skip for pagination (offset).
- tags (string): Comma-separated topic tag slugs to filter by (e.g. 'array,hash-table,dynamic-programming').
- limit (integer): Maximum number of problems to return per page.
- keyword (string): Search keyword to filter problems by title (e.g. 'two sum', 'binary tree').
- category (string): Category slug filter. Accepts: algorithms, database, shell, concurrency. Empty string returns all categories.: Allowed values: algorithms, database, shell, concurrency
- difficulty (string): Difficulty filter. Accepts exactly one of: EASY, MEDIUM, HARD. Case-insensitive input is uppercased internally.: Allowed values: EASY, MEDIUM, HARD
Example queries
- {"skip":"0","tags":"array","limit":"5","keyword":"two sum","category":"algorithms","difficulty":"EASY"}