Name: Code Kata Generator — Coding Exercise Design Tool
Author: revfactory

搜索技能.../

Code Kata Generator — Coding Exercise Design Tool | Skills Pool

## [T{N}] {Exercise Name}

### Problem Description
{Clear problem statement}

### Input
- {Input format and constraints}

### Output
- {Output format}

### Examples
| Input | Output | Explanation |
|-------|--------|-------------|
| {Example 1 input} | {Example 1 output} | {Walkthrough} |
| {Example 2 input} | {Example 2 output} | |

### Constraints
- {Time/space complexity requirements}
- {Input size range}

### Hints (optional)
<details>
<summary>Show hint</summary>
{Directional hint}
</details>

### Test Cases
{Basic + edge + large-input cases}

### Model Solution
{Including time complexity and space complexity analysis}

### Learning Points
- {Concept learned from this problem}
- {Real-world application}

Concept	Required Exercise Types	Tier
Arrays	Two Pointers, Sliding Window	T2-T3
Linked Lists	Reversal, merging, cycle detection	T2-T3
Stacks	Bracket matching, histogram	T2-T3
Queues	BFS, circular queue, priority queue	T3
Hash Maps	Frequency counting, Two Sum, grouping	T2-T3
Trees	Traversal, LCA, balance checking	T3-T4
Graphs	DFS/BFS, shortest path, topological sort	T4-T5

Concept	Required Exercise Types	Tier
Sorting	Sort implementation, custom sorting	T2-T3
Binary Search	Range search, Parametric Search	T3-T4
Recursion	Fibonacci, permutations/combinations, divide & conquer	T3
DP	Knapsack, LIS, grid paths	T4-T5
Greedy	Activity selection, interval scheduling	T3-T4
Backtracking	N-Queens, Sudoku, combinations	T4

Type	Purpose	Example
Basic	Verify normal operation	Same as problem examples
Minimum input	Lower boundary value	Empty array, length 1
Maximum input	Performance verification	n = 10^5
Edge	Special situations	All same values, negatives, 0
Reverse/sorted	Sorting-related	Already sorted, reverse sorted
Duplicates	Duplicate handling	Many duplicate elements

[T2] Find a specific value in an array (linear search)
  |
[T3] Find a value in a sorted array (binary search)
  |
[T3] Find a value in a rotated sorted array
  |
[T4] Find a value in a 2D sorted matrix
  |
[T4] Parametric Search (find optimal value satisfying a condition)

Tier	Name	Concepts	Est. Solving Time	Target Phase
T1	Warm-up	Variables, conditionals, loops, functions	5-15 min	Week 1-2
T2	Foundation	Arrays, strings, basic data structures	15-30 min	Week 3-6
T3	Intermediate	Hash maps, stacks/queues, recursion, sorting	30-60 min	Week 7-12
T4	Advanced	Trees, graphs, DP, binary search

Tier	Name	Concepts	Est. Solving Time	Target Phase
T1	Warm-up	Variables, conditionals, loops, functions	5-15 min	Week 1-2
T2	Foundation	Arrays, strings, basic data structures	15-30 min	Week 3-6
T3	Intermediate	Hash maps, stacks/queues, recursion, sorting	30-60 min	Week 7-12
T4	Advanced	Trees, graphs, DP, binary search

Code Kata Generator — Coding Exercise Design Tool

Target Agent

Exercise Difficulty System

5-Tier Difficulty Classification

Code Kata Generator — Coding Exercise Design Tool

Target Agent

Exercise Difficulty System

5-Tier Difficulty Classification

Exercise Template

Concept-to-Exercise Map

Data Structures

Algorithms

Test Case Design Principles

Required Case Types

Case Count Guide

Exercise Sequencing Principles

Scaffolding

Interleaving

Update Skills

Eval Harness

Ecc Tools Cost Audit

Code Tour

Rules Distill

Design System