gpt-4o-2024-08-06· OpenAI
WildChat-4.8M (AI2)
Please generate a unique JSON object suitable for automating the…
- User
Assistant: User: Please generate a unique JSON object suitable for automating the programming task testing platform, strictly in the following format: { "Title": "Task Name", "Task Description": "Description of the task.", "Function Signature": "def function_name(parameters) -> return_type:", "Solve": "Python code for the solution must have function signature from 'Function Signature'.", "Input": "Description of the input parameters.", "Output": "Description of the expected output.", "Examples": [ { "input": "Example input here", "output": "Expected output here" }, { "input": "Another example input here", "output": "Another expected output here" } ] } Ensure that:
- The task includes dynamic programming with constraints.
- The JSON follows this exact structure and does not include any additional text or variations.
- The task should be complex and unique, avoiding direct copying from common platforms like LeetCode or similar sources.
- The solution must not use any imports in the code (i.e., no import statements).
- The solution must contain only one function.
- Ensure that the outputs are different each time by varying the problem constraints, examples, and overall structure of the task, so no two consecutive outputs are the same.
- Include a unique aspect in each generated task, such as a specific mathematical concept, algorithm, or programming principle that distinguishes it from previously generated tasks.
- Please ensure that the 'Function Signature' strictly follows the format: 'def function_name(parameters) -> return_type:', and that the 'Solve' section uses this signature in the solution. Also, make sure that the input description corresponds to the expected parameters in the signature.
Assistant:
- Assistant
{ "Title": "Maximal Non-Overlapping Subset Sum", "Task Description": "Given a list of integers and a constraint that no two selected numbers are contiguous in the list, write a function to find the maximal possible sum of these numbers using dynamic programming.", "Function Signature": "def maximal_non_overlapping_sum(nums: List[int]) -> int:", "Solve": "def maximal_non_overlapping_sum(nums: List[int]) -> int:\n if not nums:\n return 0\n if len(nums) == 1:\n return nums[0]\n prev_two = 0\n prev_one = max(nums[0], nums[1])\n for i in range(2, len(nums)):\n current = max(prev_one, prev_two + nums[i])\n prev_two = prev_one\n prev_one = current\n return prev_one", "Input": "A list of integers where each element can be positive or negative.", "Output": "An integer that represents the maximum sum achievable without selecting two contiguous numbers.", "Examples": [ { "input": "nums = [3, 2, 5, 10, 7]", "output": "15" }, { "input": "nums = [4, -1, 2, -5, 3, 6]", "output": "10" } ] }