aps-algorithm-concept-taxonomy

Designs concept taxonomies, prerequisite maps, and difficulty dimensions for algorithm-problem-solving products.

Updated Jul 4, 2026
One-click install
npx skills add https://github.com/100Thieves-team/plady-expert-skills --skill aps-algorithm-concept-taxonomy-100thieves-team
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: aps-algorithm-concept-taxonomy
Source: https://github.com/100Thieves-team/plady-expert-skills/tree/main/algo-experts/skills/aps-algorithm-concept-taxonomy
Command: npx skills add https://github.com/100Thieves-team/plady-expert-skills --skill aps-algorithm-concept-taxonomy-100thieves-team

SYSTEM DOCUMENTATION & REQUIREMENTS

What problem does it solve? Teams building algorithm-problem-solving products (Baekjoon/LeetCode/judge-style) lack a shared conceptual skeleton, so learning paths, recommendations, hints, editorials, and progress tracking each invent their own inconsistent view of concepts, tags, and difficulty. ## Core Features & Use Cases - Concept Taxonomy Design: Structures layered taxonomies (foundation, data structure, algorithm family, pattern, technique, problem model) with a canonical leaf-tag vocabulary drawn from CP-Algorithms, USACO Guide, and standard curricula. - Prerequisite & Difficulty Modeling: Provides a starter prerequisite DAG, constraint-to-complexity heuristics, and multi-dimensional difficulty axes (insight, implementation burden, proof burden, language burden) instead of a single difficulty number. - Tag Reveal & Normalization Policy: Defines spoiler-aware tag reveal levels and normalization mappings across solved.ac, Codeforces, LeetCode, and AtCoder difficulty scales. - Use Case: A planner asks how to model DP, graph, and greedy concepts so the recommendation engine can suggest gap-filling problems; the Skill produces a concept map with prerequisites, common mistakes, reveal policies, and MVP scope boundaries. ## Quick Start Ask the Skill to design an algorithm concept taxonomy and prerequisite map for your problem-solving product's recommendation and hint features.

Frequently Asked Questions about aps-algorithm-concept-taxonomy

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

FAQPage Schema
How do I design a concept taxonomy for an algorithm practice product?

Structure it in layers: foundation skills, data structures, algorithm families, patterns, techniques, and problem models. Use canonical leaf tags like Dijkstra, segment tree, or bitmask DP so the product can distinguish wrong algorithm choice from wrong implementation.

How do I build a prerequisite map for problem recommendation?

Model prerequisites as a DAG where each concept lists what it generally requires, such as Dijkstra requiring BFS/DFS plus heaps. This lets recommendations route struggling users back to gap-filling easier problems instead of sideways to similar failures.

Should algorithm tags be hidden from users during practice?

Yes, tags can be spoilers when discovering the approach is the core skill. Platforms like Codeforces and solved.ac already treat tags as spoiler-sensitive, so the product should mark a reveal level per tag and hide them in discovery-focused modes.

How do I normalize difficulty across Baekjoon, Codeforces, and LeetCode?

These scales are not linearly comparable: solved.ac uses 30 crowd-voted levels, Codeforces uses 800-3500 ratings, and LeetCode uses coarse Easy/Medium/Hard. Build an explicit mapping table with confidence labels rather than copying any single scale.

Why is problem difficulty not a single number?

Difficulty is multi-dimensional: concept prerequisites, insight difficulty, implementation burden, proof burden, edge cases, and language-specific costs all vary independently. Two DP problems can differ enormously because optimization insights like convex hull trick are separate from base DP knowledge.

Does this Skill solve algorithm problems or write competitive programming code?

No. It is a product domain expert that frames requirements, taxonomy structure, scope boundaries, and risks for teams building algorithm-problem-solving products. It explicitly does not solve problems, write contest code, or debug user submissions.