← ClaudeAtlas

solvelisted

Solve competitive programming and LeetCode-style problems with educational explanations. Use when asked to "solve this problem", "help with this leetcode", "competitive programming solution", "solve this algorithm problem", "coding challenge solution", "how to solve this coding problem", or any algorithmic problem-solving request.
sequenzia/agent-alchemy · ★ 45 · AI & Automation · score 76
Install: claude install-skill sequenzia/agent-alchemy
# Competitive Programming Problem Solver Solve competitive programming and LeetCode-style problems with clear educational explanations, step-by-step walkthroughs, and verified Python solutions. **CRITICAL: Complete ALL 4 phases. Do not stop after classification or skip the agent.** ## Phase 1: Parse Input **Goal:** Extract and understand the problem statement. If `$ARGUMENTS` is provided, parse the problem statement from it. Extract: - Problem description and objective - Input/output format - Constraints (N, M, value ranges) - Example test cases with expected outputs - Any special conditions (modular arithmetic, multiple test cases, interactive) If `$ARGUMENTS` is empty or unclear, use `AskUserQuestion` to request the problem: ``` AskUserQuestion: question: "Please provide the problem statement. You can paste the full text, describe it in your own words, or provide a link." options: - label: "Paste problem text" description: "Paste the full problem statement including constraints and examples" - label: "Describe the problem" description: "Describe what the problem asks in your own words" ``` If the problem statement is ambiguous or missing key information (constraints, examples), ask for clarification before proceeding. ## Phase 2: Classify Problem **Goal:** Determine the algorithmic category, technique, and difficulty. Analyze the problem to determine: ### 2.1 Primary Category Match to one of: - **Dynamic Programming** — optimization over