A precise, focused Claude Code plugin for mastering Computer Science fundamentals. 5 expert agents guide you through algorithms, data structures, complexity theory, and systems.
- CS Foundations Expert - Discrete math, logic, proofs, computational thinking
- Algorithms Expert - Algorithm design, patterns, optimization strategies
- Data Structures Expert - Choosing and implementing optimal structures
- Complexity Theory Expert - Big O analysis, NP-completeness, computability
- Systems Expert - CPU architecture, OS, networks, distributed systems
/learn- Guided Computer Science learning paths (4-24 weeks)/problem- Solve algorithmic and data structure problems with hints/analyze- Analyze algorithm complexity and performance/quiz- Test your CS knowledge with adaptive quizzes
- CS Foundations (Math, logic, proofs)
- Algorithms (Design, patterns, optimization)
- Data Structures (Selection, implementation, trade-offs)
- Complexity Analysis (Big O, P vs NP, computability)
- Systems Computing (Architecture, OS, networks, distributed)
- Advanced Topics (Advanced data structures, parallel computing, ML theory)
# Claude Code auto-loads from this directory
# Or add to ~/.claude-code/plugins//learn fundamentals
Foundation path: 4 weeks of discrete math, logic, proofs
/learn full-path
Complete CS education: 24 weeks covering everything
/problem two-sum
Get help with the two-sum algorithmic problem
/problem array medium
Find medium difficulty array problems
/analyze merge-sort
Detailed complexity analysis of merge sort
/analyze time-complexity quicksort
Understand quicksort worst-case behavior
/quiz algorithms medium
Test your algorithms knowledge with medium difficulty
/quiz all comprehensive
Full assessment across all CS domains
custom-plugin-computer-science/
├── .claude-plugin/
│ └── plugin.json # Plugin manifest
├── agents/ # 5 CS experts
│ ├── 01-foundations-expert.md
│ ├── 02-algorithms-expert.md
│ ├── 03-data-structures-expert.md
│ ├── 04-complexity-theory-expert.md
│ └── 05-systems-expert.md
├── commands/ # 4 slash commands
│ ├── learn.md
│ ├── problem.md
│ ├── analyze.md
│ └── quiz.md
├── skills/ # 6 skill modules
│ ├── foundations/SKILL.md
│ ├── algorithms/SKILL.md
│ ├── data-structures/SKILL.md
│ ├── theory/SKILL.md
│ ├── systems/SKILL.md
│ └── advanced/SKILL.md
├── hooks/
│ └── hooks.json # Automation & parallel processing
└── README.md
| Path | Duration | Focus |
|---|---|---|
| Foundations | 4 weeks | Math, logic, proofs, computational thinking |
| Algorithms | 8 weeks | Algorithm design, patterns, optimization |
| Data Structures | 6 weeks | Arrays, lists, trees, graphs, heaps, hashes |
| Systems | 10 weeks | CPU, OS, networks, distributed systems |
| Full Path | 24 weeks | Complete CS education |
All 5 agents collaborate simultaneously:
- Foundations Expert analyzes math concepts
- Algorithms Expert reviews design patterns
- Data Structures Expert evaluates implementations
- Complexity Expert analyzes theory
- Systems Expert covers architecture
Result: Comprehensive CS guidance in seconds!
| Component | Count | Status |
|---|---|---|
| Agents | 5 | ✅ Expert |
| Commands | 4 | ✅ Powerful |
| Skills | 6 | ✅ Complete |
| Learning Hours | 100+ | ✅ Comprehensive |
| Practice Problems | 500+ | ✅ Included |
- Boolean logic and gates
- Set theory and relations
- Proof techniques
- Combinatorics
- Sorting: merge, quick, heap, insertion
- Searching: linear, binary, hash
- Divide and conquer
- Dynamic programming
- Linear: arrays, lists, stacks, queues
- Trees: BST, AVL, Red-Black, heaps
- Hash tables and sets
- Tries and graphs
- Big O, Big Theta, Big Omega
- Recurrence relations
- Master Theorem
- NP-completeness
- CPU caching and pipelining
- Virtual memory and paging
- Process scheduling
- TCP/IP and networking
- Consensus algorithms
- Segment trees, Fenwick trees
- Advanced algorithms
- Parallel computing
- Quantum algorithms
✅ Focused: Computer Science fundamentals only (no bloat) ✅ Precise: Clear explanations with complexity analysis ✅ Practical: 500+ problems with solutions ✅ Structured: Learning paths from beginner to expert ✅ Interactive: Quizzes, problems, and analysis tools ✅ Expert Guidance: 5 specialists guide you ✅ Interview Ready: Master interview questions
- Learning CS: Structured paths from scratch to expert
- Interview Prep: Master algorithms and complexity analysis
- Problem Solving: Get help with specific problems
- Knowledge Assessment: Quiz to find weak areas
- Complexity Analysis: Analyze algorithm performance
Beginner Learning:
/learn fundamentals
→ 4-week foundation building
→ Discrete math, logic, proofs
→ Ready for algorithms
Preparing for Interviews:
/quiz all comprehensive
→ Find weak areas
→ /learn algorithms
→ /problem [company-favorite]
→ /analyze [solution]
Solving LeetCode:
/problem merge-k-lists hint
→ Get progressive hints
→ /analyze solution
→ Understand complexity
→ /quiz data-structures
✅ Official Claude Code plugin format ✅ YAML frontmatter on all agents ✅ Production-ready code structure ✅ Comprehensive documentation ✅ Error handling and fallbacks ✅ Parallel processing optimized ✅ Interview-verified content
| Command | Purpose | Example |
|---|---|---|
/learn |
Start learning path | /learn algorithms |
/problem |
Solve problems with hints | /problem two-sum hint |
/analyze |
Analyze complexity | /analyze merge-sort |
/quiz |
Test knowledge | /quiz algorithms hard |
- Load plugin:
./custom-plugin-computer-science - Try:
/learn fundamentals - Solve:
/problem two-sum - Analyze:
/analyze binary-search - Quiz:
/quiz foundations medium
Master Computer Science. Build Strong Foundations. Ace Interviews. 🎓