Install any skill in seconds. Free to start, no credit card required.
Get Started Free →a5c-ai/dp-state-designer
Assist in designing optimal DP states and transitions
Passed 18 of 22 test cases with the skill, and 9 of 22 without it.
and 3 more in the full report
9 fixed8 passed either way5 still failing0 broke
Tokens, turns and time describe resource use, not a dollar price.
One of 9 test cases the skill fixed. Same model, same prompt, with and without the skill.
For the recurrence dp[i] = max_{i-K <= j < i} (dp[j]) + val[i], specify the optimization to compute transitions in O(1) time per state in JSON format.
| Checked | Without skill | With skill |
|---|---|---|
| The response is valid JSON. | Passed | Passed |
| The optimizations array specifies using a monotonic queue. | Missed | Passed |
The instructions your model reads when the skill loads.
Assist in designing optimal dynamic programming states, transitions, and optimizations for complex DP problems.
{
"type": "object",
"properties": {
"problemDescription": { "type": "string" },
"constraints": { "type": "object" },
"examples": { "type": "array" },
test cases passed, vs 9 / 22 without
Published skills whose descriptions closely match this one, with their headline benchmark lift.
More skills from the same source and nearby in the registry, with their headline benchmark lift.