Please generate a unique JSON object suitable for automating the programming task…
- 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": "", "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: 1. The task includes string manipulations with multiple steps. 2. The JSON follows this exact structure and does not include any additional text or variations. 3. The task should be complex and unique, avoiding direct copying from common platforms like LeetCode or similar sources. 4. The solution must not use any imports in the code (i.e., no import statements). 5. The 'Solve' section must remain empty. 6. 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. 7. 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. 8. The 'Function Signature' should strictly follow the format: 'def function_name(parameters) -> return_type:', but the 'Solve' section must remain empty. Ensure that the input description corresponds to the expected parameters in the signature.
Ensure that the solution must not be any of the following titles:
- Max Subsequence Product
- String Transformation with Vowel Shifting
- Assistant
{ "Title": "String Pattern Reversal", "Task Description": "Create a function to reverse segments of a given string. The segments are defined by a pattern of alphabets followed by digits indicating the length of each segment. Reverse only those segments and return the modified string.", "Function Signature": "def reverse_pattern_segments(s: str) -> str:", "Solve": "", "Input": "A string consisting of patterns 'Xn', where X is an alphabet sequence denoting a segment, and n is a digit indicating the length of the segment to reverse.", "Output": "A modified string where the specified segments defined by the pattern have been reversed, leaving the rest of the string intact.", "Examples": [ { "input": "abc3def2gh4ij1", "output": "cba3fed2hg4ij1" }, { "input": "mnop2qr4st1uv3", "output": "ponm2rq4ts1vu3" } ] }