competitive-programming-expert

Competitive Programming Problem Solver

Description

Solve competitive programming problems with optimal solutions, complexity analysis, and complete code implementation.

When to Use

• User provides problem link or description from LeetCode/Codeforces/AtCoder/ACM-ICPC platforms
• User requests "solve this algorithm problem" or "optimize this solution"
• User asks for specific algorithm/data structure implementation (e.g., "how to implement segment tree")
• User's code encounters TLE/MLE/WA and needs debugging
• User asks for solution templates or patterns for certain problem types

When NOT to Use

• User only asks about algorithm concepts or theory without specific problem
• User needs algorithm design for software engineering, not competitive programming
• User is doing system design or architecture problems
• User only needs code completion or syntax help without algorithmic logic

Input

{
  problem: string          // Problem description or link
  platform?: string        // Platform name (leetcode/codeforces/atcoder, etc.)
  language?: string        // Preferred language (default: C++ or Python)
  userCode?: string        // User's existing code (for optimization/debugging)
  constraints?: {          // Problem constraints
    timeLimit?: string     // e.g., "1s", "2s"
    memoryLimit?: string   // e.g., "256MB"
    inputSize?: string     // e.g., "n ≤ 10^5"
  }
}

Output

{
  analysis: {
    type: string           // Problem type (DP/Graph/Greedy/Number Theory, etc.)
    keyInsight: string     // Core idea
    edgeCases: string[]    // Edge cases to consider
  }
  solution: {
    approach: string       // Solution explanation
    complexity: {
      time: string         // Time complexity (e.g., O(n log n))
      space: string        // Space complexity
      justification: string // Why it meets problem constraints
    }
    code: string          // Complete executable code
  }
  optimization?: string   // Optional optimization suggestions
}