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 nested structures. 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:
- Hierarchical Lexicographic Sort
- Alphanumeric Pattern Transformation
- Custom Radix Sort with Base Conversion
- Optimal Substructure Graph Traversal
- Multi-Dimensional Array Spiral Sort
- Nested List Sum with Depth Weighting
- Prime Number Path in Graph
- Decoding a Varied Mysterious Cipher
- Unique Character Counter
- Matrix Diagonal Sorting Algorithm
- Minimum Cost Path in a Grid
- Nested Palindrome Checker
- Binary Tree Depth Sum
- Bidirectional Merging Cascade
- String Compression with Character Frequency
- Custom Frequency-Based Sort
- Nested Fibonacci Sequence Sum
- Vowel Consonant Rank Encoding
- Nested Polynomial Evaluation
- Custom Tuple Sorting Challenge
- Dynamic Subset Sum with Constraints
- Dynamic Coin Change with Limited Supply
- Assistant
{ "Title": "Nested Factorial Sequence Evaluation", "Task Description": "Create a function which computes a sequence where each term is a factorial of the previous term’s factorial. The sequence should end when the factorial exceeds a specified limit. The input parameter is a single nested dictionary where each depth level contains a 'start' key with the value being the initial number and a 'limit' key specifying the threshold for the factorial calculations.", "Function Signature": "def nested_factorial_sequence(data: dict) -> list:", "Solve": "", "Input": "A nested dictionary with one level of depth containing 'start' (initial integer value) and 'limit' (threshold for factorial growth).", "Output": "A list of integers representing the computed factorial sequence until the limit is exceeded.", "Examples": [ { "input": "{ 'level1': { 'start': 3, 'limit': 1000 } }", "output": "[3, 6, 720]" }, { "input": "{ 'level1': { 'start': 5, 'limit': 10000 } }", "output": "[5, 120]" } ] }