Getting it into your agent
One page per mod, every tool's command on it. A separate URL per tool would split the same page into five that compete with each other.
npx agentmods add commands/huifer/claude-code-interview/practicegit clone --depth 1 https://github.com/huifer/claude-code-interviewWhat it costs to keep this loaded
Counted locally with the o200k_base tokenizer, which is exact for GPT models; Claude uses its own tokenizer and its counts differ. Treat this as one consistent yardstick across the catalogue rather than a bill. Prices are per million input tokens.
| Model | Per session | Once invoked |
|---|---|---|
| Fable 5 | $0.00024 | $0.04031 |
| Opus 5 | $0.00012 | $0.02015 |
| Sonnet 5 | $0.00005 | $0.00806 |
| Haiku 4.5 | $0.00002 | $0.00403 |
Grade A, and why
practice scanned grade A with 0 findings against 26 rules in 11 categories — prompt injection, anti-refusal, data exfiltration, privilege escalation, supply chain, agent snooping, system-prompt leakage, SSRF and excessive agency — measured 2d ago.
A static scan of the body, not an audit. Every finding is printed with the line that produced it so you can judge whether it matters here. A mod is markdown that instructs an agent; that is exactly why what it instructs is worth reading.
Nothing flagged
None of the 26 patterns this scan looks for appear in this file: no shell pipes, no recursive deletes, no credential paths, no hidden text, no instruction-override or anti-refusal phrasing, no agent-config snooping. That is not a guarantee, it is the absence of the things that are checkable.
How it starts
The opening of the file, as written. The whole thing — 630 lines — stays where its author put it; the contents beside it link to each section on GitHub.
针对性练习
基于弱点分析，推荐个性化练习题和学习资源。
使用方法
获取针对弱点练习
# 基于最近面试的弱点
/weakness/practice
# 练习特定类别
/weakness/practice algorithms
/weakness/practice system-design
/weakness/practice behavioral
# 指定难度
/weakness/practice algorithms medium
/weakness/practice algorithms hard
# 获取每日练习计划
/weakness/practice --daily
练习类别
1. 算法练习
基于弱点推荐
{
"algorithm_practice": {
"weakness": "Dynamic Programming",
"current_level": "Beginner",
"target_level": "Intermediate",
"practice_plan": {
"phase_1": {
"duration": "Week 1-2",
"focus": "Basic DP Patterns",
"problems": [
{
"id": 70,
"name": "Climbing Stairs",
"difficulty": "Easy",
"pattern": "Fibonacci-style DP",
"why": "入门DP，建立基本概念"
},
{
"id": 198,
"name": "House Robber",
"difficulty": "Medium",
"pattern": "Decision DP",
"why": "练习状态转移思考"
},
{
"id": 213,
"name": "House Robber II",
"difficulty": "Medium",
"pattern": "Circular DP",
"why": "考虑边界条件"
}
],
"daily_target": "3-5 problems",
"time_limit": "30-45 min/problem"
},
"phase_2": {
"duration": "Week 3-4",
"focus": "Classic DP Problems",
"problems": [
{
"id": 0,
"name": "Knapsack problem variants",
"difficulty": "Medium",
"pattern": "0/1 Knapsack",
"problems": ["416", "474", "494"]
},
{
"id": 300,
"name": "Longest Increasing Subsequence",
"difficulty": "Medium",
"pattern": "LIS DP",
"why": "经典子序列DP"
},
{
"id": 1143,
"name": "Longest Common Subsequence",
"difficulty": "Medium",
"pattern": "LCS DP",
"why": "双序列DP"
}
]
},
"phase_3": {
"duration": "Week 5+",
"focus": "Advanced Applications",
"problems": [
"72 (Edit Distance)",
"97 (Interleaving String)",
"127 (Word Ladder II)",
"140 (Word Break II)"
]
}
},
"learning_resources": {
"articles": [
"LeetCode DP Explore Cards",
"GeeksforGeeks DP Tutorial"
],
"videos": [
"TechLead: Dynamic Programming",
"CS Dojo: 5 Simple Steps",
"BackToBackSWE: DP Intuition"
],
"books": [
"CLRS Chapter 15: Dynamic Programming",
"Elements of Programming Interviews - DP Chapter"
]
}
}
}
What this file has done since we first saw it
Hashed on every crawl. A supply-chain change to an agent config is a question of when, not whether, so the history is kept rather than the latest state alone.
- 2d ago First seen · 630 lines · 24 tokens per session scan A e86bd0653ef4
practice is a command published in the GitHub repository huifer/claude-code-interview (23 stars, last pushed 7mo ago), licensed MIT. It adds 24 tokens to every session and 4,031 once invoked, about $0.0001 per session on Opus 5. A static security scan graded it A with 0 findings. No closer match exists in the catalogue, so it is treated as the original; first seen 2026-08-30.
Other commands, from other repositories
checklist
Generate a custom checklist for the current feature based on user requirements.
clarify
Identify underspecified areas in the current feature spec by asking up to 5 highly targeted clarification questions and encoding answers back into the spec.
specify
Create or update the feature specification from a natural language feature description.
analyze
Perform a non-destructive cross-artifact consistency and quality analysis across spec.md, plan.md, and tasks.md after task generation.
converge
Assess the current codebase against the feature's spec, plan, and tasks, then append any remaining unbuilt work as new tasks to tasks.md so implement can complete it.
implement
Execute the implementation plan by processing and executing all tasks defined in tasks.md.