v0.1.0 - Check a tutorial draft against its saved plan and sketch before review. Use when a draft needs plan adherence, concept timing, code continuity, runnable snippet, and Hugo placement checks before tutorial review.
v0.1.0 - Record an approved tutorial plan into an ignored local run directory. Use when a LeetCode or algorithm tutorial plan must survive context compaction, multi-turn work, or handoff before build starts.
v0.1.0 - Create a teaching skeleton and code-growth contract from a saved tutorial plan. Use before tutorial build when concept timing, helper extraction, final-code placement, or checkpoint continuity must be made explicit.
v0.1.1 - Build exactly one planned LeetCode tutorial increment through problem pressure, naive baseline, break, change, check, freeze, and review handoff. Use when a task-first LeetCode tutorial plan is ready and the next checkpoint must be drafted without self-approval.
v0.1.0 - Build exactly one planned algorithm tutorial checkpoint and stop for review. Use when a task-first algorithm tutorial plan is ready and the next section must derive one mechanism, invariant, code fragment, or runnable checkpoint from concrete pressure without self-approval.
v0.1.0 - Deepen 1-2 selected concepts in a reviewed algorithm tutorial using PDKH standards. Use when a method tutorial needs stronger invariant, formalization, correctness, complexity, counterexample, or engineering-reality evidence without broadening into unrelated topics.
v0.1.0 - Plan one standalone algorithm, data-structure, or method tutorial as review-gated writing tasks. Use when the subject is the technique itself and the plan must preserve derivation-first construction, runnable checkpoints, invariants, correctness, complexity, counterexamples, engineering tradeoffs, deepening tasks, and publishable Hugo placement before drafting.
v0.1.0 - Plan one LeetCode or OJ-style tutorial as ordered, review-gated writing tasks before drafting. Use when a concrete problem needs a publishable guided-build tutorial with problem facts, examples, constraints, smaller subproblem, connected code checkpoints, optimization bridge, verification, and checkpoint handoff.