Provide implementations of advanced data structures
中文简介正在准备中。当前显示原文说明。
Fetch and parse LeetCode problems with metadata, constraints, examples, hints, difficulty ratings, and related problems. Integrates with LeetCode API for comprehensive problem data retrieval.
中文简介正在准备中。当前显示原文说明。
查看安装方法安装前可以查看交给 AI 代理的指令内容。
A specialized skill for fetching and parsing LeetCode problems with complete metadata, suitable for competitive programming practice, interview preparation, and algorithm learning workflows.
Extract comprehensive problem data from LeetCode including:
Problem Retrieval
Metadata Extraction
Content Parsing
User Data Access
# Install LeetCode MCP Server by jinzcdev
claude mcp add-json "leetcode" '{"type":"stdio","command":"npx","args":["-y","@jinzcdev/leetcode-mcp-server","--site","global"]}'
Available MCP Tools:
get_daily_challenge - Fetch daily LeetCode challengeget_problem - Retrieve problem by titleSlugsearch_problems - Filter by category, tags, difficulty, keywordsget_user_profile - Access user dataget_user_contest_ranking - Track contest performance// GraphQL endpoint for LeetCode
const LEETCODE_GRAPHQL = 'https://leetcode.com/graphql';
// Query for problem details
const problemQuery = `
query getProblem($titleSlug: String!) {
question(titleSlug: $titleSlug) {
questionId
title
titleSlug
content
difficulty
topicTags { name slug }
hints
sampleTestCase
codeSnippets { lang code }
stats
}
}
`;
Competitive Companion - Parses problems from LeetCode and 115+ other online judges:
# Using MCP Server
leetcode get_problem --titleSlug "two-sum"
# Output includes:
# - Problem title and description
# - Difficulty and acceptance rate
# - Topic tags
# - Examples and constraints
# - Code templates
# Search by difficulty and tags
leetcode search_problems --difficulty MEDIUM --tags "dynamic-programming,array"
# Search by keyword
leetcode search_problems --keyword "substring"
# Fetch today's daily challenge
leetcode get_daily_challenge
{
"problem": {
"id": "string",
"title": "string",
"titleSlug": "string",
"difficulty": "Easy|Medium|Hard",
"acceptanceRate": "number",
"description": "string (markdown)",
"constraints": ["string"],
"examples": [
{
"input": "string",
"output": "string",
"explanation": "string"
}
],
"hints": ["string"],
"topicTags": ["string"],
"similarQuestions": ["string"],
"codeTemplates": {
"python3": "string",
"cpp": "string",
"java": "string"
}
},
"metadata": {
"fetchedAt": "ISO8601 timestamp",
"source": "leetcode.com|leetcode.cn"
}
}
This skill enhances the following processes:
leetcode-problem-solving - Core problem-solving workflowpattern-recognition - Identifying algorithmic patternsfaang-interview-prep - FAANG interview preparation| Error | Cause | Resolution |
|---|---|---|
PROBLEM_NOT_FOUND | Invalid titleSlug | Verify problem URL or slug |
RATE_LIMITED | Too many requests | Implement exponential backoff |
AUTH_REQUIRED | Premium problem | Use alternative or authenticate |
NETWORK_ERROR | Connection failed | Check network, retry with backoff |
还没有评价。欢迎分享你的使用感受。
无需登录即可发表。欢迎分享使用感受、提问,或说明在哪些环境下无法运行。
还没有评论。来写第一条吧。
Provide implementations of advanced data structures
中文简介正在准备中。当前显示原文说明。
Fresh adversarial code review with binary PASS/FAIL verdicts, evidence citations, and anchoring bias prevention via fresh reviewer spawning.
中文简介正在准备中。当前显示原文说明。
WASM-based instant code transforms for simple tasks, achieving 352x speedup over LLM inference with zero cost.
中文简介正在准备中。当前显示原文说明。
Coordinate Crew (persistent) and Polecat (transient) agents using Gas Town's hook-based work distribution and GUPP principle.
中文简介正在准备中。当前显示原文说明。
Generate visual representations of algorithm execution
中文简介正在准备中。当前显示原文说明。
Hierarchical coordination and drift detection with frequent checkpoints, shared memory coherence validation, role specialization enforcement, and short task cycles.
中文简介正在准备中。当前显示原文说明。