solving-problems

Design and implement efficient C++ algorithms for competitive programming problems.

Updated Jul 29, 2026

Search Tags:#optimization #algorithms #problem-solving #stress-testing #cpp #competitive-programming

Ready to run

npx skills add https://github.com/LLaammTTeerr/competitive-programming --skill solving-problems-llaammtteerr

💬 Prompt for ChatGPT / Claude Chat▼

Please help me install this Agent Skill.
Skill: solving-problems
Source: https://github.com/LLaammTTeerr/competitive-programming/tree/main/skills/solving-problems
Command: npx skills add https://github.com/LLaammTTeerr/competitive-programming --skill solving-problems-llaammtteerr

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill includes references (resource) components.

What problem does it solve?

This skill provides a structured, partner-based approach to solving competitive programming problems, ensuring that algorithmic designs are correct, efficient, and compliant with strict time and memory constraints.

Core Features & Use Cases

Algorithmic Design: Guides the user through problem classification, complexity analysis, and edge-case identification before writing code.
C++ Implementation: Generates clean, performant C++ code using modern idioms and fast I/O, with optional low-level optimizations for extreme constraints.
Verification: Supports stress testing against brute-force oracles to ensure correctness for complex logic.

Quick Start

Use the solving-problems skill to analyze and implement a solution for the competitive programming problem provided in the attached text.

Frequently Asked Questions about solving-problems

High-intent search queries and answers about installing and using this skill.

FAQPage Schema

How do I solve competitive programming problems in C++ with strict time and memory limits?▼

Solving competitive programming problems in C++ requires designing efficient algorithms and implementing clean code using fast I/O to adhere to strict time and memory constraints. The process includes problem classification, complexity analysis, and edge-case identification before writing code.

What is the best way to prepare for edge cases in algorithmic problem solving?▼

Algorithmic problem solving prepares for edge cases by identifying them before writing code and verifying correctness through stress testing against brute-force oracles. This ensures complex logic handles all boundary conditions efficiently within contest constraints.

Can I use this approach for contest-style problems from platforms like Codeforces or AtCoder?▼

Yes, this approach applies directly to contest-style problems from platforms like Codeforces or AtCoder. It specifically handles stdin/stdout interaction and satisfies requirements for complexity analysis and low-level optimizations needed for competitive environments.

How does stress testing verify C++ algorithm correctness for competitive programming?▼

Stress testing verifies C++ algorithm correctness by comparing the optimized solution against a brute-force oracle across generated test cases. This mechanism identifies hidden logic flaws and edge-case failures before final contest submission.

Do I need to perform complexity analysis before implementing C++ algorithms for contests?▼

Yes, complexity analysis is required before implementing C++ algorithms. Analyzing time and memory constraints ensures the algorithmic design fits within strict contest limits, preventing timeouts and memory exceeded errors during execution.