{
    "api": "YAML JSON TOON Database",
    "version": "1.0.0",
    "format": "json",
    "dataset": {
        "id": 401,
        "slug": "dynamic-programming-patterns",
        "title": "Dynamic Programming Patterns",
        "description": "Classic problems solved with dynamic programming.",
        "category": "Algorithms",
        "category_slug": "algorithms",
        "tags": "algorithms,dynamic-programming,optimization",
        "view_count": 1,
        "created_at": 1781275786,
        "updated_at": 1781275786
    },
    "data": [
        {
            "problem": "Fibonacci",
            "description": "Compute nth Fibonacci using memoization or tabulation."
        },
        {
            "problem": "0\/1 Knapsack",
            "description": "Select items to maximize value without exceeding capacity."
        },
        {
            "problem": "Longest Common Subsequence",
            "description": "Find longest subsequence present in two sequences."
        },
        {
            "problem": "Longest Increasing Subsequence",
            "description": "Find longest strictly increasing subsequence."
        },
        {
            "problem": "Coin Change",
            "description": "Minimum coins needed to make a target amount."
        },
        {
            "problem": "Matrix Chain Multiplication",
            "description": "Optimal parenthesization for multiplying matrices."
        },
        {
            "problem": "Edit Distance",
            "description": "Minimum operations to convert one string to another."
        },
        {
            "problem": "Maximum Subarray",
            "description": "Contiguous subarray with the largest sum."
        }
    ]
}