{"id": 1, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using bubble sort.", "code": "def bubble_sort(buffer):\n n = len(buffer)\n for i in range(n):\n for j in range(0, n - i - 1):\n if buffer[j] > buffer[j + 1]:\n buffer[j], buffer[j + 1] = buffer[j + 1], buffer[j]\n return buffer\n\nprint(bubble_sort([-22, -44, 20, 12, 7]))", "explanation": "Bubble sort on int data, variable named 'buffer', 5 elements."} {"id": 2, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using bubble sort.", "code": "def bubble_sort(values):\n n = len(values)\n for i in range(n):\n for j in range(0, n - i - 1):\n if values[j] > values[j + 1]:\n values[j], values[j + 1] = values[j + 1], values[j]\n return values\n\nprint(bubble_sort([-24, 89, -28, 58, -42]))", "explanation": "Bubble sort on int data, variable named 'values', 5 elements."} {"id": 3, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using bubble sort.", "code": "def bubble_sort(arr):\n n = len(arr)\n for i in range(n):\n for j in range(0, n - i - 1):\n if arr[j] > arr[j + 1]:\n arr[j], arr[j + 1] = arr[j + 1], arr[j]\n return arr\n\nprint(bubble_sort([-27, 5, 9, 79, -44]))", "explanation": "Bubble sort on int data, variable named 'arr', 5 elements."} {"id": 4, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using bubble sort.", "code": "def bubble_sort(input_arr):\n n = len(input_arr)\n for i in range(n):\n for j in range(0, n - i - 1):\n if input_arr[j] > input_arr[j + 1]:\n input_arr[j], input_arr[j + 1] = input_arr[j + 1], input_arr[j]\n return input_arr\n\nprint(bubble_sort([0, 89, 57, 6, 64, 21, -49, -10]))", "explanation": "Bubble sort on int data, variable named 'input_arr', 8 elements."} {"id": 5, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using bubble sort.", "code": "def bubble_sort(seq):\n n = len(seq)\n for i in range(n):\n for j in range(0, n - i - 1):\n if seq[j] > seq[j + 1]:\n seq[j], seq[j + 1] = seq[j + 1], seq[j]\n return seq\n\nprint(bubble_sort([58, 37, 21, -11, 5, 36, -24, -27]))", "explanation": "Bubble sort on int data, variable named 'seq', 8 elements."} {"id": 6, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using bubble sort.", "code": "def bubble_sort(collection):\n n = len(collection)\n for i in range(n):\n for j in range(0, n - i - 1):\n if collection[j] > collection[j + 1]:\n collection[j], collection[j + 1] = collection[j + 1], collection[j]\n return collection\n\nprint(bubble_sort([-26, 41, 38, 17, -39, 67, 87, -19]))", "explanation": "Bubble sort on int data, variable named 'collection', 8 elements."} {"id": 7, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using bubble sort.", "code": "def bubble_sort(entries):\n n = len(entries)\n for i in range(n):\n for j in range(0, n - i - 1):\n if entries[j] > entries[j + 1]:\n entries[j], entries[j + 1] = entries[j + 1], entries[j]\n return entries\n\nprint(bubble_sort([46, -30, 91, 25, 42, 97, -1, -33, -39, 8]))", "explanation": "Bubble sort on int data, variable named 'entries', 10 elements."} {"id": 8, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using bubble sort.", "code": "def bubble_sort(vals):\n n = len(vals)\n for i in range(n):\n for j in range(0, n - i - 1):\n if vals[j] > vals[j + 1]:\n vals[j], vals[j + 1] = vals[j + 1], vals[j]\n return vals\n\nprint(bubble_sort([24, -30, 9, -25, 47, 21, 66, 43, -9, 44]))", "explanation": "Bubble sort on int data, variable named 'vals', 10 elements."} {"id": 9, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using bubble sort.", "code": "def bubble_sort(list1):\n n = len(list1)\n for i in range(n):\n for j in range(0, n - i - 1):\n if list1[j] > list1[j + 1]:\n list1[j], list1[j + 1] = list1[j + 1], list1[j]\n return list1\n\nprint(bubble_sort([3, 18, -32, -7, 86, 12, -9, 68, 47, 19]))", "explanation": "Bubble sort on int data, variable named 'list1', 10 elements."} {"id": 10, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using bubble sort.", "code": "def bubble_sort(entries):\n n = len(entries)\n for i in range(n):\n for j in range(0, n - i - 1):\n if entries[j] > entries[j + 1]:\n entries[j], entries[j + 1] = entries[j + 1], entries[j]\n return entries\n\nprint(bubble_sort([92, 6, 33, -36, 8, -42, 30, 52, 18, -34, 4, 95]))", "explanation": "Bubble sort on int data, variable named 'entries', 12 elements."} {"id": 11, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using bubble sort.", "code": "def bubble_sort(entries):\n n = len(entries)\n for i in range(n):\n for j in range(0, n - i - 1):\n if entries[j] > entries[j + 1]:\n entries[j], entries[j + 1] = entries[j + 1], entries[j]\n return entries\n\nprint(bubble_sort([30, 4, 77, 51, 67, -14, 17, -15, 13, 93, 87, 17]))", "explanation": "Bubble sort on int data, variable named 'entries', 12 elements."} {"id": 12, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using bubble sort.", "code": "def bubble_sort(seq):\n n = len(seq)\n for i in range(n):\n for j in range(0, n - i - 1):\n if seq[j] > seq[j + 1]:\n seq[j], seq[j + 1] = seq[j + 1], seq[j]\n return seq\n\nprint(bubble_sort([99, 59, 99, 52, 42, 6, -15, 80, 76, -27, -38, -22]))", "explanation": "Bubble sort on int data, variable named 'seq', 12 elements."} {"id": 13, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using bubble sort.", "code": "def bubble_sort(values):\n n = len(values)\n for i in range(n):\n for j in range(0, n - i - 1):\n if values[j] > values[j + 1]:\n values[j], values[j + 1] = values[j + 1], values[j]\n return values\n\nprint(bubble_sort([-10, 58, -34, 48, 47, 69, 85, 14, 91, -48, -21, 87, 18, 37, -22]))", "explanation": "Bubble sort on int data, variable named 'values', 15 elements."} {"id": 14, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using bubble sort.", "code": "def bubble_sort(nums):\n n = len(nums)\n for i in range(n):\n for j in range(0, n - i - 1):\n if nums[j] > nums[j + 1]:\n nums[j], nums[j + 1] = nums[j + 1], nums[j]\n return nums\n\nprint(bubble_sort([61, -10, 66, -50, 17, 78, -5, 79, -23, 26, 79, 0, -11, 45, -9]))", "explanation": "Bubble sort on int data, variable named 'nums', 15 elements."} {"id": 15, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using bubble sort.", "code": "def bubble_sort(input_arr):\n n = len(input_arr)\n for i in range(n):\n for j in range(0, n - i - 1):\n if input_arr[j] > input_arr[j + 1]:\n input_arr[j], input_arr[j + 1] = input_arr[j + 1], input_arr[j]\n return input_arr\n\nprint(bubble_sort([85, -50, 32, 75, -46, -22, 42, 28, 11, -36, 11, 95, -30, -29, 74]))", "explanation": "Bubble sort on int data, variable named 'input_arr', 15 elements."} {"id": 16, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using bubble sort.", "code": "def bubble_sort(records):\n n = len(records)\n for i in range(n):\n for j in range(0, n - i - 1):\n if records[j] > records[j + 1]:\n records[j], records[j + 1] = records[j + 1], records[j]\n return records\n\nprint(bubble_sort([-33, 86, -18, -18, 71, 90, -8, 17, 85, 58, 4, 88, 1, 29, 52, 45, 62, 82, 65, -20]))", "explanation": "Bubble sort on int data, variable named 'records', 20 elements."} {"id": 17, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using bubble sort.", "code": "def bubble_sort(items):\n n = len(items)\n for i in range(n):\n for j in range(0, n - i - 1):\n if items[j] > items[j + 1]:\n items[j], items[j + 1] = items[j + 1], items[j]\n return items\n\nprint(bubble_sort([7, -34, 36, -45, 91, 8, 6, -49, -32, -35, 8, -33, -42, 34, -32, 81, 10, 21, 74, 4]))", "explanation": "Bubble sort on int data, variable named 'items', 20 elements."} {"id": 18, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using bubble sort.", "code": "def bubble_sort(input_arr):\n n = len(input_arr)\n for i in range(n):\n for j in range(0, n - i - 1):\n if input_arr[j] > input_arr[j + 1]:\n input_arr[j], input_arr[j + 1] = input_arr[j + 1], input_arr[j]\n return input_arr\n\nprint(bubble_sort([-17, 96, 97, 71, 12, 71, 54, -2, -26, -26, 60, 40, 58, 55, 69, -37, -25, -35, 53, 36]))", "explanation": "Bubble sort on int data, variable named 'input_arr', 20 elements."} {"id": 19, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using bubble sort.", "code": "def bubble_sort(vals):\n n = len(vals)\n for i in range(n):\n for j in range(0, n - i - 1):\n if vals[j] > vals[j + 1]:\n vals[j], vals[j + 1] = vals[j + 1], vals[j]\n return vals\n\nprint(bubble_sort([82.54, 9.59, 2.63, 33.39, 30.2]))", "explanation": "Bubble sort on float data, variable named 'vals', 5 elements."} {"id": 20, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using bubble sort.", "code": "def bubble_sort(nums):\n n = len(nums)\n for i in range(n):\n for j in range(0, n - i - 1):\n if nums[j] > nums[j + 1]:\n nums[j], nums[j + 1] = nums[j + 1], nums[j]\n return nums\n\nprint(bubble_sort([35.05, 84.06, -11.03, 76.15, 81.86]))", "explanation": "Bubble sort on float data, variable named 'nums', 5 elements."} {"id": 21, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using bubble sort.", "code": "def bubble_sort(data):\n n = len(data)\n for i in range(n):\n for j in range(0, n - i - 1):\n if data[j] > data[j + 1]:\n data[j], data[j + 1] = data[j + 1], data[j]\n return data\n\nprint(bubble_sort([-13.98, 98.91, 79.49, 95.31, 90.24]))", "explanation": "Bubble sort on float data, variable named 'data', 5 elements."} {"id": 22, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using bubble sort.", "code": "def bubble_sort(records):\n n = len(records)\n for i in range(n):\n for j in range(0, n - i - 1):\n if records[j] > records[j + 1]:\n records[j], records[j + 1] = records[j + 1], records[j]\n return records\n\nprint(bubble_sort([8.13, 28.36, 37.28, 82.89, 87.39, -0.41, -19.74, 26.46]))", "explanation": "Bubble sort on float data, variable named 'records', 8 elements."} {"id": 23, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using bubble sort.", "code": "def bubble_sort(entries):\n n = len(entries)\n for i in range(n):\n for j in range(0, n - i - 1):\n if entries[j] > entries[j + 1]:\n entries[j], entries[j + 1] = entries[j + 1], entries[j]\n return entries\n\nprint(bubble_sort([73.3, 34.15, 30.34, 93.92, 98.46, 46.14, 65.49, -1.58]))", "explanation": "Bubble sort on float data, variable named 'entries', 8 elements."} {"id": 24, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using bubble sort.", "code": "def bubble_sort(nums):\n n = len(nums)\n for i in range(n):\n for j in range(0, n - i - 1):\n if nums[j] > nums[j + 1]:\n nums[j], nums[j + 1] = nums[j + 1], nums[j]\n return nums\n\nprint(bubble_sort([5.91, -13.04, 67.55, -12.75, 17.32, -14.03, 36.74, 89.41]))", "explanation": "Bubble sort on float data, variable named 'nums', 8 elements."} {"id": 25, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using bubble sort.", "code": "def bubble_sort(input_arr):\n n = len(input_arr)\n for i in range(n):\n for j in range(0, n - i - 1):\n if input_arr[j] > input_arr[j + 1]:\n input_arr[j], input_arr[j + 1] = input_arr[j + 1], input_arr[j]\n return input_arr\n\nprint(bubble_sort([-1.27, 94.33, -10.47, 2.11, 50.81, 60.35, 7.99, -5.73, 85.94, 9.3]))", "explanation": "Bubble sort on float data, variable named 'input_arr', 10 elements."} {"id": 26, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using bubble sort.", "code": "def bubble_sort(elements):\n n = len(elements)\n for i in range(n):\n for j in range(0, n - i - 1):\n if elements[j] > elements[j + 1]:\n elements[j], elements[j + 1] = elements[j + 1], elements[j]\n return elements\n\nprint(bubble_sort([-15.27, -10.24, 58.23, 47.26, 17.65, 11.03, 59.7, 17.39, 11.61, -4.43]))", "explanation": "Bubble sort on float data, variable named 'elements', 10 elements."} {"id": 27, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using bubble sort.", "code": "def bubble_sort(buffer):\n n = len(buffer)\n for i in range(n):\n for j in range(0, n - i - 1):\n if buffer[j] > buffer[j + 1]:\n buffer[j], buffer[j + 1] = buffer[j + 1], buffer[j]\n return buffer\n\nprint(bubble_sort([15.7, 17.63, 69.47, -11.37, 34.54, 98.82, 98.54, -11.28, 5.37, 11.56]))", "explanation": "Bubble sort on float data, variable named 'buffer', 10 elements."} {"id": 28, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using bubble sort.", "code": "def bubble_sort(entries):\n n = len(entries)\n for i in range(n):\n for j in range(0, n - i - 1):\n if entries[j] > entries[j + 1]:\n entries[j], entries[j + 1] = entries[j + 1], entries[j]\n return entries\n\nprint(bubble_sort([21.53, -11.81, 9.07, 13.91, 32.14, 44.64, 16.0, 97.08, 76.04, 42.94, 59.48, 46.0]))", "explanation": "Bubble sort on float data, variable named 'entries', 12 elements."} {"id": 29, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using bubble sort.", "code": "def bubble_sort(entries):\n n = len(entries)\n for i in range(n):\n for j in range(0, n - i - 1):\n if entries[j] > entries[j + 1]:\n entries[j], entries[j + 1] = entries[j + 1], entries[j]\n return entries\n\nprint(bubble_sort([58.94, 91.73, -4.02, -6.26, -7.26, 45.83, 12.41, 51.97, 65.4, 4.23, 55.47, 11.41]))", "explanation": "Bubble sort on float data, variable named 'entries', 12 elements."} {"id": 30, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using bubble sort.", "code": "def bubble_sort(dataset):\n n = len(dataset)\n for i in range(n):\n for j in range(0, n - i - 1):\n if dataset[j] > dataset[j + 1]:\n dataset[j], dataset[j + 1] = dataset[j + 1], dataset[j]\n return dataset\n\nprint(bubble_sort([9.88, 88.07, -13.95, 55.48, 78.69, -14.75, 19.69, -4.43, 96.6, -0.77, 32.58, 63.97]))", "explanation": "Bubble sort on float data, variable named 'dataset', 12 elements."} {"id": 31, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using bubble sort.", "code": "def bubble_sort(input_arr):\n n = len(input_arr)\n for i in range(n):\n for j in range(0, n - i - 1):\n if input_arr[j] > input_arr[j + 1]:\n input_arr[j], input_arr[j + 1] = input_arr[j + 1], input_arr[j]\n return input_arr\n\nprint(bubble_sort([-18.85, -11.05, 85.09, 87.57, 44.93, 79.32, 49.32, -2.38, -4.83, 16.68, 86.98, 74.74, 82.42, 86.97, 5.0]))", "explanation": "Bubble sort on float data, variable named 'input_arr', 15 elements."} {"id": 32, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using bubble sort.", "code": "def bubble_sort(items):\n n = len(items)\n for i in range(n):\n for j in range(0, n - i - 1):\n if items[j] > items[j + 1]:\n items[j], items[j + 1] = items[j + 1], items[j]\n return items\n\nprint(bubble_sort([59.37, 22.09, 46.63, 84.09, 95.89, 69.19, 90.17, 8.17, -0.66, 75.19, 1.07, 29.06, 1.34, 90.01, 73.1]))", "explanation": "Bubble sort on float data, variable named 'items', 15 elements."} {"id": 33, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using bubble sort.", "code": "def bubble_sort(collection):\n n = len(collection)\n for i in range(n):\n for j in range(0, n - i - 1):\n if collection[j] > collection[j + 1]:\n collection[j], collection[j + 1] = collection[j + 1], collection[j]\n return collection\n\nprint(bubble_sort([75.47, 82.82, 76.48, 11.75, 73.7, -7.14, 83.79, 82.17, 6.47, 77.17, 34.78, 16.32, 74.65, 7.08, -17.18]))", "explanation": "Bubble sort on float data, variable named 'collection', 15 elements."} {"id": 34, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using bubble sort.", "code": "def bubble_sort(items):\n n = len(items)\n for i in range(n):\n for j in range(0, n - i - 1):\n if items[j] > items[j + 1]:\n items[j], items[j + 1] = items[j + 1], items[j]\n return items\n\nprint(bubble_sort([27.42, 13.15, -11.74, 72.03, 21.79, 40.62, 60.86, 80.4, 19.41, -16.72, 84.37, 11.08, 49.09, 97.04, -15.45, 50.99, 21.14, 73.58, 31.93, 97.12]))", "explanation": "Bubble sort on float data, variable named 'items', 20 elements."} {"id": 35, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using bubble sort.", "code": "def bubble_sort(data):\n n = len(data)\n for i in range(n):\n for j in range(0, n - i - 1):\n if data[j] > data[j + 1]:\n data[j], data[j + 1] = data[j + 1], data[j]\n return data\n\nprint(bubble_sort([25.84, 48.61, 10.31, 64.35, -19.8, 90.14, 44.08, 65.61, 68.29, 59.8, 23.34, -11.67, 59.04, 19.29, 17.36, 80.91, 65.65, 15.74, 16.8, 28.6]))", "explanation": "Bubble sort on float data, variable named 'data', 20 elements."} {"id": 36, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using bubble sort.", "code": "def bubble_sort(collection):\n n = len(collection)\n for i in range(n):\n for j in range(0, n - i - 1):\n if collection[j] > collection[j + 1]:\n collection[j], collection[j + 1] = collection[j + 1], collection[j]\n return collection\n\nprint(bubble_sort([62.97, 45.98, 2.83, 59.13, 25.12, 69.03, 0.71, 47.72, 28.32, 79.21, 16.16, 5.01, 73.51, 52.19, 18.35, 32.57, 60.4, 40.83, 74.45, 94.22]))", "explanation": "Bubble sort on float data, variable named 'collection', 20 elements."} {"id": 37, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(seq) {\n const n = seq.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (seq[j] > seq[j + 1]) {\n [seq[j], seq[j + 1]] = [seq[j + 1], seq[j]];\n }\n }\n }\n return seq;\n}\n\nconsole.log(bubbleSort([-7, -29, 22, 81, 35]));", "explanation": "Bubble sort on int data, variable named 'seq', 5 elements."} {"id": 38, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(data) {\n const n = data.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (data[j] > data[j + 1]) {\n [data[j], data[j + 1]] = [data[j + 1], data[j]];\n }\n }\n }\n return data;\n}\n\nconsole.log(bubbleSort([10, 29, 7, 0, -13]));", "explanation": "Bubble sort on int data, variable named 'data', 5 elements."} {"id": 39, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(arr) {\n const n = arr.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (arr[j] > arr[j + 1]) {\n [arr[j], arr[j + 1]] = [arr[j + 1], arr[j]];\n }\n }\n }\n return arr;\n}\n\nconsole.log(bubbleSort([-39, 12, 71, -32, 66]));", "explanation": "Bubble sort on int data, variable named 'arr', 5 elements."} {"id": 40, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(collection) {\n const n = collection.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (collection[j] > collection[j + 1]) {\n [collection[j], collection[j + 1]] = [collection[j + 1], collection[j]];\n }\n }\n }\n return collection;\n}\n\nconsole.log(bubbleSort([97, -1, 48, 76, 52, 12, -13, -49]));", "explanation": "Bubble sort on int data, variable named 'collection', 8 elements."} {"id": 41, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(entries) {\n const n = entries.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (entries[j] > entries[j + 1]) {\n [entries[j], entries[j + 1]] = [entries[j + 1], entries[j]];\n }\n }\n }\n return entries;\n}\n\nconsole.log(bubbleSort([-23, 58, 6, -5, 82, 68, -38, 92]));", "explanation": "Bubble sort on int data, variable named 'entries', 8 elements."} {"id": 42, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(items) {\n const n = items.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (items[j] > items[j + 1]) {\n [items[j], items[j + 1]] = [items[j + 1], items[j]];\n }\n }\n }\n return items;\n}\n\nconsole.log(bubbleSort([-19, 66, -16, 68, 85, 93, 31, 63]));", "explanation": "Bubble sort on int data, variable named 'items', 8 elements."} {"id": 43, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(elements) {\n const n = elements.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (elements[j] > elements[j + 1]) {\n [elements[j], elements[j + 1]] = [elements[j + 1], elements[j]];\n }\n }\n }\n return elements;\n}\n\nconsole.log(bubbleSort([79, 59, 90, 64, -10, 71, 65, 16, 13, 20]));", "explanation": "Bubble sort on int data, variable named 'elements', 10 elements."} {"id": 44, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(vals) {\n const n = vals.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (vals[j] > vals[j + 1]) {\n [vals[j], vals[j + 1]] = [vals[j + 1], vals[j]];\n }\n }\n }\n return vals;\n}\n\nconsole.log(bubbleSort([83, 74, 11, 20, 62, -31, 23, 10, 19, 35]));", "explanation": "Bubble sort on int data, variable named 'vals', 10 elements."} {"id": 45, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(list1) {\n const n = list1.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (list1[j] > list1[j + 1]) {\n [list1[j], list1[j + 1]] = [list1[j + 1], list1[j]];\n }\n }\n }\n return list1;\n}\n\nconsole.log(bubbleSort([88, -30, -15, -12, 9, 48, -11, 4, -34, 56]));", "explanation": "Bubble sort on int data, variable named 'list1', 10 elements."} {"id": 46, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(collection) {\n const n = collection.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (collection[j] > collection[j + 1]) {\n [collection[j], collection[j + 1]] = [collection[j + 1], collection[j]];\n }\n }\n }\n return collection;\n}\n\nconsole.log(bubbleSort([34, 88, 69, 56, -35, 2, 57, 49, 99, -45, 97, 47]));", "explanation": "Bubble sort on int data, variable named 'collection', 12 elements."} {"id": 47, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(dataset) {\n const n = dataset.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (dataset[j] > dataset[j + 1]) {\n [dataset[j], dataset[j + 1]] = [dataset[j + 1], dataset[j]];\n }\n }\n }\n return dataset;\n}\n\nconsole.log(bubbleSort([-49, 40, 26, 49, 57, 87, 89, 6, 74, 6, 19, 61]));", "explanation": "Bubble sort on int data, variable named 'dataset', 12 elements."} {"id": 48, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(dataset) {\n const n = dataset.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (dataset[j] > dataset[j + 1]) {\n [dataset[j], dataset[j + 1]] = [dataset[j + 1], dataset[j]];\n }\n }\n }\n return dataset;\n}\n\nconsole.log(bubbleSort([-43, 49, 36, 53, -8, 69, -18, 86, -44, 50, 94, -44]));", "explanation": "Bubble sort on int data, variable named 'dataset', 12 elements."} {"id": 49, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(data) {\n const n = data.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (data[j] > data[j + 1]) {\n [data[j], data[j + 1]] = [data[j + 1], data[j]];\n }\n }\n }\n return data;\n}\n\nconsole.log(bubbleSort([59, -16, 68, -4, -38, 16, 47, 33, 4, 66, 33, 36, 47, 21, 57]));", "explanation": "Bubble sort on int data, variable named 'data', 15 elements."} {"id": 50, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(nums) {\n const n = nums.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (nums[j] > nums[j + 1]) {\n [nums[j], nums[j + 1]] = [nums[j + 1], nums[j]];\n }\n }\n }\n return nums;\n}\n\nconsole.log(bubbleSort([-30, 70, -46, 88, -37, 39, 7, -33, -40, -43, 13, 1, -45, -11, 11]));", "explanation": "Bubble sort on int data, variable named 'nums', 15 elements."} {"id": 51, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(values) {\n const n = values.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (values[j] > values[j + 1]) {\n [values[j], values[j + 1]] = [values[j + 1], values[j]];\n }\n }\n }\n return values;\n}\n\nconsole.log(bubbleSort([71, -21, 94, 5, 69, 15, 44, -8, -21, -9, 29, -23, 98, -44, 29]));", "explanation": "Bubble sort on int data, variable named 'values', 15 elements."} {"id": 52, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(elements) {\n const n = elements.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (elements[j] > elements[j + 1]) {\n [elements[j], elements[j + 1]] = [elements[j + 1], elements[j]];\n }\n }\n }\n return elements;\n}\n\nconsole.log(bubbleSort([46, 51, 0, -31, 12, -24, 27, -20, 94, -40, 38, 86, 59, 44, -33, 79, 37, -47, 57, 75]));", "explanation": "Bubble sort on int data, variable named 'elements', 20 elements."} {"id": 53, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(data) {\n const n = data.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (data[j] > data[j + 1]) {\n [data[j], data[j + 1]] = [data[j + 1], data[j]];\n }\n }\n }\n return data;\n}\n\nconsole.log(bubbleSort([60, 42, 67, -11, 61, -5, 83, 19, 87, 73, 69, 61, 18, 32, 12, -28, 21, 65, 12, 68]));", "explanation": "Bubble sort on int data, variable named 'data', 20 elements."} {"id": 54, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(elements) {\n const n = elements.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (elements[j] > elements[j + 1]) {\n [elements[j], elements[j + 1]] = [elements[j + 1], elements[j]];\n }\n }\n }\n return elements;\n}\n\nconsole.log(bubbleSort([47, 36, -43, 76, 33, -4, 74, 4, 40, 16, 37, 21, 20, 92, -48, 82, -2, -29, 11, 54]));", "explanation": "Bubble sort on int data, variable named 'elements', 20 elements."} {"id": 55, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(dataset) {\n const n = dataset.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (dataset[j] > dataset[j + 1]) {\n [dataset[j], dataset[j + 1]] = [dataset[j + 1], dataset[j]];\n }\n }\n }\n return dataset;\n}\n\nconsole.log(bubbleSort([46.07, 8.6, 36.66, 64.71, 33.33]));", "explanation": "Bubble sort on float data, variable named 'dataset', 5 elements."} {"id": 56, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(arr) {\n const n = arr.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (arr[j] > arr[j + 1]) {\n [arr[j], arr[j + 1]] = [arr[j + 1], arr[j]];\n }\n }\n }\n return arr;\n}\n\nconsole.log(bubbleSort([-8.93, 6.37, 62.32, 16.44, 49.21]));", "explanation": "Bubble sort on float data, variable named 'arr', 5 elements."} {"id": 57, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(dataset) {\n const n = dataset.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (dataset[j] > dataset[j + 1]) {\n [dataset[j], dataset[j + 1]] = [dataset[j + 1], dataset[j]];\n }\n }\n }\n return dataset;\n}\n\nconsole.log(bubbleSort([45.86, 20.91, 98.6, 45.5, 21.87]));", "explanation": "Bubble sort on float data, variable named 'dataset', 5 elements."} {"id": 58, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(dataset) {\n const n = dataset.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (dataset[j] > dataset[j + 1]) {\n [dataset[j], dataset[j + 1]] = [dataset[j + 1], dataset[j]];\n }\n }\n }\n return dataset;\n}\n\nconsole.log(bubbleSort([12.24, 9.92, -5.64, 2.92, -5.77, 43.77, 70.7, 2.03]));", "explanation": "Bubble sort on float data, variable named 'dataset', 8 elements."} {"id": 59, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(items) {\n const n = items.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (items[j] > items[j + 1]) {\n [items[j], items[j + 1]] = [items[j + 1], items[j]];\n }\n }\n }\n return items;\n}\n\nconsole.log(bubbleSort([67.89, 12.9, 50.16, 70.46, 51.02, 96.68, 79.08, 15.25]));", "explanation": "Bubble sort on float data, variable named 'items', 8 elements."} {"id": 60, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(list1) {\n const n = list1.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (list1[j] > list1[j + 1]) {\n [list1[j], list1[j + 1]] = [list1[j + 1], list1[j]];\n }\n }\n }\n return list1;\n}\n\nconsole.log(bubbleSort([1.35, -18.32, 43.56, 12.64, 95.94, 45.85, 62.99, -4.97]));", "explanation": "Bubble sort on float data, variable named 'list1', 8 elements."} {"id": 61, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(records) {\n const n = records.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (records[j] > records[j + 1]) {\n [records[j], records[j + 1]] = [records[j + 1], records[j]];\n }\n }\n }\n return records;\n}\n\nconsole.log(bubbleSort([69.58, -7.79, -18.54, 13.84, 36.97, 20.54, 94.89, 10.04, 82.55, -6.42]));", "explanation": "Bubble sort on float data, variable named 'records', 10 elements."} {"id": 62, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(data) {\n const n = data.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (data[j] > data[j + 1]) {\n [data[j], data[j + 1]] = [data[j + 1], data[j]];\n }\n }\n }\n return data;\n}\n\nconsole.log(bubbleSort([27.68, -11.18, 54.9, -13.62, -2.25, 46.98, 16.16, 98.28, -5.9, 70.97]));", "explanation": "Bubble sort on float data, variable named 'data', 10 elements."} {"id": 63, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(elements) {\n const n = elements.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (elements[j] > elements[j + 1]) {\n [elements[j], elements[j + 1]] = [elements[j + 1], elements[j]];\n }\n }\n }\n return elements;\n}\n\nconsole.log(bubbleSort([50.94, 53.59, 72.31, 25.26, 88.11, 15.39, 50.03, 31.03, 47.67, -12.83]));", "explanation": "Bubble sort on float data, variable named 'elements', 10 elements."} {"id": 64, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(seq) {\n const n = seq.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (seq[j] > seq[j + 1]) {\n [seq[j], seq[j + 1]] = [seq[j + 1], seq[j]];\n }\n }\n }\n return seq;\n}\n\nconsole.log(bubbleSort([-8.19, 70.77, 54.44, 11.49, -10.34, 8.54, 45.69, -1.37, 28.61, 62.04, 35.92, -16.12]));", "explanation": "Bubble sort on float data, variable named 'seq', 12 elements."} {"id": 65, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(nums) {\n const n = nums.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (nums[j] > nums[j + 1]) {\n [nums[j], nums[j + 1]] = [nums[j + 1], nums[j]];\n }\n }\n }\n return nums;\n}\n\nconsole.log(bubbleSort([64.13, 63.66, 34.03, 61.8, 89.95, 73.75, 54.38, 58.68, 91.11, 30.59, 44.8, 57.07]));", "explanation": "Bubble sort on float data, variable named 'nums', 12 elements."} {"id": 66, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(entries) {\n const n = entries.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (entries[j] > entries[j + 1]) {\n [entries[j], entries[j + 1]] = [entries[j + 1], entries[j]];\n }\n }\n }\n return entries;\n}\n\nconsole.log(bubbleSort([11.61, -3.07, -12.9, 74.32, 50.81, 78.08, 89.62, 32.26, 35.78, 16.19, 27.9, 12.4]));", "explanation": "Bubble sort on float data, variable named 'entries', 12 elements."} {"id": 67, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(input_arr) {\n const n = input_arr.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (input_arr[j] > input_arr[j + 1]) {\n [input_arr[j], input_arr[j + 1]] = [input_arr[j + 1], input_arr[j]];\n }\n }\n }\n return input_arr;\n}\n\nconsole.log(bubbleSort([38.76, -10.43, -15.26, 31.41, 18.36, 9.79, -9.13, 94.47, 79.48, 48.45, 93.14, 98.95, 60.0, 12.07, -15.21]));", "explanation": "Bubble sort on float data, variable named 'input_arr', 15 elements."} {"id": 68, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(vals) {\n const n = vals.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (vals[j] > vals[j + 1]) {\n [vals[j], vals[j + 1]] = [vals[j + 1], vals[j]];\n }\n }\n }\n return vals;\n}\n\nconsole.log(bubbleSort([0.85, 41.76, 32.63, 13.1, 98.64, 31.87, 76.9, 95.32, 35.93, 28.59, 18.21, -7.55, -0.86, 28.99, 38.96]));", "explanation": "Bubble sort on float data, variable named 'vals', 15 elements."} {"id": 69, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(buffer) {\n const n = buffer.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (buffer[j] > buffer[j + 1]) {\n [buffer[j], buffer[j + 1]] = [buffer[j + 1], buffer[j]];\n }\n }\n }\n return buffer;\n}\n\nconsole.log(bubbleSort([92.48, 76.81, 45.46, 34.12, 17.43, 18.47, 95.45, 28.1, 41.24, 97.59, 58.26, 44.57, 29.18, 2.32, 23.05]));", "explanation": "Bubble sort on float data, variable named 'buffer', 15 elements."} {"id": 70, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(vals) {\n const n = vals.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (vals[j] > vals[j + 1]) {\n [vals[j], vals[j + 1]] = [vals[j + 1], vals[j]];\n }\n }\n }\n return vals;\n}\n\nconsole.log(bubbleSort([39.32, 32.6, -13.86, 11.78, -4.41, 14.28, 84.82, 37.68, -16.56, 54.97, 75.12, 64.46, 16.98, -18.37, 28.55, 6.74, 80.13, -6.5, 92.7, 57.08]));", "explanation": "Bubble sort on float data, variable named 'vals', 20 elements."} {"id": 71, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(values) {\n const n = values.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (values[j] > values[j + 1]) {\n [values[j], values[j + 1]] = [values[j + 1], values[j]];\n }\n }\n }\n return values;\n}\n\nconsole.log(bubbleSort([39.31, 65.28, 40.56, 12.54, 79.33, 96.65, 9.0, 45.6, 25.65, 89.7, 40.48, 84.64, 82.82, 12.87, 74.01, 29.38, 91.18, 40.42, 77.65, 13.66]));", "explanation": "Bubble sort on float data, variable named 'values', 20 elements."} {"id": 72, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(nums) {\n const n = nums.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (nums[j] > nums[j + 1]) {\n [nums[j], nums[j + 1]] = [nums[j + 1], nums[j]];\n }\n }\n }\n return nums;\n}\n\nconsole.log(bubbleSort([79.66, 49.01, 58.53, 82.97, 33.14, 37.64, 19.56, 70.78, 24.89, 91.01, 83.48, 96.71, 8.42, 25.57, 81.87, 28.88, 17.86, 36.28, 88.7, 25.37]));", "explanation": "Bubble sort on float data, variable named 'nums', 20 elements."} {"id": 73, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(buffer) {\n const n = buffer.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (buffer[j] > buffer[j + 1]) {\n [buffer[j], buffer[j + 1]] = [buffer[j + 1], buffer[j]];\n }\n }\n }\n return buffer;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([-12, 76, -41, -18, 78]));", "explanation": "Bubble sort on int data, variable named 'buffer', 5 elements."} {"id": 74, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(elements) {\n const n = elements.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (elements[j] > elements[j + 1]) {\n [elements[j], elements[j + 1]] = [elements[j + 1], elements[j]];\n }\n }\n }\n return elements;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([34, -25, 62, -25, 84]));", "explanation": "Bubble sort on int data, variable named 'elements', 5 elements."} {"id": 75, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(entries) {\n const n = entries.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (entries[j] > entries[j + 1]) {\n [entries[j], entries[j + 1]] = [entries[j + 1], entries[j]];\n }\n }\n }\n return entries;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([66, -47, -14, 54, -11]));", "explanation": "Bubble sort on int data, variable named 'entries', 5 elements."} {"id": 76, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(data) {\n const n = data.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (data[j] > data[j + 1]) {\n [data[j], data[j + 1]] = [data[j + 1], data[j]];\n }\n }\n }\n return data;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([70, 17, 36, 51, -30, 34, 86, 47]));", "explanation": "Bubble sort on int data, variable named 'data', 8 elements."} {"id": 77, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(list1) {\n const n = list1.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (list1[j] > list1[j + 1]) {\n [list1[j], list1[j + 1]] = [list1[j + 1], list1[j]];\n }\n }\n }\n return list1;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([74, 88, -41, -33, 10, 23, 8, -27]));", "explanation": "Bubble sort on int data, variable named 'list1', 8 elements."} {"id": 78, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(collection) {\n const n = collection.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (collection[j] > collection[j + 1]) {\n [collection[j], collection[j + 1]] = [collection[j + 1], collection[j]];\n }\n }\n }\n return collection;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([-25, -25, 63, -8, 26, -43, -39, 33]));", "explanation": "Bubble sort on int data, variable named 'collection', 8 elements."} {"id": 79, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(vals) {\n const n = vals.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (vals[j] > vals[j + 1]) {\n [vals[j], vals[j + 1]] = [vals[j + 1], vals[j]];\n }\n }\n }\n return vals;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([-36, 25, 41, 45, 60, -13, 12, 85, 55, 94]));", "explanation": "Bubble sort on int data, variable named 'vals', 10 elements."} {"id": 80, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(buffer) {\n const n = buffer.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (buffer[j] > buffer[j + 1]) {\n [buffer[j], buffer[j + 1]] = [buffer[j + 1], buffer[j]];\n }\n }\n }\n return buffer;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([-4, -7, -6, -30, 47, 11, 77, 99, -14, 9]));", "explanation": "Bubble sort on int data, variable named 'buffer', 10 elements."} {"id": 81, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(dataset) {\n const n = dataset.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (dataset[j] > dataset[j + 1]) {\n [dataset[j], dataset[j + 1]] = [dataset[j + 1], dataset[j]];\n }\n }\n }\n return dataset;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([15, 67, 15, -48, 69, 23, 89, -10, -32, 63]));", "explanation": "Bubble sort on int data, variable named 'dataset', 10 elements."} {"id": 82, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(list1) {\n const n = list1.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (list1[j] > list1[j + 1]) {\n [list1[j], list1[j + 1]] = [list1[j + 1], list1[j]];\n }\n }\n }\n return list1;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([26, 58, 14, 66, 27, 0, 48, 73, -23, 10, 47, 96]));", "explanation": "Bubble sort on int data, variable named 'list1', 12 elements."} {"id": 83, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(list1) {\n const n = list1.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (list1[j] > list1[j + 1]) {\n [list1[j], list1[j + 1]] = [list1[j + 1], list1[j]];\n }\n }\n }\n return list1;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([97, 25, 25, -45, 51, 20, -48, 94, -38, 77, 23, 8]));", "explanation": "Bubble sort on int data, variable named 'list1', 12 elements."} {"id": 84, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(elements) {\n const n = elements.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (elements[j] > elements[j + 1]) {\n [elements[j], elements[j + 1]] = [elements[j + 1], elements[j]];\n }\n }\n }\n return elements;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([40, 6, -2, 14, -15, -26, -40, 29, 62, -42, 98, 43]));", "explanation": "Bubble sort on int data, variable named 'elements', 12 elements."} {"id": 85, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(seq) {\n const n = seq.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (seq[j] > seq[j + 1]) {\n [seq[j], seq[j + 1]] = [seq[j + 1], seq[j]];\n }\n }\n }\n return seq;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([-17, -27, 25, 33, 56, -6, 1, -17, 88, 43, 85, 78, 19, -8, 15]));", "explanation": "Bubble sort on int data, variable named 'seq', 15 elements."} {"id": 86, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(entries) {\n const n = entries.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (entries[j] > entries[j + 1]) {\n [entries[j], entries[j + 1]] = [entries[j + 1], entries[j]];\n }\n }\n }\n return entries;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([73, 25, 36, -21, 69, -31, -14, 7, 51, 92, 43, -27, 51, -47, 17]));", "explanation": "Bubble sort on int data, variable named 'entries', 15 elements."} {"id": 87, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(input_arr) {\n const n = input_arr.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (input_arr[j] > input_arr[j + 1]) {\n [input_arr[j], input_arr[j + 1]] = [input_arr[j + 1], input_arr[j]];\n }\n }\n }\n return input_arr;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([-19, 66, 44, 17, 99, 47, 45, -23, 9, 70, -44, 93, 33, 6, -34]));", "explanation": "Bubble sort on int data, variable named 'input_arr', 15 elements."} {"id": 88, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(buffer) {\n const n = buffer.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (buffer[j] > buffer[j + 1]) {\n [buffer[j], buffer[j + 1]] = [buffer[j + 1], buffer[j]];\n }\n }\n }\n return buffer;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([68, 27, 54, -21, -15, -39, -41, 27, 76, -21, -26, 10, 87, -16, 49, 66, 44, 88, 57, -11]));", "explanation": "Bubble sort on int data, variable named 'buffer', 20 elements."} {"id": 89, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(entries) {\n const n = entries.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (entries[j] > entries[j + 1]) {\n [entries[j], entries[j + 1]] = [entries[j + 1], entries[j]];\n }\n }\n }\n return entries;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([56, -25, 75, 54, 21, -42, 44, 5, 63, 63, 10, 42, -25, 44, 89, 41, -35, 51, 20, -2]));", "explanation": "Bubble sort on int data, variable named 'entries', 20 elements."} {"id": 90, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using bubble sort.", "code": "function bubbleSort(data) {\n const n = data.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (data[j] > data[j + 1]) {\n [data[j], data[j + 1]] = [data[j + 1], data[j]];\n }\n }\n }\n return data;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([66, -27, 4, -45, -38, 35, 12, -18, 94, 2, -33, 91, 3, 5, 9, 34, -13, -50, 20, -13]));", "explanation": "Bubble sort on int data, variable named 'data', 20 elements."} {"id": 91, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(values) {\n const n = values.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (values[j] > values[j + 1]) {\n [values[j], values[j + 1]] = [values[j + 1], values[j]];\n }\n }\n }\n return values;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([44.29, 75.02, -6.92, 83.11, -4.32]));", "explanation": "Bubble sort on float data, variable named 'values', 5 elements."} {"id": 92, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(list1) {\n const n = list1.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (list1[j] > list1[j + 1]) {\n [list1[j], list1[j + 1]] = [list1[j + 1], list1[j]];\n }\n }\n }\n return list1;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([74.01, 8.31, 18.53, 0.74, -13.76]));", "explanation": "Bubble sort on float data, variable named 'list1', 5 elements."} {"id": 93, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(seq) {\n const n = seq.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (seq[j] > seq[j + 1]) {\n [seq[j], seq[j + 1]] = [seq[j + 1], seq[j]];\n }\n }\n }\n return seq;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([30.09, -6.48, -12.44, 33.34, 23.08]));", "explanation": "Bubble sort on float data, variable named 'seq', 5 elements."} {"id": 94, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(elements) {\n const n = elements.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (elements[j] > elements[j + 1]) {\n [elements[j], elements[j + 1]] = [elements[j + 1], elements[j]];\n }\n }\n }\n return elements;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([-7.02, 39.96, 92.5, -14.84, 73.2, 83.17, 42.05, 34.51]));", "explanation": "Bubble sort on float data, variable named 'elements', 8 elements."} {"id": 95, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(arr) {\n const n = arr.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (arr[j] > arr[j + 1]) {\n [arr[j], arr[j + 1]] = [arr[j + 1], arr[j]];\n }\n }\n }\n return arr;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([-12.76, 37.0, 27.79, 61.65, 38.34, 88.25, -11.25, -10.39]));", "explanation": "Bubble sort on float data, variable named 'arr', 8 elements."} {"id": 96, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(elements) {\n const n = elements.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (elements[j] > elements[j + 1]) {\n [elements[j], elements[j + 1]] = [elements[j + 1], elements[j]];\n }\n }\n }\n return elements;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([-2.35, -4.98, 54.29, 49.66, 64.75, 25.33, 51.09, 15.09]));", "explanation": "Bubble sort on float data, variable named 'elements', 8 elements."} {"id": 97, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(input_arr) {\n const n = input_arr.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (input_arr[j] > input_arr[j + 1]) {\n [input_arr[j], input_arr[j + 1]] = [input_arr[j + 1], input_arr[j]];\n }\n }\n }\n return input_arr;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([52.05, -8.2, 63.51, 81.48, 57.46, 71.51, 65.78, 5.59, 33.74, 7.19]));", "explanation": "Bubble sort on float data, variable named 'input_arr', 10 elements."} {"id": 98, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(list1) {\n const n = list1.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (list1[j] > list1[j + 1]) {\n [list1[j], list1[j + 1]] = [list1[j + 1], list1[j]];\n }\n }\n }\n return list1;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([78.46, 27.45, 66.82, 17.19, 17.19, 10.33, 93.48, 61.73, 36.44, -9.14]));", "explanation": "Bubble sort on float data, variable named 'list1', 10 elements."} {"id": 99, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(data) {\n const n = data.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (data[j] > data[j + 1]) {\n [data[j], data[j + 1]] = [data[j + 1], data[j]];\n }\n }\n }\n return data;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([-8.91, -8.51, 67.92, 76.6, 46.21, 49.79, 46.83, 19.23, -5.45, 22.08]));", "explanation": "Bubble sort on float data, variable named 'data', 10 elements."} {"id": 100, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(buffer) {\n const n = buffer.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (buffer[j] > buffer[j + 1]) {\n [buffer[j], buffer[j + 1]] = [buffer[j + 1], buffer[j]];\n }\n }\n }\n return buffer;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([91.99, 30.33, 88.99, -13.88, 14.23, 17.18, -7.67, 40.38, -1.59, 37.38, 80.83, 21.66]));", "explanation": "Bubble sort on float data, variable named 'buffer', 12 elements."} {"id": 101, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(input_arr) {\n const n = input_arr.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (input_arr[j] > input_arr[j + 1]) {\n [input_arr[j], input_arr[j + 1]] = [input_arr[j + 1], input_arr[j]];\n }\n }\n }\n return input_arr;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([23.74, 70.75, 48.32, 76.06, 80.57, 95.97, 77.39, 53.02, 56.48, -16.88, 90.56, 78.71]));", "explanation": "Bubble sort on float data, variable named 'input_arr', 12 elements."} {"id": 102, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(nums) {\n const n = nums.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (nums[j] > nums[j + 1]) {\n [nums[j], nums[j + 1]] = [nums[j + 1], nums[j]];\n }\n }\n }\n return nums;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([-16.55, 12.52, 70.73, 89.66, 21.77, 1.59, -2.95, 58.22, -11.72, 68.18, 95.65, -9.08]));", "explanation": "Bubble sort on float data, variable named 'nums', 12 elements."} {"id": 103, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(input_arr) {\n const n = input_arr.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (input_arr[j] > input_arr[j + 1]) {\n [input_arr[j], input_arr[j + 1]] = [input_arr[j + 1], input_arr[j]];\n }\n }\n }\n return input_arr;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([5.6, 29.96, 20.57, 24.04, 65.87, 72.44, 47.54, -9.89, -13.74, -1.27, 53.52, 60.2, 12.38, 58.77, 37.79]));", "explanation": "Bubble sort on float data, variable named 'input_arr', 15 elements."} {"id": 104, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(dataset) {\n const n = dataset.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (dataset[j] > dataset[j + 1]) {\n [dataset[j], dataset[j + 1]] = [dataset[j + 1], dataset[j]];\n }\n }\n }\n return dataset;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([29.29, 5.65, 40.97, 21.08, -6.8, 60.71, 50.58, 42.71, 16.7, 6.24, 97.15, -13.48, 4.33, 92.49, 71.31]));", "explanation": "Bubble sort on float data, variable named 'dataset', 15 elements."} {"id": 105, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(vals) {\n const n = vals.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (vals[j] > vals[j + 1]) {\n [vals[j], vals[j + 1]] = [vals[j + 1], vals[j]];\n }\n }\n }\n return vals;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([10.41, 19.05, -19.08, 68.89, 0.91, 25.24, 63.74, 39.53, 79.17, 75.94, -11.42, 82.55, -14.97, -17.77, 89.62]));", "explanation": "Bubble sort on float data, variable named 'vals', 15 elements."} {"id": 106, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(records) {\n const n = records.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (records[j] > records[j + 1]) {\n [records[j], records[j + 1]] = [records[j + 1], records[j]];\n }\n }\n }\n return records;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([17.25, 31.08, 28.13, 56.18, 14.45, 28.2, 94.98, 0.45, 92.77, 34.75, 62.06, 23.06, 31.97, -7.4, 31.85, 27.65, -10.64, 83.59, 68.75, 6.37]));", "explanation": "Bubble sort on float data, variable named 'records', 20 elements."} {"id": 107, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(vals) {\n const n = vals.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (vals[j] > vals[j + 1]) {\n [vals[j], vals[j + 1]] = [vals[j + 1], vals[j]];\n }\n }\n }\n return vals;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([0.01, 40.75, -6.43, 40.68, 87.8, 21.58, 66.56, 77.45, 76.99, 8.12, -2.57, 3.48, 51.69, 70.47, 58.01, 1.08, 71.97, 38.8, 69.78, 70.43]));", "explanation": "Bubble sort on float data, variable named 'vals', 20 elements."} {"id": 108, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using bubble sort.", "code": "function bubbleSort(dataset) {\n const n = dataset.length;\n for (let i = 0; i < n; i++) {\n for (let j = 0; j < n - i - 1; j++) {\n if (dataset[j] > dataset[j + 1]) {\n [dataset[j], dataset[j + 1]] = [dataset[j + 1], dataset[j]];\n }\n }\n }\n return dataset;\n}\n\nmodule.exports = { bubbleSort };\nconsole.log(bubbleSort([61.05, 84.96, 56.52, 97.4, 18.46, 95.55, 17.62, 32.33, 35.8, 55.13, 74.76, 50.38, 21.88, -11.17, 34.95, -15.52, 23.88, 14.16, 56.72, 96.31]));", "explanation": "Bubble sort on float data, variable named 'dataset', 20 elements."} {"id": 109, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(int[] data) {\n int n = data.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (data[j] > data[j + 1]) {\n int temp = data[j];\n data[j] = data[j + 1];\n data[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n int[] data = {79, 48, 68, 98, 91};\n bubbleSort(data);\n for (int v : data) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on int data, variable named 'data', 5 elements."} {"id": 110, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(int[] vals) {\n int n = vals.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (vals[j] > vals[j + 1]) {\n int temp = vals[j];\n vals[j] = vals[j + 1];\n vals[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n int[] vals = {-40, 65, 96, -2, 32};\n bubbleSort(vals);\n for (int v : vals) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on int data, variable named 'vals', 5 elements."} {"id": 111, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(int[] elements) {\n int n = elements.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (elements[j] > elements[j + 1]) {\n int temp = elements[j];\n elements[j] = elements[j + 1];\n elements[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n int[] elements = {71, 78, -12, -35, 65};\n bubbleSort(elements);\n for (int v : elements) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on int data, variable named 'elements', 5 elements."} {"id": 112, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(int[] data) {\n int n = data.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (data[j] > data[j + 1]) {\n int temp = data[j];\n data[j] = data[j + 1];\n data[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n int[] data = {37, -29, 79, -6, -40, 13, 62, 62};\n bubbleSort(data);\n for (int v : data) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on int data, variable named 'data', 8 elements."} {"id": 113, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(int[] input_arr) {\n int n = input_arr.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (input_arr[j] > input_arr[j + 1]) {\n int temp = input_arr[j];\n input_arr[j] = input_arr[j + 1];\n input_arr[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n int[] input_arr = {83, -10, 43, 45, 22, 49, 54, 36};\n bubbleSort(input_arr);\n for (int v : input_arr) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on int data, variable named 'input_arr', 8 elements."} {"id": 114, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(int[] buffer) {\n int n = buffer.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (buffer[j] > buffer[j + 1]) {\n int temp = buffer[j];\n buffer[j] = buffer[j + 1];\n buffer[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n int[] buffer = {-37, 35, -34, 34, -26, 92, 48, 22};\n bubbleSort(buffer);\n for (int v : buffer) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on int data, variable named 'buffer', 8 elements."} {"id": 115, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(int[] nums) {\n int n = nums.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (nums[j] > nums[j + 1]) {\n int temp = nums[j];\n nums[j] = nums[j + 1];\n nums[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n int[] nums = {-12, 35, -30, 99, -14, 39, 29, 50, -17, -29};\n bubbleSort(nums);\n for (int v : nums) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on int data, variable named 'nums', 10 elements."} {"id": 116, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(int[] nums) {\n int n = nums.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (nums[j] > nums[j + 1]) {\n int temp = nums[j];\n nums[j] = nums[j + 1];\n nums[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n int[] nums = {93, 46, 34, -18, 84, -27, 58, 80, 42, -46};\n bubbleSort(nums);\n for (int v : nums) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on int data, variable named 'nums', 10 elements."} {"id": 117, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(int[] list1) {\n int n = list1.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (list1[j] > list1[j + 1]) {\n int temp = list1[j];\n list1[j] = list1[j + 1];\n list1[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n int[] list1 = {29, -4, 4, 37, 74, -1, 7, -15, -11, -31};\n bubbleSort(list1);\n for (int v : list1) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on int data, variable named 'list1', 10 elements."} {"id": 118, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(int[] nums) {\n int n = nums.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (nums[j] > nums[j + 1]) {\n int temp = nums[j];\n nums[j] = nums[j + 1];\n nums[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n int[] nums = {-25, 79, 88, 84, -41, 36, -17, 46, -11, -9, -4, -8};\n bubbleSort(nums);\n for (int v : nums) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on int data, variable named 'nums', 12 elements."} {"id": 119, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(int[] seq) {\n int n = seq.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (seq[j] > seq[j + 1]) {\n int temp = seq[j];\n seq[j] = seq[j + 1];\n seq[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n int[] seq = {62, -39, 55, 43, 10, 63, 22, 64, 9, 86, 11, 29};\n bubbleSort(seq);\n for (int v : seq) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on int data, variable named 'seq', 12 elements."} {"id": 120, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(int[] vals) {\n int n = vals.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (vals[j] > vals[j + 1]) {\n int temp = vals[j];\n vals[j] = vals[j + 1];\n vals[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n int[] vals = {70, -1, 44, 96, 62, 68, 22, 47, 78, 85, 57, -9};\n bubbleSort(vals);\n for (int v : vals) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on int data, variable named 'vals', 12 elements."} {"id": 121, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(int[] records) {\n int n = records.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (records[j] > records[j + 1]) {\n int temp = records[j];\n records[j] = records[j + 1];\n records[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n int[] records = {1, -15, 14, -37, 73, 45, 91, -24, 82, -19, 22, -29, -9, 19, 65};\n bubbleSort(records);\n for (int v : records) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on int data, variable named 'records', 15 elements."} {"id": 122, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(int[] entries) {\n int n = entries.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (entries[j] > entries[j + 1]) {\n int temp = entries[j];\n entries[j] = entries[j + 1];\n entries[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n int[] entries = {81, -13, 61, -27, 6, 65, 39, -44, 56, -37, 51, 78, 45, 10, 48};\n bubbleSort(entries);\n for (int v : entries) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on int data, variable named 'entries', 15 elements."} {"id": 123, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(int[] data) {\n int n = data.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (data[j] > data[j + 1]) {\n int temp = data[j];\n data[j] = data[j + 1];\n data[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n int[] data = {45, 7, -43, 31, -25, 35, -13, -15, -41, 23, 70, -15, 70, 64, -49};\n bubbleSort(data);\n for (int v : data) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on int data, variable named 'data', 15 elements."} {"id": 124, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(int[] entries) {\n int n = entries.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (entries[j] > entries[j + 1]) {\n int temp = entries[j];\n entries[j] = entries[j + 1];\n entries[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n int[] entries = {-30, -46, 15, 5, -12, 90, 85, 58, -22, 23, 10, 27, -19, -38, 11, 57, 67, -34, -22, 77};\n bubbleSort(entries);\n for (int v : entries) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on int data, variable named 'entries', 20 elements."} {"id": 125, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(int[] elements) {\n int n = elements.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (elements[j] > elements[j + 1]) {\n int temp = elements[j];\n elements[j] = elements[j + 1];\n elements[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n int[] elements = {87, -46, 81, 97, 11, -14, 24, 59, -50, 40, 11, 96, 56, -3, -29, 84, 42, -33, 84, 89};\n bubbleSort(elements);\n for (int v : elements) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on int data, variable named 'elements', 20 elements."} {"id": 126, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(int[] input_arr) {\n int n = input_arr.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (input_arr[j] > input_arr[j + 1]) {\n int temp = input_arr[j];\n input_arr[j] = input_arr[j + 1];\n input_arr[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n int[] input_arr = {79, 91, -45, 49, 70, -39, 49, 45, 14, -46, 41, -33, 38, 11, -24, 98, 35, -16, -39, 40};\n bubbleSort(input_arr);\n for (int v : input_arr) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on int data, variable named 'input_arr', 20 elements."} {"id": 127, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(double[] input_arr) {\n int n = input_arr.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (input_arr[j] > input_arr[j + 1]) {\n double temp = input_arr[j];\n input_arr[j] = input_arr[j + 1];\n input_arr[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n double[] input_arr = {20.29, 56.49, 78.82, 61.48, 96.72};\n bubbleSort(input_arr);\n for (double v : input_arr) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on float data, variable named 'input_arr', 5 elements."} {"id": 128, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(double[] dataset) {\n int n = dataset.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (dataset[j] > dataset[j + 1]) {\n double temp = dataset[j];\n dataset[j] = dataset[j + 1];\n dataset[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n double[] dataset = {55.18, 76.57, -12.49, 72.37, 34.46};\n bubbleSort(dataset);\n for (double v : dataset) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on float data, variable named 'dataset', 5 elements."} {"id": 129, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(double[] nums) {\n int n = nums.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (nums[j] > nums[j + 1]) {\n double temp = nums[j];\n nums[j] = nums[j + 1];\n nums[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n double[] nums = {3.99, 74.14, 85.41, 17.56, 16.9};\n bubbleSort(nums);\n for (double v : nums) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on float data, variable named 'nums', 5 elements."} {"id": 130, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(double[] collection) {\n int n = collection.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (collection[j] > collection[j + 1]) {\n double temp = collection[j];\n collection[j] = collection[j + 1];\n collection[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n double[] collection = {97.71, 44.62, 10.14, 69.64, 2.74, 22.48, 72.92, 83.03};\n bubbleSort(collection);\n for (double v : collection) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on float data, variable named 'collection', 8 elements."} {"id": 131, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(double[] list1) {\n int n = list1.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (list1[j] > list1[j + 1]) {\n double temp = list1[j];\n list1[j] = list1[j + 1];\n list1[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n double[] list1 = {12.51, 75.12, 32.0, 27.6, 32.33, 93.82, 20.35, 2.23};\n bubbleSort(list1);\n for (double v : list1) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on float data, variable named 'list1', 8 elements."} {"id": 132, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(double[] seq) {\n int n = seq.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (seq[j] > seq[j + 1]) {\n double temp = seq[j];\n seq[j] = seq[j + 1];\n seq[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n double[] seq = {39.21, 89.99, 41.79, 75.34, 66.52, -10.61, 51.69, 77.86};\n bubbleSort(seq);\n for (double v : seq) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on float data, variable named 'seq', 8 elements."} {"id": 133, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(double[] input_arr) {\n int n = input_arr.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (input_arr[j] > input_arr[j + 1]) {\n double temp = input_arr[j];\n input_arr[j] = input_arr[j + 1];\n input_arr[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n double[] input_arr = {14.96, -7.79, 19.02, 15.18, 33.06, 65.4, -0.17, 32.83, 33.21, 66.49};\n bubbleSort(input_arr);\n for (double v : input_arr) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on float data, variable named 'input_arr', 10 elements."} {"id": 134, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(double[] entries) {\n int n = entries.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (entries[j] > entries[j + 1]) {\n double temp = entries[j];\n entries[j] = entries[j + 1];\n entries[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n double[] entries = {21.95, 98.78, 12.67, 96.62, 92.8, -11.07, 55.86, 23.23, 75.33, 60.85};\n bubbleSort(entries);\n for (double v : entries) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on float data, variable named 'entries', 10 elements."} {"id": 135, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(double[] arr) {\n int n = arr.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (arr[j] > arr[j + 1]) {\n double temp = arr[j];\n arr[j] = arr[j + 1];\n arr[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n double[] arr = {-3.01, 52.3, 72.98, -15.86, -12.0, 72.64, 23.59, 25.56, 47.5, 52.01};\n bubbleSort(arr);\n for (double v : arr) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on float data, variable named 'arr', 10 elements."} {"id": 136, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(double[] buffer) {\n int n = buffer.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (buffer[j] > buffer[j + 1]) {\n double temp = buffer[j];\n buffer[j] = buffer[j + 1];\n buffer[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n double[] buffer = {33.54, 24.14, 32.83, -10.85, -3.61, 23.67, 17.41, 13.16, 94.3, -16.92, 2.14, 41.61};\n bubbleSort(buffer);\n for (double v : buffer) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on float data, variable named 'buffer', 12 elements."} {"id": 137, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(double[] entries) {\n int n = entries.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (entries[j] > entries[j + 1]) {\n double temp = entries[j];\n entries[j] = entries[j + 1];\n entries[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n double[] entries = {46.84, 11.15, 10.97, 33.11, 98.57, 13.98, 89.06, 38.45, -5.41, 81.49, 33.79, 86.94};\n bubbleSort(entries);\n for (double v : entries) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on float data, variable named 'entries', 12 elements."} {"id": 138, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(double[] dataset) {\n int n = dataset.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (dataset[j] > dataset[j + 1]) {\n double temp = dataset[j];\n dataset[j] = dataset[j + 1];\n dataset[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n double[] dataset = {98.67, 76.45, 95.14, 97.4, 59.47, 64.44, 45.45, 14.55, 15.69, -1.26, 64.44, 63.33};\n bubbleSort(dataset);\n for (double v : dataset) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on float data, variable named 'dataset', 12 elements."} {"id": 139, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(double[] values) {\n int n = values.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (values[j] > values[j + 1]) {\n double temp = values[j];\n values[j] = values[j + 1];\n values[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n double[] values = {74.45, 40.54, -5.56, 3.92, -3.47, 74.05, -16.87, 45.93, 23.9, 75.64, 45.65, 52.82, -9.74, 16.81, 98.95};\n bubbleSort(values);\n for (double v : values) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on float data, variable named 'values', 15 elements."} {"id": 140, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(double[] seq) {\n int n = seq.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (seq[j] > seq[j + 1]) {\n double temp = seq[j];\n seq[j] = seq[j + 1];\n seq[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n double[] seq = {36.96, 28.88, 28.72, 48.41, -5.09, 17.73, -11.17, 35.43, 41.57, -4.73, 78.66, 45.61, 49.95, 71.37, -4.65};\n bubbleSort(seq);\n for (double v : seq) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on float data, variable named 'seq', 15 elements."} {"id": 141, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(double[] input_arr) {\n int n = input_arr.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (input_arr[j] > input_arr[j + 1]) {\n double temp = input_arr[j];\n input_arr[j] = input_arr[j + 1];\n input_arr[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n double[] input_arr = {88.37, -13.41, -5.22, -1.79, -0.41, 18.4, 64.41, 21.18, 91.97, 86.5, 80.67, 9.82, 55.57, 45.55, -5.1};\n bubbleSort(input_arr);\n for (double v : input_arr) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on float data, variable named 'input_arr', 15 elements."} {"id": 142, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(double[] nums) {\n int n = nums.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (nums[j] > nums[j + 1]) {\n double temp = nums[j];\n nums[j] = nums[j + 1];\n nums[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n double[] nums = {53.12, -8.88, 56.28, 50.43, 49.1, 0.37, 54.31, 87.34, 20.18, 89.95, -15.1, 82.79, -10.33, 92.88, 71.75, 11.49, 5.09, 48.08, 53.55, -16.4};\n bubbleSort(nums);\n for (double v : nums) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on float data, variable named 'nums', 20 elements."} {"id": 143, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(double[] entries) {\n int n = entries.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (entries[j] > entries[j + 1]) {\n double temp = entries[j];\n entries[j] = entries[j + 1];\n entries[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n double[] entries = {54.63, 14.47, 93.84, 37.47, 75.76, 61.51, 15.39, -11.32, -12.87, 32.31, 37.63, 4.28, 52.19, 17.2, 65.49, 67.37, 82.43, 96.07, -4.44, 24.09};\n bubbleSort(entries);\n for (double v : entries) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on float data, variable named 'entries', 20 elements."} {"id": 144, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using bubble sort.", "code": "public class Main {\n static void bubbleSort(double[] input_arr) {\n int n = input_arr.length;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (input_arr[j] > input_arr[j + 1]) {\n double temp = input_arr[j];\n input_arr[j] = input_arr[j + 1];\n input_arr[j + 1] = temp;\n }\n }\n }\n }\n\n public static void main(String[] args) {\n double[] input_arr = {-7.36, 8.77, -5.42, 33.5, -3.24, -13.98, 92.5, 82.84, 29.76, 94.56, 87.37, 76.8, 91.12, 65.81, 2.59, -1.04, 98.52, 35.55, 84.61, 39.19};\n bubbleSort(input_arr);\n for (double v : input_arr) System.out.print(v + \" \");\n }\n}", "explanation": "Bubble sort on float data, variable named 'input_arr', 20 elements."} {"id": 145, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(int data[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (data[j] > data[j + 1]) {\n int temp = data[j];\n data[j] = data[j + 1];\n data[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n int data[] = {50, 79, 67, 11, 5};\n int n = sizeof(data) / sizeof(data[0]);\n bubble_sort(data, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)data[i]);\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'data', 5 elements."} {"id": 146, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(int elements[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (elements[j] > elements[j + 1]) {\n int temp = elements[j];\n elements[j] = elements[j + 1];\n elements[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n int elements[] = {40, -38, -38, 22, 76};\n int n = sizeof(elements) / sizeof(elements[0]);\n bubble_sort(elements, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)elements[i]);\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'elements', 5 elements."} {"id": 147, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(int elements[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (elements[j] > elements[j + 1]) {\n int temp = elements[j];\n elements[j] = elements[j + 1];\n elements[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n int elements[] = {70, 23, 87, -48, -23};\n int n = sizeof(elements) / sizeof(elements[0]);\n bubble_sort(elements, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)elements[i]);\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'elements', 5 elements."} {"id": 148, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(int collection[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (collection[j] > collection[j + 1]) {\n int temp = collection[j];\n collection[j] = collection[j + 1];\n collection[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n int collection[] = {-16, 17, 43, 53, 43, -39, 52, -37};\n int n = sizeof(collection) / sizeof(collection[0]);\n bubble_sort(collection, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)collection[i]);\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'collection', 8 elements."} {"id": 149, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(int elements[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (elements[j] > elements[j + 1]) {\n int temp = elements[j];\n elements[j] = elements[j + 1];\n elements[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n int elements[] = {93, -1, 42, 91, 23, -32, 48, 79};\n int n = sizeof(elements) / sizeof(elements[0]);\n bubble_sort(elements, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)elements[i]);\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'elements', 8 elements."} {"id": 150, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(int dataset[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (dataset[j] > dataset[j + 1]) {\n int temp = dataset[j];\n dataset[j] = dataset[j + 1];\n dataset[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n int dataset[] = {90, 21, -20, -18, -26, 50, 45, 36};\n int n = sizeof(dataset) / sizeof(dataset[0]);\n bubble_sort(dataset, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)dataset[i]);\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'dataset', 8 elements."} {"id": 151, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(int input_arr[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (input_arr[j] > input_arr[j + 1]) {\n int temp = input_arr[j];\n input_arr[j] = input_arr[j + 1];\n input_arr[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n int input_arr[] = {43, -14, 0, 80, 52, 78, -40, -39, -41, -15};\n int n = sizeof(input_arr) / sizeof(input_arr[0]);\n bubble_sort(input_arr, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)input_arr[i]);\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'input_arr', 10 elements."} {"id": 152, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(int seq[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (seq[j] > seq[j + 1]) {\n int temp = seq[j];\n seq[j] = seq[j + 1];\n seq[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n int seq[] = {35, 71, 82, 66, -12, 81, -15, 33, 31, -9};\n int n = sizeof(seq) / sizeof(seq[0]);\n bubble_sort(seq, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)seq[i]);\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'seq', 10 elements."} {"id": 153, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(int collection[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (collection[j] > collection[j + 1]) {\n int temp = collection[j];\n collection[j] = collection[j + 1];\n collection[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n int collection[] = {26, 36, 79, 80, 86, 75, 94, 26, 71, -46};\n int n = sizeof(collection) / sizeof(collection[0]);\n bubble_sort(collection, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)collection[i]);\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'collection', 10 elements."} {"id": 154, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(int list1[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (list1[j] > list1[j + 1]) {\n int temp = list1[j];\n list1[j] = list1[j + 1];\n list1[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n int list1[] = {34, -22, 56, 99, 28, -44, 71, 17, 98, 97, 8, -37};\n int n = sizeof(list1) / sizeof(list1[0]);\n bubble_sort(list1, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)list1[i]);\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'list1', 12 elements."} {"id": 155, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(int elements[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (elements[j] > elements[j + 1]) {\n int temp = elements[j];\n elements[j] = elements[j + 1];\n elements[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n int elements[] = {72, -7, 84, 47, -13, 12, -42, 96, -22, -2, -46, 62};\n int n = sizeof(elements) / sizeof(elements[0]);\n bubble_sort(elements, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)elements[i]);\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'elements', 12 elements."} {"id": 156, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(int list1[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (list1[j] > list1[j + 1]) {\n int temp = list1[j];\n list1[j] = list1[j + 1];\n list1[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n int list1[] = {57, -12, 55, 2, 55, 78, 70, -35, -15, 82, 3, 93};\n int n = sizeof(list1) / sizeof(list1[0]);\n bubble_sort(list1, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)list1[i]);\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'list1', 12 elements."} {"id": 157, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(int list1[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (list1[j] > list1[j + 1]) {\n int temp = list1[j];\n list1[j] = list1[j + 1];\n list1[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n int list1[] = {72, 84, 46, 30, -6, 67, 86, 37, 89, 40, 17, 73, -1, 13, 21};\n int n = sizeof(list1) / sizeof(list1[0]);\n bubble_sort(list1, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)list1[i]);\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'list1', 15 elements."} {"id": 158, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(int input_arr[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (input_arr[j] > input_arr[j + 1]) {\n int temp = input_arr[j];\n input_arr[j] = input_arr[j + 1];\n input_arr[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n int input_arr[] = {26, 7, 26, 23, 3, 75, 31, 72, 39, 93, 20, 23, -19, 96, 89};\n int n = sizeof(input_arr) / sizeof(input_arr[0]);\n bubble_sort(input_arr, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)input_arr[i]);\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'input_arr', 15 elements."} {"id": 159, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(int collection[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (collection[j] > collection[j + 1]) {\n int temp = collection[j];\n collection[j] = collection[j + 1];\n collection[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n int collection[] = {51, 38, -13, 24, -40, 23, -30, 38, 63, 15, 72, 4, 1, 87, 19};\n int n = sizeof(collection) / sizeof(collection[0]);\n bubble_sort(collection, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)collection[i]);\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'collection', 15 elements."} {"id": 160, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(int entries[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (entries[j] > entries[j + 1]) {\n int temp = entries[j];\n entries[j] = entries[j + 1];\n entries[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n int entries[] = {93, 19, -15, -23, 11, 12, -38, 85, 7, 9, -37, -25, 55, 34, 70, -25, -15, -49, 90, -10};\n int n = sizeof(entries) / sizeof(entries[0]);\n bubble_sort(entries, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)entries[i]);\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'entries', 20 elements."} {"id": 161, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(int collection[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (collection[j] > collection[j + 1]) {\n int temp = collection[j];\n collection[j] = collection[j + 1];\n collection[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n int collection[] = {71, 72, 1, 23, 32, 23, -35, -28, 96, 9, 86, -41, -6, 56, -5, -41, 51, 76, -3, 24};\n int n = sizeof(collection) / sizeof(collection[0]);\n bubble_sort(collection, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)collection[i]);\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'collection', 20 elements."} {"id": 162, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(int entries[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (entries[j] > entries[j + 1]) {\n int temp = entries[j];\n entries[j] = entries[j + 1];\n entries[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n int entries[] = {-41, -48, 26, 95, -23, 35, 22, 66, 89, 84, 76, -16, 79, 69, 19, -1, -22, 34, -9, 67};\n int n = sizeof(entries) / sizeof(entries[0]);\n bubble_sort(entries, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)entries[i]);\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'entries', 20 elements."} {"id": 163, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(double buffer[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (buffer[j] > buffer[j + 1]) {\n double temp = buffer[j];\n buffer[j] = buffer[j + 1];\n buffer[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n double buffer[] = {10.61, 2.16, 67.66, 74.1, 47.57};\n int n = sizeof(buffer) / sizeof(buffer[0]);\n bubble_sort(buffer, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)buffer[i]);\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'buffer', 5 elements."} {"id": 164, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(double vals[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (vals[j] > vals[j + 1]) {\n double temp = vals[j];\n vals[j] = vals[j + 1];\n vals[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n double vals[] = {2.99, 52.7, 56.01, 28.25, 30.9};\n int n = sizeof(vals) / sizeof(vals[0]);\n bubble_sort(vals, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)vals[i]);\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'vals', 5 elements."} {"id": 165, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(double list1[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (list1[j] > list1[j + 1]) {\n double temp = list1[j];\n list1[j] = list1[j + 1];\n list1[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n double list1[] = {-9.68, 59.64, 1.99, -3.27, 18.51};\n int n = sizeof(list1) / sizeof(list1[0]);\n bubble_sort(list1, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)list1[i]);\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'list1', 5 elements."} {"id": 166, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(double items[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (items[j] > items[j + 1]) {\n double temp = items[j];\n items[j] = items[j + 1];\n items[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n double items[] = {-19.19, 25.65, 33.16, 11.77, 19.23, 49.31, 48.17, 11.12};\n int n = sizeof(items) / sizeof(items[0]);\n bubble_sort(items, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)items[i]);\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'items', 8 elements."} {"id": 167, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(double list1[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (list1[j] > list1[j + 1]) {\n double temp = list1[j];\n list1[j] = list1[j + 1];\n list1[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n double list1[] = {62.44, -12.61, -5.93, 16.51, 28.24, 39.8, 86.52, 63.72};\n int n = sizeof(list1) / sizeof(list1[0]);\n bubble_sort(list1, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)list1[i]);\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'list1', 8 elements."} {"id": 168, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(double nums[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (nums[j] > nums[j + 1]) {\n double temp = nums[j];\n nums[j] = nums[j + 1];\n nums[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n double nums[] = {62.14, 56.01, 91.94, 23.74, 6.28, 93.93, 36.9, 34.14};\n int n = sizeof(nums) / sizeof(nums[0]);\n bubble_sort(nums, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)nums[i]);\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'nums', 8 elements."} {"id": 169, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(double elements[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (elements[j] > elements[j + 1]) {\n double temp = elements[j];\n elements[j] = elements[j + 1];\n elements[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n double elements[] = {24.46, 63.53, 88.62, 70.12, 75.44, 78.25, 70.66, 60.96, 50.9, 73.7};\n int n = sizeof(elements) / sizeof(elements[0]);\n bubble_sort(elements, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)elements[i]);\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'elements', 10 elements."} {"id": 170, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(double input_arr[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (input_arr[j] > input_arr[j + 1]) {\n double temp = input_arr[j];\n input_arr[j] = input_arr[j + 1];\n input_arr[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n double input_arr[] = {33.16, 63.75, -10.71, 47.14, -12.65, 45.17, 40.15, 48.15, -2.17, 19.05};\n int n = sizeof(input_arr) / sizeof(input_arr[0]);\n bubble_sort(input_arr, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)input_arr[i]);\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'input_arr', 10 elements."} {"id": 171, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(double input_arr[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (input_arr[j] > input_arr[j + 1]) {\n double temp = input_arr[j];\n input_arr[j] = input_arr[j + 1];\n input_arr[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n double input_arr[] = {32.58, 60.96, 65.31, 38.17, 86.97, 33.01, -13.38, -4.3, 29.44, 47.11};\n int n = sizeof(input_arr) / sizeof(input_arr[0]);\n bubble_sort(input_arr, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)input_arr[i]);\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'input_arr', 10 elements."} {"id": 172, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(double input_arr[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (input_arr[j] > input_arr[j + 1]) {\n double temp = input_arr[j];\n input_arr[j] = input_arr[j + 1];\n input_arr[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n double input_arr[] = {35.02, 76.02, 66.07, 27.12, 77.16, 68.75, 48.82, -14.61, 21.0, -12.41, 98.3, 91.22};\n int n = sizeof(input_arr) / sizeof(input_arr[0]);\n bubble_sort(input_arr, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)input_arr[i]);\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'input_arr', 12 elements."} {"id": 173, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(double data[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (data[j] > data[j + 1]) {\n double temp = data[j];\n data[j] = data[j + 1];\n data[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n double data[] = {97.35, 36.18, 14.16, 1.42, -3.88, 56.34, 66.79, 94.69, 24.56, 86.07, 33.38, 89.14};\n int n = sizeof(data) / sizeof(data[0]);\n bubble_sort(data, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)data[i]);\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'data', 12 elements."} {"id": 174, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(double collection[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (collection[j] > collection[j + 1]) {\n double temp = collection[j];\n collection[j] = collection[j + 1];\n collection[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n double collection[] = {24.7, 61.24, 58.75, 44.18, 57.77, 21.38, 1.24, 43.93, 42.93, 66.62, 6.5, -19.59};\n int n = sizeof(collection) / sizeof(collection[0]);\n bubble_sort(collection, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)collection[i]);\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'collection', 12 elements."} {"id": 175, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(double arr[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (arr[j] > arr[j + 1]) {\n double temp = arr[j];\n arr[j] = arr[j + 1];\n arr[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n double arr[] = {96.44, 35.1, 65.57, 30.47, 25.13, 7.33, 34.81, -1.54, 2.43, 84.15, 71.09, -16.17, 58.56, 53.18, 91.41};\n int n = sizeof(arr) / sizeof(arr[0]);\n bubble_sort(arr, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)arr[i]);\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'arr', 15 elements."} {"id": 176, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(double entries[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (entries[j] > entries[j + 1]) {\n double temp = entries[j];\n entries[j] = entries[j + 1];\n entries[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n double entries[] = {-18.14, 4.52, -7.99, -16.0, 51.14, 63.69, -14.21, 68.12, 27.87, 7.89, 5.86, 82.78, -13.28, 39.96, 14.42};\n int n = sizeof(entries) / sizeof(entries[0]);\n bubble_sort(entries, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)entries[i]);\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'entries', 15 elements."} {"id": 177, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(double records[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (records[j] > records[j + 1]) {\n double temp = records[j];\n records[j] = records[j + 1];\n records[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n double records[] = {89.05, 48.56, 48.72, 71.93, 77.39, 8.19, 84.27, 97.3, 42.03, 29.21, 12.74, 46.25, 50.41, 67.49, 0.84};\n int n = sizeof(records) / sizeof(records[0]);\n bubble_sort(records, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)records[i]);\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'records', 15 elements."} {"id": 178, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(double buffer[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (buffer[j] > buffer[j + 1]) {\n double temp = buffer[j];\n buffer[j] = buffer[j + 1];\n buffer[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n double buffer[] = {30.84, 38.98, 95.7, 92.05, 59.89, 73.51, 17.93, 29.54, -2.24, 24.8, 69.78, 36.35, 81.07, 15.79, 64.2, 75.89, 88.85, 46.92, 95.17, 46.32};\n int n = sizeof(buffer) / sizeof(buffer[0]);\n bubble_sort(buffer, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)buffer[i]);\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'buffer', 20 elements."} {"id": 179, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(double values[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (values[j] > values[j + 1]) {\n double temp = values[j];\n values[j] = values[j + 1];\n values[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n double values[] = {26.22, 10.34, 19.3, -10.59, 33.52, 24.16, 43.74, 78.7, -13.87, 24.88, 51.99, -15.29, -11.34, 75.75, 49.92, 59.9, 5.82, 4.86, 87.94, 16.08};\n int n = sizeof(values) / sizeof(values[0]);\n bubble_sort(values, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)values[i]);\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'values', 20 elements."} {"id": 180, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using bubble sort.", "code": "#include \n\nvoid bubble_sort(double entries[], int n) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (entries[j] > entries[j + 1]) {\n double temp = entries[j];\n entries[j] = entries[j + 1];\n entries[j + 1] = temp;\n }\n }\n }\n}\n\nint main(void) {\n double entries[] = {-18.18, 91.52, 94.49, -6.04, 98.95, 36.99, 8.87, 51.92, 4.34, 88.9, 45.7, 72.29, 25.3, 43.5, 22.75, 11.13, 41.03, 39.18, -8.27, 96.78};\n int n = sizeof(entries) / sizeof(entries[0]);\n bubble_sort(entries, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)entries[i]);\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'entries', 20 elements."} {"id": 181, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& dataset) {\n int n = (int) dataset.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (dataset[j] > dataset[j + 1]) std::swap(dataset[j], dataset[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector dataset = {31, 2, 44, 30, 55};\n bubbleSort(dataset);\n for (int v : dataset) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'dataset', 5 elements."} {"id": 182, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& arr) {\n int n = (int) arr.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (arr[j] > arr[j + 1]) std::swap(arr[j], arr[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector arr = {94, 6, -13, -46, 16};\n bubbleSort(arr);\n for (int v : arr) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'arr', 5 elements."} {"id": 183, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& input_arr) {\n int n = (int) input_arr.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (input_arr[j] > input_arr[j + 1]) std::swap(input_arr[j], input_arr[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector input_arr = {99, 98, 56, 25, -11};\n bubbleSort(input_arr);\n for (int v : input_arr) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'input_arr', 5 elements."} {"id": 184, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& items) {\n int n = (int) items.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (items[j] > items[j + 1]) std::swap(items[j], items[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector items = {34, 8, 47, 95, 12, 77, 90, 36};\n bubbleSort(items);\n for (int v : items) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'items', 8 elements."} {"id": 185, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& nums) {\n int n = (int) nums.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (nums[j] > nums[j + 1]) std::swap(nums[j], nums[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector nums = {75, 75, 67, -7, 40, -7, -15, 89};\n bubbleSort(nums);\n for (int v : nums) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'nums', 8 elements."} {"id": 186, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& dataset) {\n int n = (int) dataset.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (dataset[j] > dataset[j + 1]) std::swap(dataset[j], dataset[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector dataset = {-3, 88, -35, 84, -42, -31, -38, -49};\n bubbleSort(dataset);\n for (int v : dataset) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'dataset', 8 elements."} {"id": 187, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& collection) {\n int n = (int) collection.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (collection[j] > collection[j + 1]) std::swap(collection[j], collection[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector collection = {-15, 9, -33, -12, -48, 5, 79, 66, 45, -35};\n bubbleSort(collection);\n for (int v : collection) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'collection', 10 elements."} {"id": 188, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& elements) {\n int n = (int) elements.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (elements[j] > elements[j + 1]) std::swap(elements[j], elements[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector elements = {73, 74, -46, -49, 86, 91, 55, -47, -46, 85};\n bubbleSort(elements);\n for (int v : elements) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'elements', 10 elements."} {"id": 189, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& seq) {\n int n = (int) seq.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (seq[j] > seq[j + 1]) std::swap(seq[j], seq[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector seq = {20, 87, 23, -46, 78, 60, -5, -23, -26, 84};\n bubbleSort(seq);\n for (int v : seq) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'seq', 10 elements."} {"id": 190, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& values) {\n int n = (int) values.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (values[j] > values[j + 1]) std::swap(values[j], values[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector values = {11, -1, 84, 14, 40, 18, 51, -30, 45, 53, 67, 94};\n bubbleSort(values);\n for (int v : values) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'values', 12 elements."} {"id": 191, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& items) {\n int n = (int) items.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (items[j] > items[j + 1]) std::swap(items[j], items[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector items = {7, 26, -30, -42, -27, 53, 47, 46, 91, 71, -36, -48};\n bubbleSort(items);\n for (int v : items) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'items', 12 elements."} {"id": 192, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& seq) {\n int n = (int) seq.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (seq[j] > seq[j + 1]) std::swap(seq[j], seq[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector seq = {-7, -29, 77, 61, 34, 94, -26, 85, -40, 8, 4, 95};\n bubbleSort(seq);\n for (int v : seq) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'seq', 12 elements."} {"id": 193, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& dataset) {\n int n = (int) dataset.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (dataset[j] > dataset[j + 1]) std::swap(dataset[j], dataset[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector dataset = {19, -39, -31, 21, 89, 94, -42, -5, 30, -46, 3, -14, 51, -31, 26};\n bubbleSort(dataset);\n for (int v : dataset) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'dataset', 15 elements."} {"id": 194, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& values) {\n int n = (int) values.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (values[j] > values[j + 1]) std::swap(values[j], values[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector values = {94, 11, 95, 49, 88, 34, 48, -15, -30, 78, 38, -37, -25, 61, 9};\n bubbleSort(values);\n for (int v : values) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'values', 15 elements."} {"id": 195, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& records) {\n int n = (int) records.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (records[j] > records[j + 1]) std::swap(records[j], records[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector records = {-31, 37, 51, 33, -43, 19, 65, 75, 8, 41, 91, 46, 60, -3, 99};\n bubbleSort(records);\n for (int v : records) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'records', 15 elements."} {"id": 196, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& buffer) {\n int n = (int) buffer.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (buffer[j] > buffer[j + 1]) std::swap(buffer[j], buffer[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector buffer = {47, -29, 25, 13, -32, -29, 18, -11, 47, -11, 49, 31, 42, -23, -27, -49, 28, 63, 42, 19};\n bubbleSort(buffer);\n for (int v : buffer) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'buffer', 20 elements."} {"id": 197, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& data) {\n int n = (int) data.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (data[j] > data[j + 1]) std::swap(data[j], data[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector data = {-17, -28, -3, 60, 64, 92, 92, 81, 54, -24, -44, -28, 40, 91, -27, 33, 48, -47, 24, 55};\n bubbleSort(data);\n for (int v : data) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'data', 20 elements."} {"id": 198, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& collection) {\n int n = (int) collection.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (collection[j] > collection[j + 1]) std::swap(collection[j], collection[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector collection = {-29, 93, 12, 96, 83, -7, 47, -7, -15, 18, 27, 18, 76, -13, -34, -8, 61, 20, 57, 26};\n bubbleSort(collection);\n for (int v : collection) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on int data, variable named 'collection', 20 elements."} {"id": 199, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& dataset) {\n int n = (int) dataset.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (dataset[j] > dataset[j + 1]) std::swap(dataset[j], dataset[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector dataset = {73.14, 22.97, 92.36, 65.79, 39.0};\n bubbleSort(dataset);\n for (double v : dataset) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'dataset', 5 elements."} {"id": 200, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& elements) {\n int n = (int) elements.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (elements[j] > elements[j + 1]) std::swap(elements[j], elements[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector elements = {3.27, -7.27, 16.25, 92.91, 19.53};\n bubbleSort(elements);\n for (double v : elements) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'elements', 5 elements."} {"id": 201, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& elements) {\n int n = (int) elements.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (elements[j] > elements[j + 1]) std::swap(elements[j], elements[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector elements = {25.21, 82.6, 32.39, 31.24, 78.0};\n bubbleSort(elements);\n for (double v : elements) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'elements', 5 elements."} {"id": 202, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& buffer) {\n int n = (int) buffer.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (buffer[j] > buffer[j + 1]) std::swap(buffer[j], buffer[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector buffer = {95.93, -3.8, 18.16, 92.73, 3.9, 17.39, 94.78, 95.28};\n bubbleSort(buffer);\n for (double v : buffer) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'buffer', 8 elements."} {"id": 203, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& nums) {\n int n = (int) nums.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (nums[j] > nums[j + 1]) std::swap(nums[j], nums[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector nums = {67.45, 55.32, 95.16, 73.05, 18.78, 13.36, 73.52, 23.44};\n bubbleSort(nums);\n for (double v : nums) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'nums', 8 elements."} {"id": 204, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& entries) {\n int n = (int) entries.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (entries[j] > entries[j + 1]) std::swap(entries[j], entries[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector entries = {47.1, 50.48, 44.93, 61.12, 45.46, 93.41, 34.93, 64.3};\n bubbleSort(entries);\n for (double v : entries) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'entries', 8 elements."} {"id": 205, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& dataset) {\n int n = (int) dataset.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (dataset[j] > dataset[j + 1]) std::swap(dataset[j], dataset[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector dataset = {74.92, 78.92, -11.77, 80.89, 74.61, 60.08, -3.44, 16.04, 10.07, -1.66};\n bubbleSort(dataset);\n for (double v : dataset) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'dataset', 10 elements."} {"id": 206, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& collection) {\n int n = (int) collection.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (collection[j] > collection[j + 1]) std::swap(collection[j], collection[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector collection = {73.9, -11.2, 97.89, 37.03, 27.7, 40.29, 89.53, 62.31, 44.69, 74.1};\n bubbleSort(collection);\n for (double v : collection) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'collection', 10 elements."} {"id": 207, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& list1) {\n int n = (int) list1.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (list1[j] > list1[j + 1]) std::swap(list1[j], list1[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector list1 = {63.49, 76.66, 50.66, 88.81, -6.99, 9.54, 59.1, -0.21, 52.91, 47.02};\n bubbleSort(list1);\n for (double v : list1) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'list1', 10 elements."} {"id": 208, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& buffer) {\n int n = (int) buffer.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (buffer[j] > buffer[j + 1]) std::swap(buffer[j], buffer[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector buffer = {60.62, 27.55, 69.57, 94.92, 31.22, -18.74, 10.79, 40.77, 41.74, 49.08, 48.45, 33.05};\n bubbleSort(buffer);\n for (double v : buffer) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'buffer', 12 elements."} {"id": 209, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& collection) {\n int n = (int) collection.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (collection[j] > collection[j + 1]) std::swap(collection[j], collection[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector collection = {35.1, 60.87, 62.16, -2.06, 98.73, 37.45, 15.16, 89.55, -9.78, 78.93, 66.89, 21.45};\n bubbleSort(collection);\n for (double v : collection) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'collection', 12 elements."} {"id": 210, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& list1) {\n int n = (int) list1.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (list1[j] > list1[j + 1]) std::swap(list1[j], list1[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector list1 = {34.18, 4.62, 37.47, 36.66, 32.14, 62.91, 17.95, 15.73, 76.41, -6.3, 81.05, 57.11};\n bubbleSort(list1);\n for (double v : list1) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'list1', 12 elements."} {"id": 211, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& buffer) {\n int n = (int) buffer.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (buffer[j] > buffer[j + 1]) std::swap(buffer[j], buffer[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector buffer = {75.21, 90.66, 68.12, 41.4, 45.68, 19.39, 30.74, 34.98, 74.93, 54.94, 2.18, 58.22, 27.07, 67.75, 85.09};\n bubbleSort(buffer);\n for (double v : buffer) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'buffer', 15 elements."} {"id": 212, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& dataset) {\n int n = (int) dataset.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (dataset[j] > dataset[j + 1]) std::swap(dataset[j], dataset[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector dataset = {50.47, 26.27, 63.86, 4.49, 69.53, 76.24, -12.55, -7.89, 83.77, 2.25, 18.79, 34.45, 11.22, 82.65, 42.8};\n bubbleSort(dataset);\n for (double v : dataset) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'dataset', 15 elements."} {"id": 213, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& buffer) {\n int n = (int) buffer.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (buffer[j] > buffer[j + 1]) std::swap(buffer[j], buffer[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector buffer = {17.3, 26.25, 26.71, -6.41, 21.89, 34.49, 0.53, 60.16, 75.27, 89.32, 50.23, 59.98, 17.27, 8.39, -6.08};\n bubbleSort(buffer);\n for (double v : buffer) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'buffer', 15 elements."} {"id": 214, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& list1) {\n int n = (int) list1.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (list1[j] > list1[j + 1]) std::swap(list1[j], list1[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector list1 = {62.52, 40.79, 29.77, -3.59, 25.66, 2.1, 55.62, 62.52, 56.79, 98.99, 46.03, 38.27, -3.3, 17.44, 33.67, -13.62, 22.73, -18.86, -3.75, 77.01};\n bubbleSort(list1);\n for (double v : list1) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'list1', 20 elements."} {"id": 215, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& input_arr) {\n int n = (int) input_arr.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (input_arr[j] > input_arr[j + 1]) std::swap(input_arr[j], input_arr[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector input_arr = {40.15, 38.9, 61.48, 29.46, 79.95, 38.16, -10.16, -16.33, 70.57, 14.76, 12.71, 43.98, 0.02, 34.42, 68.36, 71.14, 45.42, -6.53, -6.41, 72.24};\n bubbleSort(input_arr);\n for (double v : input_arr) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'input_arr', 20 elements."} {"id": 216, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using bubble sort.", "code": "#include \n#include \n\nvoid bubbleSort(std::vector& records) {\n int n = (int) records.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n - i - 1; j++) {\n if (records[j] > records[j + 1]) std::swap(records[j], records[j + 1]);\n }\n }\n}\n\nint main() {\n std::vector records = {97.92, 44.5, 70.06, 70.44, 32.52, 6.01, 30.59, 67.58, 57.79, 9.46, 84.1, -16.16, 11.28, 82.6, -9.65, 82.97, -6.03, 76.61, 4.98, 67.78};\n bubbleSort(records);\n for (double v : records) std::cout << v << \" \";\n return 0;\n}", "explanation": "Bubble sort on float data, variable named 'records', 20 elements."} {"id": 217, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using bubble sort.", "code": "fn bubble_sort(seq: &mut Vec) {\n let n = seq.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if seq[j] > seq[j + 1] {\n seq.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut seq = vec![39, 59, -8, -15, 2];\n bubble_sort(&mut seq);\n println!(\"{:?}\", seq);\n}", "explanation": "Bubble sort on int data, variable named 'seq', 5 elements."} {"id": 218, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using bubble sort.", "code": "fn bubble_sort(records: &mut Vec) {\n let n = records.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if records[j] > records[j + 1] {\n records.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut records = vec![2, -35, 95, 39, 86];\n bubble_sort(&mut records);\n println!(\"{:?}\", records);\n}", "explanation": "Bubble sort on int data, variable named 'records', 5 elements."} {"id": 219, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using bubble sort.", "code": "fn bubble_sort(nums: &mut Vec) {\n let n = nums.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if nums[j] > nums[j + 1] {\n nums.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut nums = vec![87, -7, 32, 24, 24];\n bubble_sort(&mut nums);\n println!(\"{:?}\", nums);\n}", "explanation": "Bubble sort on int data, variable named 'nums', 5 elements."} {"id": 220, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using bubble sort.", "code": "fn bubble_sort(elements: &mut Vec) {\n let n = elements.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if elements[j] > elements[j + 1] {\n elements.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut elements = vec![18, 81, -26, -16, 55, -35, 20, -18];\n bubble_sort(&mut elements);\n println!(\"{:?}\", elements);\n}", "explanation": "Bubble sort on int data, variable named 'elements', 8 elements."} {"id": 221, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using bubble sort.", "code": "fn bubble_sort(seq: &mut Vec) {\n let n = seq.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if seq[j] > seq[j + 1] {\n seq.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut seq = vec![-17, 13, -13, 32, 13, 50, 75, -14];\n bubble_sort(&mut seq);\n println!(\"{:?}\", seq);\n}", "explanation": "Bubble sort on int data, variable named 'seq', 8 elements."} {"id": 222, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using bubble sort.", "code": "fn bubble_sort(elements: &mut Vec) {\n let n = elements.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if elements[j] > elements[j + 1] {\n elements.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut elements = vec![18, 56, 46, 65, -31, -27, 53, 81];\n bubble_sort(&mut elements);\n println!(\"{:?}\", elements);\n}", "explanation": "Bubble sort on int data, variable named 'elements', 8 elements."} {"id": 223, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using bubble sort.", "code": "fn bubble_sort(seq: &mut Vec) {\n let n = seq.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if seq[j] > seq[j + 1] {\n seq.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut seq = vec![21, 44, 66, 74, 33, 98, -50, -27, 67, 41];\n bubble_sort(&mut seq);\n println!(\"{:?}\", seq);\n}", "explanation": "Bubble sort on int data, variable named 'seq', 10 elements."} {"id": 224, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using bubble sort.", "code": "fn bubble_sort(records: &mut Vec) {\n let n = records.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if records[j] > records[j + 1] {\n records.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut records = vec![-34, 86, 51, 5, 59, 4, 76, 18, 32, 22];\n bubble_sort(&mut records);\n println!(\"{:?}\", records);\n}", "explanation": "Bubble sort on int data, variable named 'records', 10 elements."} {"id": 225, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using bubble sort.", "code": "fn bubble_sort(list1: &mut Vec) {\n let n = list1.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if list1[j] > list1[j + 1] {\n list1.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut list1 = vec![90, 97, -17, 94, 74, 37, -38, -39, -25, 67];\n bubble_sort(&mut list1);\n println!(\"{:?}\", list1);\n}", "explanation": "Bubble sort on int data, variable named 'list1', 10 elements."} {"id": 226, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using bubble sort.", "code": "fn bubble_sort(arr: &mut Vec) {\n let n = arr.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if arr[j] > arr[j + 1] {\n arr.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut arr = vec![-19, -10, 62, 66, -50, 59, 1, -17, 27, -10, 20, -27];\n bubble_sort(&mut arr);\n println!(\"{:?}\", arr);\n}", "explanation": "Bubble sort on int data, variable named 'arr', 12 elements."} {"id": 227, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using bubble sort.", "code": "fn bubble_sort(buffer: &mut Vec) {\n let n = buffer.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if buffer[j] > buffer[j + 1] {\n buffer.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut buffer = vec![42, 14, -29, 45, -8, -37, 51, 28, 9, 59, -27, -26];\n bubble_sort(&mut buffer);\n println!(\"{:?}\", buffer);\n}", "explanation": "Bubble sort on int data, variable named 'buffer', 12 elements."} {"id": 228, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using bubble sort.", "code": "fn bubble_sort(arr: &mut Vec) {\n let n = arr.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if arr[j] > arr[j + 1] {\n arr.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut arr = vec![4, 72, -31, -17, 7, 82, 63, -48, -48, 37, -20, 58];\n bubble_sort(&mut arr);\n println!(\"{:?}\", arr);\n}", "explanation": "Bubble sort on int data, variable named 'arr', 12 elements."} {"id": 229, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using bubble sort.", "code": "fn bubble_sort(seq: &mut Vec) {\n let n = seq.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if seq[j] > seq[j + 1] {\n seq.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut seq = vec![-17, 72, -32, 8, 48, -28, -24, -24, 30, 44, 26, -15, 47, -16, -14];\n bubble_sort(&mut seq);\n println!(\"{:?}\", seq);\n}", "explanation": "Bubble sort on int data, variable named 'seq', 15 elements."} {"id": 230, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using bubble sort.", "code": "fn bubble_sort(data: &mut Vec) {\n let n = data.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if data[j] > data[j + 1] {\n data.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut data = vec![85, 94, -48, -8, 62, 39, 4, -12, 55, 63, 5, -28, -25, -15, -19];\n bubble_sort(&mut data);\n println!(\"{:?}\", data);\n}", "explanation": "Bubble sort on int data, variable named 'data', 15 elements."} {"id": 231, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using bubble sort.", "code": "fn bubble_sort(elements: &mut Vec) {\n let n = elements.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if elements[j] > elements[j + 1] {\n elements.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut elements = vec![48, 39, 59, 30, -15, 13, 20, -29, 13, 91, 22, -44, 27, 2, 82];\n bubble_sort(&mut elements);\n println!(\"{:?}\", elements);\n}", "explanation": "Bubble sort on int data, variable named 'elements', 15 elements."} {"id": 232, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using bubble sort.", "code": "fn bubble_sort(elements: &mut Vec) {\n let n = elements.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if elements[j] > elements[j + 1] {\n elements.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut elements = vec![80, -2, 50, 25, -37, 11, 76, 48, -22, 11, 77, -32, 85, -47, 42, 31, -17, 49, 95, 57];\n bubble_sort(&mut elements);\n println!(\"{:?}\", elements);\n}", "explanation": "Bubble sort on int data, variable named 'elements', 20 elements."} {"id": 233, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using bubble sort.", "code": "fn bubble_sort(list1: &mut Vec) {\n let n = list1.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if list1[j] > list1[j + 1] {\n list1.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut list1 = vec![89, -6, 70, -32, -46, -33, -47, 17, 5, -40, -35, 51, 79, 23, 78, 56, 58, 52, -29, 87];\n bubble_sort(&mut list1);\n println!(\"{:?}\", list1);\n}", "explanation": "Bubble sort on int data, variable named 'list1', 20 elements."} {"id": 234, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using bubble sort.", "code": "fn bubble_sort(input_arr: &mut Vec) {\n let n = input_arr.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if input_arr[j] > input_arr[j + 1] {\n input_arr.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut input_arr = vec![-11, 21, -29, 29, -30, 80, 2, -11, 87, 33, 50, -34, 29, 61, 11, -36, 12, -28, 61, -21];\n bubble_sort(&mut input_arr);\n println!(\"{:?}\", input_arr);\n}", "explanation": "Bubble sort on int data, variable named 'input_arr', 20 elements."} {"id": 235, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using bubble sort.", "code": "fn bubble_sort(dataset: &mut Vec) {\n let n = dataset.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if dataset[j] > dataset[j + 1] {\n dataset.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut dataset = vec![52.86, -13.45, 59.26, 58.31, 0.9];\n bubble_sort(&mut dataset);\n println!(\"{:?}\", dataset);\n}", "explanation": "Bubble sort on float data, variable named 'dataset', 5 elements."} {"id": 236, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using bubble sort.", "code": "fn bubble_sort(arr: &mut Vec) {\n let n = arr.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if arr[j] > arr[j + 1] {\n arr.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut arr = vec![64.24, 63.48, -0.5, 93.41, 42.24];\n bubble_sort(&mut arr);\n println!(\"{:?}\", arr);\n}", "explanation": "Bubble sort on float data, variable named 'arr', 5 elements."} {"id": 237, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using bubble sort.", "code": "fn bubble_sort(vals: &mut Vec) {\n let n = vals.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if vals[j] > vals[j + 1] {\n vals.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut vals = vec![77.88, 10.85, 24.25, 69.22, 83.94];\n bubble_sort(&mut vals);\n println!(\"{:?}\", vals);\n}", "explanation": "Bubble sort on float data, variable named 'vals', 5 elements."} {"id": 238, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using bubble sort.", "code": "fn bubble_sort(seq: &mut Vec) {\n let n = seq.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if seq[j] > seq[j + 1] {\n seq.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut seq = vec![85.48, 71.8, -16.51, 76.05, 12.37, -12.4, 64.77, 48.62];\n bubble_sort(&mut seq);\n println!(\"{:?}\", seq);\n}", "explanation": "Bubble sort on float data, variable named 'seq', 8 elements."} {"id": 239, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using bubble sort.", "code": "fn bubble_sort(data: &mut Vec) {\n let n = data.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if data[j] > data[j + 1] {\n data.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut data = vec![39.04, 40.78, -13.4, 82.26, -0.14, -1.28, 72.03, 86.42];\n bubble_sort(&mut data);\n println!(\"{:?}\", data);\n}", "explanation": "Bubble sort on float data, variable named 'data', 8 elements."} {"id": 240, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using bubble sort.", "code": "fn bubble_sort(buffer: &mut Vec) {\n let n = buffer.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if buffer[j] > buffer[j + 1] {\n buffer.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut buffer = vec![66.01, 7.18, 40.55, -14.76, 82.69, 9.1, 36.14, 25.57];\n bubble_sort(&mut buffer);\n println!(\"{:?}\", buffer);\n}", "explanation": "Bubble sort on float data, variable named 'buffer', 8 elements."} {"id": 241, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using bubble sort.", "code": "fn bubble_sort(values: &mut Vec) {\n let n = values.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if values[j] > values[j + 1] {\n values.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut values = vec![1.3, 94.28, -15.79, 75.57, 64.97, 58.03, 6.72, 9.54, 88.99, 18.07];\n bubble_sort(&mut values);\n println!(\"{:?}\", values);\n}", "explanation": "Bubble sort on float data, variable named 'values', 10 elements."} {"id": 242, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using bubble sort.", "code": "fn bubble_sort(records: &mut Vec) {\n let n = records.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if records[j] > records[j + 1] {\n records.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut records = vec![-10.73, 24.36, 39.74, 87.33, 1.34, 75.72, 96.79, 93.54, -11.8, 35.35];\n bubble_sort(&mut records);\n println!(\"{:?}\", records);\n}", "explanation": "Bubble sort on float data, variable named 'records', 10 elements."} {"id": 243, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using bubble sort.", "code": "fn bubble_sort(nums: &mut Vec) {\n let n = nums.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if nums[j] > nums[j + 1] {\n nums.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut nums = vec![72.05, 16.97, -9.72, 34.35, 23.9, 14.7, 73.36, 68.01, 8.87, 23.82];\n bubble_sort(&mut nums);\n println!(\"{:?}\", nums);\n}", "explanation": "Bubble sort on float data, variable named 'nums', 10 elements."} {"id": 244, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using bubble sort.", "code": "fn bubble_sort(dataset: &mut Vec) {\n let n = dataset.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if dataset[j] > dataset[j + 1] {\n dataset.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut dataset = vec![98.74, 72.33, 67.16, 45.04, 74.72, -2.08, 90.96, -17.15, 44.44, 55.68, 62.52, -18.86];\n bubble_sort(&mut dataset);\n println!(\"{:?}\", dataset);\n}", "explanation": "Bubble sort on float data, variable named 'dataset', 12 elements."} {"id": 245, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using bubble sort.", "code": "fn bubble_sort(list1: &mut Vec) {\n let n = list1.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if list1[j] > list1[j + 1] {\n list1.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut list1 = vec![-19.83, 58.22, 81.03, 66.54, -7.63, 43.05, 8.34, 38.55, -12.87, 98.64, 64.69, -8.93];\n bubble_sort(&mut list1);\n println!(\"{:?}\", list1);\n}", "explanation": "Bubble sort on float data, variable named 'list1', 12 elements."} {"id": 246, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using bubble sort.", "code": "fn bubble_sort(entries: &mut Vec) {\n let n = entries.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if entries[j] > entries[j + 1] {\n entries.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut entries = vec![7.55, 80.62, 29.15, 86.57, 34.56, 69.0, 49.11, 40.15, 55.83, 26.93, 50.44, -12.59];\n bubble_sort(&mut entries);\n println!(\"{:?}\", entries);\n}", "explanation": "Bubble sort on float data, variable named 'entries', 12 elements."} {"id": 247, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using bubble sort.", "code": "fn bubble_sort(buffer: &mut Vec) {\n let n = buffer.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if buffer[j] > buffer[j + 1] {\n buffer.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut buffer = vec![94.74, 8.18, 11.06, 17.49, 75.3, 63.39, 67.51, 17.85, 12.36, -11.11, 4.12, 72.81, 49.58, -1.51, -0.44];\n bubble_sort(&mut buffer);\n println!(\"{:?}\", buffer);\n}", "explanation": "Bubble sort on float data, variable named 'buffer', 15 elements."} {"id": 248, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using bubble sort.", "code": "fn bubble_sort(dataset: &mut Vec) {\n let n = dataset.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if dataset[j] > dataset[j + 1] {\n dataset.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut dataset = vec![17.37, -5.63, 22.64, 71.67, 33.78, 35.14, 81.45, -9.24, 76.1, 16.2, 63.86, 51.79, 5.59, 81.93, -2.35];\n bubble_sort(&mut dataset);\n println!(\"{:?}\", dataset);\n}", "explanation": "Bubble sort on float data, variable named 'dataset', 15 elements."} {"id": 249, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using bubble sort.", "code": "fn bubble_sort(seq: &mut Vec) {\n let n = seq.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if seq[j] > seq[j + 1] {\n seq.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut seq = vec![9.54, 22.33, 41.1, 60.58, 10.96, 97.89, -16.3, 28.12, 33.81, 69.02, 9.73, 34.98, 75.66, -3.36, -18.58];\n bubble_sort(&mut seq);\n println!(\"{:?}\", seq);\n}", "explanation": "Bubble sort on float data, variable named 'seq', 15 elements."} {"id": 250, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using bubble sort.", "code": "fn bubble_sort(records: &mut Vec) {\n let n = records.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if records[j] > records[j + 1] {\n records.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut records = vec![72.93, 6.45, 3.58, 27.67, 61.67, 91.57, -10.0, 49.75, 89.17, -11.08, 98.66, 3.53, 56.87, 76.31, -9.05, 80.83, 76.26, -5.42, 92.13, -13.97];\n bubble_sort(&mut records);\n println!(\"{:?}\", records);\n}", "explanation": "Bubble sort on float data, variable named 'records', 20 elements."} {"id": 251, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using bubble sort.", "code": "fn bubble_sort(entries: &mut Vec) {\n let n = entries.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if entries[j] > entries[j + 1] {\n entries.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut entries = vec![48.29, 77.78, 27.0, -16.49, 61.3, 0.56, 5.55, 2.27, 13.3, 85.13, -15.88, 53.68, 9.25, 15.12, 29.03, 45.53, -12.74, 13.29, -3.67, 3.74];\n bubble_sort(&mut entries);\n println!(\"{:?}\", entries);\n}", "explanation": "Bubble sort on float data, variable named 'entries', 20 elements."} {"id": 252, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using bubble sort.", "code": "fn bubble_sort(entries: &mut Vec) {\n let n = entries.len();\n for i in 0..n {\n for j in 0..n - i - 1 {\n if entries[j] > entries[j + 1] {\n entries.swap(j, j + 1);\n }\n }\n }\n}\n\nfn main() {\n let mut entries = vec![74.87, 9.65, 98.3, 44.7, -17.68, 25.52, 64.89, 37.08, 72.99, 20.94, 47.31, 18.27, 12.18, -16.9, 51.06, -16.51, 76.47, 13.43, 76.23, 36.13];\n bubble_sort(&mut entries);\n println!(\"{:?}\", entries);\n}", "explanation": "Bubble sort on float data, variable named 'entries', 20 elements."} {"id": 253, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using selection sort.", "code": "def selection_sort(list1):\n n = len(list1)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if list1[j] < list1[min_idx]:\n min_idx = j\n list1[i], list1[min_idx] = list1[min_idx], list1[i]\n return list1\n\nprint(selection_sort([99, 9, -10, -25, 13]))", "explanation": "Selection sort on int data, variable named 'list1', 5 elements."} {"id": 254, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using selection sort.", "code": "def selection_sort(buffer):\n n = len(buffer)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if buffer[j] < buffer[min_idx]:\n min_idx = j\n buffer[i], buffer[min_idx] = buffer[min_idx], buffer[i]\n return buffer\n\nprint(selection_sort([11, 18, 86, -36, 6]))", "explanation": "Selection sort on int data, variable named 'buffer', 5 elements."} {"id": 255, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using selection sort.", "code": "def selection_sort(elements):\n n = len(elements)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if elements[j] < elements[min_idx]:\n min_idx = j\n elements[i], elements[min_idx] = elements[min_idx], elements[i]\n return elements\n\nprint(selection_sort([49, 40, -6, -5, 10]))", "explanation": "Selection sort on int data, variable named 'elements', 5 elements."} {"id": 256, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using selection sort.", "code": "def selection_sort(elements):\n n = len(elements)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if elements[j] < elements[min_idx]:\n min_idx = j\n elements[i], elements[min_idx] = elements[min_idx], elements[i]\n return elements\n\nprint(selection_sort([31, 41, -43, 40, 95, 94, -14, 94]))", "explanation": "Selection sort on int data, variable named 'elements', 8 elements."} {"id": 257, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using selection sort.", "code": "def selection_sort(items):\n n = len(items)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if items[j] < items[min_idx]:\n min_idx = j\n items[i], items[min_idx] = items[min_idx], items[i]\n return items\n\nprint(selection_sort([76, 88, 29, -6, 75, -41, -27, -36]))", "explanation": "Selection sort on int data, variable named 'items', 8 elements."} {"id": 258, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using selection sort.", "code": "def selection_sort(items):\n n = len(items)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if items[j] < items[min_idx]:\n min_idx = j\n items[i], items[min_idx] = items[min_idx], items[i]\n return items\n\nprint(selection_sort([6, -45, 84, 72, -50, 34, 1, -17]))", "explanation": "Selection sort on int data, variable named 'items', 8 elements."} {"id": 259, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using selection sort.", "code": "def selection_sort(list1):\n n = len(list1)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if list1[j] < list1[min_idx]:\n min_idx = j\n list1[i], list1[min_idx] = list1[min_idx], list1[i]\n return list1\n\nprint(selection_sort([-5, 32, -35, -45, -13, -14, -22, 84, 43, -32]))", "explanation": "Selection sort on int data, variable named 'list1', 10 elements."} {"id": 260, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using selection sort.", "code": "def selection_sort(list1):\n n = len(list1)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if list1[j] < list1[min_idx]:\n min_idx = j\n list1[i], list1[min_idx] = list1[min_idx], list1[i]\n return list1\n\nprint(selection_sort([51, -25, 36, 27, 32, -16, -10, 61, 74, 31]))", "explanation": "Selection sort on int data, variable named 'list1', 10 elements."} {"id": 261, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using selection sort.", "code": "def selection_sort(values):\n n = len(values)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if values[j] < values[min_idx]:\n min_idx = j\n values[i], values[min_idx] = values[min_idx], values[i]\n return values\n\nprint(selection_sort([93, 41, 7, -6, 46, 28, 25, -18, -5, -50]))", "explanation": "Selection sort on int data, variable named 'values', 10 elements."} {"id": 262, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using selection sort.", "code": "def selection_sort(seq):\n n = len(seq)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if seq[j] < seq[min_idx]:\n min_idx = j\n seq[i], seq[min_idx] = seq[min_idx], seq[i]\n return seq\n\nprint(selection_sort([96, 50, 95, -42, -4, 31, 6, 94, -24, 77, -14, 34]))", "explanation": "Selection sort on int data, variable named 'seq', 12 elements."} {"id": 263, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using selection sort.", "code": "def selection_sort(seq):\n n = len(seq)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if seq[j] < seq[min_idx]:\n min_idx = j\n seq[i], seq[min_idx] = seq[min_idx], seq[i]\n return seq\n\nprint(selection_sort([-31, 10, 38, 31, -8, -28, 35, 64, -48, 17, 3, 13]))", "explanation": "Selection sort on int data, variable named 'seq', 12 elements."} {"id": 264, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using selection sort.", "code": "def selection_sort(seq):\n n = len(seq)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if seq[j] < seq[min_idx]:\n min_idx = j\n seq[i], seq[min_idx] = seq[min_idx], seq[i]\n return seq\n\nprint(selection_sort([-33, 39, 15, -23, -50, -38, 48, 62, 57, -8, 55, 76]))", "explanation": "Selection sort on int data, variable named 'seq', 12 elements."} {"id": 265, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using selection sort.", "code": "def selection_sort(entries):\n n = len(entries)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if entries[j] < entries[min_idx]:\n min_idx = j\n entries[i], entries[min_idx] = entries[min_idx], entries[i]\n return entries\n\nprint(selection_sort([46, 39, 89, 46, -25, 72, 97, 7, -9, 65, -32, -42, 25, -45, 31]))", "explanation": "Selection sort on int data, variable named 'entries', 15 elements."} {"id": 266, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using selection sort.", "code": "def selection_sort(nums):\n n = len(nums)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if nums[j] < nums[min_idx]:\n min_idx = j\n nums[i], nums[min_idx] = nums[min_idx], nums[i]\n return nums\n\nprint(selection_sort([-24, -32, 37, -7, 46, -9, -31, 90, -27, 36, 73, -43, 60, -8, 61]))", "explanation": "Selection sort on int data, variable named 'nums', 15 elements."} {"id": 267, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using selection sort.", "code": "def selection_sort(values):\n n = len(values)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if values[j] < values[min_idx]:\n min_idx = j\n values[i], values[min_idx] = values[min_idx], values[i]\n return values\n\nprint(selection_sort([-37, -25, 34, 2, -2, 54, 91, 88, 17, 22, 26, 10, -26, -38, 50]))", "explanation": "Selection sort on int data, variable named 'values', 15 elements."} {"id": 268, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using selection sort.", "code": "def selection_sort(elements):\n n = len(elements)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if elements[j] < elements[min_idx]:\n min_idx = j\n elements[i], elements[min_idx] = elements[min_idx], elements[i]\n return elements\n\nprint(selection_sort([90, 75, -11, -37, 42, -50, 59, -28, 25, 72, 1, -26, -44, 2, -7, 24, -30, 71, -21, 28]))", "explanation": "Selection sort on int data, variable named 'elements', 20 elements."} {"id": 269, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using selection sort.", "code": "def selection_sort(vals):\n n = len(vals)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if vals[j] < vals[min_idx]:\n min_idx = j\n vals[i], vals[min_idx] = vals[min_idx], vals[i]\n return vals\n\nprint(selection_sort([51, 70, 75, 17, -27, 89, 49, -3, 44, 47, 44, -3, 64, -39, 17, 62, 69, 17, 7, 18]))", "explanation": "Selection sort on int data, variable named 'vals', 20 elements."} {"id": 270, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using selection sort.", "code": "def selection_sort(elements):\n n = len(elements)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if elements[j] < elements[min_idx]:\n min_idx = j\n elements[i], elements[min_idx] = elements[min_idx], elements[i]\n return elements\n\nprint(selection_sort([-35, -12, -26, -29, 38, 88, 55, 8, 91, -35, 49, 83, 57, 87, 71, 96, 10, 71, 26, -30]))", "explanation": "Selection sort on int data, variable named 'elements', 20 elements."} {"id": 271, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using selection sort.", "code": "def selection_sort(collection):\n n = len(collection)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if collection[j] < collection[min_idx]:\n min_idx = j\n collection[i], collection[min_idx] = collection[min_idx], collection[i]\n return collection\n\nprint(selection_sort([87.43, 65.0, 39.75, 87.15, 75.25]))", "explanation": "Selection sort on float data, variable named 'collection', 5 elements."} {"id": 272, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using selection sort.", "code": "def selection_sort(buffer):\n n = len(buffer)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if buffer[j] < buffer[min_idx]:\n min_idx = j\n buffer[i], buffer[min_idx] = buffer[min_idx], buffer[i]\n return buffer\n\nprint(selection_sort([96.95, -2.45, 92.96, 33.44, 92.94]))", "explanation": "Selection sort on float data, variable named 'buffer', 5 elements."} {"id": 273, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using selection sort.", "code": "def selection_sort(values):\n n = len(values)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if values[j] < values[min_idx]:\n min_idx = j\n values[i], values[min_idx] = values[min_idx], values[i]\n return values\n\nprint(selection_sort([95.69, 76.21, -4.98, 30.38, 97.61]))", "explanation": "Selection sort on float data, variable named 'values', 5 elements."} {"id": 274, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using selection sort.", "code": "def selection_sort(collection):\n n = len(collection)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if collection[j] < collection[min_idx]:\n min_idx = j\n collection[i], collection[min_idx] = collection[min_idx], collection[i]\n return collection\n\nprint(selection_sort([4.03, 77.89, -2.4, 50.81, 18.05, 66.53, 76.07, -9.64]))", "explanation": "Selection sort on float data, variable named 'collection', 8 elements."} {"id": 275, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using selection sort.", "code": "def selection_sort(input_arr):\n n = len(input_arr)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if input_arr[j] < input_arr[min_idx]:\n min_idx = j\n input_arr[i], input_arr[min_idx] = input_arr[min_idx], input_arr[i]\n return input_arr\n\nprint(selection_sort([27.29, 18.81, 12.87, 34.52, 83.94, 73.6, 54.14, 42.18]))", "explanation": "Selection sort on float data, variable named 'input_arr', 8 elements."} {"id": 276, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using selection sort.", "code": "def selection_sort(collection):\n n = len(collection)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if collection[j] < collection[min_idx]:\n min_idx = j\n collection[i], collection[min_idx] = collection[min_idx], collection[i]\n return collection\n\nprint(selection_sort([-6.61, -2.19, 47.42, 49.34, 94.81, -8.08, -7.43, 72.77]))", "explanation": "Selection sort on float data, variable named 'collection', 8 elements."} {"id": 277, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using selection sort.", "code": "def selection_sort(vals):\n n = len(vals)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if vals[j] < vals[min_idx]:\n min_idx = j\n vals[i], vals[min_idx] = vals[min_idx], vals[i]\n return vals\n\nprint(selection_sort([14.05, 43.74, 20.92, 28.9, 25.58, 37.78, 52.47, -15.54, 12.77, -2.88]))", "explanation": "Selection sort on float data, variable named 'vals', 10 elements."} {"id": 278, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using selection sort.", "code": "def selection_sort(elements):\n n = len(elements)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if elements[j] < elements[min_idx]:\n min_idx = j\n elements[i], elements[min_idx] = elements[min_idx], elements[i]\n return elements\n\nprint(selection_sort([61.02, 27.8, 27.1, 84.6, 62.17, -14.13, 36.55, 11.96, 24.32, 20.21]))", "explanation": "Selection sort on float data, variable named 'elements', 10 elements."} {"id": 279, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using selection sort.", "code": "def selection_sort(vals):\n n = len(vals)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if vals[j] < vals[min_idx]:\n min_idx = j\n vals[i], vals[min_idx] = vals[min_idx], vals[i]\n return vals\n\nprint(selection_sort([16.06, 13.36, 38.5, 62.85, -8.31, 83.4, -4.01, 95.93, 32.73, 78.27]))", "explanation": "Selection sort on float data, variable named 'vals', 10 elements."} {"id": 280, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using selection sort.", "code": "def selection_sort(nums):\n n = len(nums)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if nums[j] < nums[min_idx]:\n min_idx = j\n nums[i], nums[min_idx] = nums[min_idx], nums[i]\n return nums\n\nprint(selection_sort([66.73, 51.99, -9.37, 32.56, 88.7, 28.45, 37.65, 41.46, 24.5, -13.31, 74.19, -12.19]))", "explanation": "Selection sort on float data, variable named 'nums', 12 elements."} {"id": 281, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using selection sort.", "code": "def selection_sort(seq):\n n = len(seq)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if seq[j] < seq[min_idx]:\n min_idx = j\n seq[i], seq[min_idx] = seq[min_idx], seq[i]\n return seq\n\nprint(selection_sort([40.31, -3.86, 81.3, 84.64, -16.56, 2.94, 79.12, 79.6, 9.69, 34.32, 89.25, 63.85]))", "explanation": "Selection sort on float data, variable named 'seq', 12 elements."} {"id": 282, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using selection sort.", "code": "def selection_sort(nums):\n n = len(nums)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if nums[j] < nums[min_idx]:\n min_idx = j\n nums[i], nums[min_idx] = nums[min_idx], nums[i]\n return nums\n\nprint(selection_sort([23.83, 35.24, 27.24, 89.85, 61.06, 8.79, 38.17, 33.09, 94.3, 36.48, 45.61, 20.97]))", "explanation": "Selection sort on float data, variable named 'nums', 12 elements."} {"id": 283, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using selection sort.", "code": "def selection_sort(records):\n n = len(records)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if records[j] < records[min_idx]:\n min_idx = j\n records[i], records[min_idx] = records[min_idx], records[i]\n return records\n\nprint(selection_sort([86.44, 69.13, 61.97, 13.92, 26.0, -0.61, 48.1, 94.83, 82.0, 57.04, 60.65, 12.02, 28.73, -17.61, 72.86]))", "explanation": "Selection sort on float data, variable named 'records', 15 elements."} {"id": 284, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using selection sort.", "code": "def selection_sort(vals):\n n = len(vals)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if vals[j] < vals[min_idx]:\n min_idx = j\n vals[i], vals[min_idx] = vals[min_idx], vals[i]\n return vals\n\nprint(selection_sort([61.18, 36.42, -4.25, 0.61, 75.3, 6.63, 52.39, 92.22, 64.82, 64.41, 12.77, 86.56, 81.34, 34.62, 5.97]))", "explanation": "Selection sort on float data, variable named 'vals', 15 elements."} {"id": 285, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using selection sort.", "code": "def selection_sort(nums):\n n = len(nums)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if nums[j] < nums[min_idx]:\n min_idx = j\n nums[i], nums[min_idx] = nums[min_idx], nums[i]\n return nums\n\nprint(selection_sort([60.59, 78.09, 27.26, -7.82, 40.87, 58.82, 80.35, 24.53, 57.03, 52.48, 15.52, -7.14, -12.4, 97.61, 56.23]))", "explanation": "Selection sort on float data, variable named 'nums', 15 elements."} {"id": 286, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using selection sort.", "code": "def selection_sort(records):\n n = len(records)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if records[j] < records[min_idx]:\n min_idx = j\n records[i], records[min_idx] = records[min_idx], records[i]\n return records\n\nprint(selection_sort([12.95, 58.08, 93.31, 57.52, 2.41, 41.56, 8.6, -13.24, 82.02, 76.39, 28.09, 18.03, -3.35, -16.97, 39.19, 15.18, 87.92, 28.15, 67.67, 49.38]))", "explanation": "Selection sort on float data, variable named 'records', 20 elements."} {"id": 287, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using selection sort.", "code": "def selection_sort(elements):\n n = len(elements)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if elements[j] < elements[min_idx]:\n min_idx = j\n elements[i], elements[min_idx] = elements[min_idx], elements[i]\n return elements\n\nprint(selection_sort([77.11, 20.84, 64.89, 61.67, 55.96, 36.61, 91.94, 22.66, 15.72, 0.23, 58.26, 46.43, 14.96, 36.02, 68.17, 66.3, 46.52, 88.6, 92.68, 87.05]))", "explanation": "Selection sort on float data, variable named 'elements', 20 elements."} {"id": 288, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using selection sort.", "code": "def selection_sort(buffer):\n n = len(buffer)\n for i in range(n):\n min_idx = i\n for j in range(i + 1, n):\n if buffer[j] < buffer[min_idx]:\n min_idx = j\n buffer[i], buffer[min_idx] = buffer[min_idx], buffer[i]\n return buffer\n\nprint(selection_sort([-9.37, 22.28, 68.56, 16.54, 73.78, 19.43, 11.01, 14.99, 81.29, 35.99, 83.1, 49.45, 92.37, -11.53, 85.84, 39.56, 83.23, 25.42, 15.5, -13.57]))", "explanation": "Selection sort on float data, variable named 'buffer', 20 elements."} {"id": 289, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using selection sort.", "code": "function selectionSort(records) {\n const n = records.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (records[j] < records[minIdx]) minIdx = j;\n }\n [records[i], records[minIdx]] = [records[minIdx], records[i]];\n }\n return records;\n}\n\nconsole.log(selectionSort([-12, -15, 1, 37, 54]));", "explanation": "Selection sort on int data, variable named 'records', 5 elements."} {"id": 290, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using selection sort.", "code": "function selectionSort(elements) {\n const n = elements.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (elements[j] < elements[minIdx]) minIdx = j;\n }\n [elements[i], elements[minIdx]] = [elements[minIdx], elements[i]];\n }\n return elements;\n}\n\nconsole.log(selectionSort([67, -14, 30, -4, -30]));", "explanation": "Selection sort on int data, variable named 'elements', 5 elements."} {"id": 291, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using selection sort.", "code": "function selectionSort(dataset) {\n const n = dataset.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (dataset[j] < dataset[minIdx]) minIdx = j;\n }\n [dataset[i], dataset[minIdx]] = [dataset[minIdx], dataset[i]];\n }\n return dataset;\n}\n\nconsole.log(selectionSort([35, -5, 30, -36, -49]));", "explanation": "Selection sort on int data, variable named 'dataset', 5 elements."} {"id": 292, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using selection sort.", "code": "function selectionSort(dataset) {\n const n = dataset.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (dataset[j] < dataset[minIdx]) minIdx = j;\n }\n [dataset[i], dataset[minIdx]] = [dataset[minIdx], dataset[i]];\n }\n return dataset;\n}\n\nconsole.log(selectionSort([20, 3, -7, 97, -10, 75, -28, -17]));", "explanation": "Selection sort on int data, variable named 'dataset', 8 elements."} {"id": 293, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using selection sort.", "code": "function selectionSort(elements) {\n const n = elements.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (elements[j] < elements[minIdx]) minIdx = j;\n }\n [elements[i], elements[minIdx]] = [elements[minIdx], elements[i]];\n }\n return elements;\n}\n\nconsole.log(selectionSort([61, 59, 53, 59, 72, 48, -49, -41]));", "explanation": "Selection sort on int data, variable named 'elements', 8 elements."} {"id": 294, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using selection sort.", "code": "function selectionSort(input_arr) {\n const n = input_arr.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (input_arr[j] < input_arr[minIdx]) minIdx = j;\n }\n [input_arr[i], input_arr[minIdx]] = [input_arr[minIdx], input_arr[i]];\n }\n return input_arr;\n}\n\nconsole.log(selectionSort([1, 45, -47, 32, 85, -2, -46, -49]));", "explanation": "Selection sort on int data, variable named 'input_arr', 8 elements."} {"id": 295, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using selection sort.", "code": "function selectionSort(buffer) {\n const n = buffer.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (buffer[j] < buffer[minIdx]) minIdx = j;\n }\n [buffer[i], buffer[minIdx]] = [buffer[minIdx], buffer[i]];\n }\n return buffer;\n}\n\nconsole.log(selectionSort([13, 7, 38, 29, -17, -24, 48, 78, 28, -8]));", "explanation": "Selection sort on int data, variable named 'buffer', 10 elements."} {"id": 296, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using selection sort.", "code": "function selectionSort(data) {\n const n = data.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (data[j] < data[minIdx]) minIdx = j;\n }\n [data[i], data[minIdx]] = [data[minIdx], data[i]];\n }\n return data;\n}\n\nconsole.log(selectionSort([-39, 26, 24, 66, 83, 84, 36, 61, -16, 37]));", "explanation": "Selection sort on int data, variable named 'data', 10 elements."} {"id": 297, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using selection sort.", "code": "function selectionSort(entries) {\n const n = entries.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (entries[j] < entries[minIdx]) minIdx = j;\n }\n [entries[i], entries[minIdx]] = [entries[minIdx], entries[i]];\n }\n return entries;\n}\n\nconsole.log(selectionSort([75, 41, -2, -8, 53, -46, 8, 7, -17, 4]));", "explanation": "Selection sort on int data, variable named 'entries', 10 elements."} {"id": 298, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using selection sort.", "code": "function selectionSort(seq) {\n const n = seq.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (seq[j] < seq[minIdx]) minIdx = j;\n }\n [seq[i], seq[minIdx]] = [seq[minIdx], seq[i]];\n }\n return seq;\n}\n\nconsole.log(selectionSort([-45, 79, -7, -19, 43, -41, 46, 15, 86, -38, -38, -23]));", "explanation": "Selection sort on int data, variable named 'seq', 12 elements."} {"id": 299, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using selection sort.", "code": "function selectionSort(buffer) {\n const n = buffer.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (buffer[j] < buffer[minIdx]) minIdx = j;\n }\n [buffer[i], buffer[minIdx]] = [buffer[minIdx], buffer[i]];\n }\n return buffer;\n}\n\nconsole.log(selectionSort([-45, -38, -21, 56, 63, 47, -19, 90, 14, 71, -11, 2]));", "explanation": "Selection sort on int data, variable named 'buffer', 12 elements."} {"id": 300, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using selection sort.", "code": "function selectionSort(seq) {\n const n = seq.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (seq[j] < seq[minIdx]) minIdx = j;\n }\n [seq[i], seq[minIdx]] = [seq[minIdx], seq[i]];\n }\n return seq;\n}\n\nconsole.log(selectionSort([-48, 27, 57, -25, 83, 19, -15, 57, -24, 80, -20, 22]));", "explanation": "Selection sort on int data, variable named 'seq', 12 elements."} {"id": 301, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using selection sort.", "code": "function selectionSort(data) {\n const n = data.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (data[j] < data[minIdx]) minIdx = j;\n }\n [data[i], data[minIdx]] = [data[minIdx], data[i]];\n }\n return data;\n}\n\nconsole.log(selectionSort([-23, 77, 0, 1, 17, 83, 1, 41, 54, 25, -9, -40, 90, 77, 3]));", "explanation": "Selection sort on int data, variable named 'data', 15 elements."} {"id": 302, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using selection sort.", "code": "function selectionSort(seq) {\n const n = seq.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (seq[j] < seq[minIdx]) minIdx = j;\n }\n [seq[i], seq[minIdx]] = [seq[minIdx], seq[i]];\n }\n return seq;\n}\n\nconsole.log(selectionSort([73, 34, 10, -50, -47, -28, -22, 96, 76, -12, -27, 80, -31, -25, 15]));", "explanation": "Selection sort on int data, variable named 'seq', 15 elements."} {"id": 303, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using selection sort.", "code": "function selectionSort(buffer) {\n const n = buffer.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (buffer[j] < buffer[minIdx]) minIdx = j;\n }\n [buffer[i], buffer[minIdx]] = [buffer[minIdx], buffer[i]];\n }\n return buffer;\n}\n\nconsole.log(selectionSort([9, 66, 25, 17, 68, -38, -25, -6, -40, 24, 42, 30, 59, -21, -26]));", "explanation": "Selection sort on int data, variable named 'buffer', 15 elements."} {"id": 304, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using selection sort.", "code": "function selectionSort(records) {\n const n = records.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (records[j] < records[minIdx]) minIdx = j;\n }\n [records[i], records[minIdx]] = [records[minIdx], records[i]];\n }\n return records;\n}\n\nconsole.log(selectionSort([-39, -48, -15, -7, 34, 41, 62, 18, -27, 45, 37, -4, -21, 52, 52, 66, 19, 48, 72, 57]));", "explanation": "Selection sort on int data, variable named 'records', 20 elements."} {"id": 305, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using selection sort.", "code": "function selectionSort(buffer) {\n const n = buffer.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (buffer[j] < buffer[minIdx]) minIdx = j;\n }\n [buffer[i], buffer[minIdx]] = [buffer[minIdx], buffer[i]];\n }\n return buffer;\n}\n\nconsole.log(selectionSort([-8, -22, -17, -35, -10, -24, 56, 73, 95, 62, -4, 47, 41, -43, -17, 73, 74, -22, 55, 62]));", "explanation": "Selection sort on int data, variable named 'buffer', 20 elements."} {"id": 306, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using selection sort.", "code": "function selectionSort(arr) {\n const n = arr.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (arr[j] < arr[minIdx]) minIdx = j;\n }\n [arr[i], arr[minIdx]] = [arr[minIdx], arr[i]];\n }\n return arr;\n}\n\nconsole.log(selectionSort([-34, 16, 30, -47, 84, 97, 94, 7, 36, 82, 83, -26, 60, 13, 73, 38, 48, -12, 92, -37]));", "explanation": "Selection sort on int data, variable named 'arr', 20 elements."} {"id": 307, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using selection sort.", "code": "function selectionSort(arr) {\n const n = arr.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (arr[j] < arr[minIdx]) minIdx = j;\n }\n [arr[i], arr[minIdx]] = [arr[minIdx], arr[i]];\n }\n return arr;\n}\n\nconsole.log(selectionSort([56.56, -1.33, 81.01, 81.37, 83.46]));", "explanation": "Selection sort on float data, variable named 'arr', 5 elements."} {"id": 308, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using selection sort.", "code": "function selectionSort(data) {\n const n = data.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (data[j] < data[minIdx]) minIdx = j;\n }\n [data[i], data[minIdx]] = [data[minIdx], data[i]];\n }\n return data;\n}\n\nconsole.log(selectionSort([69.42, 18.16, 19.38, 13.1, 40.32]));", "explanation": "Selection sort on float data, variable named 'data', 5 elements."} {"id": 309, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using selection sort.", "code": "function selectionSort(input_arr) {\n const n = input_arr.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (input_arr[j] < input_arr[minIdx]) minIdx = j;\n }\n [input_arr[i], input_arr[minIdx]] = [input_arr[minIdx], input_arr[i]];\n }\n return input_arr;\n}\n\nconsole.log(selectionSort([56.55, 27.99, 7.96, 34.63, 75.35]));", "explanation": "Selection sort on float data, variable named 'input_arr', 5 elements."} {"id": 310, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using selection sort.", "code": "function selectionSort(dataset) {\n const n = dataset.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (dataset[j] < dataset[minIdx]) minIdx = j;\n }\n [dataset[i], dataset[minIdx]] = [dataset[minIdx], dataset[i]];\n }\n return dataset;\n}\n\nconsole.log(selectionSort([-9.53, 39.32, 17.61, 96.7, 68.68, -17.89, 28.01, -15.74]));", "explanation": "Selection sort on float data, variable named 'dataset', 8 elements."} {"id": 311, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using selection sort.", "code": "function selectionSort(input_arr) {\n const n = input_arr.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (input_arr[j] < input_arr[minIdx]) minIdx = j;\n }\n [input_arr[i], input_arr[minIdx]] = [input_arr[minIdx], input_arr[i]];\n }\n return input_arr;\n}\n\nconsole.log(selectionSort([-19.98, -9.18, 51.9, 53.67, 16.25, 40.49, 4.62, 59.91]));", "explanation": "Selection sort on float data, variable named 'input_arr', 8 elements."} {"id": 312, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using selection sort.", "code": "function selectionSort(list1) {\n const n = list1.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (list1[j] < list1[minIdx]) minIdx = j;\n }\n [list1[i], list1[minIdx]] = [list1[minIdx], list1[i]];\n }\n return list1;\n}\n\nconsole.log(selectionSort([23.24, -13.54, 6.53, 34.08, 46.66, 53.75, 36.3, 58.2]));", "explanation": "Selection sort on float data, variable named 'list1', 8 elements."} {"id": 313, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using selection sort.", "code": "function selectionSort(seq) {\n const n = seq.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (seq[j] < seq[minIdx]) minIdx = j;\n }\n [seq[i], seq[minIdx]] = [seq[minIdx], seq[i]];\n }\n return seq;\n}\n\nconsole.log(selectionSort([33.85, -8.4, 58.41, -19.74, 22.26, 55.41, 75.19, 45.18, 24.49, -7.35]));", "explanation": "Selection sort on float data, variable named 'seq', 10 elements."} {"id": 314, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using selection sort.", "code": "function selectionSort(entries) {\n const n = entries.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (entries[j] < entries[minIdx]) minIdx = j;\n }\n [entries[i], entries[minIdx]] = [entries[minIdx], entries[i]];\n }\n return entries;\n}\n\nconsole.log(selectionSort([-0.47, -3.29, 65.31, 65.87, -7.27, 52.69, 2.32, 90.7, 26.75, 34.39]));", "explanation": "Selection sort on float data, variable named 'entries', 10 elements."} {"id": 315, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using selection sort.", "code": "function selectionSort(vals) {\n const n = vals.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (vals[j] < vals[minIdx]) minIdx = j;\n }\n [vals[i], vals[minIdx]] = [vals[minIdx], vals[i]];\n }\n return vals;\n}\n\nconsole.log(selectionSort([2.68, 20.21, 70.1, -14.47, 55.36, 59.98, -5.34, 86.12, 34.43, 50.13]));", "explanation": "Selection sort on float data, variable named 'vals', 10 elements."} {"id": 316, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using selection sort.", "code": "function selectionSort(input_arr) {\n const n = input_arr.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (input_arr[j] < input_arr[minIdx]) minIdx = j;\n }\n [input_arr[i], input_arr[minIdx]] = [input_arr[minIdx], input_arr[i]];\n }\n return input_arr;\n}\n\nconsole.log(selectionSort([-3.98, 39.36, 43.11, -14.22, 91.3, 79.82, 37.47, 40.49, 89.62, 1.09, 48.85, 66.93]));", "explanation": "Selection sort on float data, variable named 'input_arr', 12 elements."} {"id": 317, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using selection sort.", "code": "function selectionSort(values) {\n const n = values.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (values[j] < values[minIdx]) minIdx = j;\n }\n [values[i], values[minIdx]] = [values[minIdx], values[i]];\n }\n return values;\n}\n\nconsole.log(selectionSort([-7.68, 58.25, 52.13, 18.3, 84.89, 29.82, 52.47, 62.41, 9.54, 27.35, 20.8, 15.01]));", "explanation": "Selection sort on float data, variable named 'values', 12 elements."} {"id": 318, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using selection sort.", "code": "function selectionSort(vals) {\n const n = vals.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (vals[j] < vals[minIdx]) minIdx = j;\n }\n [vals[i], vals[minIdx]] = [vals[minIdx], vals[i]];\n }\n return vals;\n}\n\nconsole.log(selectionSort([-4.13, 29.12, 63.3, 69.06, 15.57, 63.48, 82.42, 64.71, 91.33, 55.28, 3.91, 54.28]));", "explanation": "Selection sort on float data, variable named 'vals', 12 elements."} {"id": 319, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using selection sort.", "code": "function selectionSort(nums) {\n const n = nums.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (nums[j] < nums[minIdx]) minIdx = j;\n }\n [nums[i], nums[minIdx]] = [nums[minIdx], nums[i]];\n }\n return nums;\n}\n\nconsole.log(selectionSort([61.71, 89.62, -4.21, 64.54, 96.05, 1.16, 44.56, 55.79, 64.53, 70.53, 46.91, 49.35, 92.18, 64.5, 60.23]));", "explanation": "Selection sort on float data, variable named 'nums', 15 elements."} {"id": 320, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using selection sort.", "code": "function selectionSort(entries) {\n const n = entries.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (entries[j] < entries[minIdx]) minIdx = j;\n }\n [entries[i], entries[minIdx]] = [entries[minIdx], entries[i]];\n }\n return entries;\n}\n\nconsole.log(selectionSort([80.13, 14.03, 80.83, 76.19, 42.2, -16.99, -2.71, 59.76, 3.79, 69.27, -0.85, 14.11, 9.82, 79.89, 62.18]));", "explanation": "Selection sort on float data, variable named 'entries', 15 elements."} {"id": 321, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using selection sort.", "code": "function selectionSort(nums) {\n const n = nums.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (nums[j] < nums[minIdx]) minIdx = j;\n }\n [nums[i], nums[minIdx]] = [nums[minIdx], nums[i]];\n }\n return nums;\n}\n\nconsole.log(selectionSort([4.28, 44.4, 22.68, 33.86, 53.32, 60.39, 46.86, 6.69, 57.01, 26.28, 40.8, 74.82, 62.84, 62.46, -14.41]));", "explanation": "Selection sort on float data, variable named 'nums', 15 elements."} {"id": 322, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using selection sort.", "code": "function selectionSort(collection) {\n const n = collection.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (collection[j] < collection[minIdx]) minIdx = j;\n }\n [collection[i], collection[minIdx]] = [collection[minIdx], collection[i]];\n }\n return collection;\n}\n\nconsole.log(selectionSort([26.12, 93.85, 96.12, 17.21, 45.7, -18.46, 9.91, 53.85, 72.93, 83.54, 78.77, 88.47, 63.85, 57.07, 69.86, 45.05, 51.8, 72.36, 94.75, 15.01]));", "explanation": "Selection sort on float data, variable named 'collection', 20 elements."} {"id": 323, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using selection sort.", "code": "function selectionSort(values) {\n const n = values.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (values[j] < values[minIdx]) minIdx = j;\n }\n [values[i], values[minIdx]] = [values[minIdx], values[i]];\n }\n return values;\n}\n\nconsole.log(selectionSort([97.03, -11.14, 94.53, 67.47, -5.8, -15.16, 13.21, 11.44, -0.85, 80.68, -19.33, 35.49, 91.56, -15.25, 90.51, 51.03, 72.07, 54.42, 80.33, 15.84]));", "explanation": "Selection sort on float data, variable named 'values', 20 elements."} {"id": 324, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using selection sort.", "code": "function selectionSort(vals) {\n const n = vals.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (vals[j] < vals[minIdx]) minIdx = j;\n }\n [vals[i], vals[minIdx]] = [vals[minIdx], vals[i]];\n }\n return vals;\n}\n\nconsole.log(selectionSort([48.15, 22.61, 73.3, 17.83, 6.18, 1.88, -11.89, 40.11, 29.5, 43.91, -9.06, 6.32, 5.39, 19.49, 22.93, 5.99, 69.57, 43.13, 98.6, 78.02]));", "explanation": "Selection sort on float data, variable named 'vals', 20 elements."} {"id": 325, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using selection sort.", "code": "function selectionSort(buffer) {\n const n = buffer.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (buffer[j] < buffer[minIdx]) minIdx = j;\n }\n [buffer[i], buffer[minIdx]] = [buffer[minIdx], buffer[i]];\n }\n return buffer;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([-48, -21, 38, 64, 11]));", "explanation": "Selection sort on int data, variable named 'buffer', 5 elements."} {"id": 326, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using selection sort.", "code": "function selectionSort(entries) {\n const n = entries.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (entries[j] < entries[minIdx]) minIdx = j;\n }\n [entries[i], entries[minIdx]] = [entries[minIdx], entries[i]];\n }\n return entries;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([12, -40, 32, 47, -21]));", "explanation": "Selection sort on int data, variable named 'entries', 5 elements."} {"id": 327, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using selection sort.", "code": "function selectionSort(collection) {\n const n = collection.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (collection[j] < collection[minIdx]) minIdx = j;\n }\n [collection[i], collection[minIdx]] = [collection[minIdx], collection[i]];\n }\n return collection;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([15, 88, 22, -44, 82]));", "explanation": "Selection sort on int data, variable named 'collection', 5 elements."} {"id": 328, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using selection sort.", "code": "function selectionSort(records) {\n const n = records.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (records[j] < records[minIdx]) minIdx = j;\n }\n [records[i], records[minIdx]] = [records[minIdx], records[i]];\n }\n return records;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([45, 81, 80, 64, 74, -39, 25, -1]));", "explanation": "Selection sort on int data, variable named 'records', 8 elements."} {"id": 329, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using selection sort.", "code": "function selectionSort(list1) {\n const n = list1.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (list1[j] < list1[minIdx]) minIdx = j;\n }\n [list1[i], list1[minIdx]] = [list1[minIdx], list1[i]];\n }\n return list1;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([81, -29, -26, -8, 87, 86, -49, -34]));", "explanation": "Selection sort on int data, variable named 'list1', 8 elements."} {"id": 330, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using selection sort.", "code": "function selectionSort(items) {\n const n = items.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (items[j] < items[minIdx]) minIdx = j;\n }\n [items[i], items[minIdx]] = [items[minIdx], items[i]];\n }\n return items;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([4, 58, -24, 2, 87, 61, -32, -11]));", "explanation": "Selection sort on int data, variable named 'items', 8 elements."} {"id": 331, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using selection sort.", "code": "function selectionSort(arr) {\n const n = arr.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (arr[j] < arr[minIdx]) minIdx = j;\n }\n [arr[i], arr[minIdx]] = [arr[minIdx], arr[i]];\n }\n return arr;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([67, 34, -41, -28, -32, -37, -5, 14, 92, -32]));", "explanation": "Selection sort on int data, variable named 'arr', 10 elements."} {"id": 332, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using selection sort.", "code": "function selectionSort(elements) {\n const n = elements.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (elements[j] < elements[minIdx]) minIdx = j;\n }\n [elements[i], elements[minIdx]] = [elements[minIdx], elements[i]];\n }\n return elements;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([8, 16, 54, 49, 65, 53, 60, 30, -46, 49]));", "explanation": "Selection sort on int data, variable named 'elements', 10 elements."} {"id": 333, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using selection sort.", "code": "function selectionSort(buffer) {\n const n = buffer.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (buffer[j] < buffer[minIdx]) minIdx = j;\n }\n [buffer[i], buffer[minIdx]] = [buffer[minIdx], buffer[i]];\n }\n return buffer;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([-20, 86, -49, -34, 99, -39, -32, 41, 78, -23]));", "explanation": "Selection sort on int data, variable named 'buffer', 10 elements."} {"id": 334, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using selection sort.", "code": "function selectionSort(nums) {\n const n = nums.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (nums[j] < nums[minIdx]) minIdx = j;\n }\n [nums[i], nums[minIdx]] = [nums[minIdx], nums[i]];\n }\n return nums;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([27, -28, 22, 62, 47, 51, -43, 71, -10, 86, 6, -16]));", "explanation": "Selection sort on int data, variable named 'nums', 12 elements."} {"id": 335, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using selection sort.", "code": "function selectionSort(seq) {\n const n = seq.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (seq[j] < seq[minIdx]) minIdx = j;\n }\n [seq[i], seq[minIdx]] = [seq[minIdx], seq[i]];\n }\n return seq;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([50, 89, 25, -14, 26, 45, -48, 91, 92, -14, -19, -40]));", "explanation": "Selection sort on int data, variable named 'seq', 12 elements."} {"id": 336, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using selection sort.", "code": "function selectionSort(arr) {\n const n = arr.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (arr[j] < arr[minIdx]) minIdx = j;\n }\n [arr[i], arr[minIdx]] = [arr[minIdx], arr[i]];\n }\n return arr;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([96, 50, 87, 90, -29, 28, 3, 38, 4, 55, 81, -14]));", "explanation": "Selection sort on int data, variable named 'arr', 12 elements."} {"id": 337, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using selection sort.", "code": "function selectionSort(values) {\n const n = values.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (values[j] < values[minIdx]) minIdx = j;\n }\n [values[i], values[minIdx]] = [values[minIdx], values[i]];\n }\n return values;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([-3, 6, 14, -1, -21, -4, 95, -37, 90, 68, 90, -32, 24, -33, 14]));", "explanation": "Selection sort on int data, variable named 'values', 15 elements."} {"id": 338, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using selection sort.", "code": "function selectionSort(data) {\n const n = data.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (data[j] < data[minIdx]) minIdx = j;\n }\n [data[i], data[minIdx]] = [data[minIdx], data[i]];\n }\n return data;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([0, 98, 74, 34, 41, -18, 10, -25, 22, -33, -1, 31, 74, 65, 34]));", "explanation": "Selection sort on int data, variable named 'data', 15 elements."} {"id": 339, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using selection sort.", "code": "function selectionSort(elements) {\n const n = elements.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (elements[j] < elements[minIdx]) minIdx = j;\n }\n [elements[i], elements[minIdx]] = [elements[minIdx], elements[i]];\n }\n return elements;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([28, 99, -11, 94, 95, 43, 30, 59, -7, -49, 30, 13, 6, 61, 20]));", "explanation": "Selection sort on int data, variable named 'elements', 15 elements."} {"id": 340, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using selection sort.", "code": "function selectionSort(records) {\n const n = records.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (records[j] < records[minIdx]) minIdx = j;\n }\n [records[i], records[minIdx]] = [records[minIdx], records[i]];\n }\n return records;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([42, -16, 34, 72, 68, 64, 41, 28, 74, 91, -23, -6, -30, 21, -15, 87, 0, 17, -31, -31]));", "explanation": "Selection sort on int data, variable named 'records', 20 elements."} {"id": 341, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using selection sort.", "code": "function selectionSort(entries) {\n const n = entries.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (entries[j] < entries[minIdx]) minIdx = j;\n }\n [entries[i], entries[minIdx]] = [entries[minIdx], entries[i]];\n }\n return entries;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([-46, 79, -43, 98, 98, 53, 4, -41, 91, 16, 89, 88, 70, -12, 43, 50, 7, 24, -16, 68]));", "explanation": "Selection sort on int data, variable named 'entries', 20 elements."} {"id": 342, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using selection sort.", "code": "function selectionSort(input_arr) {\n const n = input_arr.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (input_arr[j] < input_arr[minIdx]) minIdx = j;\n }\n [input_arr[i], input_arr[minIdx]] = [input_arr[minIdx], input_arr[i]];\n }\n return input_arr;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([80, -27, 51, 43, 78, -48, 11, -8, 81, -15, 64, -10, -5, 94, 94, -13, 73, 41, -40, 6]));", "explanation": "Selection sort on int data, variable named 'input_arr', 20 elements."} {"id": 343, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using selection sort.", "code": "function selectionSort(vals) {\n const n = vals.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (vals[j] < vals[minIdx]) minIdx = j;\n }\n [vals[i], vals[minIdx]] = [vals[minIdx], vals[i]];\n }\n return vals;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([38.03, -12.52, 23.96, -14.91, 4.61]));", "explanation": "Selection sort on float data, variable named 'vals', 5 elements."} {"id": 344, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using selection sort.", "code": "function selectionSort(entries) {\n const n = entries.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (entries[j] < entries[minIdx]) minIdx = j;\n }\n [entries[i], entries[minIdx]] = [entries[minIdx], entries[i]];\n }\n return entries;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([74.18, 26.18, 89.23, 84.9, -15.25]));", "explanation": "Selection sort on float data, variable named 'entries', 5 elements."} {"id": 345, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using selection sort.", "code": "function selectionSort(buffer) {\n const n = buffer.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (buffer[j] < buffer[minIdx]) minIdx = j;\n }\n [buffer[i], buffer[minIdx]] = [buffer[minIdx], buffer[i]];\n }\n return buffer;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([18.56, 63.74, 42.04, 78.73, 79.35]));", "explanation": "Selection sort on float data, variable named 'buffer', 5 elements."} {"id": 346, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using selection sort.", "code": "function selectionSort(nums) {\n const n = nums.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (nums[j] < nums[minIdx]) minIdx = j;\n }\n [nums[i], nums[minIdx]] = [nums[minIdx], nums[i]];\n }\n return nums;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([48.86, 47.85, 24.82, 25.04, 49.93, 86.89, -10.74, 9.94]));", "explanation": "Selection sort on float data, variable named 'nums', 8 elements."} {"id": 347, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using selection sort.", "code": "function selectionSort(entries) {\n const n = entries.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (entries[j] < entries[minIdx]) minIdx = j;\n }\n [entries[i], entries[minIdx]] = [entries[minIdx], entries[i]];\n }\n return entries;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([6.53, 28.3, 77.25, 21.06, 74.33, 85.57, -19.21, 84.96]));", "explanation": "Selection sort on float data, variable named 'entries', 8 elements."} {"id": 348, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using selection sort.", "code": "function selectionSort(dataset) {\n const n = dataset.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (dataset[j] < dataset[minIdx]) minIdx = j;\n }\n [dataset[i], dataset[minIdx]] = [dataset[minIdx], dataset[i]];\n }\n return dataset;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([-0.29, -10.83, 56.57, 5.17, 2.24, 23.1, 65.36, -5.92]));", "explanation": "Selection sort on float data, variable named 'dataset', 8 elements."} {"id": 349, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using selection sort.", "code": "function selectionSort(items) {\n const n = items.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (items[j] < items[minIdx]) minIdx = j;\n }\n [items[i], items[minIdx]] = [items[minIdx], items[i]];\n }\n return items;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([29.34, 19.3, -6.51, 60.35, 37.0, 50.3, 57.02, 28.9, 9.0, -4.78]));", "explanation": "Selection sort on float data, variable named 'items', 10 elements."} {"id": 350, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using selection sort.", "code": "function selectionSort(elements) {\n const n = elements.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (elements[j] < elements[minIdx]) minIdx = j;\n }\n [elements[i], elements[minIdx]] = [elements[minIdx], elements[i]];\n }\n return elements;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([-0.83, 54.92, -15.34, 48.1, -13.35, 10.73, 1.42, 94.03, 51.32, 47.07]));", "explanation": "Selection sort on float data, variable named 'elements', 10 elements."} {"id": 351, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using selection sort.", "code": "function selectionSort(arr) {\n const n = arr.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (arr[j] < arr[minIdx]) minIdx = j;\n }\n [arr[i], arr[minIdx]] = [arr[minIdx], arr[i]];\n }\n return arr;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([84.54, 66.63, 77.74, 92.72, 5.77, 52.18, 36.1, 37.32, 6.1, 28.88]));", "explanation": "Selection sort on float data, variable named 'arr', 10 elements."} {"id": 352, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using selection sort.", "code": "function selectionSort(values) {\n const n = values.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (values[j] < values[minIdx]) minIdx = j;\n }\n [values[i], values[minIdx]] = [values[minIdx], values[i]];\n }\n return values;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([74.56, 77.63, 1.64, 58.5, 11.48, 66.18, 20.78, 33.96, 50.28, 7.35, 25.87, -7.08]));", "explanation": "Selection sort on float data, variable named 'values', 12 elements."} {"id": 353, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using selection sort.", "code": "function selectionSort(items) {\n const n = items.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (items[j] < items[minIdx]) minIdx = j;\n }\n [items[i], items[minIdx]] = [items[minIdx], items[i]];\n }\n return items;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([42.2, 88.21, 61.44, 78.36, 52.06, 1.11, 87.29, 51.38, 84.45, 43.24, 69.53, -8.91]));", "explanation": "Selection sort on float data, variable named 'items', 12 elements."} {"id": 354, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using selection sort.", "code": "function selectionSort(buffer) {\n const n = buffer.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (buffer[j] < buffer[minIdx]) minIdx = j;\n }\n [buffer[i], buffer[minIdx]] = [buffer[minIdx], buffer[i]];\n }\n return buffer;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([-4.49, 51.81, 78.48, 86.74, 72.21, 57.26, 42.12, 24.07, -14.83, 43.05, 7.31, 75.47]));", "explanation": "Selection sort on float data, variable named 'buffer', 12 elements."} {"id": 355, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using selection sort.", "code": "function selectionSort(vals) {\n const n = vals.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (vals[j] < vals[minIdx]) minIdx = j;\n }\n [vals[i], vals[minIdx]] = [vals[minIdx], vals[i]];\n }\n return vals;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([71.47, 21.71, 75.75, 88.04, 79.63, 48.56, 30.63, 10.29, 71.14, 88.3, -10.03, 51.2, 44.7, 10.68, -19.35]));", "explanation": "Selection sort on float data, variable named 'vals', 15 elements."} {"id": 356, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using selection sort.", "code": "function selectionSort(seq) {\n const n = seq.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (seq[j] < seq[minIdx]) minIdx = j;\n }\n [seq[i], seq[minIdx]] = [seq[minIdx], seq[i]];\n }\n return seq;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([73.94, 48.78, -5.98, -19.14, 57.89, 61.84, 17.59, 23.11, -1.58, 57.54, 10.18, 81.74, 30.4, 23.51, 12.79]));", "explanation": "Selection sort on float data, variable named 'seq', 15 elements."} {"id": 357, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using selection sort.", "code": "function selectionSort(buffer) {\n const n = buffer.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (buffer[j] < buffer[minIdx]) minIdx = j;\n }\n [buffer[i], buffer[minIdx]] = [buffer[minIdx], buffer[i]];\n }\n return buffer;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([27.3, 4.24, 45.7, 46.35, 1.27, 46.53, 37.57, 97.63, 48.74, 72.13, 27.38, -3.57, 82.8, -5.83, 7.34]));", "explanation": "Selection sort on float data, variable named 'buffer', 15 elements."} {"id": 358, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using selection sort.", "code": "function selectionSort(vals) {\n const n = vals.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (vals[j] < vals[minIdx]) minIdx = j;\n }\n [vals[i], vals[minIdx]] = [vals[minIdx], vals[i]];\n }\n return vals;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([63.22, -0.75, 5.52, 27.67, 20.27, 45.52, 62.95, 64.11, -0.87, 94.78, -19.37, -9.16, -2.71, 90.18, 31.81, -12.37, 6.39, -10.48, -15.51, 25.73]));", "explanation": "Selection sort on float data, variable named 'vals', 20 elements."} {"id": 359, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using selection sort.", "code": "function selectionSort(collection) {\n const n = collection.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (collection[j] < collection[minIdx]) minIdx = j;\n }\n [collection[i], collection[minIdx]] = [collection[minIdx], collection[i]];\n }\n return collection;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([53.06, 42.0, 64.68, 51.1, 92.54, 77.61, 56.19, 32.24, 4.0, 58.17, 75.67, 14.03, -16.0, 51.34, 41.38, 7.57, 0.17, -15.71, 8.47, -19.97]));", "explanation": "Selection sort on float data, variable named 'collection', 20 elements."} {"id": 360, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using selection sort.", "code": "function selectionSort(values) {\n const n = values.length;\n for (let i = 0; i < n; i++) {\n let minIdx = i;\n for (let j = i + 1; j < n; j++) {\n if (values[j] < values[minIdx]) minIdx = j;\n }\n [values[i], values[minIdx]] = [values[minIdx], values[i]];\n }\n return values;\n}\n\nmodule.exports = { selectionSort };\nconsole.log(selectionSort([-9.67, 12.84, 27.53, 59.69, 28.25, 3.84, -18.17, 63.73, 89.38, 45.4, 66.41, 46.53, 49.37, 21.35, 77.05, 6.93, 94.6, 34.12, 28.07, -19.45]));", "explanation": "Selection sort on float data, variable named 'values', 20 elements."} {"id": 361, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(int[] values) {\n int n = values.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (values[j] < values[minIdx]) minIdx = j;\n }\n int temp = values[i];\n values[i] = values[minIdx];\n values[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n int[] values = {54, 79, -23, 93, -32};\n selectionSort(values);\n for (int v : values) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on int data, variable named 'values', 5 elements."} {"id": 362, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(int[] input_arr) {\n int n = input_arr.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (input_arr[j] < input_arr[minIdx]) minIdx = j;\n }\n int temp = input_arr[i];\n input_arr[i] = input_arr[minIdx];\n input_arr[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n int[] input_arr = {25, 37, -21, 81, 15};\n selectionSort(input_arr);\n for (int v : input_arr) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on int data, variable named 'input_arr', 5 elements."} {"id": 363, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(int[] entries) {\n int n = entries.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (entries[j] < entries[minIdx]) minIdx = j;\n }\n int temp = entries[i];\n entries[i] = entries[minIdx];\n entries[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n int[] entries = {87, 97, 14, 63, 46};\n selectionSort(entries);\n for (int v : entries) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on int data, variable named 'entries', 5 elements."} {"id": 364, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(int[] elements) {\n int n = elements.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (elements[j] < elements[minIdx]) minIdx = j;\n }\n int temp = elements[i];\n elements[i] = elements[minIdx];\n elements[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n int[] elements = {73, 12, 36, 67, 67, -43, 73, -21};\n selectionSort(elements);\n for (int v : elements) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on int data, variable named 'elements', 8 elements."} {"id": 365, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(int[] nums) {\n int n = nums.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (nums[j] < nums[minIdx]) minIdx = j;\n }\n int temp = nums[i];\n nums[i] = nums[minIdx];\n nums[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n int[] nums = {-33, 47, 6, 8, 30, 55, 40, 82};\n selectionSort(nums);\n for (int v : nums) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on int data, variable named 'nums', 8 elements."} {"id": 366, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(int[] input_arr) {\n int n = input_arr.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (input_arr[j] < input_arr[minIdx]) minIdx = j;\n }\n int temp = input_arr[i];\n input_arr[i] = input_arr[minIdx];\n input_arr[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n int[] input_arr = {-48, 17, 13, 23, -27, 52, 37, -31};\n selectionSort(input_arr);\n for (int v : input_arr) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on int data, variable named 'input_arr', 8 elements."} {"id": 367, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(int[] input_arr) {\n int n = input_arr.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (input_arr[j] < input_arr[minIdx]) minIdx = j;\n }\n int temp = input_arr[i];\n input_arr[i] = input_arr[minIdx];\n input_arr[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n int[] input_arr = {-5, 71, 30, 40, 5, 96, 18, -4, -2, 77};\n selectionSort(input_arr);\n for (int v : input_arr) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on int data, variable named 'input_arr', 10 elements."} {"id": 368, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(int[] seq) {\n int n = seq.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (seq[j] < seq[minIdx]) minIdx = j;\n }\n int temp = seq[i];\n seq[i] = seq[minIdx];\n seq[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n int[] seq = {1, 10, 11, 17, 2, 8, 1, 13, 41, -11};\n selectionSort(seq);\n for (int v : seq) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on int data, variable named 'seq', 10 elements."} {"id": 369, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(int[] vals) {\n int n = vals.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (vals[j] < vals[minIdx]) minIdx = j;\n }\n int temp = vals[i];\n vals[i] = vals[minIdx];\n vals[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n int[] vals = {-23, -20, -30, 76, -49, 88, -40, 73, 45, 30};\n selectionSort(vals);\n for (int v : vals) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on int data, variable named 'vals', 10 elements."} {"id": 370, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(int[] dataset) {\n int n = dataset.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (dataset[j] < dataset[minIdx]) minIdx = j;\n }\n int temp = dataset[i];\n dataset[i] = dataset[minIdx];\n dataset[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n int[] dataset = {97, 20, 75, -4, 80, 21, 51, 6, 97, -18, -37, 84};\n selectionSort(dataset);\n for (int v : dataset) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on int data, variable named 'dataset', 12 elements."} {"id": 371, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(int[] vals) {\n int n = vals.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (vals[j] < vals[minIdx]) minIdx = j;\n }\n int temp = vals[i];\n vals[i] = vals[minIdx];\n vals[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n int[] vals = {58, 72, 88, -42, 78, 38, 50, -6, 67, -20, 82, 67};\n selectionSort(vals);\n for (int v : vals) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on int data, variable named 'vals', 12 elements."} {"id": 372, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(int[] list1) {\n int n = list1.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (list1[j] < list1[minIdx]) minIdx = j;\n }\n int temp = list1[i];\n list1[i] = list1[minIdx];\n list1[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n int[] list1 = {-48, -47, 3, 47, 98, -25, 33, 42, 16, -3, 90, 17};\n selectionSort(list1);\n for (int v : list1) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on int data, variable named 'list1', 12 elements."} {"id": 373, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(int[] items) {\n int n = items.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (items[j] < items[minIdx]) minIdx = j;\n }\n int temp = items[i];\n items[i] = items[minIdx];\n items[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n int[] items = {18, 70, 37, 43, -3, 77, 58, 3, 57, 45, 43, 52, 21, 65, -4};\n selectionSort(items);\n for (int v : items) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on int data, variable named 'items', 15 elements."} {"id": 374, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(int[] elements) {\n int n = elements.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (elements[j] < elements[minIdx]) minIdx = j;\n }\n int temp = elements[i];\n elements[i] = elements[minIdx];\n elements[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n int[] elements = {-17, 97, 8, -25, 19, 10, 92, 60, 47, 0, -13, -12, 71, -48, -5};\n selectionSort(elements);\n for (int v : elements) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on int data, variable named 'elements', 15 elements."} {"id": 375, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(int[] collection) {\n int n = collection.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (collection[j] < collection[minIdx]) minIdx = j;\n }\n int temp = collection[i];\n collection[i] = collection[minIdx];\n collection[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n int[] collection = {77, -16, 82, 86, 30, 74, 26, 14, 93, 95, -38, 51, -25, -9, -35};\n selectionSort(collection);\n for (int v : collection) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on int data, variable named 'collection', 15 elements."} {"id": 376, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(int[] items) {\n int n = items.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (items[j] < items[minIdx]) minIdx = j;\n }\n int temp = items[i];\n items[i] = items[minIdx];\n items[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n int[] items = {15, 71, -26, 65, 35, 16, 42, 42, 93, 92, 15, 38, -45, 55, -19, 39, 0, 97, 97, 87};\n selectionSort(items);\n for (int v : items) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on int data, variable named 'items', 20 elements."} {"id": 377, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(int[] values) {\n int n = values.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (values[j] < values[minIdx]) minIdx = j;\n }\n int temp = values[i];\n values[i] = values[minIdx];\n values[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n int[] values = {22, 40, 33, 80, 74, 64, -30, 47, 23, 68, -13, -8, 36, 57, 96, 53, -32, -30, -9, 37};\n selectionSort(values);\n for (int v : values) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on int data, variable named 'values', 20 elements."} {"id": 378, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(int[] items) {\n int n = items.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (items[j] < items[minIdx]) minIdx = j;\n }\n int temp = items[i];\n items[i] = items[minIdx];\n items[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n int[] items = {30, 31, 24, 18, 51, 19, 63, 42, 83, 65, 55, -8, -3, -45, -18, 10, 14, -30, 3, -8};\n selectionSort(items);\n for (int v : items) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on int data, variable named 'items', 20 elements."} {"id": 379, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(double[] collection) {\n int n = collection.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (collection[j] < collection[minIdx]) minIdx = j;\n }\n double temp = collection[i];\n collection[i] = collection[minIdx];\n collection[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n double[] collection = {-7.74, -12.41, 84.56, 45.26, -16.86};\n selectionSort(collection);\n for (double v : collection) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on float data, variable named 'collection', 5 elements."} {"id": 380, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(double[] collection) {\n int n = collection.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (collection[j] < collection[minIdx]) minIdx = j;\n }\n double temp = collection[i];\n collection[i] = collection[minIdx];\n collection[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n double[] collection = {42.35, 98.53, -7.63, 53.55, -9.97};\n selectionSort(collection);\n for (double v : collection) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on float data, variable named 'collection', 5 elements."} {"id": 381, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(double[] entries) {\n int n = entries.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (entries[j] < entries[minIdx]) minIdx = j;\n }\n double temp = entries[i];\n entries[i] = entries[minIdx];\n entries[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n double[] entries = {85.37, 16.82, 9.44, 13.82, 54.55};\n selectionSort(entries);\n for (double v : entries) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on float data, variable named 'entries', 5 elements."} {"id": 382, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(double[] values) {\n int n = values.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (values[j] < values[minIdx]) minIdx = j;\n }\n double temp = values[i];\n values[i] = values[minIdx];\n values[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n double[] values = {42.68, 0.3, -15.82, 22.46, 88.92, 82.84, 35.6, 83.64};\n selectionSort(values);\n for (double v : values) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on float data, variable named 'values', 8 elements."} {"id": 383, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(double[] entries) {\n int n = entries.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (entries[j] < entries[minIdx]) minIdx = j;\n }\n double temp = entries[i];\n entries[i] = entries[minIdx];\n entries[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n double[] entries = {12.42, 32.94, 95.38, 63.02, 1.07, 51.11, 55.09, 55.67};\n selectionSort(entries);\n for (double v : entries) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on float data, variable named 'entries', 8 elements."} {"id": 384, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(double[] elements) {\n int n = elements.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (elements[j] < elements[minIdx]) minIdx = j;\n }\n double temp = elements[i];\n elements[i] = elements[minIdx];\n elements[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n double[] elements = {31.76, 56.13, 43.52, 88.16, 37.32, 7.03, -9.34, 16.64};\n selectionSort(elements);\n for (double v : elements) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on float data, variable named 'elements', 8 elements."} {"id": 385, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(double[] collection) {\n int n = collection.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (collection[j] < collection[minIdx]) minIdx = j;\n }\n double temp = collection[i];\n collection[i] = collection[minIdx];\n collection[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n double[] collection = {10.92, 16.13, -19.99, 77.03, 80.91, 20.92, 35.83, -19.01, 89.73, 92.69};\n selectionSort(collection);\n for (double v : collection) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on float data, variable named 'collection', 10 elements."} {"id": 386, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(double[] dataset) {\n int n = dataset.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (dataset[j] < dataset[minIdx]) minIdx = j;\n }\n double temp = dataset[i];\n dataset[i] = dataset[minIdx];\n dataset[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n double[] dataset = {15.65, 71.14, 74.96, 51.04, 74.82, 45.24, 2.44, 84.98, 32.02, 9.74};\n selectionSort(dataset);\n for (double v : dataset) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on float data, variable named 'dataset', 10 elements."} {"id": 387, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(double[] seq) {\n int n = seq.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (seq[j] < seq[minIdx]) minIdx = j;\n }\n double temp = seq[i];\n seq[i] = seq[minIdx];\n seq[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n double[] seq = {67.72, 26.38, 25.02, 11.29, 30.25, 8.51, 70.98, 88.28, 76.1, 61.47};\n selectionSort(seq);\n for (double v : seq) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on float data, variable named 'seq', 10 elements."} {"id": 388, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(double[] nums) {\n int n = nums.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (nums[j] < nums[minIdx]) minIdx = j;\n }\n double temp = nums[i];\n nums[i] = nums[minIdx];\n nums[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n double[] nums = {57.17, 43.3, 11.99, 2.37, -11.85, -3.74, -6.87, 34.19, 33.88, 63.36, 38.55, 18.16};\n selectionSort(nums);\n for (double v : nums) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on float data, variable named 'nums', 12 elements."} {"id": 389, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(double[] values) {\n int n = values.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (values[j] < values[minIdx]) minIdx = j;\n }\n double temp = values[i];\n values[i] = values[minIdx];\n values[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n double[] values = {-14.09, 43.66, 2.13, -7.83, 12.03, 65.11, 66.53, 7.7, -2.07, 38.74, 20.69, 17.08};\n selectionSort(values);\n for (double v : values) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on float data, variable named 'values', 12 elements."} {"id": 390, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(double[] vals) {\n int n = vals.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (vals[j] < vals[minIdx]) minIdx = j;\n }\n double temp = vals[i];\n vals[i] = vals[minIdx];\n vals[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n double[] vals = {39.31, 24.2, 62.94, -16.22, -10.45, 69.32, -2.62, 11.71, 26.7, 44.64, 1.61, 86.59};\n selectionSort(vals);\n for (double v : vals) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on float data, variable named 'vals', 12 elements."} {"id": 391, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(double[] nums) {\n int n = nums.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (nums[j] < nums[minIdx]) minIdx = j;\n }\n double temp = nums[i];\n nums[i] = nums[minIdx];\n nums[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n double[] nums = {77.25, 78.56, -5.49, 71.41, 9.63, 71.78, 32.71, 67.78, -16.01, 34.84, 71.75, 42.02, 96.87, 36.27, 61.09};\n selectionSort(nums);\n for (double v : nums) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on float data, variable named 'nums', 15 elements."} {"id": 392, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(double[] nums) {\n int n = nums.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (nums[j] < nums[minIdx]) minIdx = j;\n }\n double temp = nums[i];\n nums[i] = nums[minIdx];\n nums[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n double[] nums = {91.41, -1.13, 66.66, 68.62, 45.4, -5.47, 37.27, 15.56, 22.89, -13.8, 59.34, 95.82, 8.08, 31.67, -18.21};\n selectionSort(nums);\n for (double v : nums) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on float data, variable named 'nums', 15 elements."} {"id": 393, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(double[] vals) {\n int n = vals.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (vals[j] < vals[minIdx]) minIdx = j;\n }\n double temp = vals[i];\n vals[i] = vals[minIdx];\n vals[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n double[] vals = {12.86, -5.76, 73.91, -18.94, -15.0, 73.23, 36.56, 50.95, 24.2, -9.35, -1.23, -9.12, 53.62, 90.77, 98.64};\n selectionSort(vals);\n for (double v : vals) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on float data, variable named 'vals', 15 elements."} {"id": 394, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(double[] buffer) {\n int n = buffer.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (buffer[j] < buffer[minIdx]) minIdx = j;\n }\n double temp = buffer[i];\n buffer[i] = buffer[minIdx];\n buffer[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n double[] buffer = {-12.85, 22.31, -1.68, 43.83, -7.22, 38.05, 17.69, 46.44, 56.71, 21.33, 86.12, 67.25, -17.46, 24.95, 66.2, 9.83, -15.3, 64.09, 46.52, 44.59};\n selectionSort(buffer);\n for (double v : buffer) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on float data, variable named 'buffer', 20 elements."} {"id": 395, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(double[] dataset) {\n int n = dataset.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (dataset[j] < dataset[minIdx]) minIdx = j;\n }\n double temp = dataset[i];\n dataset[i] = dataset[minIdx];\n dataset[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n double[] dataset = {2.58, 2.21, 21.37, 67.16, 12.76, 78.93, 88.82, 45.99, -11.8, -1.55, 15.19, 11.34, 23.69, -19.91, 55.93, 25.11, 2.08, -17.77, 81.96, 72.35};\n selectionSort(dataset);\n for (double v : dataset) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on float data, variable named 'dataset', 20 elements."} {"id": 396, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using selection sort.", "code": "public class Main {\n static void selectionSort(double[] items) {\n int n = items.length;\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (items[j] < items[minIdx]) minIdx = j;\n }\n double temp = items[i];\n items[i] = items[minIdx];\n items[minIdx] = temp;\n }\n }\n\n public static void main(String[] args) {\n double[] items = {18.16, -12.46, 95.09, 77.47, 2.59, 61.3, 71.12, -1.66, 13.69, 28.77, 18.32, -8.55, 58.41, -14.79, 91.6, 1.26, -16.28, -7.26, 2.8, -16.21};\n selectionSort(items);\n for (double v : items) System.out.print(v + \" \");\n }\n}", "explanation": "Selection sort on float data, variable named 'items', 20 elements."} {"id": 397, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(int buffer[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (buffer[j] < buffer[min_idx]) min_idx = j;\n }\n int temp = buffer[i];\n buffer[i] = buffer[min_idx];\n buffer[min_idx] = temp;\n }\n}\n\nint main(void) {\n int buffer[] = {49, 75, 84, 15, -38};\n int n = sizeof(buffer) / sizeof(buffer[0]);\n selection_sort(buffer, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)buffer[i]);\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'buffer', 5 elements."} {"id": 398, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(int list1[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (list1[j] < list1[min_idx]) min_idx = j;\n }\n int temp = list1[i];\n list1[i] = list1[min_idx];\n list1[min_idx] = temp;\n }\n}\n\nint main(void) {\n int list1[] = {6, -32, -47, 3, 75};\n int n = sizeof(list1) / sizeof(list1[0]);\n selection_sort(list1, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)list1[i]);\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'list1', 5 elements."} {"id": 399, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(int entries[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (entries[j] < entries[min_idx]) min_idx = j;\n }\n int temp = entries[i];\n entries[i] = entries[min_idx];\n entries[min_idx] = temp;\n }\n}\n\nint main(void) {\n int entries[] = {-30, 69, -35, 42, 92};\n int n = sizeof(entries) / sizeof(entries[0]);\n selection_sort(entries, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)entries[i]);\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'entries', 5 elements."} {"id": 400, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(int seq[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (seq[j] < seq[min_idx]) min_idx = j;\n }\n int temp = seq[i];\n seq[i] = seq[min_idx];\n seq[min_idx] = temp;\n }\n}\n\nint main(void) {\n int seq[] = {56, 44, -36, 18, 85, -40, -32, 27};\n int n = sizeof(seq) / sizeof(seq[0]);\n selection_sort(seq, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)seq[i]);\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'seq', 8 elements."} {"id": 401, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(int data[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (data[j] < data[min_idx]) min_idx = j;\n }\n int temp = data[i];\n data[i] = data[min_idx];\n data[min_idx] = temp;\n }\n}\n\nint main(void) {\n int data[] = {5, 82, -26, -25, 9, 86, 48, -2};\n int n = sizeof(data) / sizeof(data[0]);\n selection_sort(data, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)data[i]);\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'data', 8 elements."} {"id": 402, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(int items[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (items[j] < items[min_idx]) min_idx = j;\n }\n int temp = items[i];\n items[i] = items[min_idx];\n items[min_idx] = temp;\n }\n}\n\nint main(void) {\n int items[] = {84, 13, 95, -5, 92, 92, 56, -23};\n int n = sizeof(items) / sizeof(items[0]);\n selection_sort(items, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)items[i]);\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'items', 8 elements."} {"id": 403, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(int vals[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (vals[j] < vals[min_idx]) min_idx = j;\n }\n int temp = vals[i];\n vals[i] = vals[min_idx];\n vals[min_idx] = temp;\n }\n}\n\nint main(void) {\n int vals[] = {97, 41, 67, 59, -24, -8, -4, 90, 52, 79};\n int n = sizeof(vals) / sizeof(vals[0]);\n selection_sort(vals, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)vals[i]);\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'vals', 10 elements."} {"id": 404, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(int list1[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (list1[j] < list1[min_idx]) min_idx = j;\n }\n int temp = list1[i];\n list1[i] = list1[min_idx];\n list1[min_idx] = temp;\n }\n}\n\nint main(void) {\n int list1[] = {-10, 86, 63, 40, 30, 90, 33, 45, 55, 60};\n int n = sizeof(list1) / sizeof(list1[0]);\n selection_sort(list1, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)list1[i]);\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'list1', 10 elements."} {"id": 405, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(int records[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (records[j] < records[min_idx]) min_idx = j;\n }\n int temp = records[i];\n records[i] = records[min_idx];\n records[min_idx] = temp;\n }\n}\n\nint main(void) {\n int records[] = {32, 11, 94, 89, 4, 46, 90, 15, 42, 65};\n int n = sizeof(records) / sizeof(records[0]);\n selection_sort(records, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)records[i]);\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'records', 10 elements."} {"id": 406, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(int dataset[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (dataset[j] < dataset[min_idx]) min_idx = j;\n }\n int temp = dataset[i];\n dataset[i] = dataset[min_idx];\n dataset[min_idx] = temp;\n }\n}\n\nint main(void) {\n int dataset[] = {51, -50, -42, 22, -46, 82, -16, 27, -49, 26, 6, 4};\n int n = sizeof(dataset) / sizeof(dataset[0]);\n selection_sort(dataset, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)dataset[i]);\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'dataset', 12 elements."} {"id": 407, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(int records[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (records[j] < records[min_idx]) min_idx = j;\n }\n int temp = records[i];\n records[i] = records[min_idx];\n records[min_idx] = temp;\n }\n}\n\nint main(void) {\n int records[] = {30, -45, 20, 91, 80, 92, 96, 96, -11, -26, -41, 67};\n int n = sizeof(records) / sizeof(records[0]);\n selection_sort(records, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)records[i]);\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'records', 12 elements."} {"id": 408, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(int list1[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (list1[j] < list1[min_idx]) min_idx = j;\n }\n int temp = list1[i];\n list1[i] = list1[min_idx];\n list1[min_idx] = temp;\n }\n}\n\nint main(void) {\n int list1[] = {-11, -15, 17, 43, 99, 13, 9, 15, 26, -27, 96, 52};\n int n = sizeof(list1) / sizeof(list1[0]);\n selection_sort(list1, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)list1[i]);\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'list1', 12 elements."} {"id": 409, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(int elements[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (elements[j] < elements[min_idx]) min_idx = j;\n }\n int temp = elements[i];\n elements[i] = elements[min_idx];\n elements[min_idx] = temp;\n }\n}\n\nint main(void) {\n int elements[] = {5, -31, 33, 73, -6, 74, 97, -26, 26, -41, 97, 47, -30, -36, 35};\n int n = sizeof(elements) / sizeof(elements[0]);\n selection_sort(elements, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)elements[i]);\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'elements', 15 elements."} {"id": 410, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(int list1[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (list1[j] < list1[min_idx]) min_idx = j;\n }\n int temp = list1[i];\n list1[i] = list1[min_idx];\n list1[min_idx] = temp;\n }\n}\n\nint main(void) {\n int list1[] = {61, 56, -20, 8, -48, 47, -37, 28, 84, -40, 31, 88, 94, -12, 33};\n int n = sizeof(list1) / sizeof(list1[0]);\n selection_sort(list1, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)list1[i]);\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'list1', 15 elements."} {"id": 411, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(int input_arr[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (input_arr[j] < input_arr[min_idx]) min_idx = j;\n }\n int temp = input_arr[i];\n input_arr[i] = input_arr[min_idx];\n input_arr[min_idx] = temp;\n }\n}\n\nint main(void) {\n int input_arr[] = {6, -11, -38, 50, 64, 97, 79, -27, 6, 60, 24, 50, -13, -17, 36};\n int n = sizeof(input_arr) / sizeof(input_arr[0]);\n selection_sort(input_arr, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)input_arr[i]);\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'input_arr', 15 elements."} {"id": 412, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(int data[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (data[j] < data[min_idx]) min_idx = j;\n }\n int temp = data[i];\n data[i] = data[min_idx];\n data[min_idx] = temp;\n }\n}\n\nint main(void) {\n int data[] = {71, 96, -38, 90, 52, 17, -29, 52, 78, 61, -17, -16, 73, 93, 0, 74, 51, 96, 0, 93};\n int n = sizeof(data) / sizeof(data[0]);\n selection_sort(data, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)data[i]);\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'data', 20 elements."} {"id": 413, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(int elements[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (elements[j] < elements[min_idx]) min_idx = j;\n }\n int temp = elements[i];\n elements[i] = elements[min_idx];\n elements[min_idx] = temp;\n }\n}\n\nint main(void) {\n int elements[] = {84, 13, 12, -32, 18, 60, 32, 97, -28, -22, 55, 58, 43, 39, -2, 32, 38, -44, 28, -7};\n int n = sizeof(elements) / sizeof(elements[0]);\n selection_sort(elements, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)elements[i]);\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'elements', 20 elements."} {"id": 414, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(int list1[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (list1[j] < list1[min_idx]) min_idx = j;\n }\n int temp = list1[i];\n list1[i] = list1[min_idx];\n list1[min_idx] = temp;\n }\n}\n\nint main(void) {\n int list1[] = {63, -13, 62, -39, 9, 1, 45, -11, -29, -22, -37, 12, -13, 23, -47, 37, -22, 28, 65, 70};\n int n = sizeof(list1) / sizeof(list1[0]);\n selection_sort(list1, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)list1[i]);\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'list1', 20 elements."} {"id": 415, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(double arr[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (arr[j] < arr[min_idx]) min_idx = j;\n }\n double temp = arr[i];\n arr[i] = arr[min_idx];\n arr[min_idx] = temp;\n }\n}\n\nint main(void) {\n double arr[] = {19.49, 68.06, 5.21, 45.02, 69.29};\n int n = sizeof(arr) / sizeof(arr[0]);\n selection_sort(arr, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)arr[i]);\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'arr', 5 elements."} {"id": 416, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(double input_arr[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (input_arr[j] < input_arr[min_idx]) min_idx = j;\n }\n double temp = input_arr[i];\n input_arr[i] = input_arr[min_idx];\n input_arr[min_idx] = temp;\n }\n}\n\nint main(void) {\n double input_arr[] = {37.48, 66.86, -3.18, 63.15, -17.81};\n int n = sizeof(input_arr) / sizeof(input_arr[0]);\n selection_sort(input_arr, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)input_arr[i]);\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'input_arr', 5 elements."} {"id": 417, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(double elements[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (elements[j] < elements[min_idx]) min_idx = j;\n }\n double temp = elements[i];\n elements[i] = elements[min_idx];\n elements[min_idx] = temp;\n }\n}\n\nint main(void) {\n double elements[] = {87.82, 42.69, 10.4, -12.85, 3.88};\n int n = sizeof(elements) / sizeof(elements[0]);\n selection_sort(elements, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)elements[i]);\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'elements', 5 elements."} {"id": 418, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(double seq[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (seq[j] < seq[min_idx]) min_idx = j;\n }\n double temp = seq[i];\n seq[i] = seq[min_idx];\n seq[min_idx] = temp;\n }\n}\n\nint main(void) {\n double seq[] = {53.54, -13.68, 57.92, -19.01, 26.25, 12.29, 81.4, 58.55};\n int n = sizeof(seq) / sizeof(seq[0]);\n selection_sort(seq, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)seq[i]);\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'seq', 8 elements."} {"id": 419, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(double records[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (records[j] < records[min_idx]) min_idx = j;\n }\n double temp = records[i];\n records[i] = records[min_idx];\n records[min_idx] = temp;\n }\n}\n\nint main(void) {\n double records[] = {-7.16, 14.81, 85.12, 26.0, 96.6, 40.52, 64.45, 87.56};\n int n = sizeof(records) / sizeof(records[0]);\n selection_sort(records, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)records[i]);\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'records', 8 elements."} {"id": 420, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(double dataset[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (dataset[j] < dataset[min_idx]) min_idx = j;\n }\n double temp = dataset[i];\n dataset[i] = dataset[min_idx];\n dataset[min_idx] = temp;\n }\n}\n\nint main(void) {\n double dataset[] = {83.15, 43.26, 2.18, 39.58, 34.5, 90.24, -17.44, 9.44};\n int n = sizeof(dataset) / sizeof(dataset[0]);\n selection_sort(dataset, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)dataset[i]);\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'dataset', 8 elements."} {"id": 421, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(double input_arr[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (input_arr[j] < input_arr[min_idx]) min_idx = j;\n }\n double temp = input_arr[i];\n input_arr[i] = input_arr[min_idx];\n input_arr[min_idx] = temp;\n }\n}\n\nint main(void) {\n double input_arr[] = {16.29, 38.3, 68.58, -17.81, 61.43, 22.29, 15.98, 98.52, 96.45, 12.83};\n int n = sizeof(input_arr) / sizeof(input_arr[0]);\n selection_sort(input_arr, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)input_arr[i]);\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'input_arr', 10 elements."} {"id": 422, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(double arr[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (arr[j] < arr[min_idx]) min_idx = j;\n }\n double temp = arr[i];\n arr[i] = arr[min_idx];\n arr[min_idx] = temp;\n }\n}\n\nint main(void) {\n double arr[] = {54.47, 84.56, 85.96, 76.97, -16.49, 46.04, 13.34, -1.95, 86.76, 58.17};\n int n = sizeof(arr) / sizeof(arr[0]);\n selection_sort(arr, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)arr[i]);\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'arr', 10 elements."} {"id": 423, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(double data[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (data[j] < data[min_idx]) min_idx = j;\n }\n double temp = data[i];\n data[i] = data[min_idx];\n data[min_idx] = temp;\n }\n}\n\nint main(void) {\n double data[] = {66.86, 41.97, 60.68, 83.85, 61.7, 29.66, 48.17, 30.75, 17.17, 52.04};\n int n = sizeof(data) / sizeof(data[0]);\n selection_sort(data, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)data[i]);\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'data', 10 elements."} {"id": 424, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(double dataset[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (dataset[j] < dataset[min_idx]) min_idx = j;\n }\n double temp = dataset[i];\n dataset[i] = dataset[min_idx];\n dataset[min_idx] = temp;\n }\n}\n\nint main(void) {\n double dataset[] = {44.53, 4.6, -3.51, 44.42, 75.21, 82.65, 16.77, 63.91, 42.33, -3.9, 98.49, 96.12};\n int n = sizeof(dataset) / sizeof(dataset[0]);\n selection_sort(dataset, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)dataset[i]);\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'dataset', 12 elements."} {"id": 425, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(double values[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (values[j] < values[min_idx]) min_idx = j;\n }\n double temp = values[i];\n values[i] = values[min_idx];\n values[min_idx] = temp;\n }\n}\n\nint main(void) {\n double values[] = {58.09, 47.22, -1.19, -11.93, 43.42, 65.61, 1.91, 79.9, -2.68, -16.49, 17.92, 95.77};\n int n = sizeof(values) / sizeof(values[0]);\n selection_sort(values, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)values[i]);\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'values', 12 elements."} {"id": 426, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(double collection[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (collection[j] < collection[min_idx]) min_idx = j;\n }\n double temp = collection[i];\n collection[i] = collection[min_idx];\n collection[min_idx] = temp;\n }\n}\n\nint main(void) {\n double collection[] = {16.1, 68.73, 77.78, 55.78, 67.86, -1.92, 2.36, -4.35, -16.88, 97.33, 53.42, 52.07};\n int n = sizeof(collection) / sizeof(collection[0]);\n selection_sort(collection, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)collection[i]);\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'collection', 12 elements."} {"id": 427, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(double elements[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (elements[j] < elements[min_idx]) min_idx = j;\n }\n double temp = elements[i];\n elements[i] = elements[min_idx];\n elements[min_idx] = temp;\n }\n}\n\nint main(void) {\n double elements[] = {7.48, 7.63, 61.8, 22.75, 61.89, 36.72, 39.78, 51.96, 64.73, 24.5, 81.4, 38.48, -3.64, 3.0, -16.16};\n int n = sizeof(elements) / sizeof(elements[0]);\n selection_sort(elements, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)elements[i]);\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'elements', 15 elements."} {"id": 428, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(double vals[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (vals[j] < vals[min_idx]) min_idx = j;\n }\n double temp = vals[i];\n vals[i] = vals[min_idx];\n vals[min_idx] = temp;\n }\n}\n\nint main(void) {\n double vals[] = {95.29, 90.13, 93.07, 6.48, 59.89, 4.14, 4.34, 1.07, 93.61, 32.27, 53.43, 61.86, 83.15, 85.62, 30.88};\n int n = sizeof(vals) / sizeof(vals[0]);\n selection_sort(vals, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)vals[i]);\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'vals', 15 elements."} {"id": 429, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(double vals[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (vals[j] < vals[min_idx]) min_idx = j;\n }\n double temp = vals[i];\n vals[i] = vals[min_idx];\n vals[min_idx] = temp;\n }\n}\n\nint main(void) {\n double vals[] = {-15.02, 67.5, 25.26, 17.23, 52.77, 68.35, 50.66, 42.5, 84.22, 73.64, 41.96, 33.74, 78.41, -14.95, 98.5};\n int n = sizeof(vals) / sizeof(vals[0]);\n selection_sort(vals, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)vals[i]);\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'vals', 15 elements."} {"id": 430, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(double input_arr[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (input_arr[j] < input_arr[min_idx]) min_idx = j;\n }\n double temp = input_arr[i];\n input_arr[i] = input_arr[min_idx];\n input_arr[min_idx] = temp;\n }\n}\n\nint main(void) {\n double input_arr[] = {44.01, 97.08, -15.33, 26.1, 71.05, 94.55, 2.59, 32.31, 85.24, 72.07, 14.02, -0.19, 15.04, 89.36, 62.1, 87.54, 35.17, 56.89, -9.24, 39.58};\n int n = sizeof(input_arr) / sizeof(input_arr[0]);\n selection_sort(input_arr, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)input_arr[i]);\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'input_arr', 20 elements."} {"id": 431, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(double values[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (values[j] < values[min_idx]) min_idx = j;\n }\n double temp = values[i];\n values[i] = values[min_idx];\n values[min_idx] = temp;\n }\n}\n\nint main(void) {\n double values[] = {72.67, 91.6, 62.84, -3.9, 29.21, 33.66, 1.29, 50.25, 64.8, 4.03, 34.11, 9.76, 62.31, 87.95, 74.78, 65.49, -5.3, -6.41, 33.48, 23.19};\n int n = sizeof(values) / sizeof(values[0]);\n selection_sort(values, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)values[i]);\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'values', 20 elements."} {"id": 432, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using selection sort.", "code": "#include \n\nvoid selection_sort(double input_arr[], int n) {\n for (int i = 0; i < n; i++) {\n int min_idx = i;\n for (int j = i + 1; j < n; j++) {\n if (input_arr[j] < input_arr[min_idx]) min_idx = j;\n }\n double temp = input_arr[i];\n input_arr[i] = input_arr[min_idx];\n input_arr[min_idx] = temp;\n }\n}\n\nint main(void) {\n double input_arr[] = {64.17, 66.5, 96.05, 52.84, -0.97, 45.49, -14.78, 0.34, 19.89, 83.69, 82.66, -0.71, -2.79, 71.53, -13.89, 16.66, 66.89, 94.35, 14.36, 1.5};\n int n = sizeof(input_arr) / sizeof(input_arr[0]);\n selection_sort(input_arr, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)input_arr[i]);\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'input_arr', 20 elements."} {"id": 433, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& entries) {\n int n = (int) entries.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (entries[j] < entries[minIdx]) minIdx = j;\n }\n std::swap(entries[i], entries[minIdx]);\n }\n}\n\nint main() {\n std::vector entries = {-17, 1, -50, 14, -47};\n selectionSort(entries);\n for (int v : entries) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'entries', 5 elements."} {"id": 434, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& dataset) {\n int n = (int) dataset.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (dataset[j] < dataset[minIdx]) minIdx = j;\n }\n std::swap(dataset[i], dataset[minIdx]);\n }\n}\n\nint main() {\n std::vector dataset = {77, 77, 89, -49, 76};\n selectionSort(dataset);\n for (int v : dataset) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'dataset', 5 elements."} {"id": 435, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& items) {\n int n = (int) items.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (items[j] < items[minIdx]) minIdx = j;\n }\n std::swap(items[i], items[minIdx]);\n }\n}\n\nint main() {\n std::vector items = {5, 71, 66, 54, 63};\n selectionSort(items);\n for (int v : items) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'items', 5 elements."} {"id": 436, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& data) {\n int n = (int) data.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (data[j] < data[minIdx]) minIdx = j;\n }\n std::swap(data[i], data[minIdx]);\n }\n}\n\nint main() {\n std::vector data = {-49, 12, 90, 21, 92, 3, -38, -3};\n selectionSort(data);\n for (int v : data) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'data', 8 elements."} {"id": 437, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& values) {\n int n = (int) values.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (values[j] < values[minIdx]) minIdx = j;\n }\n std::swap(values[i], values[minIdx]);\n }\n}\n\nint main() {\n std::vector values = {-36, 39, -41, -13, -42, 97, 26, 34};\n selectionSort(values);\n for (int v : values) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'values', 8 elements."} {"id": 438, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& entries) {\n int n = (int) entries.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (entries[j] < entries[minIdx]) minIdx = j;\n }\n std::swap(entries[i], entries[minIdx]);\n }\n}\n\nint main() {\n std::vector entries = {-28, -38, -23, 56, -5, -9, 22, 96};\n selectionSort(entries);\n for (int v : entries) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'entries', 8 elements."} {"id": 439, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& vals) {\n int n = (int) vals.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (vals[j] < vals[minIdx]) minIdx = j;\n }\n std::swap(vals[i], vals[minIdx]);\n }\n}\n\nint main() {\n std::vector vals = {93, -5, 66, 98, 42, -41, -27, 26, 32, 44};\n selectionSort(vals);\n for (int v : vals) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'vals', 10 elements."} {"id": 440, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& entries) {\n int n = (int) entries.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (entries[j] < entries[minIdx]) minIdx = j;\n }\n std::swap(entries[i], entries[minIdx]);\n }\n}\n\nint main() {\n std::vector entries = {47, -33, 59, 90, -34, 24, 70, -16, -19, 20};\n selectionSort(entries);\n for (int v : entries) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'entries', 10 elements."} {"id": 441, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& list1) {\n int n = (int) list1.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (list1[j] < list1[minIdx]) minIdx = j;\n }\n std::swap(list1[i], list1[minIdx]);\n }\n}\n\nint main() {\n std::vector list1 = {84, 55, 84, 3, 3, -36, -23, 96, 85, -28};\n selectionSort(list1);\n for (int v : list1) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'list1', 10 elements."} {"id": 442, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& dataset) {\n int n = (int) dataset.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (dataset[j] < dataset[minIdx]) minIdx = j;\n }\n std::swap(dataset[i], dataset[minIdx]);\n }\n}\n\nint main() {\n std::vector dataset = {23, 59, 31, 16, 84, 97, 40, -17, 94, 77, 83, 77};\n selectionSort(dataset);\n for (int v : dataset) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'dataset', 12 elements."} {"id": 443, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& dataset) {\n int n = (int) dataset.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (dataset[j] < dataset[minIdx]) minIdx = j;\n }\n std::swap(dataset[i], dataset[minIdx]);\n }\n}\n\nint main() {\n std::vector dataset = {-4, 9, 24, -1, -50, -20, -44, 69, -20, 3, 56, 55};\n selectionSort(dataset);\n for (int v : dataset) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'dataset', 12 elements."} {"id": 444, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& arr) {\n int n = (int) arr.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (arr[j] < arr[minIdx]) minIdx = j;\n }\n std::swap(arr[i], arr[minIdx]);\n }\n}\n\nint main() {\n std::vector arr = {35, 39, 93, 4, -48, 1, 22, 15, -33, 28, 26, 79};\n selectionSort(arr);\n for (int v : arr) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'arr', 12 elements."} {"id": 445, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& input_arr) {\n int n = (int) input_arr.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (input_arr[j] < input_arr[minIdx]) minIdx = j;\n }\n std::swap(input_arr[i], input_arr[minIdx]);\n }\n}\n\nint main() {\n std::vector input_arr = {32, -49, -21, 35, 37, 51, 95, -43, -6, -1, 34, 36, 72, 71, -41};\n selectionSort(input_arr);\n for (int v : input_arr) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'input_arr', 15 elements."} {"id": 446, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& buffer) {\n int n = (int) buffer.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (buffer[j] < buffer[minIdx]) minIdx = j;\n }\n std::swap(buffer[i], buffer[minIdx]);\n }\n}\n\nint main() {\n std::vector buffer = {-16, 73, -11, 67, 87, 35, 68, 55, -36, 83, 26, 94, 30, 92, 87};\n selectionSort(buffer);\n for (int v : buffer) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'buffer', 15 elements."} {"id": 447, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& arr) {\n int n = (int) arr.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (arr[j] < arr[minIdx]) minIdx = j;\n }\n std::swap(arr[i], arr[minIdx]);\n }\n}\n\nint main() {\n std::vector arr = {3, 97, 34, 40, -34, -12, 21, -43, 36, 46, 86, -8, 96, 49, -3};\n selectionSort(arr);\n for (int v : arr) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'arr', 15 elements."} {"id": 448, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& elements) {\n int n = (int) elements.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (elements[j] < elements[minIdx]) minIdx = j;\n }\n std::swap(elements[i], elements[minIdx]);\n }\n}\n\nint main() {\n std::vector elements = {-21, 28, 30, -42, 19, 55, -28, 77, 10, 45, 65, 27, 5, 84, 27, -6, -22, 45, -41, 1};\n selectionSort(elements);\n for (int v : elements) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'elements', 20 elements."} {"id": 449, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& entries) {\n int n = (int) entries.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (entries[j] < entries[minIdx]) minIdx = j;\n }\n std::swap(entries[i], entries[minIdx]);\n }\n}\n\nint main() {\n std::vector entries = {-27, 63, 79, -44, 73, 78, -11, -2, 37, 73, 84, 29, 33, -14, -25, 82, -17, 2, -41, 67};\n selectionSort(entries);\n for (int v : entries) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'entries', 20 elements."} {"id": 450, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& collection) {\n int n = (int) collection.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (collection[j] < collection[minIdx]) minIdx = j;\n }\n std::swap(collection[i], collection[minIdx]);\n }\n}\n\nint main() {\n std::vector collection = {83, -21, -49, 29, -39, -28, 35, 69, -39, -24, 83, 29, -45, 97, 29, 3, 32, 1, -1, 23};\n selectionSort(collection);\n for (int v : collection) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on int data, variable named 'collection', 20 elements."} {"id": 451, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& nums) {\n int n = (int) nums.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (nums[j] < nums[minIdx]) minIdx = j;\n }\n std::swap(nums[i], nums[minIdx]);\n }\n}\n\nint main() {\n std::vector nums = {43.34, 71.96, 59.86, 12.45, -1.26};\n selectionSort(nums);\n for (double v : nums) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'nums', 5 elements."} {"id": 452, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& data) {\n int n = (int) data.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (data[j] < data[minIdx]) minIdx = j;\n }\n std::swap(data[i], data[minIdx]);\n }\n}\n\nint main() {\n std::vector data = {-18.18, 54.13, 41.17, 4.58, 21.69};\n selectionSort(data);\n for (double v : data) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'data', 5 elements."} {"id": 453, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& list1) {\n int n = (int) list1.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (list1[j] < list1[minIdx]) minIdx = j;\n }\n std::swap(list1[i], list1[minIdx]);\n }\n}\n\nint main() {\n std::vector list1 = {12.26, 92.25, 75.68, 48.32, 0.38};\n selectionSort(list1);\n for (double v : list1) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'list1', 5 elements."} {"id": 454, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& nums) {\n int n = (int) nums.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (nums[j] < nums[minIdx]) minIdx = j;\n }\n std::swap(nums[i], nums[minIdx]);\n }\n}\n\nint main() {\n std::vector nums = {52.98, 20.31, 32.79, -4.52, 36.02, 60.38, -7.39, -13.6};\n selectionSort(nums);\n for (double v : nums) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'nums', 8 elements."} {"id": 455, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& collection) {\n int n = (int) collection.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (collection[j] < collection[minIdx]) minIdx = j;\n }\n std::swap(collection[i], collection[minIdx]);\n }\n}\n\nint main() {\n std::vector collection = {26.64, 63.86, 86.06, 54.91, 62.12, 33.05, 22.32, 19.55};\n selectionSort(collection);\n for (double v : collection) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'collection', 8 elements."} {"id": 456, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& items) {\n int n = (int) items.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (items[j] < items[minIdx]) minIdx = j;\n }\n std::swap(items[i], items[minIdx]);\n }\n}\n\nint main() {\n std::vector items = {64.83, 59.83, 43.48, 95.87, 69.93, 35.42, -4.32, 76.73};\n selectionSort(items);\n for (double v : items) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'items', 8 elements."} {"id": 457, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& entries) {\n int n = (int) entries.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (entries[j] < entries[minIdx]) minIdx = j;\n }\n std::swap(entries[i], entries[minIdx]);\n }\n}\n\nint main() {\n std::vector entries = {63.13, -8.43, 16.94, 56.69, 71.21, 35.99, 92.75, -2.9, 86.59, 10.71};\n selectionSort(entries);\n for (double v : entries) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'entries', 10 elements."} {"id": 458, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& list1) {\n int n = (int) list1.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (list1[j] < list1[minIdx]) minIdx = j;\n }\n std::swap(list1[i], list1[minIdx]);\n }\n}\n\nint main() {\n std::vector list1 = {26.66, 63.25, 59.16, 73.86, 85.01, 33.94, -16.4, 36.56, 21.82, 34.89};\n selectionSort(list1);\n for (double v : list1) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'list1', 10 elements."} {"id": 459, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& values) {\n int n = (int) values.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (values[j] < values[minIdx]) minIdx = j;\n }\n std::swap(values[i], values[minIdx]);\n }\n}\n\nint main() {\n std::vector values = {13.59, 21.49, 48.39, 40.45, 28.28, 65.0, -7.27, 46.18, -11.56, 15.95};\n selectionSort(values);\n for (double v : values) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'values', 10 elements."} {"id": 460, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& dataset) {\n int n = (int) dataset.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (dataset[j] < dataset[minIdx]) minIdx = j;\n }\n std::swap(dataset[i], dataset[minIdx]);\n }\n}\n\nint main() {\n std::vector dataset = {27.7, 29.2, 53.88, 45.21, 95.89, 25.67, 20.54, 76.86, 50.33, 73.33, 31.81, 73.69};\n selectionSort(dataset);\n for (double v : dataset) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'dataset', 12 elements."} {"id": 461, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& input_arr) {\n int n = (int) input_arr.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (input_arr[j] < input_arr[minIdx]) minIdx = j;\n }\n std::swap(input_arr[i], input_arr[minIdx]);\n }\n}\n\nint main() {\n std::vector input_arr = {62.6, 0.6, 59.68, 67.98, 64.72, 79.57, -6.4, 50.93, 18.72, -8.38, 32.98, 16.66};\n selectionSort(input_arr);\n for (double v : input_arr) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'input_arr', 12 elements."} {"id": 462, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& collection) {\n int n = (int) collection.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (collection[j] < collection[minIdx]) minIdx = j;\n }\n std::swap(collection[i], collection[minIdx]);\n }\n}\n\nint main() {\n std::vector collection = {-11.72, -7.06, 76.87, 71.79, 25.09, 38.82, 58.56, -9.23, 77.23, 85.58, 87.49, 55.7};\n selectionSort(collection);\n for (double v : collection) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'collection', 12 elements."} {"id": 463, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& arr) {\n int n = (int) arr.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (arr[j] < arr[minIdx]) minIdx = j;\n }\n std::swap(arr[i], arr[minIdx]);\n }\n}\n\nint main() {\n std::vector arr = {70.09, 58.64, 33.9, 14.69, 53.25, 33.21, 4.47, 84.41, 15.67, 74.53, 60.87, 89.3, 91.46, 65.42, 88.9};\n selectionSort(arr);\n for (double v : arr) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'arr', 15 elements."} {"id": 464, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& data) {\n int n = (int) data.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (data[j] < data[minIdx]) minIdx = j;\n }\n std::swap(data[i], data[minIdx]);\n }\n}\n\nint main() {\n std::vector data = {49.34, 52.77, 40.74, 80.87, 81.45, -12.57, 87.23, 95.18, -19.9, 46.64, 96.46, -6.95, 13.58, -16.29, 31.37};\n selectionSort(data);\n for (double v : data) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'data', 15 elements."} {"id": 465, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& elements) {\n int n = (int) elements.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (elements[j] < elements[minIdx]) minIdx = j;\n }\n std::swap(elements[i], elements[minIdx]);\n }\n}\n\nint main() {\n std::vector elements = {26.92, 17.86, 25.55, 25.41, 44.87, 58.84, 36.51, 2.4, 25.77, 90.01, 79.96, -1.64, 98.7, 59.74, -4.02};\n selectionSort(elements);\n for (double v : elements) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'elements', 15 elements."} {"id": 466, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& data) {\n int n = (int) data.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (data[j] < data[minIdx]) minIdx = j;\n }\n std::swap(data[i], data[minIdx]);\n }\n}\n\nint main() {\n std::vector data = {57.16, -2.86, 85.3, 58.29, 96.02, -3.84, -3.67, 75.91, 82.36, 86.34, 62.75, 90.71, 54.17, 34.07, 30.47, 77.59, 25.78, 6.86, 30.55, -19.12};\n selectionSort(data);\n for (double v : data) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'data', 20 elements."} {"id": 467, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& dataset) {\n int n = (int) dataset.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (dataset[j] < dataset[minIdx]) minIdx = j;\n }\n std::swap(dataset[i], dataset[minIdx]);\n }\n}\n\nint main() {\n std::vector dataset = {80.77, 8.17, 39.71, 28.89, 44.99, 23.67, 96.41, 47.61, 63.88, -6.53, 37.3, 62.17, -3.09, 67.02, 97.05, 97.06, 72.69, 35.33, -10.69, 85.9};\n selectionSort(dataset);\n for (double v : dataset) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'dataset', 20 elements."} {"id": 468, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using selection sort.", "code": "#include \n#include \n\nvoid selectionSort(std::vector& data) {\n int n = (int) data.size();\n for (int i = 0; i < n; i++) {\n int minIdx = i;\n for (int j = i + 1; j < n; j++) {\n if (data[j] < data[minIdx]) minIdx = j;\n }\n std::swap(data[i], data[minIdx]);\n }\n}\n\nint main() {\n std::vector data = {9.18, 55.05, 58.98, 59.58, 61.4, 44.16, 48.98, 52.95, 87.53, 43.67, -18.72, 34.03, 87.82, 48.3, 19.45, 22.0, 96.35, 15.06, -0.07, 62.71};\n selectionSort(data);\n for (double v : data) std::cout << v << \" \";\n return 0;\n}", "explanation": "Selection sort on float data, variable named 'data', 20 elements."} {"id": 469, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using selection sort.", "code": "fn selection_sort(elements: &mut Vec) {\n let n = elements.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if elements[j] < elements[min_idx] {\n min_idx = j;\n }\n }\n elements.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut elements = vec![27, 94, 16, -35, 71];\n selection_sort(&mut elements);\n println!(\"{:?}\", elements);\n}", "explanation": "Selection sort on int data, variable named 'elements', 5 elements."} {"id": 470, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using selection sort.", "code": "fn selection_sort(elements: &mut Vec) {\n let n = elements.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if elements[j] < elements[min_idx] {\n min_idx = j;\n }\n }\n elements.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut elements = vec![-7, 96, -37, 24, -44];\n selection_sort(&mut elements);\n println!(\"{:?}\", elements);\n}", "explanation": "Selection sort on int data, variable named 'elements', 5 elements."} {"id": 471, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using selection sort.", "code": "fn selection_sort(nums: &mut Vec) {\n let n = nums.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if nums[j] < nums[min_idx] {\n min_idx = j;\n }\n }\n nums.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut nums = vec![74, -29, -18, 79, -31];\n selection_sort(&mut nums);\n println!(\"{:?}\", nums);\n}", "explanation": "Selection sort on int data, variable named 'nums', 5 elements."} {"id": 472, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using selection sort.", "code": "fn selection_sort(records: &mut Vec) {\n let n = records.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if records[j] < records[min_idx] {\n min_idx = j;\n }\n }\n records.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut records = vec![21, 14, -17, 21, 20, 15, -47, -22];\n selection_sort(&mut records);\n println!(\"{:?}\", records);\n}", "explanation": "Selection sort on int data, variable named 'records', 8 elements."} {"id": 473, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using selection sort.", "code": "fn selection_sort(elements: &mut Vec) {\n let n = elements.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if elements[j] < elements[min_idx] {\n min_idx = j;\n }\n }\n elements.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut elements = vec![-6, -12, 64, 44, -6, 16, 10, 74];\n selection_sort(&mut elements);\n println!(\"{:?}\", elements);\n}", "explanation": "Selection sort on int data, variable named 'elements', 8 elements."} {"id": 474, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using selection sort.", "code": "fn selection_sort(values: &mut Vec) {\n let n = values.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if values[j] < values[min_idx] {\n min_idx = j;\n }\n }\n values.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut values = vec![85, -42, 37, -29, -13, -11, 76, 55];\n selection_sort(&mut values);\n println!(\"{:?}\", values);\n}", "explanation": "Selection sort on int data, variable named 'values', 8 elements."} {"id": 475, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using selection sort.", "code": "fn selection_sort(vals: &mut Vec) {\n let n = vals.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if vals[j] < vals[min_idx] {\n min_idx = j;\n }\n }\n vals.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut vals = vec![48, 10, 62, -8, 3, 97, 38, -37, 17, -21];\n selection_sort(&mut vals);\n println!(\"{:?}\", vals);\n}", "explanation": "Selection sort on int data, variable named 'vals', 10 elements."} {"id": 476, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using selection sort.", "code": "fn selection_sort(arr: &mut Vec) {\n let n = arr.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if arr[j] < arr[min_idx] {\n min_idx = j;\n }\n }\n arr.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut arr = vec![-8, 68, 52, 71, 27, 71, 86, 9, 47, 49];\n selection_sort(&mut arr);\n println!(\"{:?}\", arr);\n}", "explanation": "Selection sort on int data, variable named 'arr', 10 elements."} {"id": 477, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using selection sort.", "code": "fn selection_sort(dataset: &mut Vec) {\n let n = dataset.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if dataset[j] < dataset[min_idx] {\n min_idx = j;\n }\n }\n dataset.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut dataset = vec![17, -13, 85, 61, -47, 23, 64, 47, 30, 85];\n selection_sort(&mut dataset);\n println!(\"{:?}\", dataset);\n}", "explanation": "Selection sort on int data, variable named 'dataset', 10 elements."} {"id": 478, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using selection sort.", "code": "fn selection_sort(buffer: &mut Vec) {\n let n = buffer.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if buffer[j] < buffer[min_idx] {\n min_idx = j;\n }\n }\n buffer.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut buffer = vec![-40, -26, 86, 40, 60, 19, 35, 19, 18, -25, 15, 99];\n selection_sort(&mut buffer);\n println!(\"{:?}\", buffer);\n}", "explanation": "Selection sort on int data, variable named 'buffer', 12 elements."} {"id": 479, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using selection sort.", "code": "fn selection_sort(collection: &mut Vec) {\n let n = collection.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if collection[j] < collection[min_idx] {\n min_idx = j;\n }\n }\n collection.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut collection = vec![68, 11, -1, 83, 36, -4, 30, 90, -48, -48, -33, -47];\n selection_sort(&mut collection);\n println!(\"{:?}\", collection);\n}", "explanation": "Selection sort on int data, variable named 'collection', 12 elements."} {"id": 480, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using selection sort.", "code": "fn selection_sort(collection: &mut Vec) {\n let n = collection.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if collection[j] < collection[min_idx] {\n min_idx = j;\n }\n }\n collection.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut collection = vec![-25, 84, -24, 64, 39, 6, 22, 14, -1, -42, -44, -27];\n selection_sort(&mut collection);\n println!(\"{:?}\", collection);\n}", "explanation": "Selection sort on int data, variable named 'collection', 12 elements."} {"id": 481, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using selection sort.", "code": "fn selection_sort(arr: &mut Vec) {\n let n = arr.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if arr[j] < arr[min_idx] {\n min_idx = j;\n }\n }\n arr.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut arr = vec![5, -19, -20, -28, -17, 46, 94, -3, -22, -3, 14, 25, 69, -31, 66];\n selection_sort(&mut arr);\n println!(\"{:?}\", arr);\n}", "explanation": "Selection sort on int data, variable named 'arr', 15 elements."} {"id": 482, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using selection sort.", "code": "fn selection_sort(entries: &mut Vec) {\n let n = entries.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if entries[j] < entries[min_idx] {\n min_idx = j;\n }\n }\n entries.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut entries = vec![20, 59, 32, 15, -9, -32, 20, -35, 47, 49, 35, -35, 16, 17, -5];\n selection_sort(&mut entries);\n println!(\"{:?}\", entries);\n}", "explanation": "Selection sort on int data, variable named 'entries', 15 elements."} {"id": 483, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using selection sort.", "code": "fn selection_sort(dataset: &mut Vec) {\n let n = dataset.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if dataset[j] < dataset[min_idx] {\n min_idx = j;\n }\n }\n dataset.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut dataset = vec![-33, 75, 1, 50, -5, 75, -23, -14, 88, 60, 5, -23, 63, 16, -24];\n selection_sort(&mut dataset);\n println!(\"{:?}\", dataset);\n}", "explanation": "Selection sort on int data, variable named 'dataset', 15 elements."} {"id": 484, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using selection sort.", "code": "fn selection_sort(arr: &mut Vec) {\n let n = arr.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if arr[j] < arr[min_idx] {\n min_idx = j;\n }\n }\n arr.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut arr = vec![-32, -32, 96, 14, 64, -46, 77, -12, -50, -41, 49, 18, -12, 34, 50, 97, -50, 81, 75, 72];\n selection_sort(&mut arr);\n println!(\"{:?}\", arr);\n}", "explanation": "Selection sort on int data, variable named 'arr', 20 elements."} {"id": 485, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using selection sort.", "code": "fn selection_sort(collection: &mut Vec) {\n let n = collection.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if collection[j] < collection[min_idx] {\n min_idx = j;\n }\n }\n collection.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut collection = vec![53, -33, 88, 7, -50, 48, 73, -19, 95, 87, 41, 35, 27, 52, -36, -27, 43, 86, 37, -30];\n selection_sort(&mut collection);\n println!(\"{:?}\", collection);\n}", "explanation": "Selection sort on int data, variable named 'collection', 20 elements."} {"id": 486, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using selection sort.", "code": "fn selection_sort(records: &mut Vec) {\n let n = records.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if records[j] < records[min_idx] {\n min_idx = j;\n }\n }\n records.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut records = vec![67, 24, 1, -5, 91, -40, 48, -2, 26, 49, -23, 41, 74, -29, 62, -2, -15, -41, -1, -44];\n selection_sort(&mut records);\n println!(\"{:?}\", records);\n}", "explanation": "Selection sort on int data, variable named 'records', 20 elements."} {"id": 487, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using selection sort.", "code": "fn selection_sort(seq: &mut Vec) {\n let n = seq.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if seq[j] < seq[min_idx] {\n min_idx = j;\n }\n }\n seq.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut seq = vec![98.57, 8.38, 26.26, 74.34, 56.57];\n selection_sort(&mut seq);\n println!(\"{:?}\", seq);\n}", "explanation": "Selection sort on float data, variable named 'seq', 5 elements."} {"id": 488, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using selection sort.", "code": "fn selection_sort(dataset: &mut Vec) {\n let n = dataset.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if dataset[j] < dataset[min_idx] {\n min_idx = j;\n }\n }\n dataset.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut dataset = vec![43.54, 79.28, 33.47, 98.5, -15.59];\n selection_sort(&mut dataset);\n println!(\"{:?}\", dataset);\n}", "explanation": "Selection sort on float data, variable named 'dataset', 5 elements."} {"id": 489, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using selection sort.", "code": "fn selection_sort(arr: &mut Vec) {\n let n = arr.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if arr[j] < arr[min_idx] {\n min_idx = j;\n }\n }\n arr.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut arr = vec![20.19, 65.8, 28.26, 5.19, 57.81];\n selection_sort(&mut arr);\n println!(\"{:?}\", arr);\n}", "explanation": "Selection sort on float data, variable named 'arr', 5 elements."} {"id": 490, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using selection sort.", "code": "fn selection_sort(input_arr: &mut Vec) {\n let n = input_arr.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if input_arr[j] < input_arr[min_idx] {\n min_idx = j;\n }\n }\n input_arr.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut input_arr = vec![34.55, 60.69, 84.04, -2.27, 48.94, 90.05, -15.61, -3.15];\n selection_sort(&mut input_arr);\n println!(\"{:?}\", input_arr);\n}", "explanation": "Selection sort on float data, variable named 'input_arr', 8 elements."} {"id": 491, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using selection sort.", "code": "fn selection_sort(buffer: &mut Vec) {\n let n = buffer.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if buffer[j] < buffer[min_idx] {\n min_idx = j;\n }\n }\n buffer.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut buffer = vec![-17.73, 87.95, 53.59, 8.88, 57.21, -18.29, 55.29, 87.65];\n selection_sort(&mut buffer);\n println!(\"{:?}\", buffer);\n}", "explanation": "Selection sort on float data, variable named 'buffer', 8 elements."} {"id": 492, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using selection sort.", "code": "fn selection_sort(records: &mut Vec) {\n let n = records.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if records[j] < records[min_idx] {\n min_idx = j;\n }\n }\n records.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut records = vec![74.45, 34.29, 0.31, 50.33, 77.32, -7.35, 39.16, 75.1];\n selection_sort(&mut records);\n println!(\"{:?}\", records);\n}", "explanation": "Selection sort on float data, variable named 'records', 8 elements."} {"id": 493, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using selection sort.", "code": "fn selection_sort(items: &mut Vec) {\n let n = items.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if items[j] < items[min_idx] {\n min_idx = j;\n }\n }\n items.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut items = vec![-12.49, 4.11, 20.14, 79.47, 67.81, 27.84, -5.62, 61.41, 44.96, 18.27];\n selection_sort(&mut items);\n println!(\"{:?}\", items);\n}", "explanation": "Selection sort on float data, variable named 'items', 10 elements."} {"id": 494, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using selection sort.", "code": "fn selection_sort(vals: &mut Vec) {\n let n = vals.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if vals[j] < vals[min_idx] {\n min_idx = j;\n }\n }\n vals.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut vals = vec![5.37, -14.58, 0.64, -12.48, 12.59, 70.15, -0.0, 24.02, -0.36, 8.99];\n selection_sort(&mut vals);\n println!(\"{:?}\", vals);\n}", "explanation": "Selection sort on float data, variable named 'vals', 10 elements."} {"id": 495, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using selection sort.", "code": "fn selection_sort(elements: &mut Vec) {\n let n = elements.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if elements[j] < elements[min_idx] {\n min_idx = j;\n }\n }\n elements.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut elements = vec![-15.16, -8.1, 80.84, 52.88, 72.54, -18.14, 37.95, -19.24, 1.35, -9.39];\n selection_sort(&mut elements);\n println!(\"{:?}\", elements);\n}", "explanation": "Selection sort on float data, variable named 'elements', 10 elements."} {"id": 496, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using selection sort.", "code": "fn selection_sort(buffer: &mut Vec) {\n let n = buffer.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if buffer[j] < buffer[min_idx] {\n min_idx = j;\n }\n }\n buffer.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut buffer = vec![50.65, 13.76, 62.53, 74.28, 36.65, -4.9, -2.97, 12.24, 33.6, 8.47, 0.77, 62.31];\n selection_sort(&mut buffer);\n println!(\"{:?}\", buffer);\n}", "explanation": "Selection sort on float data, variable named 'buffer', 12 elements."} {"id": 497, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using selection sort.", "code": "fn selection_sort(elements: &mut Vec) {\n let n = elements.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if elements[j] < elements[min_idx] {\n min_idx = j;\n }\n }\n elements.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut elements = vec![1.42, 39.49, 93.09, 54.64, 73.13, 21.39, -19.46, 8.04, -6.02, 43.09, -8.61, 23.07];\n selection_sort(&mut elements);\n println!(\"{:?}\", elements);\n}", "explanation": "Selection sort on float data, variable named 'elements', 12 elements."} {"id": 498, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using selection sort.", "code": "fn selection_sort(vals: &mut Vec) {\n let n = vals.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if vals[j] < vals[min_idx] {\n min_idx = j;\n }\n }\n vals.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut vals = vec![97.43, 40.4, 35.24, 54.55, 4.76, -13.68, -6.59, -2.24, 80.41, 88.47, 39.2, -0.99];\n selection_sort(&mut vals);\n println!(\"{:?}\", vals);\n}", "explanation": "Selection sort on float data, variable named 'vals', 12 elements."} {"id": 499, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using selection sort.", "code": "fn selection_sort(entries: &mut Vec) {\n let n = entries.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if entries[j] < entries[min_idx] {\n min_idx = j;\n }\n }\n entries.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut entries = vec![-14.87, 56.74, 13.92, 31.73, 19.78, 75.81, 70.25, -14.85, 68.11, 90.06, 0.93, 73.47, 37.72, -6.19, 86.51];\n selection_sort(&mut entries);\n println!(\"{:?}\", entries);\n}", "explanation": "Selection sort on float data, variable named 'entries', 15 elements."} {"id": 500, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using selection sort.", "code": "fn selection_sort(seq: &mut Vec) {\n let n = seq.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if seq[j] < seq[min_idx] {\n min_idx = j;\n }\n }\n seq.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut seq = vec![32.93, 48.99, 29.87, 68.9, 86.91, 7.38, -6.89, 7.11, 8.22, 29.1, 3.79, 86.07, -11.25, 49.63, -13.53];\n selection_sort(&mut seq);\n println!(\"{:?}\", seq);\n}", "explanation": "Selection sort on float data, variable named 'seq', 15 elements."} {"id": 501, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using selection sort.", "code": "fn selection_sort(collection: &mut Vec) {\n let n = collection.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if collection[j] < collection[min_idx] {\n min_idx = j;\n }\n }\n collection.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut collection = vec![-2.75, 90.42, 34.14, 26.09, -3.77, 65.66, 55.21, 96.09, 4.06, -4.86, 62.37, -12.9, -3.76, 81.35, 34.57];\n selection_sort(&mut collection);\n println!(\"{:?}\", collection);\n}", "explanation": "Selection sort on float data, variable named 'collection', 15 elements."} {"id": 502, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using selection sort.", "code": "fn selection_sort(values: &mut Vec) {\n let n = values.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if values[j] < values[min_idx] {\n min_idx = j;\n }\n }\n values.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut values = vec![70.48, 6.16, 15.12, -1.34, 74.55, 93.38, 87.76, 48.8, 45.78, 7.33, 28.99, 42.09, 82.6, 5.76, 36.35, 35.07, -18.27, 30.95, 83.84, 9.49];\n selection_sort(&mut values);\n println!(\"{:?}\", values);\n}", "explanation": "Selection sort on float data, variable named 'values', 20 elements."} {"id": 503, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using selection sort.", "code": "fn selection_sort(collection: &mut Vec) {\n let n = collection.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if collection[j] < collection[min_idx] {\n min_idx = j;\n }\n }\n collection.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut collection = vec![48.96, 86.13, 50.42, -2.27, 48.27, -19.4, 96.64, -15.23, 36.01, 71.46, -16.0, 43.2, 37.03, 74.96, 77.73, 33.84, 8.62, 46.46, -18.52, 67.08];\n selection_sort(&mut collection);\n println!(\"{:?}\", collection);\n}", "explanation": "Selection sort on float data, variable named 'collection', 20 elements."} {"id": 504, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using selection sort.", "code": "fn selection_sort(items: &mut Vec) {\n let n = items.len();\n for i in 0..n {\n let mut min_idx = i;\n for j in (i + 1)..n {\n if items[j] < items[min_idx] {\n min_idx = j;\n }\n }\n items.swap(i, min_idx);\n }\n}\n\nfn main() {\n let mut items = vec![-4.21, 15.2, 57.07, -9.2, 37.09, 16.28, 63.69, 82.09, 68.93, -17.09, 34.13, 71.85, 84.03, 28.24, 73.99, 24.08, 35.25, 55.37, 82.39, -11.59];\n selection_sort(&mut items);\n println!(\"{:?}\", items);\n}", "explanation": "Selection sort on float data, variable named 'items', 20 elements."} {"id": 505, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using insertion sort.", "code": "def insertion_sort(entries):\n for i in range(1, len(entries)):\n key = entries[i]\n j = i - 1\n while j >= 0 and entries[j] > key:\n entries[j + 1] = entries[j]\n j -= 1\n entries[j + 1] = key\n return entries\n\nprint(insertion_sort([35, 85, -42, 25, 59]))", "explanation": "Insertion sort on int data, variable named 'entries', 5 elements."} {"id": 506, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using insertion sort.", "code": "def insertion_sort(vals):\n for i in range(1, len(vals)):\n key = vals[i]\n j = i - 1\n while j >= 0 and vals[j] > key:\n vals[j + 1] = vals[j]\n j -= 1\n vals[j + 1] = key\n return vals\n\nprint(insertion_sort([19, 88, 97, 3, -30]))", "explanation": "Insertion sort on int data, variable named 'vals', 5 elements."} {"id": 507, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using insertion sort.", "code": "def insertion_sort(elements):\n for i in range(1, len(elements)):\n key = elements[i]\n j = i - 1\n while j >= 0 and elements[j] > key:\n elements[j + 1] = elements[j]\n j -= 1\n elements[j + 1] = key\n return elements\n\nprint(insertion_sort([35, -36, 81, 43, -37]))", "explanation": "Insertion sort on int data, variable named 'elements', 5 elements."} {"id": 508, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using insertion sort.", "code": "def insertion_sort(data):\n for i in range(1, len(data)):\n key = data[i]\n j = i - 1\n while j >= 0 and data[j] > key:\n data[j + 1] = data[j]\n j -= 1\n data[j + 1] = key\n return data\n\nprint(insertion_sort([48, 43, 69, -40, 43, 43, -6, 93]))", "explanation": "Insertion sort on int data, variable named 'data', 8 elements."} {"id": 509, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using insertion sort.", "code": "def insertion_sort(seq):\n for i in range(1, len(seq)):\n key = seq[i]\n j = i - 1\n while j >= 0 and seq[j] > key:\n seq[j + 1] = seq[j]\n j -= 1\n seq[j + 1] = key\n return seq\n\nprint(insertion_sort([-33, 93, 2, -15, 35, 11, 88, -21]))", "explanation": "Insertion sort on int data, variable named 'seq', 8 elements."} {"id": 510, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using insertion sort.", "code": "def insertion_sort(buffer):\n for i in range(1, len(buffer)):\n key = buffer[i]\n j = i - 1\n while j >= 0 and buffer[j] > key:\n buffer[j + 1] = buffer[j]\n j -= 1\n buffer[j + 1] = key\n return buffer\n\nprint(insertion_sort([72, 98, 3, 7, 32, 40, 18, 78]))", "explanation": "Insertion sort on int data, variable named 'buffer', 8 elements."} {"id": 511, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using insertion sort.", "code": "def insertion_sort(buffer):\n for i in range(1, len(buffer)):\n key = buffer[i]\n j = i - 1\n while j >= 0 and buffer[j] > key:\n buffer[j + 1] = buffer[j]\n j -= 1\n buffer[j + 1] = key\n return buffer\n\nprint(insertion_sort([58, 20, -37, -34, 45, 38, 65, 74, 78, 84]))", "explanation": "Insertion sort on int data, variable named 'buffer', 10 elements."} {"id": 512, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using insertion sort.", "code": "def insertion_sort(records):\n for i in range(1, len(records)):\n key = records[i]\n j = i - 1\n while j >= 0 and records[j] > key:\n records[j + 1] = records[j]\n j -= 1\n records[j + 1] = key\n return records\n\nprint(insertion_sort([-19, 70, 86, 86, 24, 65, 44, -34, -2, 67]))", "explanation": "Insertion sort on int data, variable named 'records', 10 elements."} {"id": 513, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using insertion sort.", "code": "def insertion_sort(data):\n for i in range(1, len(data)):\n key = data[i]\n j = i - 1\n while j >= 0 and data[j] > key:\n data[j + 1] = data[j]\n j -= 1\n data[j + 1] = key\n return data\n\nprint(insertion_sort([-30, 50, -5, 23, -31, -23, -8, 20, -22, -13]))", "explanation": "Insertion sort on int data, variable named 'data', 10 elements."} {"id": 514, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using insertion sort.", "code": "def insertion_sort(dataset):\n for i in range(1, len(dataset)):\n key = dataset[i]\n j = i - 1\n while j >= 0 and dataset[j] > key:\n dataset[j + 1] = dataset[j]\n j -= 1\n dataset[j + 1] = key\n return dataset\n\nprint(insertion_sort([-12, 2, 83, -45, 25, 56, 88, -17, 71, 38, 57, 63]))", "explanation": "Insertion sort on int data, variable named 'dataset', 12 elements."} {"id": 515, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using insertion sort.", "code": "def insertion_sort(seq):\n for i in range(1, len(seq)):\n key = seq[i]\n j = i - 1\n while j >= 0 and seq[j] > key:\n seq[j + 1] = seq[j]\n j -= 1\n seq[j + 1] = key\n return seq\n\nprint(insertion_sort([-45, 24, -2, -34, -45, 9, 83, 35, 55, 98, 37, 33]))", "explanation": "Insertion sort on int data, variable named 'seq', 12 elements."} {"id": 516, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using insertion sort.", "code": "def insertion_sort(dataset):\n for i in range(1, len(dataset)):\n key = dataset[i]\n j = i - 1\n while j >= 0 and dataset[j] > key:\n dataset[j + 1] = dataset[j]\n j -= 1\n dataset[j + 1] = key\n return dataset\n\nprint(insertion_sort([85, 90, 63, 67, 27, 95, -17, 28, -7, 16, 8, 73]))", "explanation": "Insertion sort on int data, variable named 'dataset', 12 elements."} {"id": 517, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using insertion sort.", "code": "def insertion_sort(list1):\n for i in range(1, len(list1)):\n key = list1[i]\n j = i - 1\n while j >= 0 and list1[j] > key:\n list1[j + 1] = list1[j]\n j -= 1\n list1[j + 1] = key\n return list1\n\nprint(insertion_sort([23, -38, -13, 40, 22, 66, -8, -9, 87, 23, -4, -6, -11, -9, 10]))", "explanation": "Insertion sort on int data, variable named 'list1', 15 elements."} {"id": 518, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using insertion sort.", "code": "def insertion_sort(data):\n for i in range(1, len(data)):\n key = data[i]\n j = i - 1\n while j >= 0 and data[j] > key:\n data[j + 1] = data[j]\n j -= 1\n data[j + 1] = key\n return data\n\nprint(insertion_sort([-40, 31, 97, -18, 62, 16, 44, -3, 2, 93, -42, 31, 38, -13, 45]))", "explanation": "Insertion sort on int data, variable named 'data', 15 elements."} {"id": 519, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using insertion sort.", "code": "def insertion_sort(dataset):\n for i in range(1, len(dataset)):\n key = dataset[i]\n j = i - 1\n while j >= 0 and dataset[j] > key:\n dataset[j + 1] = dataset[j]\n j -= 1\n dataset[j + 1] = key\n return dataset\n\nprint(insertion_sort([88, -9, 86, 27, -19, -44, 53, 77, -13, 67, 31, -11, -49, 89, 79]))", "explanation": "Insertion sort on int data, variable named 'dataset', 15 elements."} {"id": 520, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using insertion sort.", "code": "def insertion_sort(list1):\n for i in range(1, len(list1)):\n key = list1[i]\n j = i - 1\n while j >= 0 and list1[j] > key:\n list1[j + 1] = list1[j]\n j -= 1\n list1[j + 1] = key\n return list1\n\nprint(insertion_sort([25, 71, 24, 96, -13, 94, 63, 36, -22, 72, -40, -15, 91, -21, 28, -44, 52, 6, 64, 41]))", "explanation": "Insertion sort on int data, variable named 'list1', 20 elements."} {"id": 521, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using insertion sort.", "code": "def insertion_sort(data):\n for i in range(1, len(data)):\n key = data[i]\n j = i - 1\n while j >= 0 and data[j] > key:\n data[j + 1] = data[j]\n j -= 1\n data[j + 1] = key\n return data\n\nprint(insertion_sort([33, -36, -1, 99, 84, 6, 21, 0, -45, -29, 87, 64, -28, 81, 50, -1, 75, 31, 80, -36]))", "explanation": "Insertion sort on int data, variable named 'data', 20 elements."} {"id": 522, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using insertion sort.", "code": "def insertion_sort(entries):\n for i in range(1, len(entries)):\n key = entries[i]\n j = i - 1\n while j >= 0 and entries[j] > key:\n entries[j + 1] = entries[j]\n j -= 1\n entries[j + 1] = key\n return entries\n\nprint(insertion_sort([42, 51, -13, 59, 44, 48, 45, -47, 22, 38, 39, 28, 64, 93, -28, 5, 63, 56, 63, 23]))", "explanation": "Insertion sort on int data, variable named 'entries', 20 elements."} {"id": 523, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using insertion sort.", "code": "def insertion_sort(values):\n for i in range(1, len(values)):\n key = values[i]\n j = i - 1\n while j >= 0 and values[j] > key:\n values[j + 1] = values[j]\n j -= 1\n values[j + 1] = key\n return values\n\nprint(insertion_sort([75.88, 95.47, 30.44, 86.68, -3.39]))", "explanation": "Insertion sort on float data, variable named 'values', 5 elements."} {"id": 524, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using insertion sort.", "code": "def insertion_sort(elements):\n for i in range(1, len(elements)):\n key = elements[i]\n j = i - 1\n while j >= 0 and elements[j] > key:\n elements[j + 1] = elements[j]\n j -= 1\n elements[j + 1] = key\n return elements\n\nprint(insertion_sort([51.15, -2.91, 16.08, 97.62, 42.51]))", "explanation": "Insertion sort on float data, variable named 'elements', 5 elements."} {"id": 525, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using insertion sort.", "code": "def insertion_sort(list1):\n for i in range(1, len(list1)):\n key = list1[i]\n j = i - 1\n while j >= 0 and list1[j] > key:\n list1[j + 1] = list1[j]\n j -= 1\n list1[j + 1] = key\n return list1\n\nprint(insertion_sort([-12.13, 94.25, 69.98, -9.47, 28.73]))", "explanation": "Insertion sort on float data, variable named 'list1', 5 elements."} {"id": 526, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using insertion sort.", "code": "def insertion_sort(entries):\n for i in range(1, len(entries)):\n key = entries[i]\n j = i - 1\n while j >= 0 and entries[j] > key:\n entries[j + 1] = entries[j]\n j -= 1\n entries[j + 1] = key\n return entries\n\nprint(insertion_sort([12.53, 0.81, 34.99, 47.58, 88.87, 3.71, 79.04, 14.45]))", "explanation": "Insertion sort on float data, variable named 'entries', 8 elements."} {"id": 527, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using insertion sort.", "code": "def insertion_sort(dataset):\n for i in range(1, len(dataset)):\n key = dataset[i]\n j = i - 1\n while j >= 0 and dataset[j] > key:\n dataset[j + 1] = dataset[j]\n j -= 1\n dataset[j + 1] = key\n return dataset\n\nprint(insertion_sort([-14.97, 78.32, 79.32, 16.17, 46.55, 35.15, -16.81, -19.71]))", "explanation": "Insertion sort on float data, variable named 'dataset', 8 elements."} {"id": 528, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using insertion sort.", "code": "def insertion_sort(nums):\n for i in range(1, len(nums)):\n key = nums[i]\n j = i - 1\n while j >= 0 and nums[j] > key:\n nums[j + 1] = nums[j]\n j -= 1\n nums[j + 1] = key\n return nums\n\nprint(insertion_sort([15.72, 56.23, 55.75, -5.22, 59.24, 14.23, 1.35, 87.91]))", "explanation": "Insertion sort on float data, variable named 'nums', 8 elements."} {"id": 529, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using insertion sort.", "code": "def insertion_sort(buffer):\n for i in range(1, len(buffer)):\n key = buffer[i]\n j = i - 1\n while j >= 0 and buffer[j] > key:\n buffer[j + 1] = buffer[j]\n j -= 1\n buffer[j + 1] = key\n return buffer\n\nprint(insertion_sort([9.13, -5.8, 12.99, 98.33, -12.06, 68.72, 49.15, 47.3, 83.33, 54.73]))", "explanation": "Insertion sort on float data, variable named 'buffer', 10 elements."} {"id": 530, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using insertion sort.", "code": "def insertion_sort(dataset):\n for i in range(1, len(dataset)):\n key = dataset[i]\n j = i - 1\n while j >= 0 and dataset[j] > key:\n dataset[j + 1] = dataset[j]\n j -= 1\n dataset[j + 1] = key\n return dataset\n\nprint(insertion_sort([95.94, 77.38, 24.41, 67.22, -17.91, 10.88, 49.22, -2.61, 34.86, 62.5]))", "explanation": "Insertion sort on float data, variable named 'dataset', 10 elements."} {"id": 531, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using insertion sort.", "code": "def insertion_sort(list1):\n for i in range(1, len(list1)):\n key = list1[i]\n j = i - 1\n while j >= 0 and list1[j] > key:\n list1[j + 1] = list1[j]\n j -= 1\n list1[j + 1] = key\n return list1\n\nprint(insertion_sort([-0.57, 12.45, 29.92, 88.54, 22.36, 14.49, 43.02, 91.42, 41.15, 71.21]))", "explanation": "Insertion sort on float data, variable named 'list1', 10 elements."} {"id": 532, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using insertion sort.", "code": "def insertion_sort(values):\n for i in range(1, len(values)):\n key = values[i]\n j = i - 1\n while j >= 0 and values[j] > key:\n values[j + 1] = values[j]\n j -= 1\n values[j + 1] = key\n return values\n\nprint(insertion_sort([71.0, 51.25, -0.11, 18.39, 17.63, 80.55, 75.19, 12.3, 63.06, 23.14, 43.6, 21.84]))", "explanation": "Insertion sort on float data, variable named 'values', 12 elements."} {"id": 533, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using insertion sort.", "code": "def insertion_sort(values):\n for i in range(1, len(values)):\n key = values[i]\n j = i - 1\n while j >= 0 and values[j] > key:\n values[j + 1] = values[j]\n j -= 1\n values[j + 1] = key\n return values\n\nprint(insertion_sort([-18.47, 41.66, 24.39, 37.7, 20.5, 88.38, -7.81, -1.61, 6.31, 2.42, 86.75, 53.0]))", "explanation": "Insertion sort on float data, variable named 'values', 12 elements."} {"id": 534, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using insertion sort.", "code": "def insertion_sort(records):\n for i in range(1, len(records)):\n key = records[i]\n j = i - 1\n while j >= 0 and records[j] > key:\n records[j + 1] = records[j]\n j -= 1\n records[j + 1] = key\n return records\n\nprint(insertion_sort([93.35, 80.68, 64.79, 63.57, 75.51, 29.66, 89.01, -6.13, -4.38, -17.93, 21.44, 62.24]))", "explanation": "Insertion sort on float data, variable named 'records', 12 elements."} {"id": 535, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using insertion sort.", "code": "def insertion_sort(values):\n for i in range(1, len(values)):\n key = values[i]\n j = i - 1\n while j >= 0 and values[j] > key:\n values[j + 1] = values[j]\n j -= 1\n values[j + 1] = key\n return values\n\nprint(insertion_sort([77.23, 85.88, 51.12, 70.87, 20.7, 64.48, -16.58, 76.93, 6.46, 81.96, -3.06, 6.96, -5.08, -4.5, -10.65]))", "explanation": "Insertion sort on float data, variable named 'values', 15 elements."} {"id": 536, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using insertion sort.", "code": "def insertion_sort(seq):\n for i in range(1, len(seq)):\n key = seq[i]\n j = i - 1\n while j >= 0 and seq[j] > key:\n seq[j + 1] = seq[j]\n j -= 1\n seq[j + 1] = key\n return seq\n\nprint(insertion_sort([70.8, -6.71, -17.76, 37.63, 31.32, 3.37, -16.1, 58.51, 50.59, 35.82, 88.11, -14.85, 15.9, -18.78, -8.52]))", "explanation": "Insertion sort on float data, variable named 'seq', 15 elements."} {"id": 537, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using insertion sort.", "code": "def insertion_sort(data):\n for i in range(1, len(data)):\n key = data[i]\n j = i - 1\n while j >= 0 and data[j] > key:\n data[j + 1] = data[j]\n j -= 1\n data[j + 1] = key\n return data\n\nprint(insertion_sort([89.49, 4.44, 87.24, 1.99, 21.83, -9.2, 80.66, 92.08, 92.91, 21.39, -0.89, 39.58, 66.7, 8.78, 47.86]))", "explanation": "Insertion sort on float data, variable named 'data', 15 elements."} {"id": 538, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using insertion sort.", "code": "def insertion_sort(data):\n for i in range(1, len(data)):\n key = data[i]\n j = i - 1\n while j >= 0 and data[j] > key:\n data[j + 1] = data[j]\n j -= 1\n data[j + 1] = key\n return data\n\nprint(insertion_sort([77.53, 70.83, 42.93, 65.18, 94.75, 0.44, 69.73, -19.48, 66.32, 89.98, 89.54, 81.3, 36.49, 63.08, 2.03, 60.15, -7.23, 79.33, 96.77, 30.47]))", "explanation": "Insertion sort on float data, variable named 'data', 20 elements."} {"id": 539, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using insertion sort.", "code": "def insertion_sort(input_arr):\n for i in range(1, len(input_arr)):\n key = input_arr[i]\n j = i - 1\n while j >= 0 and input_arr[j] > key:\n input_arr[j + 1] = input_arr[j]\n j -= 1\n input_arr[j + 1] = key\n return input_arr\n\nprint(insertion_sort([7.08, -6.57, 97.17, -5.29, -6.87, -3.83, 70.71, 63.86, 46.3, -15.17, 19.05, -6.23, 13.75, 51.45, 17.13, 96.17, 32.83, 45.92, 14.58, 81.79]))", "explanation": "Insertion sort on float data, variable named 'input_arr', 20 elements."} {"id": 540, "language": "Python", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using insertion sort.", "code": "def insertion_sort(items):\n for i in range(1, len(items)):\n key = items[i]\n j = i - 1\n while j >= 0 and items[j] > key:\n items[j + 1] = items[j]\n j -= 1\n items[j + 1] = key\n return items\n\nprint(insertion_sort([81.96, 86.48, 75.49, 91.75, 23.73, -18.48, 60.22, 59.98, 27.17, 42.2, 60.51, -5.81, 26.98, 62.71, 96.33, 68.23, 86.2, 0.08, 23.28, 3.69]))", "explanation": "Insertion sort on float data, variable named 'items', 20 elements."} {"id": 541, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(items) {\n for (let i = 1; i < items.length; i++) {\n const key = items[i];\n let j = i - 1;\n while (j >= 0 && items[j] > key) {\n items[j + 1] = items[j];\n j--;\n }\n items[j + 1] = key;\n }\n return items;\n}\n\nconsole.log(insertionSort([53, -19, 9, 58, 77]));", "explanation": "Insertion sort on int data, variable named 'items', 5 elements."} {"id": 542, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(nums) {\n for (let i = 1; i < nums.length; i++) {\n const key = nums[i];\n let j = i - 1;\n while (j >= 0 && nums[j] > key) {\n nums[j + 1] = nums[j];\n j--;\n }\n nums[j + 1] = key;\n }\n return nums;\n}\n\nconsole.log(insertionSort([98, 19, 52, 41, 71]));", "explanation": "Insertion sort on int data, variable named 'nums', 5 elements."} {"id": 543, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(buffer) {\n for (let i = 1; i < buffer.length; i++) {\n const key = buffer[i];\n let j = i - 1;\n while (j >= 0 && buffer[j] > key) {\n buffer[j + 1] = buffer[j];\n j--;\n }\n buffer[j + 1] = key;\n }\n return buffer;\n}\n\nconsole.log(insertionSort([53, 74, 80, 21, -13]));", "explanation": "Insertion sort on int data, variable named 'buffer', 5 elements."} {"id": 544, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(vals) {\n for (let i = 1; i < vals.length; i++) {\n const key = vals[i];\n let j = i - 1;\n while (j >= 0 && vals[j] > key) {\n vals[j + 1] = vals[j];\n j--;\n }\n vals[j + 1] = key;\n }\n return vals;\n}\n\nconsole.log(insertionSort([66, -23, -19, 14, 75, 77, 9, -16]));", "explanation": "Insertion sort on int data, variable named 'vals', 8 elements."} {"id": 545, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(arr) {\n for (let i = 1; i < arr.length; i++) {\n const key = arr[i];\n let j = i - 1;\n while (j >= 0 && arr[j] > key) {\n arr[j + 1] = arr[j];\n j--;\n }\n arr[j + 1] = key;\n }\n return arr;\n}\n\nconsole.log(insertionSort([-25, -37, -33, 77, -44, -5, 47, 33]));", "explanation": "Insertion sort on int data, variable named 'arr', 8 elements."} {"id": 546, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(values) {\n for (let i = 1; i < values.length; i++) {\n const key = values[i];\n let j = i - 1;\n while (j >= 0 && values[j] > key) {\n values[j + 1] = values[j];\n j--;\n }\n values[j + 1] = key;\n }\n return values;\n}\n\nconsole.log(insertionSort([27, -26, -31, 83, 76, 69, 1, 25]));", "explanation": "Insertion sort on int data, variable named 'values', 8 elements."} {"id": 547, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(buffer) {\n for (let i = 1; i < buffer.length; i++) {\n const key = buffer[i];\n let j = i - 1;\n while (j >= 0 && buffer[j] > key) {\n buffer[j + 1] = buffer[j];\n j--;\n }\n buffer[j + 1] = key;\n }\n return buffer;\n}\n\nconsole.log(insertionSort([77, 75, 79, 16, 88, 37, 88, 89, -46, -42]));", "explanation": "Insertion sort on int data, variable named 'buffer', 10 elements."} {"id": 548, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(collection) {\n for (let i = 1; i < collection.length; i++) {\n const key = collection[i];\n let j = i - 1;\n while (j >= 0 && collection[j] > key) {\n collection[j + 1] = collection[j];\n j--;\n }\n collection[j + 1] = key;\n }\n return collection;\n}\n\nconsole.log(insertionSort([-20, 48, 65, 30, 46, 63, 67, -41, -42, -5]));", "explanation": "Insertion sort on int data, variable named 'collection', 10 elements."} {"id": 549, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(input_arr) {\n for (let i = 1; i < input_arr.length; i++) {\n const key = input_arr[i];\n let j = i - 1;\n while (j >= 0 && input_arr[j] > key) {\n input_arr[j + 1] = input_arr[j];\n j--;\n }\n input_arr[j + 1] = key;\n }\n return input_arr;\n}\n\nconsole.log(insertionSort([27, -8, 75, 60, -16, 29, 49, 74, -22, 95]));", "explanation": "Insertion sort on int data, variable named 'input_arr', 10 elements."} {"id": 550, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(buffer) {\n for (let i = 1; i < buffer.length; i++) {\n const key = buffer[i];\n let j = i - 1;\n while (j >= 0 && buffer[j] > key) {\n buffer[j + 1] = buffer[j];\n j--;\n }\n buffer[j + 1] = key;\n }\n return buffer;\n}\n\nconsole.log(insertionSort([75, 91, 88, 96, 70, 71, 93, -10, 79, -36, 50, 17]));", "explanation": "Insertion sort on int data, variable named 'buffer', 12 elements."} {"id": 551, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(dataset) {\n for (let i = 1; i < dataset.length; i++) {\n const key = dataset[i];\n let j = i - 1;\n while (j >= 0 && dataset[j] > key) {\n dataset[j + 1] = dataset[j];\n j--;\n }\n dataset[j + 1] = key;\n }\n return dataset;\n}\n\nconsole.log(insertionSort([46, 40, 22, 32, -35, -43, -39, -18, 43, 39, 99, -44]));", "explanation": "Insertion sort on int data, variable named 'dataset', 12 elements."} {"id": 552, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(vals) {\n for (let i = 1; i < vals.length; i++) {\n const key = vals[i];\n let j = i - 1;\n while (j >= 0 && vals[j] > key) {\n vals[j + 1] = vals[j];\n j--;\n }\n vals[j + 1] = key;\n }\n return vals;\n}\n\nconsole.log(insertionSort([37, 47, -26, 59, 38, 41, 55, 39, -36, 12, 13, 10]));", "explanation": "Insertion sort on int data, variable named 'vals', 12 elements."} {"id": 553, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(buffer) {\n for (let i = 1; i < buffer.length; i++) {\n const key = buffer[i];\n let j = i - 1;\n while (j >= 0 && buffer[j] > key) {\n buffer[j + 1] = buffer[j];\n j--;\n }\n buffer[j + 1] = key;\n }\n return buffer;\n}\n\nconsole.log(insertionSort([29, -29, -34, 28, -21, 36, -7, -45, 87, 33, -41, 67, 58, 95, 81]));", "explanation": "Insertion sort on int data, variable named 'buffer', 15 elements."} {"id": 554, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(entries) {\n for (let i = 1; i < entries.length; i++) {\n const key = entries[i];\n let j = i - 1;\n while (j >= 0 && entries[j] > key) {\n entries[j + 1] = entries[j];\n j--;\n }\n entries[j + 1] = key;\n }\n return entries;\n}\n\nconsole.log(insertionSort([57, 18, -45, 70, -45, 31, 46, 96, 49, 32, 96, -25, 75, -25, 2]));", "explanation": "Insertion sort on int data, variable named 'entries', 15 elements."} {"id": 555, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(list1) {\n for (let i = 1; i < list1.length; i++) {\n const key = list1[i];\n let j = i - 1;\n while (j >= 0 && list1[j] > key) {\n list1[j + 1] = list1[j];\n j--;\n }\n list1[j + 1] = key;\n }\n return list1;\n}\n\nconsole.log(insertionSort([77, 78, 36, -8, 26, 43, 61, 1, 77, -31, 87, 4, 23, 17, -38]));", "explanation": "Insertion sort on int data, variable named 'list1', 15 elements."} {"id": 556, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(nums) {\n for (let i = 1; i < nums.length; i++) {\n const key = nums[i];\n let j = i - 1;\n while (j >= 0 && nums[j] > key) {\n nums[j + 1] = nums[j];\n j--;\n }\n nums[j + 1] = key;\n }\n return nums;\n}\n\nconsole.log(insertionSort([96, 52, 7, -27, 98, -26, 36, 19, -33, 95, 85, 71, 59, 3, 38, -31, 27, 79, 26, 60]));", "explanation": "Insertion sort on int data, variable named 'nums', 20 elements."} {"id": 557, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(buffer) {\n for (let i = 1; i < buffer.length; i++) {\n const key = buffer[i];\n let j = i - 1;\n while (j >= 0 && buffer[j] > key) {\n buffer[j + 1] = buffer[j];\n j--;\n }\n buffer[j + 1] = key;\n }\n return buffer;\n}\n\nconsole.log(insertionSort([88, 30, 1, 56, 52, 14, 81, 66, 90, -4, -46, 82, -3, 97, 77, 4, 69, 18, 86, 61]));", "explanation": "Insertion sort on int data, variable named 'buffer', 20 elements."} {"id": 558, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(entries) {\n for (let i = 1; i < entries.length; i++) {\n const key = entries[i];\n let j = i - 1;\n while (j >= 0 && entries[j] > key) {\n entries[j + 1] = entries[j];\n j--;\n }\n entries[j + 1] = key;\n }\n return entries;\n}\n\nconsole.log(insertionSort([94, -35, 83, 1, 43, 68, -13, 11, -12, 26, 61, 55, 31, -34, 2, 55, 18, 23, -9, 15]));", "explanation": "Insertion sort on int data, variable named 'entries', 20 elements."} {"id": 559, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(buffer) {\n for (let i = 1; i < buffer.length; i++) {\n const key = buffer[i];\n let j = i - 1;\n while (j >= 0 && buffer[j] > key) {\n buffer[j + 1] = buffer[j];\n j--;\n }\n buffer[j + 1] = key;\n }\n return buffer;\n}\n\nconsole.log(insertionSort([51.55, 28.3, -6.49, 2.84, 9.22]));", "explanation": "Insertion sort on float data, variable named 'buffer', 5 elements."} {"id": 560, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(records) {\n for (let i = 1; i < records.length; i++) {\n const key = records[i];\n let j = i - 1;\n while (j >= 0 && records[j] > key) {\n records[j + 1] = records[j];\n j--;\n }\n records[j + 1] = key;\n }\n return records;\n}\n\nconsole.log(insertionSort([16.95, 37.76, 97.96, 30.22, 87.77]));", "explanation": "Insertion sort on float data, variable named 'records', 5 elements."} {"id": 561, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(items) {\n for (let i = 1; i < items.length; i++) {\n const key = items[i];\n let j = i - 1;\n while (j >= 0 && items[j] > key) {\n items[j + 1] = items[j];\n j--;\n }\n items[j + 1] = key;\n }\n return items;\n}\n\nconsole.log(insertionSort([-1.04, -3.76, 10.75, 75.62, 58.38]));", "explanation": "Insertion sort on float data, variable named 'items', 5 elements."} {"id": 562, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(values) {\n for (let i = 1; i < values.length; i++) {\n const key = values[i];\n let j = i - 1;\n while (j >= 0 && values[j] > key) {\n values[j + 1] = values[j];\n j--;\n }\n values[j + 1] = key;\n }\n return values;\n}\n\nconsole.log(insertionSort([56.67, -14.97, 65.97, 73.09, -13.42, 86.68, 17.35, 15.46]));", "explanation": "Insertion sort on float data, variable named 'values', 8 elements."} {"id": 563, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(data) {\n for (let i = 1; i < data.length; i++) {\n const key = data[i];\n let j = i - 1;\n while (j >= 0 && data[j] > key) {\n data[j + 1] = data[j];\n j--;\n }\n data[j + 1] = key;\n }\n return data;\n}\n\nconsole.log(insertionSort([87.17, 28.43, 23.25, 58.23, -9.25, 92.24, 66.18, -3.27]));", "explanation": "Insertion sort on float data, variable named 'data', 8 elements."} {"id": 564, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(data) {\n for (let i = 1; i < data.length; i++) {\n const key = data[i];\n let j = i - 1;\n while (j >= 0 && data[j] > key) {\n data[j + 1] = data[j];\n j--;\n }\n data[j + 1] = key;\n }\n return data;\n}\n\nconsole.log(insertionSort([47.95, 39.53, -5.64, 59.04, 49.07, 72.24, 42.51, 39.08]));", "explanation": "Insertion sort on float data, variable named 'data', 8 elements."} {"id": 565, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(data) {\n for (let i = 1; i < data.length; i++) {\n const key = data[i];\n let j = i - 1;\n while (j >= 0 && data[j] > key) {\n data[j + 1] = data[j];\n j--;\n }\n data[j + 1] = key;\n }\n return data;\n}\n\nconsole.log(insertionSort([8.33, -5.45, 76.0, 19.19, 49.53, 26.4, 69.06, 8.08, 30.32, -2.83]));", "explanation": "Insertion sort on float data, variable named 'data', 10 elements."} {"id": 566, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(values) {\n for (let i = 1; i < values.length; i++) {\n const key = values[i];\n let j = i - 1;\n while (j >= 0 && values[j] > key) {\n values[j + 1] = values[j];\n j--;\n }\n values[j + 1] = key;\n }\n return values;\n}\n\nconsole.log(insertionSort([5.48, 12.67, 28.6, 82.69, -13.34, 43.48, 63.25, -6.56, 44.94, 36.51]));", "explanation": "Insertion sort on float data, variable named 'values', 10 elements."} {"id": 567, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(items) {\n for (let i = 1; i < items.length; i++) {\n const key = items[i];\n let j = i - 1;\n while (j >= 0 && items[j] > key) {\n items[j + 1] = items[j];\n j--;\n }\n items[j + 1] = key;\n }\n return items;\n}\n\nconsole.log(insertionSort([94.63, 84.65, 91.5, 23.2, 65.16, 77.74, -17.49, 95.05, 52.09, 80.14]));", "explanation": "Insertion sort on float data, variable named 'items', 10 elements."} {"id": 568, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(buffer) {\n for (let i = 1; i < buffer.length; i++) {\n const key = buffer[i];\n let j = i - 1;\n while (j >= 0 && buffer[j] > key) {\n buffer[j + 1] = buffer[j];\n j--;\n }\n buffer[j + 1] = key;\n }\n return buffer;\n}\n\nconsole.log(insertionSort([75.07, -13.49, 89.18, 59.92, 10.1, 25.78, 56.03, 63.37, 87.48, 61.54, 43.65, 8.13]));", "explanation": "Insertion sort on float data, variable named 'buffer', 12 elements."} {"id": 569, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(dataset) {\n for (let i = 1; i < dataset.length; i++) {\n const key = dataset[i];\n let j = i - 1;\n while (j >= 0 && dataset[j] > key) {\n dataset[j + 1] = dataset[j];\n j--;\n }\n dataset[j + 1] = key;\n }\n return dataset;\n}\n\nconsole.log(insertionSort([26.23, 88.26, 26.76, 96.38, 10.41, -9.26, 77.9, 8.02, 5.04, 85.94, 88.99, 55.13]));", "explanation": "Insertion sort on float data, variable named 'dataset', 12 elements."} {"id": 570, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(entries) {\n for (let i = 1; i < entries.length; i++) {\n const key = entries[i];\n let j = i - 1;\n while (j >= 0 && entries[j] > key) {\n entries[j + 1] = entries[j];\n j--;\n }\n entries[j + 1] = key;\n }\n return entries;\n}\n\nconsole.log(insertionSort([76.66, 56.69, 73.93, 12.61, -10.47, 72.76, 38.51, 67.7, 90.25, 19.59, 30.26, 89.31]));", "explanation": "Insertion sort on float data, variable named 'entries', 12 elements."} {"id": 571, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(data) {\n for (let i = 1; i < data.length; i++) {\n const key = data[i];\n let j = i - 1;\n while (j >= 0 && data[j] > key) {\n data[j + 1] = data[j];\n j--;\n }\n data[j + 1] = key;\n }\n return data;\n}\n\nconsole.log(insertionSort([78.1, 63.12, 40.25, 21.87, 51.65, 76.8, 67.8, 33.94, -16.75, -13.8, 56.35, 54.99, 74.13, -3.81, 27.68]));", "explanation": "Insertion sort on float data, variable named 'data', 15 elements."} {"id": 572, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(buffer) {\n for (let i = 1; i < buffer.length; i++) {\n const key = buffer[i];\n let j = i - 1;\n while (j >= 0 && buffer[j] > key) {\n buffer[j + 1] = buffer[j];\n j--;\n }\n buffer[j + 1] = key;\n }\n return buffer;\n}\n\nconsole.log(insertionSort([16.36, 48.52, -6.81, 9.7, 64.91, 71.35, 57.25, -4.52, 50.69, 28.83, 91.79, 33.73, 83.95, -4.11, 0.64]));", "explanation": "Insertion sort on float data, variable named 'buffer', 15 elements."} {"id": 573, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(elements) {\n for (let i = 1; i < elements.length; i++) {\n const key = elements[i];\n let j = i - 1;\n while (j >= 0 && elements[j] > key) {\n elements[j + 1] = elements[j];\n j--;\n }\n elements[j + 1] = key;\n }\n return elements;\n}\n\nconsole.log(insertionSort([78.39, 75.14, 3.64, 29.33, 1.64, 84.29, 92.43, 85.24, 6.71, 92.82, 89.85, 57.01, 54.57, 87.91, 95.92]));", "explanation": "Insertion sort on float data, variable named 'elements', 15 elements."} {"id": 574, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(items) {\n for (let i = 1; i < items.length; i++) {\n const key = items[i];\n let j = i - 1;\n while (j >= 0 && items[j] > key) {\n items[j + 1] = items[j];\n j--;\n }\n items[j + 1] = key;\n }\n return items;\n}\n\nconsole.log(insertionSort([11.15, 81.37, -14.08, 53.54, 51.45, -2.24, 94.01, 0.24, 47.5, -18.32, 42.57, 72.03, 90.47, 78.44, 38.8, 6.71, 4.17, 92.58, 76.8, 11.68]));", "explanation": "Insertion sort on float data, variable named 'items', 20 elements."} {"id": 575, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(seq) {\n for (let i = 1; i < seq.length; i++) {\n const key = seq[i];\n let j = i - 1;\n while (j >= 0 && seq[j] > key) {\n seq[j + 1] = seq[j];\n j--;\n }\n seq[j + 1] = key;\n }\n return seq;\n}\n\nconsole.log(insertionSort([38.81, -4.51, 81.9, 51.41, 98.43, 13.67, 60.59, 29.78, 28.61, -2.63, 14.53, 11.15, 53.5, 87.97, 23.99, 61.43, 34.52, -18.77, -4.15, 18.47]));", "explanation": "Insertion sort on float data, variable named 'seq', 20 elements."} {"id": 576, "language": "JavaScript", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(seq) {\n for (let i = 1; i < seq.length; i++) {\n const key = seq[i];\n let j = i - 1;\n while (j >= 0 && seq[j] > key) {\n seq[j + 1] = seq[j];\n j--;\n }\n seq[j + 1] = key;\n }\n return seq;\n}\n\nconsole.log(insertionSort([27.31, 5.25, 25.64, 30.37, 51.07, -11.31, 46.28, -13.8, 90.8, 36.04, 22.16, 52.16, 59.82, 75.47, 64.44, 76.37, -19.36, 40.04, 25.33, 96.33]));", "explanation": "Insertion sort on float data, variable named 'seq', 20 elements."} {"id": 577, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(buffer) {\n for (let i = 1; i < buffer.length; i++) {\n const key = buffer[i];\n let j = i - 1;\n while (j >= 0 && buffer[j] > key) {\n buffer[j + 1] = buffer[j];\n j--;\n }\n buffer[j + 1] = key;\n }\n return buffer;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([44, -17, 93, -40, 98]));", "explanation": "Insertion sort on int data, variable named 'buffer', 5 elements."} {"id": 578, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(values) {\n for (let i = 1; i < values.length; i++) {\n const key = values[i];\n let j = i - 1;\n while (j >= 0 && values[j] > key) {\n values[j + 1] = values[j];\n j--;\n }\n values[j + 1] = key;\n }\n return values;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([16, -7, 78, 76, 36]));", "explanation": "Insertion sort on int data, variable named 'values', 5 elements."} {"id": 579, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(entries) {\n for (let i = 1; i < entries.length; i++) {\n const key = entries[i];\n let j = i - 1;\n while (j >= 0 && entries[j] > key) {\n entries[j + 1] = entries[j];\n j--;\n }\n entries[j + 1] = key;\n }\n return entries;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([69, -17, -28, 31, 85]));", "explanation": "Insertion sort on int data, variable named 'entries', 5 elements."} {"id": 580, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(collection) {\n for (let i = 1; i < collection.length; i++) {\n const key = collection[i];\n let j = i - 1;\n while (j >= 0 && collection[j] > key) {\n collection[j + 1] = collection[j];\n j--;\n }\n collection[j + 1] = key;\n }\n return collection;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([-14, 16, -21, 30, -39, -18, 77, 21]));", "explanation": "Insertion sort on int data, variable named 'collection', 8 elements."} {"id": 581, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(seq) {\n for (let i = 1; i < seq.length; i++) {\n const key = seq[i];\n let j = i - 1;\n while (j >= 0 && seq[j] > key) {\n seq[j + 1] = seq[j];\n j--;\n }\n seq[j + 1] = key;\n }\n return seq;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([42, 60, 22, 17, 17, 82, 30, 61]));", "explanation": "Insertion sort on int data, variable named 'seq', 8 elements."} {"id": 582, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(entries) {\n for (let i = 1; i < entries.length; i++) {\n const key = entries[i];\n let j = i - 1;\n while (j >= 0 && entries[j] > key) {\n entries[j + 1] = entries[j];\n j--;\n }\n entries[j + 1] = key;\n }\n return entries;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([-8, 30, 75, -12, 92, 62, -37, -2]));", "explanation": "Insertion sort on int data, variable named 'entries', 8 elements."} {"id": 583, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(values) {\n for (let i = 1; i < values.length; i++) {\n const key = values[i];\n let j = i - 1;\n while (j >= 0 && values[j] > key) {\n values[j + 1] = values[j];\n j--;\n }\n values[j + 1] = key;\n }\n return values;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([-37, 8, -4, -41, 70, 16, -9, 69, 61, -21]));", "explanation": "Insertion sort on int data, variable named 'values', 10 elements."} {"id": 584, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(entries) {\n for (let i = 1; i < entries.length; i++) {\n const key = entries[i];\n let j = i - 1;\n while (j >= 0 && entries[j] > key) {\n entries[j + 1] = entries[j];\n j--;\n }\n entries[j + 1] = key;\n }\n return entries;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([76, -40, 63, 41, 93, 74, 67, 76, -22, -13]));", "explanation": "Insertion sort on int data, variable named 'entries', 10 elements."} {"id": 585, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(data) {\n for (let i = 1; i < data.length; i++) {\n const key = data[i];\n let j = i - 1;\n while (j >= 0 && data[j] > key) {\n data[j + 1] = data[j];\n j--;\n }\n data[j + 1] = key;\n }\n return data;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([39, -27, 2, 22, -4, -7, 80, 19, 94, 99]));", "explanation": "Insertion sort on int data, variable named 'data', 10 elements."} {"id": 586, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(items) {\n for (let i = 1; i < items.length; i++) {\n const key = items[i];\n let j = i - 1;\n while (j >= 0 && items[j] > key) {\n items[j + 1] = items[j];\n j--;\n }\n items[j + 1] = key;\n }\n return items;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([99, -49, 84, 96, -4, 56, -31, 13, 77, -26, 34, -44]));", "explanation": "Insertion sort on int data, variable named 'items', 12 elements."} {"id": 587, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(nums) {\n for (let i = 1; i < nums.length; i++) {\n const key = nums[i];\n let j = i - 1;\n while (j >= 0 && nums[j] > key) {\n nums[j + 1] = nums[j];\n j--;\n }\n nums[j + 1] = key;\n }\n return nums;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([-19, 50, 45, -23, 32, -11, -43, -30, 67, 72, 66, 18]));", "explanation": "Insertion sort on int data, variable named 'nums', 12 elements."} {"id": 588, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(elements) {\n for (let i = 1; i < elements.length; i++) {\n const key = elements[i];\n let j = i - 1;\n while (j >= 0 && elements[j] > key) {\n elements[j + 1] = elements[j];\n j--;\n }\n elements[j + 1] = key;\n }\n return elements;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([-49, 34, -39, 65, 33, 95, -17, 4, -38, 22, 32, -36]));", "explanation": "Insertion sort on int data, variable named 'elements', 12 elements."} {"id": 589, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(seq) {\n for (let i = 1; i < seq.length; i++) {\n const key = seq[i];\n let j = i - 1;\n while (j >= 0 && seq[j] > key) {\n seq[j + 1] = seq[j];\n j--;\n }\n seq[j + 1] = key;\n }\n return seq;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([-32, 90, 47, -27, 52, 15, -5, 11, 52, -28, -45, 3, -9, 49, 53]));", "explanation": "Insertion sort on int data, variable named 'seq', 15 elements."} {"id": 590, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(nums) {\n for (let i = 1; i < nums.length; i++) {\n const key = nums[i];\n let j = i - 1;\n while (j >= 0 && nums[j] > key) {\n nums[j + 1] = nums[j];\n j--;\n }\n nums[j + 1] = key;\n }\n return nums;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([-11, -20, 26, 75, 60, 29, -17, 41, -26, 44, 81, 1, 75, 64, 49]));", "explanation": "Insertion sort on int data, variable named 'nums', 15 elements."} {"id": 591, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(dataset) {\n for (let i = 1; i < dataset.length; i++) {\n const key = dataset[i];\n let j = i - 1;\n while (j >= 0 && dataset[j] > key) {\n dataset[j + 1] = dataset[j];\n j--;\n }\n dataset[j + 1] = key;\n }\n return dataset;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([18, 94, 58, -27, 58, 44, -3, 61, 59, -27, -40, 81, 37, 68, 7]));", "explanation": "Insertion sort on int data, variable named 'dataset', 15 elements."} {"id": 592, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(buffer) {\n for (let i = 1; i < buffer.length; i++) {\n const key = buffer[i];\n let j = i - 1;\n while (j >= 0 && buffer[j] > key) {\n buffer[j + 1] = buffer[j];\n j--;\n }\n buffer[j + 1] = key;\n }\n return buffer;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([-11, 76, 84, 84, -29, 24, 69, 61, -30, 72, 26, -12, -18, 26, 13, 83, 59, 25, 95, -38]));", "explanation": "Insertion sort on int data, variable named 'buffer', 20 elements."} {"id": 593, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(input_arr) {\n for (let i = 1; i < input_arr.length; i++) {\n const key = input_arr[i];\n let j = i - 1;\n while (j >= 0 && input_arr[j] > key) {\n input_arr[j + 1] = input_arr[j];\n j--;\n }\n input_arr[j + 1] = key;\n }\n return input_arr;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([-31, -39, 81, -23, 80, 58, 55, -26, 68, 95, 14, 40, 15, 99, -30, 78, -46, -21, 68, -5]));", "explanation": "Insertion sort on int data, variable named 'input_arr', 20 elements."} {"id": 594, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using insertion sort.", "code": "function insertionSort(vals) {\n for (let i = 1; i < vals.length; i++) {\n const key = vals[i];\n let j = i - 1;\n while (j >= 0 && vals[j] > key) {\n vals[j + 1] = vals[j];\n j--;\n }\n vals[j + 1] = key;\n }\n return vals;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([-4, 50, -39, -29, 56, 26, 30, 66, 65, 17, 37, -3, 4, -3, -30, 16, -23, 61, 86, -46]));", "explanation": "Insertion sort on int data, variable named 'vals', 20 elements."} {"id": 595, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(arr) {\n for (let i = 1; i < arr.length; i++) {\n const key = arr[i];\n let j = i - 1;\n while (j >= 0 && arr[j] > key) {\n arr[j + 1] = arr[j];\n j--;\n }\n arr[j + 1] = key;\n }\n return arr;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([27.0, -18.42, 58.04, 34.76, 28.21]));", "explanation": "Insertion sort on float data, variable named 'arr', 5 elements."} {"id": 596, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(buffer) {\n for (let i = 1; i < buffer.length; i++) {\n const key = buffer[i];\n let j = i - 1;\n while (j >= 0 && buffer[j] > key) {\n buffer[j + 1] = buffer[j];\n j--;\n }\n buffer[j + 1] = key;\n }\n return buffer;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([94.93, 51.62, 37.92, 53.6, 95.9]));", "explanation": "Insertion sort on float data, variable named 'buffer', 5 elements."} {"id": 597, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(list1) {\n for (let i = 1; i < list1.length; i++) {\n const key = list1[i];\n let j = i - 1;\n while (j >= 0 && list1[j] > key) {\n list1[j + 1] = list1[j];\n j--;\n }\n list1[j + 1] = key;\n }\n return list1;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([62.19, 94.61, 60.34, 75.75, -9.57]));", "explanation": "Insertion sort on float data, variable named 'list1', 5 elements."} {"id": 598, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(values) {\n for (let i = 1; i < values.length; i++) {\n const key = values[i];\n let j = i - 1;\n while (j >= 0 && values[j] > key) {\n values[j + 1] = values[j];\n j--;\n }\n values[j + 1] = key;\n }\n return values;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([-18.35, -6.68, -18.11, 95.49, 82.22, 4.9, 57.19, 57.32]));", "explanation": "Insertion sort on float data, variable named 'values', 8 elements."} {"id": 599, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(collection) {\n for (let i = 1; i < collection.length; i++) {\n const key = collection[i];\n let j = i - 1;\n while (j >= 0 && collection[j] > key) {\n collection[j + 1] = collection[j];\n j--;\n }\n collection[j + 1] = key;\n }\n return collection;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([80.21, 82.12, 44.09, -9.75, 71.6, -2.37, 30.2, -6.14]));", "explanation": "Insertion sort on float data, variable named 'collection', 8 elements."} {"id": 600, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(entries) {\n for (let i = 1; i < entries.length; i++) {\n const key = entries[i];\n let j = i - 1;\n while (j >= 0 && entries[j] > key) {\n entries[j + 1] = entries[j];\n j--;\n }\n entries[j + 1] = key;\n }\n return entries;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([-1.86, 63.61, 94.7, 36.11, 82.32, 49.64, 3.96, 47.76]));", "explanation": "Insertion sort on float data, variable named 'entries', 8 elements."} {"id": 601, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(records) {\n for (let i = 1; i < records.length; i++) {\n const key = records[i];\n let j = i - 1;\n while (j >= 0 && records[j] > key) {\n records[j + 1] = records[j];\n j--;\n }\n records[j + 1] = key;\n }\n return records;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([26.62, 19.73, -7.78, 80.87, 31.38, 29.47, 38.99, 48.86, 67.0, 98.88]));", "explanation": "Insertion sort on float data, variable named 'records', 10 elements."} {"id": 602, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(arr) {\n for (let i = 1; i < arr.length; i++) {\n const key = arr[i];\n let j = i - 1;\n while (j >= 0 && arr[j] > key) {\n arr[j + 1] = arr[j];\n j--;\n }\n arr[j + 1] = key;\n }\n return arr;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([38.01, 37.85, 50.33, 52.77, 60.76, 77.19, 38.06, 65.0, 42.87, 30.22]));", "explanation": "Insertion sort on float data, variable named 'arr', 10 elements."} {"id": 603, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(list1) {\n for (let i = 1; i < list1.length; i++) {\n const key = list1[i];\n let j = i - 1;\n while (j >= 0 && list1[j] > key) {\n list1[j + 1] = list1[j];\n j--;\n }\n list1[j + 1] = key;\n }\n return list1;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([45.84, 11.87, 57.15, 85.81, -6.08, 54.1, 56.9, 33.35, 31.91, -0.8]));", "explanation": "Insertion sort on float data, variable named 'list1', 10 elements."} {"id": 604, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(seq) {\n for (let i = 1; i < seq.length; i++) {\n const key = seq[i];\n let j = i - 1;\n while (j >= 0 && seq[j] > key) {\n seq[j + 1] = seq[j];\n j--;\n }\n seq[j + 1] = key;\n }\n return seq;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([2.87, 20.92, 7.62, 6.14, 88.18, 20.36, 51.65, 80.25, 58.18, -4.39, 14.91, 64.65]));", "explanation": "Insertion sort on float data, variable named 'seq', 12 elements."} {"id": 605, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(collection) {\n for (let i = 1; i < collection.length; i++) {\n const key = collection[i];\n let j = i - 1;\n while (j >= 0 && collection[j] > key) {\n collection[j + 1] = collection[j];\n j--;\n }\n collection[j + 1] = key;\n }\n return collection;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([79.14, 60.1, 67.42, 74.72, 75.17, 80.5, 54.0, 13.61, 69.16, 59.38, -4.64, 3.74]));", "explanation": "Insertion sort on float data, variable named 'collection', 12 elements."} {"id": 606, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(elements) {\n for (let i = 1; i < elements.length; i++) {\n const key = elements[i];\n let j = i - 1;\n while (j >= 0 && elements[j] > key) {\n elements[j + 1] = elements[j];\n j--;\n }\n elements[j + 1] = key;\n }\n return elements;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([38.57, 74.42, 92.22, 38.75, 7.93, 46.26, 98.91, 22.7, 11.04, 60.55, 0.79, 82.28]));", "explanation": "Insertion sort on float data, variable named 'elements', 12 elements."} {"id": 607, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(input_arr) {\n for (let i = 1; i < input_arr.length; i++) {\n const key = input_arr[i];\n let j = i - 1;\n while (j >= 0 && input_arr[j] > key) {\n input_arr[j + 1] = input_arr[j];\n j--;\n }\n input_arr[j + 1] = key;\n }\n return input_arr;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([-16.2, -12.42, 31.24, 53.49, -5.64, 6.67, 10.68, 20.5, 22.27, -14.45, 84.45, 11.83, -2.01, 62.13, 41.33]));", "explanation": "Insertion sort on float data, variable named 'input_arr', 15 elements."} {"id": 608, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(buffer) {\n for (let i = 1; i < buffer.length; i++) {\n const key = buffer[i];\n let j = i - 1;\n while (j >= 0 && buffer[j] > key) {\n buffer[j + 1] = buffer[j];\n j--;\n }\n buffer[j + 1] = key;\n }\n return buffer;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([-7.61, -14.0, 92.61, 75.08, 94.56, 69.94, 95.98, 73.02, 52.55, 82.15, -7.88, 46.93, 40.37, -0.12, -5.95]));", "explanation": "Insertion sort on float data, variable named 'buffer', 15 elements."} {"id": 609, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(items) {\n for (let i = 1; i < items.length; i++) {\n const key = items[i];\n let j = i - 1;\n while (j >= 0 && items[j] > key) {\n items[j + 1] = items[j];\n j--;\n }\n items[j + 1] = key;\n }\n return items;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([88.41, -1.31, 14.76, 32.54, 40.2, 67.17, -8.18, 57.0, 19.82, -3.61, 80.98, 32.25, 29.47, 71.51, 9.19]));", "explanation": "Insertion sort on float data, variable named 'items', 15 elements."} {"id": 610, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(vals) {\n for (let i = 1; i < vals.length; i++) {\n const key = vals[i];\n let j = i - 1;\n while (j >= 0 && vals[j] > key) {\n vals[j + 1] = vals[j];\n j--;\n }\n vals[j + 1] = key;\n }\n return vals;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([36.37, 14.12, 0.38, 11.66, 65.11, 29.39, 54.9, 9.21, 69.63, 43.03, 73.68, -3.58, 31.03, 89.24, 86.87, 93.27, 41.42, 61.18, 92.31, 32.67]));", "explanation": "Insertion sort on float data, variable named 'vals', 20 elements."} {"id": 611, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(vals) {\n for (let i = 1; i < vals.length; i++) {\n const key = vals[i];\n let j = i - 1;\n while (j >= 0 && vals[j] > key) {\n vals[j + 1] = vals[j];\n j--;\n }\n vals[j + 1] = key;\n }\n return vals;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([-18.82, 75.94, 92.29, -9.91, 17.46, 96.85, -0.45, -12.69, 70.34, 58.56, 56.33, 87.4, -13.12, 55.16, 64.89, 58.58, 41.85, 15.19, 27.84, 61.02]));", "explanation": "Insertion sort on float data, variable named 'vals', 20 elements."} {"id": 612, "language": "Node.js", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using insertion sort.", "code": "function insertionSort(input_arr) {\n for (let i = 1; i < input_arr.length; i++) {\n const key = input_arr[i];\n let j = i - 1;\n while (j >= 0 && input_arr[j] > key) {\n input_arr[j + 1] = input_arr[j];\n j--;\n }\n input_arr[j + 1] = key;\n }\n return input_arr;\n}\n\nmodule.exports = { insertionSort };\nconsole.log(insertionSort([83.95, 65.86, 17.33, 20.95, 78.41, 87.12, 52.64, -2.52, 28.07, 56.62, 85.62, 54.3, 53.56, 32.62, 21.08, 76.61, 57.2, 72.27, 84.84, -9.97]));", "explanation": "Insertion sort on float data, variable named 'input_arr', 20 elements."} {"id": 613, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(int[] input_arr) {\n for (int i = 1; i < input_arr.length; i++) {\n int key = input_arr[i];\n int j = i - 1;\n while (j >= 0 && input_arr[j] > key) {\n input_arr[j + 1] = input_arr[j];\n j--;\n }\n input_arr[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n int[] input_arr = {35, 49, -18, 83, 88};\n insertionSort(input_arr);\n for (int v : input_arr) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on int data, variable named 'input_arr', 5 elements."} {"id": 614, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(int[] nums) {\n for (int i = 1; i < nums.length; i++) {\n int key = nums[i];\n int j = i - 1;\n while (j >= 0 && nums[j] > key) {\n nums[j + 1] = nums[j];\n j--;\n }\n nums[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n int[] nums = {4, -27, 80, 91, 29};\n insertionSort(nums);\n for (int v : nums) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on int data, variable named 'nums', 5 elements."} {"id": 615, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(int[] input_arr) {\n for (int i = 1; i < input_arr.length; i++) {\n int key = input_arr[i];\n int j = i - 1;\n while (j >= 0 && input_arr[j] > key) {\n input_arr[j + 1] = input_arr[j];\n j--;\n }\n input_arr[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n int[] input_arr = {37, -10, -45, -43, 88};\n insertionSort(input_arr);\n for (int v : input_arr) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on int data, variable named 'input_arr', 5 elements."} {"id": 616, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(int[] elements) {\n for (int i = 1; i < elements.length; i++) {\n int key = elements[i];\n int j = i - 1;\n while (j >= 0 && elements[j] > key) {\n elements[j + 1] = elements[j];\n j--;\n }\n elements[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n int[] elements = {16, 11, 27, 58, 79, -22, -35, 45};\n insertionSort(elements);\n for (int v : elements) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on int data, variable named 'elements', 8 elements."} {"id": 617, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(int[] nums) {\n for (int i = 1; i < nums.length; i++) {\n int key = nums[i];\n int j = i - 1;\n while (j >= 0 && nums[j] > key) {\n nums[j + 1] = nums[j];\n j--;\n }\n nums[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n int[] nums = {79, 40, -19, -38, -19, 64, 26, 96};\n insertionSort(nums);\n for (int v : nums) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on int data, variable named 'nums', 8 elements."} {"id": 618, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(int[] seq) {\n for (int i = 1; i < seq.length; i++) {\n int key = seq[i];\n int j = i - 1;\n while (j >= 0 && seq[j] > key) {\n seq[j + 1] = seq[j];\n j--;\n }\n seq[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n int[] seq = {-49, 66, 36, 10, 98, 94, 86, 9};\n insertionSort(seq);\n for (int v : seq) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on int data, variable named 'seq', 8 elements."} {"id": 619, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(int[] list1) {\n for (int i = 1; i < list1.length; i++) {\n int key = list1[i];\n int j = i - 1;\n while (j >= 0 && list1[j] > key) {\n list1[j + 1] = list1[j];\n j--;\n }\n list1[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n int[] list1 = {26, 22, 96, -15, 46, 83, 13, -24, 33, 82};\n insertionSort(list1);\n for (int v : list1) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on int data, variable named 'list1', 10 elements."} {"id": 620, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(int[] elements) {\n for (int i = 1; i < elements.length; i++) {\n int key = elements[i];\n int j = i - 1;\n while (j >= 0 && elements[j] > key) {\n elements[j + 1] = elements[j];\n j--;\n }\n elements[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n int[] elements = {-1, 42, 66, -25, -13, 58, 55, -30, -27, -35};\n insertionSort(elements);\n for (int v : elements) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on int data, variable named 'elements', 10 elements."} {"id": 621, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(int[] collection) {\n for (int i = 1; i < collection.length; i++) {\n int key = collection[i];\n int j = i - 1;\n while (j >= 0 && collection[j] > key) {\n collection[j + 1] = collection[j];\n j--;\n }\n collection[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n int[] collection = {-17, 71, 4, 64, -31, 44, 84, 53, 93, 82};\n insertionSort(collection);\n for (int v : collection) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on int data, variable named 'collection', 10 elements."} {"id": 622, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(int[] vals) {\n for (int i = 1; i < vals.length; i++) {\n int key = vals[i];\n int j = i - 1;\n while (j >= 0 && vals[j] > key) {\n vals[j + 1] = vals[j];\n j--;\n }\n vals[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n int[] vals = {51, 17, 99, 77, 58, 62, 75, 56, -9, -14, 79, -18};\n insertionSort(vals);\n for (int v : vals) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on int data, variable named 'vals', 12 elements."} {"id": 623, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(int[] dataset) {\n for (int i = 1; i < dataset.length; i++) {\n int key = dataset[i];\n int j = i - 1;\n while (j >= 0 && dataset[j] > key) {\n dataset[j + 1] = dataset[j];\n j--;\n }\n dataset[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n int[] dataset = {67, -17, 81, 85, -20, 4, 66, 71, -42, -10, 93, 44};\n insertionSort(dataset);\n for (int v : dataset) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on int data, variable named 'dataset', 12 elements."} {"id": 624, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(int[] entries) {\n for (int i = 1; i < entries.length; i++) {\n int key = entries[i];\n int j = i - 1;\n while (j >= 0 && entries[j] > key) {\n entries[j + 1] = entries[j];\n j--;\n }\n entries[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n int[] entries = {-20, 54, -22, -20, 44, 96, 24, -40, 83, -11, -20, 45};\n insertionSort(entries);\n for (int v : entries) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on int data, variable named 'entries', 12 elements."} {"id": 625, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(int[] nums) {\n for (int i = 1; i < nums.length; i++) {\n int key = nums[i];\n int j = i - 1;\n while (j >= 0 && nums[j] > key) {\n nums[j + 1] = nums[j];\n j--;\n }\n nums[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n int[] nums = {45, 27, 25, 74, -43, -14, -14, 57, -38, 28, 22, 5, -4, 75, -50};\n insertionSort(nums);\n for (int v : nums) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on int data, variable named 'nums', 15 elements."} {"id": 626, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(int[] data) {\n for (int i = 1; i < data.length; i++) {\n int key = data[i];\n int j = i - 1;\n while (j >= 0 && data[j] > key) {\n data[j + 1] = data[j];\n j--;\n }\n data[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n int[] data = {90, 39, -33, -39, 56, 73, 96, 29, 94, 65, 36, 46, 71, -17, -15};\n insertionSort(data);\n for (int v : data) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on int data, variable named 'data', 15 elements."} {"id": 627, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(int[] input_arr) {\n for (int i = 1; i < input_arr.length; i++) {\n int key = input_arr[i];\n int j = i - 1;\n while (j >= 0 && input_arr[j] > key) {\n input_arr[j + 1] = input_arr[j];\n j--;\n }\n input_arr[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n int[] input_arr = {67, 65, 64, -12, 33, -28, 54, 49, 9, 51, 36, 88, -39, 63, 21};\n insertionSort(input_arr);\n for (int v : input_arr) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on int data, variable named 'input_arr', 15 elements."} {"id": 628, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(int[] buffer) {\n for (int i = 1; i < buffer.length; i++) {\n int key = buffer[i];\n int j = i - 1;\n while (j >= 0 && buffer[j] > key) {\n buffer[j + 1] = buffer[j];\n j--;\n }\n buffer[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n int[] buffer = {-28, -8, -44, 96, 29, 93, -19, 93, -29, -1, 88, 97, -37, 95, 83, -2, 71, 78, -46, -20};\n insertionSort(buffer);\n for (int v : buffer) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on int data, variable named 'buffer', 20 elements."} {"id": 629, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(int[] buffer) {\n for (int i = 1; i < buffer.length; i++) {\n int key = buffer[i];\n int j = i - 1;\n while (j >= 0 && buffer[j] > key) {\n buffer[j + 1] = buffer[j];\n j--;\n }\n buffer[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n int[] buffer = {86, -4, -46, 20, 2, 12, 98, 63, -29, 86, 32, 52, -39, 75, -45, 37, 61, -4, 56, -44};\n insertionSort(buffer);\n for (int v : buffer) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on int data, variable named 'buffer', 20 elements."} {"id": 630, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(int[] records) {\n for (int i = 1; i < records.length; i++) {\n int key = records[i];\n int j = i - 1;\n while (j >= 0 && records[j] > key) {\n records[j + 1] = records[j];\n j--;\n }\n records[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n int[] records = {85, 31, 47, 15, -27, -21, -25, 88, -7, 23, -14, -4, 15, -28, -11, 28, 54, -7, -35, 33};\n insertionSort(records);\n for (int v : records) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on int data, variable named 'records', 20 elements."} {"id": 631, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(double[] values) {\n for (int i = 1; i < values.length; i++) {\n double key = values[i];\n int j = i - 1;\n while (j >= 0 && values[j] > key) {\n values[j + 1] = values[j];\n j--;\n }\n values[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n double[] values = {-16.77, -13.04, 26.4, 18.08, 29.13};\n insertionSort(values);\n for (double v : values) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on float data, variable named 'values', 5 elements."} {"id": 632, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(double[] list1) {\n for (int i = 1; i < list1.length; i++) {\n double key = list1[i];\n int j = i - 1;\n while (j >= 0 && list1[j] > key) {\n list1[j + 1] = list1[j];\n j--;\n }\n list1[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n double[] list1 = {10.69, 92.05, 87.04, -13.83, 8.52};\n insertionSort(list1);\n for (double v : list1) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on float data, variable named 'list1', 5 elements."} {"id": 633, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(double[] elements) {\n for (int i = 1; i < elements.length; i++) {\n double key = elements[i];\n int j = i - 1;\n while (j >= 0 && elements[j] > key) {\n elements[j + 1] = elements[j];\n j--;\n }\n elements[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n double[] elements = {49.74, 38.66, 69.53, 25.82, -6.31};\n insertionSort(elements);\n for (double v : elements) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on float data, variable named 'elements', 5 elements."} {"id": 634, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(double[] arr) {\n for (int i = 1; i < arr.length; i++) {\n double key = arr[i];\n int j = i - 1;\n while (j >= 0 && arr[j] > key) {\n arr[j + 1] = arr[j];\n j--;\n }\n arr[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n double[] arr = {17.88, 45.82, -12.21, -16.56, 55.39, 88.73, -17.78, 45.93};\n insertionSort(arr);\n for (double v : arr) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on float data, variable named 'arr', 8 elements."} {"id": 635, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(double[] elements) {\n for (int i = 1; i < elements.length; i++) {\n double key = elements[i];\n int j = i - 1;\n while (j >= 0 && elements[j] > key) {\n elements[j + 1] = elements[j];\n j--;\n }\n elements[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n double[] elements = {60.34, 9.31, 46.01, 73.44, 16.25, 28.4, -10.01, 55.66};\n insertionSort(elements);\n for (double v : elements) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on float data, variable named 'elements', 8 elements."} {"id": 636, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(double[] items) {\n for (int i = 1; i < items.length; i++) {\n double key = items[i];\n int j = i - 1;\n while (j >= 0 && items[j] > key) {\n items[j + 1] = items[j];\n j--;\n }\n items[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n double[] items = {73.16, -3.06, 44.31, 0.01, 9.17, 93.36, 94.4, 46.06};\n insertionSort(items);\n for (double v : items) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on float data, variable named 'items', 8 elements."} {"id": 637, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(double[] arr) {\n for (int i = 1; i < arr.length; i++) {\n double key = arr[i];\n int j = i - 1;\n while (j >= 0 && arr[j] > key) {\n arr[j + 1] = arr[j];\n j--;\n }\n arr[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n double[] arr = {-19.88, 35.29, 78.7, 14.42, 95.68, -19.94, 91.09, 37.38, 51.15, 79.9};\n insertionSort(arr);\n for (double v : arr) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on float data, variable named 'arr', 10 elements."} {"id": 638, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(double[] collection) {\n for (int i = 1; i < collection.length; i++) {\n double key = collection[i];\n int j = i - 1;\n while (j >= 0 && collection[j] > key) {\n collection[j + 1] = collection[j];\n j--;\n }\n collection[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n double[] collection = {98.91, 80.25, 5.32, 80.04, 13.48, -0.79, 43.56, -11.68, -9.32, 63.11};\n insertionSort(collection);\n for (double v : collection) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on float data, variable named 'collection', 10 elements."} {"id": 639, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(double[] records) {\n for (int i = 1; i < records.length; i++) {\n double key = records[i];\n int j = i - 1;\n while (j >= 0 && records[j] > key) {\n records[j + 1] = records[j];\n j--;\n }\n records[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n double[] records = {-3.38, 46.22, 13.26, 31.4, 52.64, 93.93, 17.88, 61.17, 20.77, 11.1};\n insertionSort(records);\n for (double v : records) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on float data, variable named 'records', 10 elements."} {"id": 640, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(double[] vals) {\n for (int i = 1; i < vals.length; i++) {\n double key = vals[i];\n int j = i - 1;\n while (j >= 0 && vals[j] > key) {\n vals[j + 1] = vals[j];\n j--;\n }\n vals[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n double[] vals = {64.22, 12.49, 58.81, 18.27, 5.06, 94.12, 19.09, 88.77, -4.09, 89.75, 52.45, -19.49};\n insertionSort(vals);\n for (double v : vals) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on float data, variable named 'vals', 12 elements."} {"id": 641, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(double[] arr) {\n for (int i = 1; i < arr.length; i++) {\n double key = arr[i];\n int j = i - 1;\n while (j >= 0 && arr[j] > key) {\n arr[j + 1] = arr[j];\n j--;\n }\n arr[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n double[] arr = {60.05, 29.17, 86.54, 63.69, 70.73, 44.04, 73.69, 57.24, -10.77, -16.32, 79.02, 59.92};\n insertionSort(arr);\n for (double v : arr) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on float data, variable named 'arr', 12 elements."} {"id": 642, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(double[] buffer) {\n for (int i = 1; i < buffer.length; i++) {\n double key = buffer[i];\n int j = i - 1;\n while (j >= 0 && buffer[j] > key) {\n buffer[j + 1] = buffer[j];\n j--;\n }\n buffer[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n double[] buffer = {-5.31, 95.67, 24.79, 51.56, 26.02, 79.86, 76.61, 97.07, -5.15, 24.09, 2.97, -18.89};\n insertionSort(buffer);\n for (double v : buffer) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on float data, variable named 'buffer', 12 elements."} {"id": 643, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(double[] seq) {\n for (int i = 1; i < seq.length; i++) {\n double key = seq[i];\n int j = i - 1;\n while (j >= 0 && seq[j] > key) {\n seq[j + 1] = seq[j];\n j--;\n }\n seq[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n double[] seq = {-17.65, 13.46, 89.65, 22.58, -9.29, 53.0, 16.08, 65.42, 7.88, 38.76, 23.2, 13.41, 87.64, 64.13, 4.88};\n insertionSort(seq);\n for (double v : seq) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on float data, variable named 'seq', 15 elements."} {"id": 644, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(double[] items) {\n for (int i = 1; i < items.length; i++) {\n double key = items[i];\n int j = i - 1;\n while (j >= 0 && items[j] > key) {\n items[j + 1] = items[j];\n j--;\n }\n items[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n double[] items = {97.13, 55.97, -6.8, 13.0, 39.54, 0.29, 3.06, 67.92, 59.99, 51.75, 0.89, 49.99, 68.77, -4.84, 91.09};\n insertionSort(items);\n for (double v : items) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on float data, variable named 'items', 15 elements."} {"id": 645, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(double[] records) {\n for (int i = 1; i < records.length; i++) {\n double key = records[i];\n int j = i - 1;\n while (j >= 0 && records[j] > key) {\n records[j + 1] = records[j];\n j--;\n }\n records[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n double[] records = {7.13, 42.25, 73.09, 2.83, 60.68, 98.04, 62.47, 43.42, 10.1, 46.65, 34.02, 91.61, 56.27, 92.23, -13.83};\n insertionSort(records);\n for (double v : records) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on float data, variable named 'records', 15 elements."} {"id": 646, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(double[] list1) {\n for (int i = 1; i < list1.length; i++) {\n double key = list1[i];\n int j = i - 1;\n while (j >= 0 && list1[j] > key) {\n list1[j + 1] = list1[j];\n j--;\n }\n list1[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n double[] list1 = {31.47, 98.42, 12.61, 60.94, 35.52, 23.02, 70.32, 85.17, 6.72, 13.07, 29.99, 33.41, -19.39, 3.16, -10.26, 48.05, -16.98, 67.76, 96.39, 30.43};\n insertionSort(list1);\n for (double v : list1) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on float data, variable named 'list1', 20 elements."} {"id": 647, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(double[] data) {\n for (int i = 1; i < data.length; i++) {\n double key = data[i];\n int j = i - 1;\n while (j >= 0 && data[j] > key) {\n data[j + 1] = data[j];\n j--;\n }\n data[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n double[] data = {89.12, 3.43, 19.18, -12.52, 54.41, -16.68, 31.4, -17.14, 74.87, 91.27, 80.02, 9.41, 36.36, 94.1, 79.07, 77.77, 41.84, 8.17, -11.32, 51.4};\n insertionSort(data);\n for (double v : data) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on float data, variable named 'data', 20 elements."} {"id": 648, "language": "Java", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using insertion sort.", "code": "public class Main {\n static void insertionSort(double[] dataset) {\n for (int i = 1; i < dataset.length; i++) {\n double key = dataset[i];\n int j = i - 1;\n while (j >= 0 && dataset[j] > key) {\n dataset[j + 1] = dataset[j];\n j--;\n }\n dataset[j + 1] = key;\n }\n }\n\n public static void main(String[] args) {\n double[] dataset = {70.93, 54.42, 48.89, -9.82, -12.78, -16.03, 17.28, 80.88, -12.26, -4.82, 89.37, 32.59, 15.88, 54.52, -12.17, 60.63, 46.55, 15.1, 25.39, -8.6};\n insertionSort(dataset);\n for (double v : dataset) System.out.print(v + \" \");\n }\n}", "explanation": "Insertion sort on float data, variable named 'dataset', 20 elements."} {"id": 649, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(int vals[], int n) {\n for (int i = 1; i < n; i++) {\n int key = vals[i];\n int j = i - 1;\n while (j >= 0 && vals[j] > key) {\n vals[j + 1] = vals[j];\n j--;\n }\n vals[j + 1] = key;\n }\n}\n\nint main(void) {\n int vals[] = {55, 9, -48, 66, 48};\n int n = sizeof(vals) / sizeof(vals[0]);\n insertion_sort(vals, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)vals[i]);\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'vals', 5 elements."} {"id": 650, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(int dataset[], int n) {\n for (int i = 1; i < n; i++) {\n int key = dataset[i];\n int j = i - 1;\n while (j >= 0 && dataset[j] > key) {\n dataset[j + 1] = dataset[j];\n j--;\n }\n dataset[j + 1] = key;\n }\n}\n\nint main(void) {\n int dataset[] = {59, -25, 36, -44, 66};\n int n = sizeof(dataset) / sizeof(dataset[0]);\n insertion_sort(dataset, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)dataset[i]);\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'dataset', 5 elements."} {"id": 651, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(int input_arr[], int n) {\n for (int i = 1; i < n; i++) {\n int key = input_arr[i];\n int j = i - 1;\n while (j >= 0 && input_arr[j] > key) {\n input_arr[j + 1] = input_arr[j];\n j--;\n }\n input_arr[j + 1] = key;\n }\n}\n\nint main(void) {\n int input_arr[] = {34, -1, -23, -24, -47};\n int n = sizeof(input_arr) / sizeof(input_arr[0]);\n insertion_sort(input_arr, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)input_arr[i]);\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'input_arr', 5 elements."} {"id": 652, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(int elements[], int n) {\n for (int i = 1; i < n; i++) {\n int key = elements[i];\n int j = i - 1;\n while (j >= 0 && elements[j] > key) {\n elements[j + 1] = elements[j];\n j--;\n }\n elements[j + 1] = key;\n }\n}\n\nint main(void) {\n int elements[] = {-33, -1, 96, -18, 80, 15, 40, 57};\n int n = sizeof(elements) / sizeof(elements[0]);\n insertion_sort(elements, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)elements[i]);\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'elements', 8 elements."} {"id": 653, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(int dataset[], int n) {\n for (int i = 1; i < n; i++) {\n int key = dataset[i];\n int j = i - 1;\n while (j >= 0 && dataset[j] > key) {\n dataset[j + 1] = dataset[j];\n j--;\n }\n dataset[j + 1] = key;\n }\n}\n\nint main(void) {\n int dataset[] = {63, -3, 12, -15, -39, -35, -18, 29};\n int n = sizeof(dataset) / sizeof(dataset[0]);\n insertion_sort(dataset, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)dataset[i]);\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'dataset', 8 elements."} {"id": 654, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(int elements[], int n) {\n for (int i = 1; i < n; i++) {\n int key = elements[i];\n int j = i - 1;\n while (j >= 0 && elements[j] > key) {\n elements[j + 1] = elements[j];\n j--;\n }\n elements[j + 1] = key;\n }\n}\n\nint main(void) {\n int elements[] = {61, 81, 41, 29, 99, 88, -13, -13};\n int n = sizeof(elements) / sizeof(elements[0]);\n insertion_sort(elements, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)elements[i]);\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'elements', 8 elements."} {"id": 655, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(int dataset[], int n) {\n for (int i = 1; i < n; i++) {\n int key = dataset[i];\n int j = i - 1;\n while (j >= 0 && dataset[j] > key) {\n dataset[j + 1] = dataset[j];\n j--;\n }\n dataset[j + 1] = key;\n }\n}\n\nint main(void) {\n int dataset[] = {29, 37, 24, 44, -48, 82, -13, -36, 10, 79};\n int n = sizeof(dataset) / sizeof(dataset[0]);\n insertion_sort(dataset, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)dataset[i]);\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'dataset', 10 elements."} {"id": 656, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(int records[], int n) {\n for (int i = 1; i < n; i++) {\n int key = records[i];\n int j = i - 1;\n while (j >= 0 && records[j] > key) {\n records[j + 1] = records[j];\n j--;\n }\n records[j + 1] = key;\n }\n}\n\nint main(void) {\n int records[] = {93, -37, 58, 38, 0, 1, 1, -33, 37, -2};\n int n = sizeof(records) / sizeof(records[0]);\n insertion_sort(records, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)records[i]);\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'records', 10 elements."} {"id": 657, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(int buffer[], int n) {\n for (int i = 1; i < n; i++) {\n int key = buffer[i];\n int j = i - 1;\n while (j >= 0 && buffer[j] > key) {\n buffer[j + 1] = buffer[j];\n j--;\n }\n buffer[j + 1] = key;\n }\n}\n\nint main(void) {\n int buffer[] = {71, 69, 34, 98, 94, 35, 26, 57, 34, -9};\n int n = sizeof(buffer) / sizeof(buffer[0]);\n insertion_sort(buffer, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)buffer[i]);\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'buffer', 10 elements."} {"id": 658, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(int data[], int n) {\n for (int i = 1; i < n; i++) {\n int key = data[i];\n int j = i - 1;\n while (j >= 0 && data[j] > key) {\n data[j + 1] = data[j];\n j--;\n }\n data[j + 1] = key;\n }\n}\n\nint main(void) {\n int data[] = {66, -40, 76, 6, -50, 7, 8, 69, 4, 11, 73, 34};\n int n = sizeof(data) / sizeof(data[0]);\n insertion_sort(data, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)data[i]);\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'data', 12 elements."} {"id": 659, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(int vals[], int n) {\n for (int i = 1; i < n; i++) {\n int key = vals[i];\n int j = i - 1;\n while (j >= 0 && vals[j] > key) {\n vals[j + 1] = vals[j];\n j--;\n }\n vals[j + 1] = key;\n }\n}\n\nint main(void) {\n int vals[] = {46, 2, 52, -3, -49, 42, -48, -32, 41, -43, 92, -21};\n int n = sizeof(vals) / sizeof(vals[0]);\n insertion_sort(vals, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)vals[i]);\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'vals', 12 elements."} {"id": 660, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(int values[], int n) {\n for (int i = 1; i < n; i++) {\n int key = values[i];\n int j = i - 1;\n while (j >= 0 && values[j] > key) {\n values[j + 1] = values[j];\n j--;\n }\n values[j + 1] = key;\n }\n}\n\nint main(void) {\n int values[] = {24, 62, -1, 99, 42, -39, -43, 0, 0, 22, -6, 6};\n int n = sizeof(values) / sizeof(values[0]);\n insertion_sort(values, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)values[i]);\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'values', 12 elements."} {"id": 661, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(int entries[], int n) {\n for (int i = 1; i < n; i++) {\n int key = entries[i];\n int j = i - 1;\n while (j >= 0 && entries[j] > key) {\n entries[j + 1] = entries[j];\n j--;\n }\n entries[j + 1] = key;\n }\n}\n\nint main(void) {\n int entries[] = {17, -6, 36, 91, 12, -5, 0, -45, -5, 17, -25, -45, -15, 47, -22};\n int n = sizeof(entries) / sizeof(entries[0]);\n insertion_sort(entries, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)entries[i]);\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'entries', 15 elements."} {"id": 662, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(int list1[], int n) {\n for (int i = 1; i < n; i++) {\n int key = list1[i];\n int j = i - 1;\n while (j >= 0 && list1[j] > key) {\n list1[j + 1] = list1[j];\n j--;\n }\n list1[j + 1] = key;\n }\n}\n\nint main(void) {\n int list1[] = {3, 28, 66, 11, 44, 45, -7, 84, 61, -34, -20, -14, -17, -2, -1};\n int n = sizeof(list1) / sizeof(list1[0]);\n insertion_sort(list1, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)list1[i]);\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'list1', 15 elements."} {"id": 663, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(int input_arr[], int n) {\n for (int i = 1; i < n; i++) {\n int key = input_arr[i];\n int j = i - 1;\n while (j >= 0 && input_arr[j] > key) {\n input_arr[j + 1] = input_arr[j];\n j--;\n }\n input_arr[j + 1] = key;\n }\n}\n\nint main(void) {\n int input_arr[] = {46, 45, 31, 59, 12, -39, -2, 87, 25, -12, 33, 13, -37, 21, -18};\n int n = sizeof(input_arr) / sizeof(input_arr[0]);\n insertion_sort(input_arr, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)input_arr[i]);\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'input_arr', 15 elements."} {"id": 664, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(int records[], int n) {\n for (int i = 1; i < n; i++) {\n int key = records[i];\n int j = i - 1;\n while (j >= 0 && records[j] > key) {\n records[j + 1] = records[j];\n j--;\n }\n records[j + 1] = key;\n }\n}\n\nint main(void) {\n int records[] = {80, 99, 75, 3, -30, 70, -34, -8, 80, 49, 80, 45, 77, 82, 68, -5, 32, 45, 84, 73};\n int n = sizeof(records) / sizeof(records[0]);\n insertion_sort(records, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)records[i]);\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'records', 20 elements."} {"id": 665, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(int seq[], int n) {\n for (int i = 1; i < n; i++) {\n int key = seq[i];\n int j = i - 1;\n while (j >= 0 && seq[j] > key) {\n seq[j + 1] = seq[j];\n j--;\n }\n seq[j + 1] = key;\n }\n}\n\nint main(void) {\n int seq[] = {76, 71, 18, 98, 52, 99, -41, 3, 6, 1, 65, 10, 51, 5, 28, 58, 46, 96, -10, 45};\n int n = sizeof(seq) / sizeof(seq[0]);\n insertion_sort(seq, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)seq[i]);\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'seq', 20 elements."} {"id": 666, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(int nums[], int n) {\n for (int i = 1; i < n; i++) {\n int key = nums[i];\n int j = i - 1;\n while (j >= 0 && nums[j] > key) {\n nums[j + 1] = nums[j];\n j--;\n }\n nums[j + 1] = key;\n }\n}\n\nint main(void) {\n int nums[] = {90, -29, -16, -29, 25, 63, 82, 40, 8, 99, -40, 69, 81, 36, 59, 65, 69, 60, 54, 44};\n int n = sizeof(nums) / sizeof(nums[0]);\n insertion_sort(nums, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)nums[i]);\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'nums', 20 elements."} {"id": 667, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(double vals[], int n) {\n for (int i = 1; i < n; i++) {\n double key = vals[i];\n int j = i - 1;\n while (j >= 0 && vals[j] > key) {\n vals[j + 1] = vals[j];\n j--;\n }\n vals[j + 1] = key;\n }\n}\n\nint main(void) {\n double vals[] = {39.21, 12.49, -17.06, 32.56, 11.61};\n int n = sizeof(vals) / sizeof(vals[0]);\n insertion_sort(vals, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)vals[i]);\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'vals', 5 elements."} {"id": 668, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(double data[], int n) {\n for (int i = 1; i < n; i++) {\n double key = data[i];\n int j = i - 1;\n while (j >= 0 && data[j] > key) {\n data[j + 1] = data[j];\n j--;\n }\n data[j + 1] = key;\n }\n}\n\nint main(void) {\n double data[] = {22.73, -10.19, 80.27, 41.02, 56.59};\n int n = sizeof(data) / sizeof(data[0]);\n insertion_sort(data, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)data[i]);\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'data', 5 elements."} {"id": 669, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(double vals[], int n) {\n for (int i = 1; i < n; i++) {\n double key = vals[i];\n int j = i - 1;\n while (j >= 0 && vals[j] > key) {\n vals[j + 1] = vals[j];\n j--;\n }\n vals[j + 1] = key;\n }\n}\n\nint main(void) {\n double vals[] = {12.89, 7.1, -5.89, 22.87, 44.98};\n int n = sizeof(vals) / sizeof(vals[0]);\n insertion_sort(vals, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)vals[i]);\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'vals', 5 elements."} {"id": 670, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(double list1[], int n) {\n for (int i = 1; i < n; i++) {\n double key = list1[i];\n int j = i - 1;\n while (j >= 0 && list1[j] > key) {\n list1[j + 1] = list1[j];\n j--;\n }\n list1[j + 1] = key;\n }\n}\n\nint main(void) {\n double list1[] = {3.4, 19.18, 16.02, 77.05, 61.34, 12.66, 63.97, 98.76};\n int n = sizeof(list1) / sizeof(list1[0]);\n insertion_sort(list1, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)list1[i]);\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'list1', 8 elements."} {"id": 671, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(double records[], int n) {\n for (int i = 1; i < n; i++) {\n double key = records[i];\n int j = i - 1;\n while (j >= 0 && records[j] > key) {\n records[j + 1] = records[j];\n j--;\n }\n records[j + 1] = key;\n }\n}\n\nint main(void) {\n double records[] = {69.53, 68.04, 88.57, -18.98, 15.64, 77.85, 73.19, 28.05};\n int n = sizeof(records) / sizeof(records[0]);\n insertion_sort(records, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)records[i]);\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'records', 8 elements."} {"id": 672, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(double collection[], int n) {\n for (int i = 1; i < n; i++) {\n double key = collection[i];\n int j = i - 1;\n while (j >= 0 && collection[j] > key) {\n collection[j + 1] = collection[j];\n j--;\n }\n collection[j + 1] = key;\n }\n}\n\nint main(void) {\n double collection[] = {77.8, 70.18, -18.59, 57.84, 97.72, 93.23, 82.99, 7.08};\n int n = sizeof(collection) / sizeof(collection[0]);\n insertion_sort(collection, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)collection[i]);\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'collection', 8 elements."} {"id": 673, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(double seq[], int n) {\n for (int i = 1; i < n; i++) {\n double key = seq[i];\n int j = i - 1;\n while (j >= 0 && seq[j] > key) {\n seq[j + 1] = seq[j];\n j--;\n }\n seq[j + 1] = key;\n }\n}\n\nint main(void) {\n double seq[] = {69.15, 36.46, 41.38, 73.53, 70.16, 65.98, 34.91, 74.24, 17.26, 2.35};\n int n = sizeof(seq) / sizeof(seq[0]);\n insertion_sort(seq, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)seq[i]);\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'seq', 10 elements."} {"id": 674, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(double vals[], int n) {\n for (int i = 1; i < n; i++) {\n double key = vals[i];\n int j = i - 1;\n while (j >= 0 && vals[j] > key) {\n vals[j + 1] = vals[j];\n j--;\n }\n vals[j + 1] = key;\n }\n}\n\nint main(void) {\n double vals[] = {92.09, 29.7, 32.2, 81.5, -16.42, -3.46, 83.98, 16.36, 67.8, 39.48};\n int n = sizeof(vals) / sizeof(vals[0]);\n insertion_sort(vals, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)vals[i]);\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'vals', 10 elements."} {"id": 675, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(double buffer[], int n) {\n for (int i = 1; i < n; i++) {\n double key = buffer[i];\n int j = i - 1;\n while (j >= 0 && buffer[j] > key) {\n buffer[j + 1] = buffer[j];\n j--;\n }\n buffer[j + 1] = key;\n }\n}\n\nint main(void) {\n double buffer[] = {79.28, 20.44, 29.88, 61.61, 28.0, 72.66, 43.97, 18.8, -17.23, 73.46};\n int n = sizeof(buffer) / sizeof(buffer[0]);\n insertion_sort(buffer, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)buffer[i]);\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'buffer', 10 elements."} {"id": 676, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(double entries[], int n) {\n for (int i = 1; i < n; i++) {\n double key = entries[i];\n int j = i - 1;\n while (j >= 0 && entries[j] > key) {\n entries[j + 1] = entries[j];\n j--;\n }\n entries[j + 1] = key;\n }\n}\n\nint main(void) {\n double entries[] = {-3.44, 96.29, 98.32, 47.61, 75.1, 88.74, 48.29, 26.52, 25.38, 92.89, -12.42, 25.99};\n int n = sizeof(entries) / sizeof(entries[0]);\n insertion_sort(entries, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)entries[i]);\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'entries', 12 elements."} {"id": 677, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(double dataset[], int n) {\n for (int i = 1; i < n; i++) {\n double key = dataset[i];\n int j = i - 1;\n while (j >= 0 && dataset[j] > key) {\n dataset[j + 1] = dataset[j];\n j--;\n }\n dataset[j + 1] = key;\n }\n}\n\nint main(void) {\n double dataset[] = {-7.07, 47.77, 33.73, 86.47, -8.9, -7.59, 45.8, -16.18, 61.99, 38.14, 2.22, -11.73};\n int n = sizeof(dataset) / sizeof(dataset[0]);\n insertion_sort(dataset, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)dataset[i]);\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'dataset', 12 elements."} {"id": 678, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(double collection[], int n) {\n for (int i = 1; i < n; i++) {\n double key = collection[i];\n int j = i - 1;\n while (j >= 0 && collection[j] > key) {\n collection[j + 1] = collection[j];\n j--;\n }\n collection[j + 1] = key;\n }\n}\n\nint main(void) {\n double collection[] = {13.77, 7.73, 58.49, -11.67, -13.16, 41.71, 0.45, 82.31, 28.89, -1.31, -6.82, 43.84};\n int n = sizeof(collection) / sizeof(collection[0]);\n insertion_sort(collection, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)collection[i]);\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'collection', 12 elements."} {"id": 679, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(double dataset[], int n) {\n for (int i = 1; i < n; i++) {\n double key = dataset[i];\n int j = i - 1;\n while (j >= 0 && dataset[j] > key) {\n dataset[j + 1] = dataset[j];\n j--;\n }\n dataset[j + 1] = key;\n }\n}\n\nint main(void) {\n double dataset[] = {68.43, 26.29, 87.53, 4.57, 83.58, 16.86, 77.33, 59.11, -1.11, 48.44, 16.93, 4.15, 65.3, 34.62, 4.0};\n int n = sizeof(dataset) / sizeof(dataset[0]);\n insertion_sort(dataset, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)dataset[i]);\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'dataset', 15 elements."} {"id": 680, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(double values[], int n) {\n for (int i = 1; i < n; i++) {\n double key = values[i];\n int j = i - 1;\n while (j >= 0 && values[j] > key) {\n values[j + 1] = values[j];\n j--;\n }\n values[j + 1] = key;\n }\n}\n\nint main(void) {\n double values[] = {33.04, 78.13, 51.98, 9.37, 19.14, 47.74, 38.42, 35.06, -15.35, -9.16, 56.91, 89.35, 21.27, 80.27, 74.29};\n int n = sizeof(values) / sizeof(values[0]);\n insertion_sort(values, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)values[i]);\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'values', 15 elements."} {"id": 681, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(double collection[], int n) {\n for (int i = 1; i < n; i++) {\n double key = collection[i];\n int j = i - 1;\n while (j >= 0 && collection[j] > key) {\n collection[j + 1] = collection[j];\n j--;\n }\n collection[j + 1] = key;\n }\n}\n\nint main(void) {\n double collection[] = {52.95, 76.39, 0.84, 9.65, 87.1, 67.26, 34.48, 88.39, 1.83, 47.67, 26.83, 92.54, 8.52, 83.59, 12.58};\n int n = sizeof(collection) / sizeof(collection[0]);\n insertion_sort(collection, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)collection[i]);\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'collection', 15 elements."} {"id": 682, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(double buffer[], int n) {\n for (int i = 1; i < n; i++) {\n double key = buffer[i];\n int j = i - 1;\n while (j >= 0 && buffer[j] > key) {\n buffer[j + 1] = buffer[j];\n j--;\n }\n buffer[j + 1] = key;\n }\n}\n\nint main(void) {\n double buffer[] = {43.99, 59.33, -12.06, 66.46, 87.37, 88.14, 28.94, 70.66, -5.57, 23.88, 69.89, 40.02, 72.76, 28.8, -0.38, 4.68, -14.69, -16.82, 56.03, 60.4};\n int n = sizeof(buffer) / sizeof(buffer[0]);\n insertion_sort(buffer, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)buffer[i]);\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'buffer', 20 elements."} {"id": 683, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(double dataset[], int n) {\n for (int i = 1; i < n; i++) {\n double key = dataset[i];\n int j = i - 1;\n while (j >= 0 && dataset[j] > key) {\n dataset[j + 1] = dataset[j];\n j--;\n }\n dataset[j + 1] = key;\n }\n}\n\nint main(void) {\n double dataset[] = {25.36, 68.77, 81.84, 27.2, -18.72, -6.35, 89.14, 18.93, 69.09, 37.69, -11.88, 45.26, 8.83, 93.05, -3.31, 77.63, 80.15, 0.3, -17.85, -8.04};\n int n = sizeof(dataset) / sizeof(dataset[0]);\n insertion_sort(dataset, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)dataset[i]);\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'dataset', 20 elements."} {"id": 684, "language": "C", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using insertion sort.", "code": "#include \n\nvoid insertion_sort(double nums[], int n) {\n for (int i = 1; i < n; i++) {\n double key = nums[i];\n int j = i - 1;\n while (j >= 0 && nums[j] > key) {\n nums[j + 1] = nums[j];\n j--;\n }\n nums[j + 1] = key;\n }\n}\n\nint main(void) {\n double nums[] = {-5.23, 68.23, 0.05, 59.9, -18.67, 12.52, 32.44, 1.17, 65.02, 86.23, 43.34, 32.6, -14.32, 55.54, 42.22, 58.84, 58.54, -7.77, 62.15, 32.83};\n int n = sizeof(nums) / sizeof(nums[0]);\n insertion_sort(nums, n);\n for (int i = 0; i < n; i++) printf(\"%g \", (double)nums[i]);\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'nums', 20 elements."} {"id": 685, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& elements) {\n for (size_t i = 1; i < elements.size(); i++) {\n int key = elements[i];\n int j = (int) i - 1;\n while (j >= 0 && elements[j] > key) {\n elements[j + 1] = elements[j];\n j--;\n }\n elements[j + 1] = key;\n }\n}\n\nint main() {\n std::vector elements = {-49, -38, 46, 1, 13};\n insertionSort(elements);\n for (int v : elements) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'elements', 5 elements."} {"id": 686, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& list1) {\n for (size_t i = 1; i < list1.size(); i++) {\n int key = list1[i];\n int j = (int) i - 1;\n while (j >= 0 && list1[j] > key) {\n list1[j + 1] = list1[j];\n j--;\n }\n list1[j + 1] = key;\n }\n}\n\nint main() {\n std::vector list1 = {11, 1, -27, -46, 57};\n insertionSort(list1);\n for (int v : list1) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'list1', 5 elements."} {"id": 687, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& arr) {\n for (size_t i = 1; i < arr.size(); i++) {\n int key = arr[i];\n int j = (int) i - 1;\n while (j >= 0 && arr[j] > key) {\n arr[j + 1] = arr[j];\n j--;\n }\n arr[j + 1] = key;\n }\n}\n\nint main() {\n std::vector arr = {-47, 36, -1, -34, 6};\n insertionSort(arr);\n for (int v : arr) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'arr', 5 elements."} {"id": 688, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& entries) {\n for (size_t i = 1; i < entries.size(); i++) {\n int key = entries[i];\n int j = (int) i - 1;\n while (j >= 0 && entries[j] > key) {\n entries[j + 1] = entries[j];\n j--;\n }\n entries[j + 1] = key;\n }\n}\n\nint main() {\n std::vector entries = {-26, -8, -8, -39, 56, 81, -23, 33};\n insertionSort(entries);\n for (int v : entries) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'entries', 8 elements."} {"id": 689, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& list1) {\n for (size_t i = 1; i < list1.size(); i++) {\n int key = list1[i];\n int j = (int) i - 1;\n while (j >= 0 && list1[j] > key) {\n list1[j + 1] = list1[j];\n j--;\n }\n list1[j + 1] = key;\n }\n}\n\nint main() {\n std::vector list1 = {93, -2, 3, 88, 51, 59, -20, 9};\n insertionSort(list1);\n for (int v : list1) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'list1', 8 elements."} {"id": 690, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& items) {\n for (size_t i = 1; i < items.size(); i++) {\n int key = items[i];\n int j = (int) i - 1;\n while (j >= 0 && items[j] > key) {\n items[j + 1] = items[j];\n j--;\n }\n items[j + 1] = key;\n }\n}\n\nint main() {\n std::vector items = {-23, 41, 32, -6, -47, 52, 30, -47};\n insertionSort(items);\n for (int v : items) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'items', 8 elements."} {"id": 691, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& collection) {\n for (size_t i = 1; i < collection.size(); i++) {\n int key = collection[i];\n int j = (int) i - 1;\n while (j >= 0 && collection[j] > key) {\n collection[j + 1] = collection[j];\n j--;\n }\n collection[j + 1] = key;\n }\n}\n\nint main() {\n std::vector collection = {4, 67, 6, -34, 21, 44, -39, -33, 5, 55};\n insertionSort(collection);\n for (int v : collection) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'collection', 10 elements."} {"id": 692, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& nums) {\n for (size_t i = 1; i < nums.size(); i++) {\n int key = nums[i];\n int j = (int) i - 1;\n while (j >= 0 && nums[j] > key) {\n nums[j + 1] = nums[j];\n j--;\n }\n nums[j + 1] = key;\n }\n}\n\nint main() {\n std::vector nums = {77, -24, 87, 95, -7, 14, -26, 33, 49, -16};\n insertionSort(nums);\n for (int v : nums) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'nums', 10 elements."} {"id": 693, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& list1) {\n for (size_t i = 1; i < list1.size(); i++) {\n int key = list1[i];\n int j = (int) i - 1;\n while (j >= 0 && list1[j] > key) {\n list1[j + 1] = list1[j];\n j--;\n }\n list1[j + 1] = key;\n }\n}\n\nint main() {\n std::vector list1 = {-6, 31, 73, -33, 35, -46, 99, 64, 47, 80};\n insertionSort(list1);\n for (int v : list1) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'list1', 10 elements."} {"id": 694, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& buffer) {\n for (size_t i = 1; i < buffer.size(); i++) {\n int key = buffer[i];\n int j = (int) i - 1;\n while (j >= 0 && buffer[j] > key) {\n buffer[j + 1] = buffer[j];\n j--;\n }\n buffer[j + 1] = key;\n }\n}\n\nint main() {\n std::vector buffer = {9, 78, -47, 9, -45, -19, 29, 10, 59, 12, -30, -35};\n insertionSort(buffer);\n for (int v : buffer) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'buffer', 12 elements."} {"id": 695, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& values) {\n for (size_t i = 1; i < values.size(); i++) {\n int key = values[i];\n int j = (int) i - 1;\n while (j >= 0 && values[j] > key) {\n values[j + 1] = values[j];\n j--;\n }\n values[j + 1] = key;\n }\n}\n\nint main() {\n std::vector values = {45, 77, 25, 1, -12, 46, 2, -41, 10, 63, 34, -16};\n insertionSort(values);\n for (int v : values) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'values', 12 elements."} {"id": 696, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& nums) {\n for (size_t i = 1; i < nums.size(); i++) {\n int key = nums[i];\n int j = (int) i - 1;\n while (j >= 0 && nums[j] > key) {\n nums[j + 1] = nums[j];\n j--;\n }\n nums[j + 1] = key;\n }\n}\n\nint main() {\n std::vector nums = {31, -40, 83, 56, 23, -44, 8, 34, 37, 12, 2, 88};\n insertionSort(nums);\n for (int v : nums) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'nums', 12 elements."} {"id": 697, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& arr) {\n for (size_t i = 1; i < arr.size(); i++) {\n int key = arr[i];\n int j = (int) i - 1;\n while (j >= 0 && arr[j] > key) {\n arr[j + 1] = arr[j];\n j--;\n }\n arr[j + 1] = key;\n }\n}\n\nint main() {\n std::vector arr = {13, 6, 47, 83, 32, -4, 63, -49, -34, 75, -33, -1, -37, -14, 2};\n insertionSort(arr);\n for (int v : arr) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'arr', 15 elements."} {"id": 698, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& values) {\n for (size_t i = 1; i < values.size(); i++) {\n int key = values[i];\n int j = (int) i - 1;\n while (j >= 0 && values[j] > key) {\n values[j + 1] = values[j];\n j--;\n }\n values[j + 1] = key;\n }\n}\n\nint main() {\n std::vector values = {-27, -6, 90, 2, 10, 79, -30, 59, 69, 29, -8, 0, 12, 58, -5};\n insertionSort(values);\n for (int v : values) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'values', 15 elements."} {"id": 699, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& elements) {\n for (size_t i = 1; i < elements.size(); i++) {\n int key = elements[i];\n int j = (int) i - 1;\n while (j >= 0 && elements[j] > key) {\n elements[j + 1] = elements[j];\n j--;\n }\n elements[j + 1] = key;\n }\n}\n\nint main() {\n std::vector elements = {13, 27, 23, 97, 64, 1, 19, 73, -30, 42, 51, 46, -8, 70, 62};\n insertionSort(elements);\n for (int v : elements) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'elements', 15 elements."} {"id": 700, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& collection) {\n for (size_t i = 1; i < collection.size(); i++) {\n int key = collection[i];\n int j = (int) i - 1;\n while (j >= 0 && collection[j] > key) {\n collection[j + 1] = collection[j];\n j--;\n }\n collection[j + 1] = key;\n }\n}\n\nint main() {\n std::vector collection = {79, 60, -11, 73, -45, 47, 59, -29, 26, 87, -11, 91, -6, 15, 47, 68, 28, 66, 22, 46};\n insertionSort(collection);\n for (int v : collection) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'collection', 20 elements."} {"id": 701, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& input_arr) {\n for (size_t i = 1; i < input_arr.size(); i++) {\n int key = input_arr[i];\n int j = (int) i - 1;\n while (j >= 0 && input_arr[j] > key) {\n input_arr[j + 1] = input_arr[j];\n j--;\n }\n input_arr[j + 1] = key;\n }\n}\n\nint main() {\n std::vector input_arr = {73, -32, 35, -16, 70, 0, -11, -2, -49, -47, 78, 45, 75, 53, 56, 51, 45, 48, 75, 28};\n insertionSort(input_arr);\n for (int v : input_arr) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'input_arr', 20 elements."} {"id": 702, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& buffer) {\n for (size_t i = 1; i < buffer.size(); i++) {\n int key = buffer[i];\n int j = (int) i - 1;\n while (j >= 0 && buffer[j] > key) {\n buffer[j + 1] = buffer[j];\n j--;\n }\n buffer[j + 1] = key;\n }\n}\n\nint main() {\n std::vector buffer = {-32, 54, -41, -19, 48, 94, -9, -1, 61, 15, 39, 80, 75, 44, -36, 48, 58, 13, 12, 72};\n insertionSort(buffer);\n for (int v : buffer) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on int data, variable named 'buffer', 20 elements."} {"id": 703, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& arr) {\n for (size_t i = 1; i < arr.size(); i++) {\n double key = arr[i];\n int j = (int) i - 1;\n while (j >= 0 && arr[j] > key) {\n arr[j + 1] = arr[j];\n j--;\n }\n arr[j + 1] = key;\n }\n}\n\nint main() {\n std::vector arr = {89.65, 23.01, 64.08, -16.64, 59.22};\n insertionSort(arr);\n for (double v : arr) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'arr', 5 elements."} {"id": 704, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& values) {\n for (size_t i = 1; i < values.size(); i++) {\n double key = values[i];\n int j = (int) i - 1;\n while (j >= 0 && values[j] > key) {\n values[j + 1] = values[j];\n j--;\n }\n values[j + 1] = key;\n }\n}\n\nint main() {\n std::vector values = {11.1, 34.2, 61.05, 10.26, 51.66};\n insertionSort(values);\n for (double v : values) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'values', 5 elements."} {"id": 705, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& buffer) {\n for (size_t i = 1; i < buffer.size(); i++) {\n double key = buffer[i];\n int j = (int) i - 1;\n while (j >= 0 && buffer[j] > key) {\n buffer[j + 1] = buffer[j];\n j--;\n }\n buffer[j + 1] = key;\n }\n}\n\nint main() {\n std::vector buffer = {80.14, -18.53, 71.75, 56.68, 89.11};\n insertionSort(buffer);\n for (double v : buffer) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'buffer', 5 elements."} {"id": 706, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& collection) {\n for (size_t i = 1; i < collection.size(); i++) {\n double key = collection[i];\n int j = (int) i - 1;\n while (j >= 0 && collection[j] > key) {\n collection[j + 1] = collection[j];\n j--;\n }\n collection[j + 1] = key;\n }\n}\n\nint main() {\n std::vector collection = {64.02, 95.92, -10.44, 88.28, 84.24, -0.27, 30.8, 62.33};\n insertionSort(collection);\n for (double v : collection) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'collection', 8 elements."} {"id": 707, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& input_arr) {\n for (size_t i = 1; i < input_arr.size(); i++) {\n double key = input_arr[i];\n int j = (int) i - 1;\n while (j >= 0 && input_arr[j] > key) {\n input_arr[j + 1] = input_arr[j];\n j--;\n }\n input_arr[j + 1] = key;\n }\n}\n\nint main() {\n std::vector input_arr = {95.15, 58.36, 25.55, 16.65, 28.98, 84.29, 66.59, -9.42};\n insertionSort(input_arr);\n for (double v : input_arr) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'input_arr', 8 elements."} {"id": 708, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& buffer) {\n for (size_t i = 1; i < buffer.size(); i++) {\n double key = buffer[i];\n int j = (int) i - 1;\n while (j >= 0 && buffer[j] > key) {\n buffer[j + 1] = buffer[j];\n j--;\n }\n buffer[j + 1] = key;\n }\n}\n\nint main() {\n std::vector buffer = {48.14, 74.91, 76.89, 12.01, 4.93, 69.05, 63.18, -19.24};\n insertionSort(buffer);\n for (double v : buffer) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'buffer', 8 elements."} {"id": 709, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& values) {\n for (size_t i = 1; i < values.size(); i++) {\n double key = values[i];\n int j = (int) i - 1;\n while (j >= 0 && values[j] > key) {\n values[j + 1] = values[j];\n j--;\n }\n values[j + 1] = key;\n }\n}\n\nint main() {\n std::vector values = {77.15, -19.81, -11.69, 62.86, 42.47, 57.89, 67.23, 0.31, 24.58, 63.78};\n insertionSort(values);\n for (double v : values) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'values', 10 elements."} {"id": 710, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& items) {\n for (size_t i = 1; i < items.size(); i++) {\n double key = items[i];\n int j = (int) i - 1;\n while (j >= 0 && items[j] > key) {\n items[j + 1] = items[j];\n j--;\n }\n items[j + 1] = key;\n }\n}\n\nint main() {\n std::vector items = {37.89, 39.81, -6.88, 47.48, 5.3, 3.91, 69.24, 76.29, 2.83, 96.97};\n insertionSort(items);\n for (double v : items) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'items', 10 elements."} {"id": 711, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& records) {\n for (size_t i = 1; i < records.size(); i++) {\n double key = records[i];\n int j = (int) i - 1;\n while (j >= 0 && records[j] > key) {\n records[j + 1] = records[j];\n j--;\n }\n records[j + 1] = key;\n }\n}\n\nint main() {\n std::vector records = {28.65, 54.59, 54.31, 83.34, -0.23, 14.88, 24.95, 12.93, 20.72, 49.69};\n insertionSort(records);\n for (double v : records) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'records', 10 elements."} {"id": 712, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& dataset) {\n for (size_t i = 1; i < dataset.size(); i++) {\n double key = dataset[i];\n int j = (int) i - 1;\n while (j >= 0 && dataset[j] > key) {\n dataset[j + 1] = dataset[j];\n j--;\n }\n dataset[j + 1] = key;\n }\n}\n\nint main() {\n std::vector dataset = {37.74, 70.5, -18.87, 11.66, 93.67, 59.17, 73.92, -15.02, 5.12, 74.22, 24.7, 41.89};\n insertionSort(dataset);\n for (double v : dataset) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'dataset', 12 elements."} {"id": 713, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& vals) {\n for (size_t i = 1; i < vals.size(); i++) {\n double key = vals[i];\n int j = (int) i - 1;\n while (j >= 0 && vals[j] > key) {\n vals[j + 1] = vals[j];\n j--;\n }\n vals[j + 1] = key;\n }\n}\n\nint main() {\n std::vector vals = {11.63, 37.83, 70.07, 51.92, 20.05, 61.14, 20.83, 17.51, 8.51, 22.98, 27.42, 52.69};\n insertionSort(vals);\n for (double v : vals) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'vals', 12 elements."} {"id": 714, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& list1) {\n for (size_t i = 1; i < list1.size(); i++) {\n double key = list1[i];\n int j = (int) i - 1;\n while (j >= 0 && list1[j] > key) {\n list1[j + 1] = list1[j];\n j--;\n }\n list1[j + 1] = key;\n }\n}\n\nint main() {\n std::vector list1 = {83.9, 75.95, -19.63, 83.59, 27.82, 79.42, 90.08, -16.94, -5.38, 43.14, 93.18, 69.42};\n insertionSort(list1);\n for (double v : list1) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'list1', 12 elements."} {"id": 715, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& items) {\n for (size_t i = 1; i < items.size(); i++) {\n double key = items[i];\n int j = (int) i - 1;\n while (j >= 0 && items[j] > key) {\n items[j + 1] = items[j];\n j--;\n }\n items[j + 1] = key;\n }\n}\n\nint main() {\n std::vector items = {23.84, 53.58, 58.41, 36.55, 29.16, 2.36, 97.36, 93.95, 76.7, -18.02, 22.86, -14.56, 76.1, 18.74, 32.87};\n insertionSort(items);\n for (double v : items) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'items', 15 elements."} {"id": 716, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& elements) {\n for (size_t i = 1; i < elements.size(); i++) {\n double key = elements[i];\n int j = (int) i - 1;\n while (j >= 0 && elements[j] > key) {\n elements[j + 1] = elements[j];\n j--;\n }\n elements[j + 1] = key;\n }\n}\n\nint main() {\n std::vector elements = {37.66, 67.97, 74.48, 21.45, 91.75, 92.04, 36.66, 58.34, 63.24, -8.05, 25.8, 52.25, 64.72, 83.51, 84.27};\n insertionSort(elements);\n for (double v : elements) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'elements', 15 elements."} {"id": 717, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& vals) {\n for (size_t i = 1; i < vals.size(); i++) {\n double key = vals[i];\n int j = (int) i - 1;\n while (j >= 0 && vals[j] > key) {\n vals[j + 1] = vals[j];\n j--;\n }\n vals[j + 1] = key;\n }\n}\n\nint main() {\n std::vector vals = {81.96, 40.05, -4.78, 74.82, 15.86, 60.09, 45.3, 84.1, -0.0, 33.11, -6.23, 58.85, 8.67, 5.19, 69.64};\n insertionSort(vals);\n for (double v : vals) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'vals', 15 elements."} {"id": 718, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& buffer) {\n for (size_t i = 1; i < buffer.size(); i++) {\n double key = buffer[i];\n int j = (int) i - 1;\n while (j >= 0 && buffer[j] > key) {\n buffer[j + 1] = buffer[j];\n j--;\n }\n buffer[j + 1] = key;\n }\n}\n\nint main() {\n std::vector buffer = {63.29, -7.45, 98.21, -16.52, 90.55, 18.85, 25.64, 13.36, 65.58, 59.25, 93.23, 59.8, 59.19, 89.81, 55.39, 38.54, 74.67, 19.6, 6.63, 48.54};\n insertionSort(buffer);\n for (double v : buffer) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'buffer', 20 elements."} {"id": 719, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& entries) {\n for (size_t i = 1; i < entries.size(); i++) {\n double key = entries[i];\n int j = (int) i - 1;\n while (j >= 0 && entries[j] > key) {\n entries[j + 1] = entries[j];\n j--;\n }\n entries[j + 1] = key;\n }\n}\n\nint main() {\n std::vector entries = {51.48, 56.63, 24.86, 65.38, 67.58, 25.42, 56.41, 46.87, 81.88, 76.21, 6.6, -6.23, -9.57, -9.39, 68.13, 91.53, 68.61, -6.18, 23.76, 81.55};\n insertionSort(entries);\n for (double v : entries) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'entries', 20 elements."} {"id": 720, "language": "C++", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using insertion sort.", "code": "#include \n#include \n\nvoid insertionSort(std::vector& collection) {\n for (size_t i = 1; i < collection.size(); i++) {\n double key = collection[i];\n int j = (int) i - 1;\n while (j >= 0 && collection[j] > key) {\n collection[j + 1] = collection[j];\n j--;\n }\n collection[j + 1] = key;\n }\n}\n\nint main() {\n std::vector collection = {48.65, -19.8, -12.64, 43.74, 80.81, 96.6, 18.04, 23.44, 60.84, 74.79, 41.85, 51.59, 6.43, 27.04, 44.06, 34.81, -2.78, 92.2, 79.63, 39.48};\n insertionSort(collection);\n for (double v : collection) std::cout << v << \" \";\n return 0;\n}", "explanation": "Insertion sort on float data, variable named 'collection', 20 elements."} {"id": 721, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using insertion sort.", "code": "fn insertion_sort(dataset: &mut Vec) {\n for i in 1..dataset.len() {\n let key = dataset[i];\n let mut j = i as i32 - 1;\n while j >= 0 && dataset[j as usize] > key {\n dataset[(j + 1) as usize] = dataset[j as usize];\n j -= 1;\n }\n dataset[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut dataset = vec![-13, 22, -13, -42, 31];\n insertion_sort(&mut dataset);\n println!(\"{:?}\", dataset);\n}", "explanation": "Insertion sort on int data, variable named 'dataset', 5 elements."} {"id": 722, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using insertion sort.", "code": "fn insertion_sort(nums: &mut Vec) {\n for i in 1..nums.len() {\n let key = nums[i];\n let mut j = i as i32 - 1;\n while j >= 0 && nums[j as usize] > key {\n nums[(j + 1) as usize] = nums[j as usize];\n j -= 1;\n }\n nums[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut nums = vec![78, -19, 20, 96, 72];\n insertion_sort(&mut nums);\n println!(\"{:?}\", nums);\n}", "explanation": "Insertion sort on int data, variable named 'nums', 5 elements."} {"id": 723, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of ints in ascending order using insertion sort.", "code": "fn insertion_sort(buffer: &mut Vec) {\n for i in 1..buffer.len() {\n let key = buffer[i];\n let mut j = i as i32 - 1;\n while j >= 0 && buffer[j as usize] > key {\n buffer[(j + 1) as usize] = buffer[j as usize];\n j -= 1;\n }\n buffer[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut buffer = vec![5, 76, 24, 46, -35];\n insertion_sort(&mut buffer);\n println!(\"{:?}\", buffer);\n}", "explanation": "Insertion sort on int data, variable named 'buffer', 5 elements."} {"id": 724, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using insertion sort.", "code": "fn insertion_sort(vals: &mut Vec) {\n for i in 1..vals.len() {\n let key = vals[i];\n let mut j = i as i32 - 1;\n while j >= 0 && vals[j as usize] > key {\n vals[(j + 1) as usize] = vals[j as usize];\n j -= 1;\n }\n vals[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut vals = vec![35, -11, 3, 7, -37, -5, 74, 50];\n insertion_sort(&mut vals);\n println!(\"{:?}\", vals);\n}", "explanation": "Insertion sort on int data, variable named 'vals', 8 elements."} {"id": 725, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using insertion sort.", "code": "fn insertion_sort(nums: &mut Vec) {\n for i in 1..nums.len() {\n let key = nums[i];\n let mut j = i as i32 - 1;\n while j >= 0 && nums[j as usize] > key {\n nums[(j + 1) as usize] = nums[j as usize];\n j -= 1;\n }\n nums[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut nums = vec![-10, -45, 90, 50, 36, 58, 71, 39];\n insertion_sort(&mut nums);\n println!(\"{:?}\", nums);\n}", "explanation": "Insertion sort on int data, variable named 'nums', 8 elements."} {"id": 726, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of ints in ascending order using insertion sort.", "code": "fn insertion_sort(vals: &mut Vec) {\n for i in 1..vals.len() {\n let key = vals[i];\n let mut j = i as i32 - 1;\n while j >= 0 && vals[j as usize] > key {\n vals[(j + 1) as usize] = vals[j as usize];\n j -= 1;\n }\n vals[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut vals = vec![50, 50, -32, 85, 22, 22, -1, 90];\n insertion_sort(&mut vals);\n println!(\"{:?}\", vals);\n}", "explanation": "Insertion sort on int data, variable named 'vals', 8 elements."} {"id": 727, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using insertion sort.", "code": "fn insertion_sort(collection: &mut Vec) {\n for i in 1..collection.len() {\n let key = collection[i];\n let mut j = i as i32 - 1;\n while j >= 0 && collection[j as usize] > key {\n collection[(j + 1) as usize] = collection[j as usize];\n j -= 1;\n }\n collection[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut collection = vec![-26, -17, 32, 98, -37, 27, 67, -9, 97, -15];\n insertion_sort(&mut collection);\n println!(\"{:?}\", collection);\n}", "explanation": "Insertion sort on int data, variable named 'collection', 10 elements."} {"id": 728, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using insertion sort.", "code": "fn insertion_sort(dataset: &mut Vec) {\n for i in 1..dataset.len() {\n let key = dataset[i];\n let mut j = i as i32 - 1;\n while j >= 0 && dataset[j as usize] > key {\n dataset[(j + 1) as usize] = dataset[j as usize];\n j -= 1;\n }\n dataset[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut dataset = vec![73, 24, -13, 3, 5, 0, -48, 42, 97, -24];\n insertion_sort(&mut dataset);\n println!(\"{:?}\", dataset);\n}", "explanation": "Insertion sort on int data, variable named 'dataset', 10 elements."} {"id": 729, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of ints in ascending order using insertion sort.", "code": "fn insertion_sort(buffer: &mut Vec) {\n for i in 1..buffer.len() {\n let key = buffer[i];\n let mut j = i as i32 - 1;\n while j >= 0 && buffer[j as usize] > key {\n buffer[(j + 1) as usize] = buffer[j as usize];\n j -= 1;\n }\n buffer[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut buffer = vec![-13, 46, 59, -7, -36, -26, 41, 71, -5, -37];\n insertion_sort(&mut buffer);\n println!(\"{:?}\", buffer);\n}", "explanation": "Insertion sort on int data, variable named 'buffer', 10 elements."} {"id": 730, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using insertion sort.", "code": "fn insertion_sort(data: &mut Vec) {\n for i in 1..data.len() {\n let key = data[i];\n let mut j = i as i32 - 1;\n while j >= 0 && data[j as usize] > key {\n data[(j + 1) as usize] = data[j as usize];\n j -= 1;\n }\n data[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut data = vec![81, 36, 61, -12, 53, 12, -42, -20, 11, 51, 75, 27];\n insertion_sort(&mut data);\n println!(\"{:?}\", data);\n}", "explanation": "Insertion sort on int data, variable named 'data', 12 elements."} {"id": 731, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using insertion sort.", "code": "fn insertion_sort(seq: &mut Vec) {\n for i in 1..seq.len() {\n let key = seq[i];\n let mut j = i as i32 - 1;\n while j >= 0 && seq[j as usize] > key {\n seq[(j + 1) as usize] = seq[j as usize];\n j -= 1;\n }\n seq[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut seq = vec![-6, 46, -28, 68, 47, 20, 63, 44, -48, -20, -21, -29];\n insertion_sort(&mut seq);\n println!(\"{:?}\", seq);\n}", "explanation": "Insertion sort on int data, variable named 'seq', 12 elements."} {"id": 732, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of ints in ascending order using insertion sort.", "code": "fn insertion_sort(data: &mut Vec) {\n for i in 1..data.len() {\n let key = data[i];\n let mut j = i as i32 - 1;\n while j >= 0 && data[j as usize] > key {\n data[(j + 1) as usize] = data[j as usize];\n j -= 1;\n }\n data[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut data = vec![75, 80, 7, -45, 96, 96, 72, 20, -26, -4, 48, 73];\n insertion_sort(&mut data);\n println!(\"{:?}\", data);\n}", "explanation": "Insertion sort on int data, variable named 'data', 12 elements."} {"id": 733, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using insertion sort.", "code": "fn insertion_sort(buffer: &mut Vec) {\n for i in 1..buffer.len() {\n let key = buffer[i];\n let mut j = i as i32 - 1;\n while j >= 0 && buffer[j as usize] > key {\n buffer[(j + 1) as usize] = buffer[j as usize];\n j -= 1;\n }\n buffer[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut buffer = vec![61, 26, 96, -18, -25, 33, -34, 87, -3, 53, -45, 50, 92, 87, 85];\n insertion_sort(&mut buffer);\n println!(\"{:?}\", buffer);\n}", "explanation": "Insertion sort on int data, variable named 'buffer', 15 elements."} {"id": 734, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using insertion sort.", "code": "fn insertion_sort(dataset: &mut Vec) {\n for i in 1..dataset.len() {\n let key = dataset[i];\n let mut j = i as i32 - 1;\n while j >= 0 && dataset[j as usize] > key {\n dataset[(j + 1) as usize] = dataset[j as usize];\n j -= 1;\n }\n dataset[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut dataset = vec![-34, 82, 99, 87, -19, 3, -20, -4, -4, -49, 92, 64, 30, -19, -40];\n insertion_sort(&mut dataset);\n println!(\"{:?}\", dataset);\n}", "explanation": "Insertion sort on int data, variable named 'dataset', 15 elements."} {"id": 735, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of ints in ascending order using insertion sort.", "code": "fn insertion_sort(values: &mut Vec) {\n for i in 1..values.len() {\n let key = values[i];\n let mut j = i as i32 - 1;\n while j >= 0 && values[j as usize] > key {\n values[(j + 1) as usize] = values[j as usize];\n j -= 1;\n }\n values[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut values = vec![97, 2, -9, -28, 93, 15, -42, -29, -19, 79, 26, 43, 89, -7, 58];\n insertion_sort(&mut values);\n println!(\"{:?}\", values);\n}", "explanation": "Insertion sort on int data, variable named 'values', 15 elements."} {"id": 736, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using insertion sort.", "code": "fn insertion_sort(buffer: &mut Vec) {\n for i in 1..buffer.len() {\n let key = buffer[i];\n let mut j = i as i32 - 1;\n while j >= 0 && buffer[j as usize] > key {\n buffer[(j + 1) as usize] = buffer[j as usize];\n j -= 1;\n }\n buffer[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut buffer = vec![-50, 13, 26, -39, 82, 25, 86, 63, -15, 97, 75, 30, 83, 40, 87, 80, 3, -25, -39, 10];\n insertion_sort(&mut buffer);\n println!(\"{:?}\", buffer);\n}", "explanation": "Insertion sort on int data, variable named 'buffer', 20 elements."} {"id": 737, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using insertion sort.", "code": "fn insertion_sort(arr: &mut Vec) {\n for i in 1..arr.len() {\n let key = arr[i];\n let mut j = i as i32 - 1;\n while j >= 0 && arr[j as usize] > key {\n arr[(j + 1) as usize] = arr[j as usize];\n j -= 1;\n }\n arr[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut arr = vec![-2, -14, 26, 5, -16, 91, 5, 41, 21, -18, 58, -31, 90, 15, 16, 47, -9, 52, 66, -29];\n insertion_sort(&mut arr);\n println!(\"{:?}\", arr);\n}", "explanation": "Insertion sort on int data, variable named 'arr', 20 elements."} {"id": 738, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of ints in ascending order using insertion sort.", "code": "fn insertion_sort(nums: &mut Vec) {\n for i in 1..nums.len() {\n let key = nums[i];\n let mut j = i as i32 - 1;\n while j >= 0 && nums[j as usize] > key {\n nums[(j + 1) as usize] = nums[j as usize];\n j -= 1;\n }\n nums[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut nums = vec![58, -14, 87, 2, -32, 18, -1, 45, 94, 80, -9, 57, -11, 30, 61, 47, -44, 13, -31, 19];\n insertion_sort(&mut nums);\n println!(\"{:?}\", nums);\n}", "explanation": "Insertion sort on int data, variable named 'nums', 20 elements."} {"id": 739, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using insertion sort.", "code": "fn insertion_sort(data: &mut Vec) {\n for i in 1..data.len() {\n let key = data[i];\n let mut j = i as i32 - 1;\n while j >= 0 && data[j as usize] > key {\n data[(j + 1) as usize] = data[j as usize];\n j -= 1;\n }\n data[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut data = vec![43.24, 61.39, 28.41, 19.19, -9.41];\n insertion_sort(&mut data);\n println!(\"{:?}\", data);\n}", "explanation": "Insertion sort on float data, variable named 'data', 5 elements."} {"id": 740, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using insertion sort.", "code": "fn insertion_sort(entries: &mut Vec) {\n for i in 1..entries.len() {\n let key = entries[i];\n let mut j = i as i32 - 1;\n while j >= 0 && entries[j as usize] > key {\n entries[(j + 1) as usize] = entries[j as usize];\n j -= 1;\n }\n entries[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut entries = vec![19.69, 12.52, 83.39, 6.87, -18.83];\n insertion_sort(&mut entries);\n println!(\"{:?}\", entries);\n}", "explanation": "Insertion sort on float data, variable named 'entries', 5 elements."} {"id": 741, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 5-element array of floats in ascending order using insertion sort.", "code": "fn insertion_sort(collection: &mut Vec) {\n for i in 1..collection.len() {\n let key = collection[i];\n let mut j = i as i32 - 1;\n while j >= 0 && collection[j as usize] > key {\n collection[(j + 1) as usize] = collection[j as usize];\n j -= 1;\n }\n collection[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut collection = vec![96.56, 6.44, 93.26, 73.15, -5.3];\n insertion_sort(&mut collection);\n println!(\"{:?}\", collection);\n}", "explanation": "Insertion sort on float data, variable named 'collection', 5 elements."} {"id": 742, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using insertion sort.", "code": "fn insertion_sort(input_arr: &mut Vec) {\n for i in 1..input_arr.len() {\n let key = input_arr[i];\n let mut j = i as i32 - 1;\n while j >= 0 && input_arr[j as usize] > key {\n input_arr[(j + 1) as usize] = input_arr[j as usize];\n j -= 1;\n }\n input_arr[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut input_arr = vec![66.67, 16.48, 77.74, 38.26, 42.95, 63.35, 82.98, 45.63];\n insertion_sort(&mut input_arr);\n println!(\"{:?}\", input_arr);\n}", "explanation": "Insertion sort on float data, variable named 'input_arr', 8 elements."} {"id": 743, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using insertion sort.", "code": "fn insertion_sort(elements: &mut Vec) {\n for i in 1..elements.len() {\n let key = elements[i];\n let mut j = i as i32 - 1;\n while j >= 0 && elements[j as usize] > key {\n elements[(j + 1) as usize] = elements[j as usize];\n j -= 1;\n }\n elements[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut elements = vec![-8.21, -14.29, 17.84, 69.47, 1.5, 75.92, 60.66, 73.86];\n insertion_sort(&mut elements);\n println!(\"{:?}\", elements);\n}", "explanation": "Insertion sort on float data, variable named 'elements', 8 elements."} {"id": 744, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 8-element array of floats in ascending order using insertion sort.", "code": "fn insertion_sort(input_arr: &mut Vec) {\n for i in 1..input_arr.len() {\n let key = input_arr[i];\n let mut j = i as i32 - 1;\n while j >= 0 && input_arr[j as usize] > key {\n input_arr[(j + 1) as usize] = input_arr[j as usize];\n j -= 1;\n }\n input_arr[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut input_arr = vec![50.76, 81.11, 36.75, -4.82, -18.87, 41.11, -1.5, -4.96];\n insertion_sort(&mut input_arr);\n println!(\"{:?}\", input_arr);\n}", "explanation": "Insertion sort on float data, variable named 'input_arr', 8 elements."} {"id": 745, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using insertion sort.", "code": "fn insertion_sort(collection: &mut Vec) {\n for i in 1..collection.len() {\n let key = collection[i];\n let mut j = i as i32 - 1;\n while j >= 0 && collection[j as usize] > key {\n collection[(j + 1) as usize] = collection[j as usize];\n j -= 1;\n }\n collection[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut collection = vec![47.54, 11.82, 89.29, 56.06, 24.05, 72.53, 60.71, 29.77, 34.48, 32.24];\n insertion_sort(&mut collection);\n println!(\"{:?}\", collection);\n}", "explanation": "Insertion sort on float data, variable named 'collection', 10 elements."} {"id": 746, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using insertion sort.", "code": "fn insertion_sort(list1: &mut Vec) {\n for i in 1..list1.len() {\n let key = list1[i];\n let mut j = i as i32 - 1;\n while j >= 0 && list1[j as usize] > key {\n list1[(j + 1) as usize] = list1[j as usize];\n j -= 1;\n }\n list1[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut list1 = vec![75.02, 39.77, 12.82, 30.9, 92.06, 84.89, 76.87, 16.32, 82.09, 92.75];\n insertion_sort(&mut list1);\n println!(\"{:?}\", list1);\n}", "explanation": "Insertion sort on float data, variable named 'list1', 10 elements."} {"id": 747, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 10-element array of floats in ascending order using insertion sort.", "code": "fn insertion_sort(collection: &mut Vec) {\n for i in 1..collection.len() {\n let key = collection[i];\n let mut j = i as i32 - 1;\n while j >= 0 && collection[j as usize] > key {\n collection[(j + 1) as usize] = collection[j as usize];\n j -= 1;\n }\n collection[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut collection = vec![71.7, 80.58, 55.53, -10.87, 8.56, -8.86, 48.46, -9.93, 14.02, 90.62];\n insertion_sort(&mut collection);\n println!(\"{:?}\", collection);\n}", "explanation": "Insertion sort on float data, variable named 'collection', 10 elements."} {"id": 748, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using insertion sort.", "code": "fn insertion_sort(vals: &mut Vec) {\n for i in 1..vals.len() {\n let key = vals[i];\n let mut j = i as i32 - 1;\n while j >= 0 && vals[j as usize] > key {\n vals[(j + 1) as usize] = vals[j as usize];\n j -= 1;\n }\n vals[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut vals = vec![84.05, 94.5, 30.45, 40.53, 66.96, 37.08, 41.29, 98.76, 85.68, 63.05, 28.25, 53.34];\n insertion_sort(&mut vals);\n println!(\"{:?}\", vals);\n}", "explanation": "Insertion sort on float data, variable named 'vals', 12 elements."} {"id": 749, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using insertion sort.", "code": "fn insertion_sort(entries: &mut Vec) {\n for i in 1..entries.len() {\n let key = entries[i];\n let mut j = i as i32 - 1;\n while j >= 0 && entries[j as usize] > key {\n entries[(j + 1) as usize] = entries[j as usize];\n j -= 1;\n }\n entries[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut entries = vec![78.94, -19.13, 30.57, 43.58, 21.06, 98.31, 58.68, 89.53, 98.9, 92.45, 61.41, -14.96];\n insertion_sort(&mut entries);\n println!(\"{:?}\", entries);\n}", "explanation": "Insertion sort on float data, variable named 'entries', 12 elements."} {"id": 750, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 12-element array of floats in ascending order using insertion sort.", "code": "fn insertion_sort(dataset: &mut Vec) {\n for i in 1..dataset.len() {\n let key = dataset[i];\n let mut j = i as i32 - 1;\n while j >= 0 && dataset[j as usize] > key {\n dataset[(j + 1) as usize] = dataset[j as usize];\n j -= 1;\n }\n dataset[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut dataset = vec![94.79, 60.27, 84.95, 42.3, 6.78, -11.06, 79.89, 41.13, 93.35, 30.3, 25.11, 24.42];\n insertion_sort(&mut dataset);\n println!(\"{:?}\", dataset);\n}", "explanation": "Insertion sort on float data, variable named 'dataset', 12 elements."} {"id": 751, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using insertion sort.", "code": "fn insertion_sort(data: &mut Vec) {\n for i in 1..data.len() {\n let key = data[i];\n let mut j = i as i32 - 1;\n while j >= 0 && data[j as usize] > key {\n data[(j + 1) as usize] = data[j as usize];\n j -= 1;\n }\n data[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut data = vec![20.22, 60.81, 78.98, 81.24, 82.08, 14.52, 37.49, 11.51, -19.73, 55.11, 26.84, 89.84, 90.56, 94.14, 41.35];\n insertion_sort(&mut data);\n println!(\"{:?}\", data);\n}", "explanation": "Insertion sort on float data, variable named 'data', 15 elements."} {"id": 752, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using insertion sort.", "code": "fn insertion_sort(entries: &mut Vec) {\n for i in 1..entries.len() {\n let key = entries[i];\n let mut j = i as i32 - 1;\n while j >= 0 && entries[j as usize] > key {\n entries[(j + 1) as usize] = entries[j as usize];\n j -= 1;\n }\n entries[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut entries = vec![-15.78, 35.1, 53.51, 38.1, 22.33, 53.25, 19.1, 22.11, -19.39, 85.93, 2.15, 22.19, -7.94, 38.55, -9.92];\n insertion_sort(&mut entries);\n println!(\"{:?}\", entries);\n}", "explanation": "Insertion sort on float data, variable named 'entries', 15 elements."} {"id": 753, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 15-element array of floats in ascending order using insertion sort.", "code": "fn insertion_sort(input_arr: &mut Vec) {\n for i in 1..input_arr.len() {\n let key = input_arr[i];\n let mut j = i as i32 - 1;\n while j >= 0 && input_arr[j as usize] > key {\n input_arr[(j + 1) as usize] = input_arr[j as usize];\n j -= 1;\n }\n input_arr[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut input_arr = vec![86.92, 28.88, 88.66, -19.18, 71.56, 9.77, 36.01, 24.54, 23.37, 86.17, 43.83, 12.07, 97.73, 58.1, 32.28];\n insertion_sort(&mut input_arr);\n println!(\"{:?}\", input_arr);\n}", "explanation": "Insertion sort on float data, variable named 'input_arr', 15 elements."} {"id": 754, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using insertion sort.", "code": "fn insertion_sort(values: &mut Vec) {\n for i in 1..values.len() {\n let key = values[i];\n let mut j = i as i32 - 1;\n while j >= 0 && values[j as usize] > key {\n values[(j + 1) as usize] = values[j as usize];\n j -= 1;\n }\n values[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut values = vec![22.09, 31.64, 22.75, 83.59, 3.62, 2.56, -15.21, 26.95, 68.53, 87.22, -0.92, 3.68, 37.04, 59.16, 11.63, 30.11, 45.46, 75.18, 65.0, 18.66];\n insertion_sort(&mut values);\n println!(\"{:?}\", values);\n}", "explanation": "Insertion sort on float data, variable named 'values', 20 elements."} {"id": 755, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using insertion sort.", "code": "fn insertion_sort(vals: &mut Vec) {\n for i in 1..vals.len() {\n let key = vals[i];\n let mut j = i as i32 - 1;\n while j >= 0 && vals[j as usize] > key {\n vals[(j + 1) as usize] = vals[j as usize];\n j -= 1;\n }\n vals[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut vals = vec![72.86, 27.59, 66.39, 68.29, 78.25, -4.36, 93.96, 74.33, -4.99, 20.95, -18.38, 61.45, -13.81, 78.75, 31.13, 51.05, -19.04, 37.14, 13.58, -10.17];\n insertion_sort(&mut vals);\n println!(\"{:?}\", vals);\n}", "explanation": "Insertion sort on float data, variable named 'vals', 20 elements."} {"id": 756, "language": "Rust", "category": "Sorting Algorithm", "difficulty": "intermediate", "task_description": "Sort a 20-element array of floats in ascending order using insertion sort.", "code": "fn insertion_sort(collection: &mut Vec) {\n for i in 1..collection.len() {\n let key = collection[i];\n let mut j = i as i32 - 1;\n while j >= 0 && collection[j as usize] > key {\n collection[(j + 1) as usize] = collection[j as usize];\n j -= 1;\n }\n collection[(j + 1) as usize] = key;\n }\n}\n\nfn main() {\n let mut collection = vec![9.48, -1.85, 40.84, 9.69, 71.24, 82.84, 98.32, 9.44, 77.65, 3.61, 64.07, 76.38, 63.44, 39.78, 1.56, 98.11, 50.35, 55.5, 7.3, -4.26];\n insertion_sort(&mut collection);\n println!(\"{:?}\", collection);\n}", "explanation": "Insertion sort on float data, variable named 'collection', 20 elements."} {"id": 757, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "class QStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = QStack()\ns.push(36)\ns.push(25)\ns.push(19)\nprint(s.pop())", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 758, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "class QStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = QStack()\ns.push(79)\ns.push(26)\ns.push(12)\nprint(s.pop())", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 759, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "class Box_Stack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = Box_Stack()\ns.push(53)\ns.push(68)\ns.push(40)\nprint(s.pop())", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 760, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "class CollStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = CollStack()\ns.push(30)\ns.push(29)\ns.push(44)\nprint(s.pop())", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 761, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "class Box_Stack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = Box_Stack()\ns.push(8)\ns.push(66)\nprint(s.pop())\ns.push(83)\nprint(s.pop())", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 762, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "class BufStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = BufStack()\ns.push(15)\ns.push(35)\nprint(s.pop())\ns.push(36)\nprint(s.pop())", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 763, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "class CollStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = CollStack()\ns.push(54)\ns.push(32)\nprint(s.pop())\ns.push(7)\nprint(s.pop())", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 764, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "class QStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = QStack()\ns.push(1)\ns.push(7)\nprint(s.pop())\ns.push(96)\nprint(s.pop())", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 765, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "class SStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = SStack()\ns.push(37)\ns.push(61)\ns.push(36)\ns.push(78)\nprint(s.pop())\nprint(s.pop())", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 766, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "class SStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = SStack()\ns.push(33)\ns.push(63)\ns.push(47)\ns.push(43)\nprint(s.pop())\nprint(s.pop())", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 767, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "class QStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = QStack()\ns.push(86)\ns.push(2)\ns.push(88)\ns.push(71)\nprint(s.pop())\nprint(s.pop())", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 768, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "class BufStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = BufStack()\ns.push(47)\ns.push(95)\ns.push(47)\ns.push(96)\nprint(s.pop())\nprint(s.pop())", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 769, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "class ContainerStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = ContainerStack()\ns.push(78)\nprint(s.pop())\ns.push(31)\ns.push(84)", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 770, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "class BufStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = BufStack()\ns.push(27)\nprint(s.pop())\ns.push(50)\ns.push(12)", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 771, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "class QStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = QStack()\ns.push(17)\nprint(s.pop())\ns.push(96)\ns.push(78)", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 772, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "class QStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = QStack()\ns.push(6)\nprint(s.pop())\ns.push(84)\ns.push(25)", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 773, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "class SStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = SStack()\ns.push(70.76)\ns.push(92.62)\ns.push(8.41)\nprint(s.pop())", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 774, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "class BufStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = BufStack()\ns.push(30.85)\ns.push(47.95)\ns.push(76.34)\nprint(s.pop())", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 775, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "class SStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = SStack()\ns.push(5.34)\ns.push(19.98)\ns.push(55.5)\nprint(s.pop())", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 776, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "class ContainerStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = ContainerStack()\ns.push(97.54)\ns.push(89.6)\ns.push(45.4)\nprint(s.pop())", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 777, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "class Box_Stack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = Box_Stack()\ns.push(7.7)\ns.push(42.48)\nprint(s.pop())\ns.push(50.88)\nprint(s.pop())", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 778, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "class ContainerStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = ContainerStack()\ns.push(28.14)\ns.push(96.78)\nprint(s.pop())\ns.push(95.62)\nprint(s.pop())", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 779, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "class CollStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = CollStack()\ns.push(19.83)\ns.push(81.64)\nprint(s.pop())\ns.push(53.71)\nprint(s.pop())", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 780, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "class QStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = QStack()\ns.push(17.39)\ns.push(75.32)\nprint(s.pop())\ns.push(78.16)\nprint(s.pop())", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 781, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "class BufStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = BufStack()\ns.push(21.49)\ns.push(1.36)\ns.push(57.62)\ns.push(59.62)\nprint(s.pop())\nprint(s.pop())", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 782, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "class ContainerStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = ContainerStack()\ns.push(46.09)\ns.push(71.07)\ns.push(52.98)\ns.push(31.04)\nprint(s.pop())\nprint(s.pop())", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 783, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "class ContainerStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = ContainerStack()\ns.push(12.79)\ns.push(23.17)\ns.push(53.82)\ns.push(29.89)\nprint(s.pop())\nprint(s.pop())", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 784, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "class BufStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = BufStack()\ns.push(92.8)\ns.push(27.77)\ns.push(79.27)\ns.push(64.6)\nprint(s.pop())\nprint(s.pop())", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 785, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "class ContainerStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = ContainerStack()\ns.push(12.5)\nprint(s.pop())\ns.push(63.64)\ns.push(97.25)", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 786, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "class BufStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = BufStack()\ns.push(9.24)\nprint(s.pop())\ns.push(55.38)\ns.push(72.49)", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 787, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "class Box_Stack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = Box_Stack()\ns.push(89.94)\nprint(s.pop())\ns.push(98.54)\ns.push(62.97)", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 788, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "class QStack:\n def __init__(self):\n self._items = []\n\n def push(self, item):\n self._items.append(item)\n\n def pop(self):\n return self._items.pop()\n\n def peek(self):\n return self._items[-1]\n\ns = QStack()\ns.push(82.57)\nprint(s.pop())\ns.push(96.56)\ns.push(18.5)", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 789, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "class QStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new QStack();\ns.push(69);\ns.push(85);\ns.push(100);\nconsole.log(s.pop());", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 790, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "class ContainerStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new ContainerStack();\ns.push(14);\ns.push(93);\ns.push(96);\nconsole.log(s.pop());", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 791, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "class Box_Stack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new Box_Stack();\ns.push(84);\ns.push(33);\ns.push(81);\nconsole.log(s.pop());", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 792, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "class ContainerStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new ContainerStack();\ns.push(71);\ns.push(27);\ns.push(57);\nconsole.log(s.pop());", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 793, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "class BufStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new BufStack();\ns.push(35);\ns.push(27);\nconsole.log(s.pop());\ns.push(81);\nconsole.log(s.pop());", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 794, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "class Box_Stack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new Box_Stack();\ns.push(20);\ns.push(58);\nconsole.log(s.pop());\ns.push(94);\nconsole.log(s.pop());", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 795, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "class Box_Stack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new Box_Stack();\ns.push(48);\ns.push(19);\nconsole.log(s.pop());\ns.push(12);\nconsole.log(s.pop());", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 796, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "class SStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new SStack();\ns.push(59);\ns.push(24);\nconsole.log(s.pop());\ns.push(25);\nconsole.log(s.pop());", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 797, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "class Box_Stack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new Box_Stack();\ns.push(94);\ns.push(24);\ns.push(83);\ns.push(37);\nconsole.log(s.pop());\nconsole.log(s.pop());", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 798, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "class SStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new SStack();\ns.push(23);\ns.push(51);\ns.push(88);\ns.push(78);\nconsole.log(s.pop());\nconsole.log(s.pop());", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 799, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "class SStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new SStack();\ns.push(10);\ns.push(55);\ns.push(32);\ns.push(59);\nconsole.log(s.pop());\nconsole.log(s.pop());", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 800, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "class QStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new QStack();\ns.push(93);\ns.push(68);\ns.push(18);\ns.push(94);\nconsole.log(s.pop());\nconsole.log(s.pop());", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 801, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "class ContainerStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new ContainerStack();\ns.push(13);\nconsole.log(s.pop());\ns.push(50);\ns.push(3);", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 802, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "class QStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new QStack();\ns.push(2);\nconsole.log(s.pop());\ns.push(83);\ns.push(6);", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 803, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "class SStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new SStack();\ns.push(32);\nconsole.log(s.pop());\ns.push(11);\ns.push(35);", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 804, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "class SStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new SStack();\ns.push(81);\nconsole.log(s.pop());\ns.push(2);\ns.push(2);", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 805, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "class QStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new QStack();\ns.push(54.69);\ns.push(82.01);\ns.push(85.42);\nconsole.log(s.pop());", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 806, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "class SStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new SStack();\ns.push(48.56);\ns.push(56.72);\ns.push(44.99);\nconsole.log(s.pop());", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 807, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "class BufStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new BufStack();\ns.push(48.41);\ns.push(25.14);\ns.push(54.81);\nconsole.log(s.pop());", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 808, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "class ContainerStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new ContainerStack();\ns.push(13.18);\ns.push(82.67);\ns.push(11.18);\nconsole.log(s.pop());", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 809, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "class ContainerStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new ContainerStack();\ns.push(88.76);\ns.push(42.11);\nconsole.log(s.pop());\ns.push(23.21);\nconsole.log(s.pop());", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 810, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "class Box_Stack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new Box_Stack();\ns.push(15.59);\ns.push(65.88);\nconsole.log(s.pop());\ns.push(88.02);\nconsole.log(s.pop());", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 811, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "class CollStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new CollStack();\ns.push(82.46);\ns.push(12.13);\nconsole.log(s.pop());\ns.push(11.9);\nconsole.log(s.pop());", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 812, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "class BufStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new BufStack();\ns.push(36.37);\ns.push(61.95);\nconsole.log(s.pop());\ns.push(92.41);\nconsole.log(s.pop());", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 813, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "class QStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new QStack();\ns.push(60.85);\ns.push(18.63);\ns.push(53.52);\ns.push(60.36);\nconsole.log(s.pop());\nconsole.log(s.pop());", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 814, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "class CollStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new CollStack();\ns.push(69.03);\ns.push(62.85);\ns.push(29.41);\ns.push(87.66);\nconsole.log(s.pop());\nconsole.log(s.pop());", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 815, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "class BufStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new BufStack();\ns.push(93.36);\ns.push(81.26);\ns.push(71.42);\ns.push(8.56);\nconsole.log(s.pop());\nconsole.log(s.pop());", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 816, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "class SStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new SStack();\ns.push(78.0);\ns.push(15.51);\ns.push(15.63);\ns.push(45.22);\nconsole.log(s.pop());\nconsole.log(s.pop());", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 817, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "class QStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new QStack();\ns.push(12.2);\nconsole.log(s.pop());\ns.push(72.94);\ns.push(15.32);", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 818, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "class BufStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new BufStack();\ns.push(99.48);\nconsole.log(s.pop());\ns.push(39.12);\ns.push(32.61);", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 819, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "class Box_Stack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new Box_Stack();\ns.push(48.65);\nconsole.log(s.pop());\ns.push(60.57);\ns.push(64.02);", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 820, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "class SStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nconst s = new SStack();\ns.push(80.41);\nconsole.log(s.pop());\ns.push(25.34);\ns.push(42.45);", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 821, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "class Box_Stack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { Box_Stack };\nconst s = new Box_Stack();\ns.push(69);\ns.push(69);\ns.push(64);\nconsole.log(s.pop());", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 822, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "class ContainerStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { ContainerStack };\nconst s = new ContainerStack();\ns.push(30);\ns.push(50);\ns.push(11);\nconsole.log(s.pop());", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 823, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "class CollStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { CollStack };\nconst s = new CollStack();\ns.push(54);\ns.push(68);\ns.push(74);\nconsole.log(s.pop());", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 824, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "class CollStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { CollStack };\nconst s = new CollStack();\ns.push(96);\ns.push(29);\ns.push(90);\nconsole.log(s.pop());", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 825, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "class SStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { SStack };\nconst s = new SStack();\ns.push(47);\ns.push(1);\nconsole.log(s.pop());\ns.push(3);\nconsole.log(s.pop());", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 826, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "class ContainerStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { ContainerStack };\nconst s = new ContainerStack();\ns.push(61);\ns.push(18);\nconsole.log(s.pop());\ns.push(8);\nconsole.log(s.pop());", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 827, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "class BufStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { BufStack };\nconst s = new BufStack();\ns.push(100);\ns.push(18);\nconsole.log(s.pop());\ns.push(59);\nconsole.log(s.pop());", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 828, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "class ContainerStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { ContainerStack };\nconst s = new ContainerStack();\ns.push(54);\ns.push(32);\nconsole.log(s.pop());\ns.push(29);\nconsole.log(s.pop());", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 829, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "class CollStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { CollStack };\nconst s = new CollStack();\ns.push(18);\ns.push(16);\ns.push(90);\ns.push(91);\nconsole.log(s.pop());\nconsole.log(s.pop());", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 830, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "class CollStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { CollStack };\nconst s = new CollStack();\ns.push(4);\ns.push(90);\ns.push(55);\ns.push(48);\nconsole.log(s.pop());\nconsole.log(s.pop());", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 831, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "class QStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { QStack };\nconst s = new QStack();\ns.push(85);\ns.push(75);\ns.push(10);\ns.push(62);\nconsole.log(s.pop());\nconsole.log(s.pop());", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 832, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "class QStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { QStack };\nconst s = new QStack();\ns.push(19);\ns.push(47);\ns.push(19);\ns.push(11);\nconsole.log(s.pop());\nconsole.log(s.pop());", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 833, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "class QStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { QStack };\nconst s = new QStack();\ns.push(73);\nconsole.log(s.pop());\ns.push(20);\ns.push(98);", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 834, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "class SStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { SStack };\nconst s = new SStack();\ns.push(61);\nconsole.log(s.pop());\ns.push(18);\ns.push(96);", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 835, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "class ContainerStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { ContainerStack };\nconst s = new ContainerStack();\ns.push(90);\nconsole.log(s.pop());\ns.push(61);\ns.push(53);", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 836, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "class CollStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { CollStack };\nconst s = new CollStack();\ns.push(44);\nconsole.log(s.pop());\ns.push(83);\ns.push(89);", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 837, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "class QStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { QStack };\nconst s = new QStack();\ns.push(29.39);\ns.push(16.43);\ns.push(88.23);\nconsole.log(s.pop());", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 838, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "class SStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { SStack };\nconst s = new SStack();\ns.push(50.83);\ns.push(2.08);\ns.push(83.44);\nconsole.log(s.pop());", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 839, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "class Box_Stack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { Box_Stack };\nconst s = new Box_Stack();\ns.push(55.86);\ns.push(83.12);\ns.push(92.0);\nconsole.log(s.pop());", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 840, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "class CollStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { CollStack };\nconst s = new CollStack();\ns.push(23.5);\ns.push(93.21);\ns.push(27.91);\nconsole.log(s.pop());", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 841, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "class Box_Stack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { Box_Stack };\nconst s = new Box_Stack();\ns.push(97.81);\ns.push(13.39);\nconsole.log(s.pop());\ns.push(62.29);\nconsole.log(s.pop());", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 842, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "class SStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { SStack };\nconst s = new SStack();\ns.push(82.43);\ns.push(97.62);\nconsole.log(s.pop());\ns.push(8.64);\nconsole.log(s.pop());", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 843, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "class Box_Stack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { Box_Stack };\nconst s = new Box_Stack();\ns.push(32.01);\ns.push(64.55);\nconsole.log(s.pop());\ns.push(17.32);\nconsole.log(s.pop());", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 844, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "class CollStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { CollStack };\nconst s = new CollStack();\ns.push(43.0);\ns.push(27.72);\nconsole.log(s.pop());\ns.push(36.91);\nconsole.log(s.pop());", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 845, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "class BufStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { BufStack };\nconst s = new BufStack();\ns.push(3.78);\ns.push(28.94);\ns.push(54.62);\ns.push(7.47);\nconsole.log(s.pop());\nconsole.log(s.pop());", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 846, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "class BufStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { BufStack };\nconst s = new BufStack();\ns.push(19.59);\ns.push(20.97);\ns.push(92.99);\ns.push(24.79);\nconsole.log(s.pop());\nconsole.log(s.pop());", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 847, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "class QStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { QStack };\nconst s = new QStack();\ns.push(56.81);\ns.push(79.23);\ns.push(5.52);\ns.push(32.14);\nconsole.log(s.pop());\nconsole.log(s.pop());", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 848, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "class BufStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { BufStack };\nconst s = new BufStack();\ns.push(75.42);\ns.push(95.92);\ns.push(50.52);\ns.push(32.13);\nconsole.log(s.pop());\nconsole.log(s.pop());", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 849, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "class SStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { SStack };\nconst s = new SStack();\ns.push(70.56);\nconsole.log(s.pop());\ns.push(41.32);\ns.push(74.4);", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 850, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "class QStack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { QStack };\nconst s = new QStack();\ns.push(50.72);\nconsole.log(s.pop());\ns.push(3.34);\ns.push(79.81);", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 851, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "class Box_Stack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { Box_Stack };\nconst s = new Box_Stack();\ns.push(59.05);\nconsole.log(s.pop());\ns.push(29.72);\ns.push(16.0);", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 852, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "class Box_Stack {\n #items = [];\n push(item) { this.#items.push(item); }\n pop() { return this.#items.pop(); }\n peek() { return this.#items[this.#items.length - 1]; }\n}\n\nmodule.exports = { Box_Stack };\nconst s = new Box_Stack();\ns.push(8.8);\nconsole.log(s.pop());\ns.push(95.33);\ns.push(23.93);", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 853, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque s = new ArrayDeque<>();\n s.push(88);\n s.push(84);\n s.push(19);\n System.out.println(s.pop());\n }\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 854, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque coll = new ArrayDeque<>();\n coll.push(21);\n coll.push(65);\n coll.push(67);\n System.out.println(coll.pop());\n }\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 855, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque container = new ArrayDeque<>();\n container.push(84);\n container.push(67);\n container.push(99);\n System.out.println(container.pop());\n }\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 856, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque box_ = new ArrayDeque<>();\n box_.push(17);\n box_.push(44);\n box_.push(38);\n System.out.println(box_.pop());\n }\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 857, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque container = new ArrayDeque<>();\n container.push(56);\n container.push(6);\n System.out.println(container.pop());\n container.push(100);\n System.out.println(container.pop());\n }\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 858, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque box_ = new ArrayDeque<>();\n box_.push(31);\n box_.push(27);\n System.out.println(box_.pop());\n box_.push(78);\n System.out.println(box_.pop());\n }\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 859, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque s = new ArrayDeque<>();\n s.push(73);\n s.push(81);\n System.out.println(s.pop());\n s.push(13);\n System.out.println(s.pop());\n }\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 860, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque s = new ArrayDeque<>();\n s.push(99);\n s.push(40);\n System.out.println(s.pop());\n s.push(12);\n System.out.println(s.pop());\n }\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 861, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque q = new ArrayDeque<>();\n q.push(59);\n q.push(41);\n q.push(22);\n q.push(38);\n System.out.println(q.pop());\n System.out.println(q.pop());\n }\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 862, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque buf = new ArrayDeque<>();\n buf.push(74);\n buf.push(47);\n buf.push(46);\n buf.push(12);\n System.out.println(buf.pop());\n System.out.println(buf.pop());\n }\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 863, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque coll = new ArrayDeque<>();\n coll.push(99);\n coll.push(59);\n coll.push(34);\n coll.push(61);\n System.out.println(coll.pop());\n System.out.println(coll.pop());\n }\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 864, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque box_ = new ArrayDeque<>();\n box_.push(84);\n box_.push(18);\n box_.push(16);\n box_.push(73);\n System.out.println(box_.pop());\n System.out.println(box_.pop());\n }\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 865, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque buf = new ArrayDeque<>();\n buf.push(37);\n System.out.println(buf.pop());\n buf.push(53);\n buf.push(80);\n }\n}", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 866, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque coll = new ArrayDeque<>();\n coll.push(17);\n System.out.println(coll.pop());\n coll.push(47);\n coll.push(66);\n }\n}", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 867, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque container = new ArrayDeque<>();\n container.push(41);\n System.out.println(container.pop());\n container.push(11);\n container.push(88);\n }\n}", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 868, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque box_ = new ArrayDeque<>();\n box_.push(65);\n System.out.println(box_.pop());\n box_.push(34);\n box_.push(88);\n }\n}", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 869, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque q = new ArrayDeque<>();\n q.push(62.44);\n q.push(64.74);\n q.push(74.36);\n System.out.println(q.pop());\n }\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 870, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque container = new ArrayDeque<>();\n container.push(1.79);\n container.push(85.45);\n container.push(29.78);\n System.out.println(container.pop());\n }\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 871, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque box_ = new ArrayDeque<>();\n box_.push(85.53);\n box_.push(23.08);\n box_.push(87.54);\n System.out.println(box_.pop());\n }\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 872, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque buf = new ArrayDeque<>();\n buf.push(47.12);\n buf.push(64.61);\n buf.push(90.11);\n System.out.println(buf.pop());\n }\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 873, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque q = new ArrayDeque<>();\n q.push(18.85);\n q.push(11.73);\n System.out.println(q.pop());\n q.push(40.3);\n System.out.println(q.pop());\n }\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 874, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque box_ = new ArrayDeque<>();\n box_.push(33.54);\n box_.push(32.41);\n System.out.println(box_.pop());\n box_.push(49.14);\n System.out.println(box_.pop());\n }\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 875, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque box_ = new ArrayDeque<>();\n box_.push(12.32);\n box_.push(46.0);\n System.out.println(box_.pop());\n box_.push(94.9);\n System.out.println(box_.pop());\n }\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 876, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque s = new ArrayDeque<>();\n s.push(32.7);\n s.push(4.1);\n System.out.println(s.pop());\n s.push(38.65);\n System.out.println(s.pop());\n }\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 877, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque buf = new ArrayDeque<>();\n buf.push(79.17);\n buf.push(97.88);\n buf.push(22.13);\n buf.push(21.94);\n System.out.println(buf.pop());\n System.out.println(buf.pop());\n }\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 878, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque box_ = new ArrayDeque<>();\n box_.push(27.71);\n box_.push(63.93);\n box_.push(9.28);\n box_.push(7.86);\n System.out.println(box_.pop());\n System.out.println(box_.pop());\n }\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 879, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque coll = new ArrayDeque<>();\n coll.push(45.69);\n coll.push(42.55);\n coll.push(22.2);\n coll.push(89.41);\n System.out.println(coll.pop());\n System.out.println(coll.pop());\n }\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 880, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque box_ = new ArrayDeque<>();\n box_.push(34.86);\n box_.push(75.56);\n box_.push(17.29);\n box_.push(35.58);\n System.out.println(box_.pop());\n System.out.println(box_.pop());\n }\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 881, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque coll = new ArrayDeque<>();\n coll.push(78.6);\n System.out.println(coll.pop());\n coll.push(44.24);\n coll.push(91.35);\n }\n}", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 882, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque container = new ArrayDeque<>();\n container.push(39.52);\n System.out.println(container.pop());\n container.push(78.52);\n container.push(60.12);\n }\n}", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 883, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque q = new ArrayDeque<>();\n q.push(72.55);\n System.out.println(q.pop());\n q.push(15.32);\n q.push(66.74);\n }\n}", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 884, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Deque coll = new ArrayDeque<>();\n coll.push(74.54);\n System.out.println(coll.pop());\n coll.push(32.34);\n coll.push(15.9);\n }\n}", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 885, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, int value) { s->items[++s->top] = value; }\nint pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack box_ = { .top = -1 };\n push(&box_, 19);\n push(&box_, 64);\n push(&box_, 41);\n printf(\"%g\\n\", (double)pop(&box_));\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 886, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, int value) { s->items[++s->top] = value; }\nint pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack coll = { .top = -1 };\n push(&coll, 53);\n push(&coll, 34);\n push(&coll, 67);\n printf(\"%g\\n\", (double)pop(&coll));\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 887, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, int value) { s->items[++s->top] = value; }\nint pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack q = { .top = -1 };\n push(&q, 58);\n push(&q, 17);\n push(&q, 82);\n printf(\"%g\\n\", (double)pop(&q));\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 888, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, int value) { s->items[++s->top] = value; }\nint pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack coll = { .top = -1 };\n push(&coll, 75);\n push(&coll, 13);\n push(&coll, 5);\n printf(\"%g\\n\", (double)pop(&coll));\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 889, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, int value) { s->items[++s->top] = value; }\nint pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack coll = { .top = -1 };\n push(&coll, 25);\n push(&coll, 54);\n printf(\"%g\\n\", (double)pop(&coll));\n push(&coll, 70);\n printf(\"%g\\n\", (double)pop(&coll));\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 890, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, int value) { s->items[++s->top] = value; }\nint pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack s = { .top = -1 };\n push(&s, 77);\n push(&s, 49);\n printf(\"%g\\n\", (double)pop(&s));\n push(&s, 45);\n printf(\"%g\\n\", (double)pop(&s));\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 891, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, int value) { s->items[++s->top] = value; }\nint pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack s = { .top = -1 };\n push(&s, 87);\n push(&s, 74);\n printf(\"%g\\n\", (double)pop(&s));\n push(&s, 48);\n printf(\"%g\\n\", (double)pop(&s));\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 892, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, int value) { s->items[++s->top] = value; }\nint pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack q = { .top = -1 };\n push(&q, 39);\n push(&q, 40);\n printf(\"%g\\n\", (double)pop(&q));\n push(&q, 16);\n printf(\"%g\\n\", (double)pop(&q));\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 893, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, int value) { s->items[++s->top] = value; }\nint pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack box_ = { .top = -1 };\n push(&box_, 84);\n push(&box_, 59);\n push(&box_, 53);\n push(&box_, 53);\n printf(\"%g\\n\", (double)pop(&box_));\n printf(\"%g\\n\", (double)pop(&box_));\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 894, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, int value) { s->items[++s->top] = value; }\nint pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack container = { .top = -1 };\n push(&container, 55);\n push(&container, 67);\n push(&container, 98);\n push(&container, 43);\n printf(\"%g\\n\", (double)pop(&container));\n printf(\"%g\\n\", (double)pop(&container));\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 895, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, int value) { s->items[++s->top] = value; }\nint pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack box_ = { .top = -1 };\n push(&box_, 55);\n push(&box_, 48);\n push(&box_, 23);\n push(&box_, 71);\n printf(\"%g\\n\", (double)pop(&box_));\n printf(\"%g\\n\", (double)pop(&box_));\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 896, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, int value) { s->items[++s->top] = value; }\nint pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack container = { .top = -1 };\n push(&container, 56);\n push(&container, 49);\n push(&container, 37);\n push(&container, 85);\n printf(\"%g\\n\", (double)pop(&container));\n printf(\"%g\\n\", (double)pop(&container));\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 897, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, int value) { s->items[++s->top] = value; }\nint pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack box_ = { .top = -1 };\n push(&box_, 82);\n printf(\"%g\\n\", (double)pop(&box_));\n push(&box_, 90);\n push(&box_, 80);\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 898, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, int value) { s->items[++s->top] = value; }\nint pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack q = { .top = -1 };\n push(&q, 12);\n printf(\"%g\\n\", (double)pop(&q));\n push(&q, 12);\n push(&q, 84);\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 899, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, int value) { s->items[++s->top] = value; }\nint pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack q = { .top = -1 };\n push(&q, 79);\n printf(\"%g\\n\", (double)pop(&q));\n push(&q, 14);\n push(&q, 64);\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 900, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, int value) { s->items[++s->top] = value; }\nint pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack coll = { .top = -1 };\n push(&coll, 97);\n printf(\"%g\\n\", (double)pop(&coll));\n push(&coll, 70);\n push(&coll, 13);\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 901, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, double value) { s->items[++s->top] = value; }\ndouble pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack coll = { .top = -1 };\n push(&coll, 44.97);\n push(&coll, 58.54);\n push(&coll, 4.23);\n printf(\"%g\\n\", (double)pop(&coll));\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 902, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, double value) { s->items[++s->top] = value; }\ndouble pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack box_ = { .top = -1 };\n push(&box_, 21.98);\n push(&box_, 77.91);\n push(&box_, 55.61);\n printf(\"%g\\n\", (double)pop(&box_));\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 903, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, double value) { s->items[++s->top] = value; }\ndouble pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack box_ = { .top = -1 };\n push(&box_, 95.1);\n push(&box_, 35.71);\n push(&box_, 79.58);\n printf(\"%g\\n\", (double)pop(&box_));\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 904, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, double value) { s->items[++s->top] = value; }\ndouble pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack coll = { .top = -1 };\n push(&coll, 70.68);\n push(&coll, 74.37);\n push(&coll, 1.75);\n printf(\"%g\\n\", (double)pop(&coll));\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 905, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, double value) { s->items[++s->top] = value; }\ndouble pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack s = { .top = -1 };\n push(&s, 51.25);\n push(&s, 27.49);\n printf(\"%g\\n\", (double)pop(&s));\n push(&s, 31.43);\n printf(\"%g\\n\", (double)pop(&s));\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 906, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, double value) { s->items[++s->top] = value; }\ndouble pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack box_ = { .top = -1 };\n push(&box_, 67.66);\n push(&box_, 1.41);\n printf(\"%g\\n\", (double)pop(&box_));\n push(&box_, 4.23);\n printf(\"%g\\n\", (double)pop(&box_));\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 907, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, double value) { s->items[++s->top] = value; }\ndouble pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack buf = { .top = -1 };\n push(&buf, 84.24);\n push(&buf, 52.38);\n printf(\"%g\\n\", (double)pop(&buf));\n push(&buf, 32.43);\n printf(\"%g\\n\", (double)pop(&buf));\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 908, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, double value) { s->items[++s->top] = value; }\ndouble pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack container = { .top = -1 };\n push(&container, 99.29);\n push(&container, 24.94);\n printf(\"%g\\n\", (double)pop(&container));\n push(&container, 20.07);\n printf(\"%g\\n\", (double)pop(&container));\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 909, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, double value) { s->items[++s->top] = value; }\ndouble pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack q = { .top = -1 };\n push(&q, 80.33);\n push(&q, 58.21);\n push(&q, 13.76);\n push(&q, 63.99);\n printf(\"%g\\n\", (double)pop(&q));\n printf(\"%g\\n\", (double)pop(&q));\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 910, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, double value) { s->items[++s->top] = value; }\ndouble pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack buf = { .top = -1 };\n push(&buf, 52.21);\n push(&buf, 44.3);\n push(&buf, 10.86);\n push(&buf, 80.32);\n printf(\"%g\\n\", (double)pop(&buf));\n printf(\"%g\\n\", (double)pop(&buf));\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 911, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, double value) { s->items[++s->top] = value; }\ndouble pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack box_ = { .top = -1 };\n push(&box_, 84.46);\n push(&box_, 63.1);\n push(&box_, 26.76);\n push(&box_, 55.74);\n printf(\"%g\\n\", (double)pop(&box_));\n printf(\"%g\\n\", (double)pop(&box_));\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 912, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, double value) { s->items[++s->top] = value; }\ndouble pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack q = { .top = -1 };\n push(&q, 3.54);\n push(&q, 2.14);\n push(&q, 77.23);\n push(&q, 16.15);\n printf(\"%g\\n\", (double)pop(&q));\n printf(\"%g\\n\", (double)pop(&q));\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 913, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, double value) { s->items[++s->top] = value; }\ndouble pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack q = { .top = -1 };\n push(&q, 57.61);\n printf(\"%g\\n\", (double)pop(&q));\n push(&q, 73.68);\n push(&q, 98.36);\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 914, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, double value) { s->items[++s->top] = value; }\ndouble pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack coll = { .top = -1 };\n push(&coll, 63.52);\n printf(\"%g\\n\", (double)pop(&coll));\n push(&coll, 24.73);\n push(&coll, 89.89);\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 915, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, double value) { s->items[++s->top] = value; }\ndouble pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack buf = { .top = -1 };\n push(&buf, 20.19);\n printf(\"%g\\n\", (double)pop(&buf));\n push(&buf, 72.9);\n push(&buf, 80.9);\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 916, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int top; } Stack;\n\nvoid push(Stack* s, double value) { s->items[++s->top] = value; }\ndouble pop(Stack* s) { return s->items[s->top--]; }\n\nint main(void) {\n Stack box_ = { .top = -1 };\n push(&box_, 77.27);\n printf(\"%g\\n\", (double)pop(&box_));\n push(&box_, 28.22);\n push(&box_, 93.56);\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 917, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "#include \n#include \n\nint main() {\n std::stack coll;\n coll.push(3);\n coll.push(82);\n coll.push(75);\n std::cout << coll.top() << std::endl; coll.pop();\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 918, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "#include \n#include \n\nint main() {\n std::stack q;\n q.push(59);\n q.push(77);\n q.push(16);\n std::cout << q.top() << std::endl; q.pop();\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 919, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "#include \n#include \n\nint main() {\n std::stack s;\n s.push(37);\n s.push(34);\n s.push(24);\n std::cout << s.top() << std::endl; s.pop();\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 920, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "#include \n#include \n\nint main() {\n std::stack q;\n q.push(64);\n q.push(47);\n q.push(27);\n std::cout << q.top() << std::endl; q.pop();\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 921, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#include \n\nint main() {\n std::stack q;\n q.push(63);\n q.push(3);\n std::cout << q.top() << std::endl; q.pop();\n q.push(10);\n std::cout << q.top() << std::endl; q.pop();\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 922, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#include \n\nint main() {\n std::stack coll;\n coll.push(10);\n coll.push(27);\n std::cout << coll.top() << std::endl; coll.pop();\n coll.push(54);\n std::cout << coll.top() << std::endl; coll.pop();\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 923, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#include \n\nint main() {\n std::stack buf;\n buf.push(82);\n buf.push(58);\n std::cout << buf.top() << std::endl; buf.pop();\n buf.push(24);\n std::cout << buf.top() << std::endl; buf.pop();\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 924, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#include \n\nint main() {\n std::stack q;\n q.push(23);\n q.push(85);\n std::cout << q.top() << std::endl; q.pop();\n q.push(81);\n std::cout << q.top() << std::endl; q.pop();\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 925, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#include \n\nint main() {\n std::stack q;\n q.push(16);\n q.push(44);\n q.push(45);\n q.push(62);\n std::cout << q.top() << std::endl; q.pop();\n std::cout << q.top() << std::endl; q.pop();\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 926, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#include \n\nint main() {\n std::stack container;\n container.push(1);\n container.push(21);\n container.push(67);\n container.push(95);\n std::cout << container.top() << std::endl; container.pop();\n std::cout << container.top() << std::endl; container.pop();\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 927, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#include \n\nint main() {\n std::stack s;\n s.push(78);\n s.push(4);\n s.push(69);\n s.push(3);\n std::cout << s.top() << std::endl; s.pop();\n std::cout << s.top() << std::endl; s.pop();\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 928, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#include \n\nint main() {\n std::stack s;\n s.push(28);\n s.push(47);\n s.push(15);\n s.push(28);\n std::cout << s.top() << std::endl; s.pop();\n std::cout << s.top() << std::endl; s.pop();\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 929, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "#include \n#include \n\nint main() {\n std::stack s;\n s.push(29);\n std::cout << s.top() << std::endl; s.pop();\n s.push(94);\n s.push(89);\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 930, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "#include \n#include \n\nint main() {\n std::stack s;\n s.push(35);\n std::cout << s.top() << std::endl; s.pop();\n s.push(62);\n s.push(26);\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 931, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "#include \n#include \n\nint main() {\n std::stack q;\n q.push(45);\n std::cout << q.top() << std::endl; q.pop();\n q.push(71);\n q.push(84);\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 932, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "#include \n#include \n\nint main() {\n std::stack buf;\n buf.push(60);\n std::cout << buf.top() << std::endl; buf.pop();\n buf.push(64);\n buf.push(56);\n return 0;\n}", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 933, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "#include \n#include \n\nint main() {\n std::stack container;\n container.push(94.69);\n container.push(92.31);\n container.push(25.76);\n std::cout << container.top() << std::endl; container.pop();\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 934, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "#include \n#include \n\nint main() {\n std::stack coll;\n coll.push(28.83);\n coll.push(39.89);\n coll.push(58.78);\n std::cout << coll.top() << std::endl; coll.pop();\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 935, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "#include \n#include \n\nint main() {\n std::stack buf;\n buf.push(17.4);\n buf.push(21.38);\n buf.push(72.48);\n std::cout << buf.top() << std::endl; buf.pop();\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 936, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "#include \n#include \n\nint main() {\n std::stack box_;\n box_.push(42.95);\n box_.push(74.96);\n box_.push(81.77);\n std::cout << box_.top() << std::endl; box_.pop();\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 937, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#include \n\nint main() {\n std::stack container;\n container.push(38.92);\n container.push(20.77);\n std::cout << container.top() << std::endl; container.pop();\n container.push(89.89);\n std::cout << container.top() << std::endl; container.pop();\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 938, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#include \n\nint main() {\n std::stack box_;\n box_.push(17.56);\n box_.push(4.34);\n std::cout << box_.top() << std::endl; box_.pop();\n box_.push(59.1);\n std::cout << box_.top() << std::endl; box_.pop();\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 939, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#include \n\nint main() {\n std::stack coll;\n coll.push(95.09);\n coll.push(53.52);\n std::cout << coll.top() << std::endl; coll.pop();\n coll.push(12.35);\n std::cout << coll.top() << std::endl; coll.pop();\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 940, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#include \n\nint main() {\n std::stack box_;\n box_.push(79.3);\n box_.push(36.42);\n std::cout << box_.top() << std::endl; box_.pop();\n box_.push(66.04);\n std::cout << box_.top() << std::endl; box_.pop();\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 941, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#include \n\nint main() {\n std::stack buf;\n buf.push(13.11);\n buf.push(32.54);\n buf.push(2.08);\n buf.push(33.56);\n std::cout << buf.top() << std::endl; buf.pop();\n std::cout << buf.top() << std::endl; buf.pop();\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 942, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#include \n\nint main() {\n std::stack s;\n s.push(56.6);\n s.push(39.17);\n s.push(60.58);\n s.push(53.2);\n std::cout << s.top() << std::endl; s.pop();\n std::cout << s.top() << std::endl; s.pop();\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 943, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#include \n\nint main() {\n std::stack container;\n container.push(94.68);\n container.push(80.94);\n container.push(67.46);\n container.push(57.82);\n std::cout << container.top() << std::endl; container.pop();\n std::cout << container.top() << std::endl; container.pop();\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 944, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#include \n\nint main() {\n std::stack box_;\n box_.push(32.46);\n box_.push(32.69);\n box_.push(20.52);\n box_.push(80.47);\n std::cout << box_.top() << std::endl; box_.pop();\n std::cout << box_.top() << std::endl; box_.pop();\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 945, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "#include \n#include \n\nint main() {\n std::stack box_;\n box_.push(12.81);\n std::cout << box_.top() << std::endl; box_.pop();\n box_.push(60.54);\n box_.push(59.53);\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 946, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "#include \n#include \n\nint main() {\n std::stack s;\n s.push(58.06);\n std::cout << s.top() << std::endl; s.pop();\n s.push(64.72);\n s.push(85.75);\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 947, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "#include \n#include \n\nint main() {\n std::stack q;\n q.push(91.25);\n std::cout << q.top() << std::endl; q.pop();\n q.push(84.32);\n q.push(40.88);\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 948, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "#include \n#include \n\nint main() {\n std::stack container;\n container.push(91.89);\n std::cout << container.top() << std::endl; container.pop();\n container.push(64.83);\n container.push(7.88);\n return 0;\n}", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 949, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "fn main() {\n let mut q: Vec = Vec::new();\n q.push(54);\n q.push(93);\n q.push(39);\n println!(\"{:?}\", q.pop());\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 950, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "fn main() {\n let mut buf: Vec = Vec::new();\n buf.push(97);\n buf.push(45);\n buf.push(52);\n println!(\"{:?}\", buf.pop());\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 951, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "fn main() {\n let mut container: Vec = Vec::new();\n container.push(100);\n container.push(41);\n container.push(64);\n println!(\"{:?}\", container.pop());\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 952, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, pop.", "code": "fn main() {\n let mut q: Vec = Vec::new();\n q.push(51);\n q.push(39);\n q.push(90);\n println!(\"{:?}\", q.pop());\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 953, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "fn main() {\n let mut box_: Vec = Vec::new();\n box_.push(83);\n box_.push(16);\n println!(\"{:?}\", box_.pop());\n box_.push(80);\n println!(\"{:?}\", box_.pop());\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 954, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "fn main() {\n let mut q: Vec = Vec::new();\n q.push(29);\n q.push(7);\n println!(\"{:?}\", q.pop());\n q.push(18);\n println!(\"{:?}\", q.pop());\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 955, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "fn main() {\n let mut buf: Vec = Vec::new();\n buf.push(89);\n buf.push(93);\n println!(\"{:?}\", buf.pop());\n buf.push(29);\n println!(\"{:?}\", buf.pop());\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 956, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, pop, push, pop.", "code": "fn main() {\n let mut q: Vec = Vec::new();\n q.push(25);\n q.push(93);\n println!(\"{:?}\", q.pop());\n q.push(69);\n println!(\"{:?}\", q.pop());\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 957, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "fn main() {\n let mut coll: Vec = Vec::new();\n coll.push(7);\n coll.push(34);\n coll.push(6);\n coll.push(15);\n println!(\"{:?}\", coll.pop());\n println!(\"{:?}\", coll.pop());\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 958, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "fn main() {\n let mut q: Vec = Vec::new();\n q.push(34);\n q.push(43);\n q.push(89);\n q.push(79);\n println!(\"{:?}\", q.pop());\n println!(\"{:?}\", q.pop());\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 959, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "fn main() {\n let mut coll: Vec = Vec::new();\n coll.push(22);\n coll.push(18);\n coll.push(75);\n coll.push(59);\n println!(\"{:?}\", coll.pop());\n println!(\"{:?}\", coll.pop());\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 960, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "fn main() {\n let mut buf: Vec = Vec::new();\n buf.push(19);\n buf.push(97);\n buf.push(75);\n buf.push(53);\n println!(\"{:?}\", buf.pop());\n println!(\"{:?}\", buf.pop());\n}", "explanation": "Stack with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 961, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "fn main() {\n let mut coll: Vec = Vec::new();\n coll.push(16);\n println!(\"{:?}\", coll.pop());\n coll.push(68);\n coll.push(31);\n}", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 962, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "fn main() {\n let mut container: Vec = Vec::new();\n container.push(62);\n println!(\"{:?}\", container.pop());\n container.push(63);\n container.push(36);\n}", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 963, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "fn main() {\n let mut buf: Vec = Vec::new();\n buf.push(99);\n println!(\"{:?}\", buf.pop());\n buf.push(62);\n buf.push(29);\n}", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 964, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of ints and run the operation sequence: push, pop, push, push.", "code": "fn main() {\n let mut q: Vec = Vec::new();\n q.push(34);\n println!(\"{:?}\", q.pop());\n q.push(38);\n q.push(92);\n}", "explanation": "Stack with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 965, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "fn main() {\n let mut q: Vec = Vec::new();\n q.push(35.95);\n q.push(83.72);\n q.push(25.0);\n println!(\"{:?}\", q.pop());\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 966, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "fn main() {\n let mut s: Vec = Vec::new();\n s.push(69.8);\n s.push(8.44);\n s.push(49.97);\n println!(\"{:?}\", s.pop());\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 967, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "fn main() {\n let mut coll: Vec = Vec::new();\n coll.push(22.4);\n coll.push(82.03);\n coll.push(19.6);\n println!(\"{:?}\", coll.pop());\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 968, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, pop.", "code": "fn main() {\n let mut s: Vec = Vec::new();\n s.push(81.59);\n s.push(76.4);\n s.push(51.88);\n println!(\"{:?}\", s.pop());\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 969, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "fn main() {\n let mut buf: Vec = Vec::new();\n buf.push(71.14);\n buf.push(65.87);\n println!(\"{:?}\", buf.pop());\n buf.push(11.46);\n println!(\"{:?}\", buf.pop());\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 970, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "fn main() {\n let mut buf: Vec = Vec::new();\n buf.push(39.17);\n buf.push(45.79);\n println!(\"{:?}\", buf.pop());\n buf.push(21.1);\n println!(\"{:?}\", buf.pop());\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 971, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "fn main() {\n let mut q: Vec = Vec::new();\n q.push(28.51);\n q.push(17.26);\n println!(\"{:?}\", q.pop());\n q.push(87.11);\n println!(\"{:?}\", q.pop());\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 972, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, pop, push, pop.", "code": "fn main() {\n let mut s: Vec = Vec::new();\n s.push(46.63);\n s.push(11.61);\n println!(\"{:?}\", s.pop());\n s.push(2.64);\n println!(\"{:?}\", s.pop());\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 973, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "fn main() {\n let mut buf: Vec = Vec::new();\n buf.push(3.83);\n buf.push(66.53);\n buf.push(45.81);\n buf.push(27.29);\n println!(\"{:?}\", buf.pop());\n println!(\"{:?}\", buf.pop());\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 974, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "fn main() {\n let mut box_: Vec = Vec::new();\n box_.push(21.99);\n box_.push(40.3);\n box_.push(43.65);\n box_.push(34.04);\n println!(\"{:?}\", box_.pop());\n println!(\"{:?}\", box_.pop());\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 975, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "fn main() {\n let mut q: Vec = Vec::new();\n q.push(65.21);\n q.push(73.47);\n q.push(42.84);\n q.push(30.11);\n println!(\"{:?}\", q.pop());\n println!(\"{:?}\", q.pop());\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 976, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "fn main() {\n let mut container: Vec = Vec::new();\n container.push(61.14);\n container.push(52.34);\n container.push(11.81);\n container.push(5.94);\n println!(\"{:?}\", container.pop());\n println!(\"{:?}\", container.pop());\n}", "explanation": "Stack with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 977, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "fn main() {\n let mut q: Vec = Vec::new();\n q.push(6.26);\n println!(\"{:?}\", q.pop());\n q.push(27.35);\n q.push(7.52);\n}", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 978, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "fn main() {\n let mut q: Vec = Vec::new();\n q.push(28.27);\n println!(\"{:?}\", q.pop());\n q.push(70.25);\n q.push(41.05);\n}", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 979, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "fn main() {\n let mut box_: Vec = Vec::new();\n box_.push(11.03);\n println!(\"{:?}\", box_.pop());\n box_.push(88.07);\n box_.push(27.56);\n}", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 980, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a stack of floats and run the operation sequence: push, pop, push, push.", "code": "fn main() {\n let mut s: Vec = Vec::new();\n s.push(17.93);\n println!(\"{:?}\", s.pop());\n s.push(64.05);\n s.push(70.88);\n}", "explanation": "Stack with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 981, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "from collections import deque\n\nbuf = deque()\nbuf.append(94)\nbuf.append(1)\nbuf.append(13)\nprint(buf.popleft())", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 982, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "from collections import deque\n\ncontainer = deque()\ncontainer.append(90)\ncontainer.append(80)\ncontainer.append(62)\nprint(container.popleft())", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 983, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "from collections import deque\n\nbuf = deque()\nbuf.append(89)\nbuf.append(31)\nbuf.append(22)\nprint(buf.popleft())", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 984, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "from collections import deque\n\ncoll = deque()\ncoll.append(9)\ncoll.append(22)\ncoll.append(24)\nprint(coll.popleft())", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 985, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "from collections import deque\n\nbox_ = deque()\nbox_.append(19)\nbox_.append(2)\nprint(box_.popleft())\nbox_.append(61)\nprint(box_.popleft())", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 986, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "from collections import deque\n\nbuf = deque()\nbuf.append(3)\nbuf.append(23)\nprint(buf.popleft())\nbuf.append(10)\nprint(buf.popleft())", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 987, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "from collections import deque\n\ncoll = deque()\ncoll.append(98)\ncoll.append(2)\nprint(coll.popleft())\ncoll.append(46)\nprint(coll.popleft())", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 988, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "from collections import deque\n\ncontainer = deque()\ncontainer.append(1)\ncontainer.append(63)\nprint(container.popleft())\ncontainer.append(61)\nprint(container.popleft())", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 989, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "from collections import deque\n\nq = deque()\nq.append(3)\nq.append(73)\nq.append(88)\nq.append(38)\nprint(q.popleft())\nprint(q.popleft())", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 990, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "from collections import deque\n\ncontainer = deque()\ncontainer.append(22)\ncontainer.append(97)\ncontainer.append(19)\ncontainer.append(100)\nprint(container.popleft())\nprint(container.popleft())", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 991, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "from collections import deque\n\nbuf = deque()\nbuf.append(95)\nbuf.append(43)\nbuf.append(58)\nbuf.append(63)\nprint(buf.popleft())\nprint(buf.popleft())", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 992, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "from collections import deque\n\ncontainer = deque()\ncontainer.append(33)\ncontainer.append(85)\ncontainer.append(63)\ncontainer.append(33)\nprint(container.popleft())\nprint(container.popleft())", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 993, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "from collections import deque\n\nq = deque()\nq.append(46)\nprint(q.popleft())\nq.append(91)\nq.append(43)", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 994, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "from collections import deque\n\ncontainer = deque()\ncontainer.append(100)\nprint(container.popleft())\ncontainer.append(77)\ncontainer.append(62)", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 995, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "from collections import deque\n\nq = deque()\nq.append(35)\nprint(q.popleft())\nq.append(67)\nq.append(94)", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 996, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "from collections import deque\n\ncoll = deque()\ncoll.append(3)\nprint(coll.popleft())\ncoll.append(53)\ncoll.append(29)", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 997, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "from collections import deque\n\ncoll = deque()\ncoll.append(99.41)\ncoll.append(36.36)\ncoll.append(4.06)\nprint(coll.popleft())", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 998, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "from collections import deque\n\ncoll = deque()\ncoll.append(97.36)\ncoll.append(36.58)\ncoll.append(74.69)\nprint(coll.popleft())", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 999, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "from collections import deque\n\nbox_ = deque()\nbox_.append(64.23)\nbox_.append(96.58)\nbox_.append(87.84)\nprint(box_.popleft())", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1000, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "from collections import deque\n\nbox_ = deque()\nbox_.append(98.75)\nbox_.append(87.73)\nbox_.append(18.32)\nprint(box_.popleft())", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1001, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "from collections import deque\n\nbuf = deque()\nbuf.append(88.91)\nbuf.append(39.71)\nprint(buf.popleft())\nbuf.append(99.4)\nprint(buf.popleft())", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1002, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "from collections import deque\n\nq = deque()\nq.append(58.37)\nq.append(70.48)\nprint(q.popleft())\nq.append(13.17)\nprint(q.popleft())", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1003, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "from collections import deque\n\ncontainer = deque()\ncontainer.append(96.85)\ncontainer.append(79.44)\nprint(container.popleft())\ncontainer.append(96.98)\nprint(container.popleft())", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1004, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "from collections import deque\n\ncoll = deque()\ncoll.append(15.57)\ncoll.append(68.41)\nprint(coll.popleft())\ncoll.append(29.69)\nprint(coll.popleft())", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1005, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "from collections import deque\n\ns = deque()\ns.append(31.06)\ns.append(29.54)\ns.append(80.18)\ns.append(2.54)\nprint(s.popleft())\nprint(s.popleft())", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1006, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "from collections import deque\n\ncontainer = deque()\ncontainer.append(13.22)\ncontainer.append(49.35)\ncontainer.append(1.5)\ncontainer.append(35.87)\nprint(container.popleft())\nprint(container.popleft())", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1007, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "from collections import deque\n\ns = deque()\ns.append(35.67)\ns.append(29.04)\ns.append(86.04)\ns.append(66.87)\nprint(s.popleft())\nprint(s.popleft())", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1008, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "from collections import deque\n\nq = deque()\nq.append(71.61)\nq.append(15.12)\nq.append(73.57)\nq.append(43.77)\nprint(q.popleft())\nprint(q.popleft())", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1009, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "from collections import deque\n\nq = deque()\nq.append(47.84)\nprint(q.popleft())\nq.append(81.36)\nq.append(64.07)", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1010, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "from collections import deque\n\nbox_ = deque()\nbox_.append(40.51)\nprint(box_.popleft())\nbox_.append(89.41)\nbox_.append(92.1)", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1011, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "from collections import deque\n\ncontainer = deque()\ncontainer.append(31.76)\nprint(container.popleft())\ncontainer.append(68.21)\ncontainer.append(32.93)", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1012, "language": "Python", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "from collections import deque\n\ncontainer = deque()\ncontainer.append(14.78)\nprint(container.popleft())\ncontainer.append(25.75)\ncontainer.append(42.21)", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1013, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "class SQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst s = new SQueue();\ns.enqueue(39);\ns.enqueue(40);\ns.enqueue(11);\nconsole.log(s.dequeue());", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1014, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "class ContainerQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst container = new ContainerQueue();\ncontainer.enqueue(81);\ncontainer.enqueue(60);\ncontainer.enqueue(70);\nconsole.log(container.dequeue());", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1015, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "class Box_Queue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst box_ = new Box_Queue();\nbox_.enqueue(56);\nbox_.enqueue(13);\nbox_.enqueue(18);\nconsole.log(box_.dequeue());", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1016, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "class Box_Queue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst box_ = new Box_Queue();\nbox_.enqueue(89);\nbox_.enqueue(41);\nbox_.enqueue(65);\nconsole.log(box_.dequeue());", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1017, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "class CollQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst coll = new CollQueue();\ncoll.enqueue(46);\ncoll.enqueue(60);\nconsole.log(coll.dequeue());\ncoll.enqueue(55);\nconsole.log(coll.dequeue());", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1018, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "class Box_Queue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst box_ = new Box_Queue();\nbox_.enqueue(53);\nbox_.enqueue(60);\nconsole.log(box_.dequeue());\nbox_.enqueue(72);\nconsole.log(box_.dequeue());", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1019, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "class Box_Queue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst box_ = new Box_Queue();\nbox_.enqueue(12);\nbox_.enqueue(97);\nconsole.log(box_.dequeue());\nbox_.enqueue(79);\nconsole.log(box_.dequeue());", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1020, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "class SQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst s = new SQueue();\ns.enqueue(75);\ns.enqueue(66);\nconsole.log(s.dequeue());\ns.enqueue(17);\nconsole.log(s.dequeue());", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1021, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "class ContainerQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst container = new ContainerQueue();\ncontainer.enqueue(73);\ncontainer.enqueue(38);\ncontainer.enqueue(7);\ncontainer.enqueue(97);\nconsole.log(container.dequeue());\nconsole.log(container.dequeue());", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1022, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "class Box_Queue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst box_ = new Box_Queue();\nbox_.enqueue(86);\nbox_.enqueue(1);\nbox_.enqueue(60);\nbox_.enqueue(98);\nconsole.log(box_.dequeue());\nconsole.log(box_.dequeue());", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1023, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "class QQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst q = new QQueue();\nq.enqueue(11);\nq.enqueue(8);\nq.enqueue(35);\nq.enqueue(84);\nconsole.log(q.dequeue());\nconsole.log(q.dequeue());", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1024, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "class ContainerQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst container = new ContainerQueue();\ncontainer.enqueue(13);\ncontainer.enqueue(38);\ncontainer.enqueue(73);\ncontainer.enqueue(62);\nconsole.log(container.dequeue());\nconsole.log(container.dequeue());", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1025, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "class QQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst q = new QQueue();\nq.enqueue(16);\nconsole.log(q.dequeue());\nq.enqueue(75);\nq.enqueue(87);", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1026, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "class ContainerQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst container = new ContainerQueue();\ncontainer.enqueue(95);\nconsole.log(container.dequeue());\ncontainer.enqueue(7);\ncontainer.enqueue(90);", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1027, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "class SQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst s = new SQueue();\ns.enqueue(67);\nconsole.log(s.dequeue());\ns.enqueue(72);\ns.enqueue(95);", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1028, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "class Box_Queue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst box_ = new Box_Queue();\nbox_.enqueue(18);\nconsole.log(box_.dequeue());\nbox_.enqueue(87);\nbox_.enqueue(82);", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1029, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "class SQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst s = new SQueue();\ns.enqueue(30.79);\ns.enqueue(31.78);\ns.enqueue(98.93);\nconsole.log(s.dequeue());", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1030, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "class Box_Queue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst box_ = new Box_Queue();\nbox_.enqueue(62.74);\nbox_.enqueue(20.87);\nbox_.enqueue(7.65);\nconsole.log(box_.dequeue());", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1031, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "class QQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst q = new QQueue();\nq.enqueue(52.46);\nq.enqueue(25.47);\nq.enqueue(11.26);\nconsole.log(q.dequeue());", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1032, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "class ContainerQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst container = new ContainerQueue();\ncontainer.enqueue(44.94);\ncontainer.enqueue(6.51);\ncontainer.enqueue(13.06);\nconsole.log(container.dequeue());", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1033, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "class SQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst s = new SQueue();\ns.enqueue(82.21);\ns.enqueue(84.33);\nconsole.log(s.dequeue());\ns.enqueue(82.35);\nconsole.log(s.dequeue());", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1034, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "class CollQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst coll = new CollQueue();\ncoll.enqueue(62.1);\ncoll.enqueue(43.8);\nconsole.log(coll.dequeue());\ncoll.enqueue(19.3);\nconsole.log(coll.dequeue());", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1035, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "class CollQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst coll = new CollQueue();\ncoll.enqueue(24.83);\ncoll.enqueue(51.64);\nconsole.log(coll.dequeue());\ncoll.enqueue(20.83);\nconsole.log(coll.dequeue());", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1036, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "class BufQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst buf = new BufQueue();\nbuf.enqueue(67.09);\nbuf.enqueue(95.95);\nconsole.log(buf.dequeue());\nbuf.enqueue(67.1);\nconsole.log(buf.dequeue());", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1037, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "class CollQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst coll = new CollQueue();\ncoll.enqueue(80.19);\ncoll.enqueue(46.93);\ncoll.enqueue(81.54);\ncoll.enqueue(15.67);\nconsole.log(coll.dequeue());\nconsole.log(coll.dequeue());", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1038, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "class Box_Queue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst box_ = new Box_Queue();\nbox_.enqueue(2.09);\nbox_.enqueue(30.97);\nbox_.enqueue(64.87);\nbox_.enqueue(89.43);\nconsole.log(box_.dequeue());\nconsole.log(box_.dequeue());", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1039, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "class BufQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst buf = new BufQueue();\nbuf.enqueue(96.32);\nbuf.enqueue(47.32);\nbuf.enqueue(72.58);\nbuf.enqueue(28.41);\nconsole.log(buf.dequeue());\nconsole.log(buf.dequeue());", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1040, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "class ContainerQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst container = new ContainerQueue();\ncontainer.enqueue(21.87);\ncontainer.enqueue(90.35);\ncontainer.enqueue(52.98);\ncontainer.enqueue(51.79);\nconsole.log(container.dequeue());\nconsole.log(container.dequeue());", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1041, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "class CollQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst coll = new CollQueue();\ncoll.enqueue(72.2);\nconsole.log(coll.dequeue());\ncoll.enqueue(71.8);\ncoll.enqueue(78.88);", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1042, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "class BufQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst buf = new BufQueue();\nbuf.enqueue(78.71);\nconsole.log(buf.dequeue());\nbuf.enqueue(92.42);\nbuf.enqueue(7.75);", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1043, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "class CollQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst coll = new CollQueue();\ncoll.enqueue(48.89);\nconsole.log(coll.dequeue());\ncoll.enqueue(60.98);\ncoll.enqueue(18.86);", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1044, "language": "JavaScript", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "class CollQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nconst coll = new CollQueue();\ncoll.enqueue(92.81);\nconsole.log(coll.dequeue());\ncoll.enqueue(53.02);\ncoll.enqueue(13.81);", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1045, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "class BufQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { BufQueue };\nconst buf = new BufQueue();\nbuf.enqueue(76);\nbuf.enqueue(75);\nbuf.enqueue(45);\nconsole.log(buf.dequeue());", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1046, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "class ContainerQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { ContainerQueue };\nconst container = new ContainerQueue();\ncontainer.enqueue(52);\ncontainer.enqueue(9);\ncontainer.enqueue(6);\nconsole.log(container.dequeue());", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1047, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "class CollQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { CollQueue };\nconst coll = new CollQueue();\ncoll.enqueue(21);\ncoll.enqueue(30);\ncoll.enqueue(13);\nconsole.log(coll.dequeue());", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1048, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "class QQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { QQueue };\nconst q = new QQueue();\nq.enqueue(64);\nq.enqueue(87);\nq.enqueue(61);\nconsole.log(q.dequeue());", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1049, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "class SQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { SQueue };\nconst s = new SQueue();\ns.enqueue(99);\ns.enqueue(94);\nconsole.log(s.dequeue());\ns.enqueue(14);\nconsole.log(s.dequeue());", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1050, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "class CollQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { CollQueue };\nconst coll = new CollQueue();\ncoll.enqueue(50);\ncoll.enqueue(97);\nconsole.log(coll.dequeue());\ncoll.enqueue(9);\nconsole.log(coll.dequeue());", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1051, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "class ContainerQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { ContainerQueue };\nconst container = new ContainerQueue();\ncontainer.enqueue(33);\ncontainer.enqueue(15);\nconsole.log(container.dequeue());\ncontainer.enqueue(96);\nconsole.log(container.dequeue());", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1052, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "class Box_Queue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { Box_Queue };\nconst box_ = new Box_Queue();\nbox_.enqueue(98);\nbox_.enqueue(48);\nconsole.log(box_.dequeue());\nbox_.enqueue(81);\nconsole.log(box_.dequeue());", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1053, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "class SQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { SQueue };\nconst s = new SQueue();\ns.enqueue(42);\ns.enqueue(14);\ns.enqueue(90);\ns.enqueue(58);\nconsole.log(s.dequeue());\nconsole.log(s.dequeue());", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1054, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "class CollQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { CollQueue };\nconst coll = new CollQueue();\ncoll.enqueue(74);\ncoll.enqueue(72);\ncoll.enqueue(26);\ncoll.enqueue(26);\nconsole.log(coll.dequeue());\nconsole.log(coll.dequeue());", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1055, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "class Box_Queue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { Box_Queue };\nconst box_ = new Box_Queue();\nbox_.enqueue(87);\nbox_.enqueue(37);\nbox_.enqueue(29);\nbox_.enqueue(26);\nconsole.log(box_.dequeue());\nconsole.log(box_.dequeue());", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1056, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "class Box_Queue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { Box_Queue };\nconst box_ = new Box_Queue();\nbox_.enqueue(68);\nbox_.enqueue(25);\nbox_.enqueue(12);\nbox_.enqueue(75);\nconsole.log(box_.dequeue());\nconsole.log(box_.dequeue());", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1057, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "class CollQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { CollQueue };\nconst coll = new CollQueue();\ncoll.enqueue(13);\nconsole.log(coll.dequeue());\ncoll.enqueue(5);\ncoll.enqueue(18);", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1058, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "class QQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { QQueue };\nconst q = new QQueue();\nq.enqueue(47);\nconsole.log(q.dequeue());\nq.enqueue(53);\nq.enqueue(73);", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1059, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "class ContainerQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { ContainerQueue };\nconst container = new ContainerQueue();\ncontainer.enqueue(10);\nconsole.log(container.dequeue());\ncontainer.enqueue(24);\ncontainer.enqueue(88);", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1060, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "class CollQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { CollQueue };\nconst coll = new CollQueue();\ncoll.enqueue(94);\nconsole.log(coll.dequeue());\ncoll.enqueue(68);\ncoll.enqueue(64);", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1061, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "class SQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { SQueue };\nconst s = new SQueue();\ns.enqueue(83.41);\ns.enqueue(57.47);\ns.enqueue(47.9);\nconsole.log(s.dequeue());", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1062, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "class ContainerQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { ContainerQueue };\nconst container = new ContainerQueue();\ncontainer.enqueue(90.08);\ncontainer.enqueue(85.49);\ncontainer.enqueue(80.36);\nconsole.log(container.dequeue());", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1063, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "class CollQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { CollQueue };\nconst coll = new CollQueue();\ncoll.enqueue(38.24);\ncoll.enqueue(8.02);\ncoll.enqueue(8.74);\nconsole.log(coll.dequeue());", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1064, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "class BufQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { BufQueue };\nconst buf = new BufQueue();\nbuf.enqueue(10.99);\nbuf.enqueue(50.37);\nbuf.enqueue(6.1);\nconsole.log(buf.dequeue());", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1065, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "class QQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { QQueue };\nconst q = new QQueue();\nq.enqueue(23.18);\nq.enqueue(94.12);\nconsole.log(q.dequeue());\nq.enqueue(25.89);\nconsole.log(q.dequeue());", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1066, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "class QQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { QQueue };\nconst q = new QQueue();\nq.enqueue(87.37);\nq.enqueue(16.63);\nconsole.log(q.dequeue());\nq.enqueue(53.91);\nconsole.log(q.dequeue());", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1067, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "class ContainerQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { ContainerQueue };\nconst container = new ContainerQueue();\ncontainer.enqueue(93.25);\ncontainer.enqueue(50.5);\nconsole.log(container.dequeue());\ncontainer.enqueue(6.61);\nconsole.log(container.dequeue());", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1068, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "class QQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { QQueue };\nconst q = new QQueue();\nq.enqueue(58.69);\nq.enqueue(93.76);\nconsole.log(q.dequeue());\nq.enqueue(65.67);\nconsole.log(q.dequeue());", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1069, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "class Box_Queue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { Box_Queue };\nconst box_ = new Box_Queue();\nbox_.enqueue(26.83);\nbox_.enqueue(34.12);\nbox_.enqueue(76.71);\nbox_.enqueue(14.79);\nconsole.log(box_.dequeue());\nconsole.log(box_.dequeue());", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1070, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "class CollQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { CollQueue };\nconst coll = new CollQueue();\ncoll.enqueue(91.32);\ncoll.enqueue(7.17);\ncoll.enqueue(49.86);\ncoll.enqueue(80.76);\nconsole.log(coll.dequeue());\nconsole.log(coll.dequeue());", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1071, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "class QQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { QQueue };\nconst q = new QQueue();\nq.enqueue(35.24);\nq.enqueue(8.01);\nq.enqueue(42.21);\nq.enqueue(74.19);\nconsole.log(q.dequeue());\nconsole.log(q.dequeue());", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1072, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "class Box_Queue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { Box_Queue };\nconst box_ = new Box_Queue();\nbox_.enqueue(94.71);\nbox_.enqueue(27.78);\nbox_.enqueue(5.13);\nbox_.enqueue(4.52);\nconsole.log(box_.dequeue());\nconsole.log(box_.dequeue());", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1073, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "class Box_Queue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { Box_Queue };\nconst box_ = new Box_Queue();\nbox_.enqueue(48.28);\nconsole.log(box_.dequeue());\nbox_.enqueue(87.77);\nbox_.enqueue(23.55);", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1074, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "class QQueue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { QQueue };\nconst q = new QQueue();\nq.enqueue(3.61);\nconsole.log(q.dequeue());\nq.enqueue(20.42);\nq.enqueue(61.21);", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1075, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "class Box_Queue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { Box_Queue };\nconst box_ = new Box_Queue();\nbox_.enqueue(68.51);\nconsole.log(box_.dequeue());\nbox_.enqueue(55.7);\nbox_.enqueue(6.16);", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1076, "language": "Node.js", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "class Box_Queue {\n #items = [];\n enqueue(item) { this.#items.push(item); }\n dequeue() { return this.#items.shift(); }\n}\n\nmodule.exports = { Box_Queue };\nconst box_ = new Box_Queue();\nbox_.enqueue(69.85);\nconsole.log(box_.dequeue());\nbox_.enqueue(43.26);\nbox_.enqueue(14.64);", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1077, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue box_ = new LinkedList<>();\n box_.add(16);\n box_.add(79);\n box_.add(48);\n System.out.println(box_.poll());\n }\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1078, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue s = new LinkedList<>();\n s.add(44);\n s.add(56);\n s.add(8);\n System.out.println(s.poll());\n }\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1079, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue s = new LinkedList<>();\n s.add(12);\n s.add(76);\n s.add(2);\n System.out.println(s.poll());\n }\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1080, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue box_ = new LinkedList<>();\n box_.add(96);\n box_.add(97);\n box_.add(69);\n System.out.println(box_.poll());\n }\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1081, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue q = new LinkedList<>();\n q.add(2);\n q.add(93);\n System.out.println(q.poll());\n q.add(8);\n System.out.println(q.poll());\n }\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1082, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue q = new LinkedList<>();\n q.add(17);\n q.add(57);\n System.out.println(q.poll());\n q.add(37);\n System.out.println(q.poll());\n }\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1083, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue buf = new LinkedList<>();\n buf.add(45);\n buf.add(78);\n System.out.println(buf.poll());\n buf.add(32);\n System.out.println(buf.poll());\n }\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1084, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue s = new LinkedList<>();\n s.add(78);\n s.add(51);\n System.out.println(s.poll());\n s.add(85);\n System.out.println(s.poll());\n }\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1085, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue coll = new LinkedList<>();\n coll.add(10);\n coll.add(10);\n coll.add(33);\n coll.add(70);\n System.out.println(coll.poll());\n System.out.println(coll.poll());\n }\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1086, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue coll = new LinkedList<>();\n coll.add(95);\n coll.add(46);\n coll.add(29);\n coll.add(57);\n System.out.println(coll.poll());\n System.out.println(coll.poll());\n }\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1087, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue buf = new LinkedList<>();\n buf.add(100);\n buf.add(71);\n buf.add(38);\n buf.add(84);\n System.out.println(buf.poll());\n System.out.println(buf.poll());\n }\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1088, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue buf = new LinkedList<>();\n buf.add(41);\n buf.add(90);\n buf.add(70);\n buf.add(65);\n System.out.println(buf.poll());\n System.out.println(buf.poll());\n }\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1089, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue buf = new LinkedList<>();\n buf.add(53);\n System.out.println(buf.poll());\n buf.add(80);\n buf.add(63);\n }\n}", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1090, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue buf = new LinkedList<>();\n buf.add(11);\n System.out.println(buf.poll());\n buf.add(18);\n buf.add(67);\n }\n}", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1091, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue s = new LinkedList<>();\n s.add(40);\n System.out.println(s.poll());\n s.add(71);\n s.add(27);\n }\n}", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1092, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue q = new LinkedList<>();\n q.add(48);\n System.out.println(q.poll());\n q.add(19);\n q.add(5);\n }\n}", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1093, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue s = new LinkedList<>();\n s.add(70.14);\n s.add(65.34);\n s.add(45.92);\n System.out.println(s.poll());\n }\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1094, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue box_ = new LinkedList<>();\n box_.add(83.8);\n box_.add(27.76);\n box_.add(59.24);\n System.out.println(box_.poll());\n }\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1095, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue q = new LinkedList<>();\n q.add(6.91);\n q.add(85.6);\n q.add(39.01);\n System.out.println(q.poll());\n }\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1096, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue box_ = new LinkedList<>();\n box_.add(39.08);\n box_.add(5.4);\n box_.add(21.37);\n System.out.println(box_.poll());\n }\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1097, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue box_ = new LinkedList<>();\n box_.add(53.72);\n box_.add(66.38);\n System.out.println(box_.poll());\n box_.add(76.54);\n System.out.println(box_.poll());\n }\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1098, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue container = new LinkedList<>();\n container.add(75.69);\n container.add(34.29);\n System.out.println(container.poll());\n container.add(26.99);\n System.out.println(container.poll());\n }\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1099, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue s = new LinkedList<>();\n s.add(75.97);\n s.add(34.75);\n System.out.println(s.poll());\n s.add(43.97);\n System.out.println(s.poll());\n }\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1100, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue coll = new LinkedList<>();\n coll.add(92.93);\n coll.add(75.49);\n System.out.println(coll.poll());\n coll.add(55.78);\n System.out.println(coll.poll());\n }\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1101, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue coll = new LinkedList<>();\n coll.add(29.45);\n coll.add(99.1);\n coll.add(53.94);\n coll.add(42.96);\n System.out.println(coll.poll());\n System.out.println(coll.poll());\n }\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1102, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue buf = new LinkedList<>();\n buf.add(17.09);\n buf.add(38.75);\n buf.add(74.82);\n buf.add(92.54);\n System.out.println(buf.poll());\n System.out.println(buf.poll());\n }\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1103, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue coll = new LinkedList<>();\n coll.add(95.15);\n coll.add(9.47);\n coll.add(25.74);\n coll.add(54.74);\n System.out.println(coll.poll());\n System.out.println(coll.poll());\n }\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1104, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue container = new LinkedList<>();\n container.add(28.15);\n container.add(27.61);\n container.add(25.8);\n container.add(65.65);\n System.out.println(container.poll());\n System.out.println(container.poll());\n }\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1105, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue buf = new LinkedList<>();\n buf.add(57.28);\n System.out.println(buf.poll());\n buf.add(27.19);\n buf.add(18.7);\n }\n}", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1106, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue box_ = new LinkedList<>();\n box_.add(2.71);\n System.out.println(box_.poll());\n box_.add(4.66);\n box_.add(36.51);\n }\n}", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1107, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue coll = new LinkedList<>();\n coll.add(84.59);\n System.out.println(coll.poll());\n coll.add(6.8);\n coll.add(93.94);\n }\n}", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1108, "language": "Java", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Queue buf = new LinkedList<>();\n buf.add(89.81);\n System.out.println(buf.poll());\n buf.add(95.38);\n buf.add(44.6);\n }\n}", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1109, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, int value) { q->items[q->rear++] = value; }\nint dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue buf = { .front = 0, .rear = 0 };\n enqueue(&buf, 99);\n enqueue(&buf, 36);\n enqueue(&buf, 34);\n printf(\"%g\\n\", (double)dequeue(&buf));\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1110, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, int value) { q->items[q->rear++] = value; }\nint dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue s = { .front = 0, .rear = 0 };\n enqueue(&s, 30);\n enqueue(&s, 81);\n enqueue(&s, 23);\n printf(\"%g\\n\", (double)dequeue(&s));\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1111, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, int value) { q->items[q->rear++] = value; }\nint dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue container = { .front = 0, .rear = 0 };\n enqueue(&container, 84);\n enqueue(&container, 7);\n enqueue(&container, 30);\n printf(\"%g\\n\", (double)dequeue(&container));\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1112, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, int value) { q->items[q->rear++] = value; }\nint dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue coll = { .front = 0, .rear = 0 };\n enqueue(&coll, 5);\n enqueue(&coll, 24);\n enqueue(&coll, 88);\n printf(\"%g\\n\", (double)dequeue(&coll));\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1113, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, int value) { q->items[q->rear++] = value; }\nint dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue box_ = { .front = 0, .rear = 0 };\n enqueue(&box_, 75);\n enqueue(&box_, 41);\n printf(\"%g\\n\", (double)dequeue(&box_));\n enqueue(&box_, 71);\n printf(\"%g\\n\", (double)dequeue(&box_));\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1114, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, int value) { q->items[q->rear++] = value; }\nint dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue s = { .front = 0, .rear = 0 };\n enqueue(&s, 8);\n enqueue(&s, 92);\n printf(\"%g\\n\", (double)dequeue(&s));\n enqueue(&s, 33);\n printf(\"%g\\n\", (double)dequeue(&s));\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1115, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, int value) { q->items[q->rear++] = value; }\nint dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue coll = { .front = 0, .rear = 0 };\n enqueue(&coll, 46);\n enqueue(&coll, 70);\n printf(\"%g\\n\", (double)dequeue(&coll));\n enqueue(&coll, 6);\n printf(\"%g\\n\", (double)dequeue(&coll));\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1116, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, int value) { q->items[q->rear++] = value; }\nint dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue s = { .front = 0, .rear = 0 };\n enqueue(&s, 45);\n enqueue(&s, 14);\n printf(\"%g\\n\", (double)dequeue(&s));\n enqueue(&s, 65);\n printf(\"%g\\n\", (double)dequeue(&s));\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1117, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, int value) { q->items[q->rear++] = value; }\nint dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue q = { .front = 0, .rear = 0 };\n enqueue(&q, 66);\n enqueue(&q, 10);\n enqueue(&q, 31);\n enqueue(&q, 27);\n printf(\"%g\\n\", (double)dequeue(&q));\n printf(\"%g\\n\", (double)dequeue(&q));\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1118, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, int value) { q->items[q->rear++] = value; }\nint dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue buf = { .front = 0, .rear = 0 };\n enqueue(&buf, 88);\n enqueue(&buf, 54);\n enqueue(&buf, 10);\n enqueue(&buf, 83);\n printf(\"%g\\n\", (double)dequeue(&buf));\n printf(\"%g\\n\", (double)dequeue(&buf));\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1119, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, int value) { q->items[q->rear++] = value; }\nint dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue s = { .front = 0, .rear = 0 };\n enqueue(&s, 4);\n enqueue(&s, 42);\n enqueue(&s, 78);\n enqueue(&s, 47);\n printf(\"%g\\n\", (double)dequeue(&s));\n printf(\"%g\\n\", (double)dequeue(&s));\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1120, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, int value) { q->items[q->rear++] = value; }\nint dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue coll = { .front = 0, .rear = 0 };\n enqueue(&coll, 48);\n enqueue(&coll, 61);\n enqueue(&coll, 38);\n enqueue(&coll, 80);\n printf(\"%g\\n\", (double)dequeue(&coll));\n printf(\"%g\\n\", (double)dequeue(&coll));\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1121, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, int value) { q->items[q->rear++] = value; }\nint dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue buf = { .front = 0, .rear = 0 };\n enqueue(&buf, 6);\n printf(\"%g\\n\", (double)dequeue(&buf));\n enqueue(&buf, 20);\n enqueue(&buf, 76);\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1122, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, int value) { q->items[q->rear++] = value; }\nint dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue q = { .front = 0, .rear = 0 };\n enqueue(&q, 14);\n printf(\"%g\\n\", (double)dequeue(&q));\n enqueue(&q, 28);\n enqueue(&q, 41);\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1123, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, int value) { q->items[q->rear++] = value; }\nint dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue container = { .front = 0, .rear = 0 };\n enqueue(&container, 92);\n printf(\"%g\\n\", (double)dequeue(&container));\n enqueue(&container, 95);\n enqueue(&container, 66);\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1124, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "#include \n#define MAX 100\n\ntypedef struct { int items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, int value) { q->items[q->rear++] = value; }\nint dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue container = { .front = 0, .rear = 0 };\n enqueue(&container, 92);\n printf(\"%g\\n\", (double)dequeue(&container));\n enqueue(&container, 28);\n enqueue(&container, 49);\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1125, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, double value) { q->items[q->rear++] = value; }\ndouble dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue container = { .front = 0, .rear = 0 };\n enqueue(&container, 4.23);\n enqueue(&container, 72.9);\n enqueue(&container, 38.73);\n printf(\"%g\\n\", (double)dequeue(&container));\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1126, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, double value) { q->items[q->rear++] = value; }\ndouble dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue q = { .front = 0, .rear = 0 };\n enqueue(&q, 95.56);\n enqueue(&q, 95.9);\n enqueue(&q, 99.24);\n printf(\"%g\\n\", (double)dequeue(&q));\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1127, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, double value) { q->items[q->rear++] = value; }\ndouble dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue container = { .front = 0, .rear = 0 };\n enqueue(&container, 63.4);\n enqueue(&container, 73.66);\n enqueue(&container, 54.36);\n printf(\"%g\\n\", (double)dequeue(&container));\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1128, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, double value) { q->items[q->rear++] = value; }\ndouble dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue container = { .front = 0, .rear = 0 };\n enqueue(&container, 80.02);\n enqueue(&container, 61.1);\n enqueue(&container, 66.26);\n printf(\"%g\\n\", (double)dequeue(&container));\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1129, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, double value) { q->items[q->rear++] = value; }\ndouble dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue buf = { .front = 0, .rear = 0 };\n enqueue(&buf, 27.65);\n enqueue(&buf, 83.76);\n printf(\"%g\\n\", (double)dequeue(&buf));\n enqueue(&buf, 25.16);\n printf(\"%g\\n\", (double)dequeue(&buf));\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1130, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, double value) { q->items[q->rear++] = value; }\ndouble dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue buf = { .front = 0, .rear = 0 };\n enqueue(&buf, 23.86);\n enqueue(&buf, 32.17);\n printf(\"%g\\n\", (double)dequeue(&buf));\n enqueue(&buf, 69.61);\n printf(\"%g\\n\", (double)dequeue(&buf));\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1131, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, double value) { q->items[q->rear++] = value; }\ndouble dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue box_ = { .front = 0, .rear = 0 };\n enqueue(&box_, 36.83);\n enqueue(&box_, 35.85);\n printf(\"%g\\n\", (double)dequeue(&box_));\n enqueue(&box_, 91.55);\n printf(\"%g\\n\", (double)dequeue(&box_));\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1132, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, double value) { q->items[q->rear++] = value; }\ndouble dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue container = { .front = 0, .rear = 0 };\n enqueue(&container, 23.8);\n enqueue(&container, 78.84);\n printf(\"%g\\n\", (double)dequeue(&container));\n enqueue(&container, 82.95);\n printf(\"%g\\n\", (double)dequeue(&container));\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1133, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, double value) { q->items[q->rear++] = value; }\ndouble dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue container = { .front = 0, .rear = 0 };\n enqueue(&container, 25.25);\n enqueue(&container, 91.02);\n enqueue(&container, 67.74);\n enqueue(&container, 66.92);\n printf(\"%g\\n\", (double)dequeue(&container));\n printf(\"%g\\n\", (double)dequeue(&container));\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1134, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, double value) { q->items[q->rear++] = value; }\ndouble dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue buf = { .front = 0, .rear = 0 };\n enqueue(&buf, 32.07);\n enqueue(&buf, 9.07);\n enqueue(&buf, 42.68);\n enqueue(&buf, 98.34);\n printf(\"%g\\n\", (double)dequeue(&buf));\n printf(\"%g\\n\", (double)dequeue(&buf));\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1135, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, double value) { q->items[q->rear++] = value; }\ndouble dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue s = { .front = 0, .rear = 0 };\n enqueue(&s, 90.09);\n enqueue(&s, 87.76);\n enqueue(&s, 2.54);\n enqueue(&s, 12.96);\n printf(\"%g\\n\", (double)dequeue(&s));\n printf(\"%g\\n\", (double)dequeue(&s));\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1136, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, double value) { q->items[q->rear++] = value; }\ndouble dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue box_ = { .front = 0, .rear = 0 };\n enqueue(&box_, 74.54);\n enqueue(&box_, 13.51);\n enqueue(&box_, 4.37);\n enqueue(&box_, 43.71);\n printf(\"%g\\n\", (double)dequeue(&box_));\n printf(\"%g\\n\", (double)dequeue(&box_));\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1137, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, double value) { q->items[q->rear++] = value; }\ndouble dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue s = { .front = 0, .rear = 0 };\n enqueue(&s, 51.97);\n printf(\"%g\\n\", (double)dequeue(&s));\n enqueue(&s, 39.42);\n enqueue(&s, 42.81);\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1138, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, double value) { q->items[q->rear++] = value; }\ndouble dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue s = { .front = 0, .rear = 0 };\n enqueue(&s, 40.83);\n printf(\"%g\\n\", (double)dequeue(&s));\n enqueue(&s, 71.49);\n enqueue(&s, 12.78);\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1139, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, double value) { q->items[q->rear++] = value; }\ndouble dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue buf = { .front = 0, .rear = 0 };\n enqueue(&buf, 59.56);\n printf(\"%g\\n\", (double)dequeue(&buf));\n enqueue(&buf, 99.42);\n enqueue(&buf, 5.48);\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1140, "language": "C", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "#include \n#define MAX 100\n\ntypedef struct { double items[MAX]; int front, rear; } Queue;\n\nvoid enqueue(Queue* q, double value) { q->items[q->rear++] = value; }\ndouble dequeue(Queue* q) { return q->items[q->front++]; }\n\nint main(void) {\n Queue coll = { .front = 0, .rear = 0 };\n enqueue(&coll, 92.15);\n printf(\"%g\\n\", (double)dequeue(&coll));\n enqueue(&coll, 91.16);\n enqueue(&coll, 63.45);\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1141, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "#include \n#include \n\nint main() {\n std::queue coll;\n coll.push(56);\n coll.push(38);\n coll.push(97);\n std::cout << coll.front() << std::endl; coll.pop();\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1142, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "#include \n#include \n\nint main() {\n std::queue coll;\n coll.push(18);\n coll.push(94);\n coll.push(24);\n std::cout << coll.front() << std::endl; coll.pop();\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1143, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "#include \n#include \n\nint main() {\n std::queue container;\n container.push(66);\n container.push(11);\n container.push(20);\n std::cout << container.front() << std::endl; container.pop();\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1144, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "#include \n#include \n\nint main() {\n std::queue container;\n container.push(76);\n container.push(48);\n container.push(87);\n std::cout << container.front() << std::endl; container.pop();\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1145, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#include \n\nint main() {\n std::queue box_;\n box_.push(49);\n box_.push(42);\n std::cout << box_.front() << std::endl; box_.pop();\n box_.push(23);\n std::cout << box_.front() << std::endl; box_.pop();\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1146, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#include \n\nint main() {\n std::queue coll;\n coll.push(76);\n coll.push(36);\n std::cout << coll.front() << std::endl; coll.pop();\n coll.push(13);\n std::cout << coll.front() << std::endl; coll.pop();\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1147, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#include \n\nint main() {\n std::queue buf;\n buf.push(64);\n buf.push(44);\n std::cout << buf.front() << std::endl; buf.pop();\n buf.push(73);\n std::cout << buf.front() << std::endl; buf.pop();\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1148, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#include \n\nint main() {\n std::queue container;\n container.push(75);\n container.push(66);\n std::cout << container.front() << std::endl; container.pop();\n container.push(37);\n std::cout << container.front() << std::endl; container.pop();\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1149, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#include \n\nint main() {\n std::queue box_;\n box_.push(41);\n box_.push(97);\n box_.push(23);\n box_.push(19);\n std::cout << box_.front() << std::endl; box_.pop();\n std::cout << box_.front() << std::endl; box_.pop();\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1150, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#include \n\nint main() {\n std::queue coll;\n coll.push(27);\n coll.push(56);\n coll.push(67);\n coll.push(36);\n std::cout << coll.front() << std::endl; coll.pop();\n std::cout << coll.front() << std::endl; coll.pop();\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1151, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#include \n\nint main() {\n std::queue buf;\n buf.push(13);\n buf.push(45);\n buf.push(37);\n buf.push(22);\n std::cout << buf.front() << std::endl; buf.pop();\n std::cout << buf.front() << std::endl; buf.pop();\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1152, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#include \n\nint main() {\n std::queue buf;\n buf.push(63);\n buf.push(57);\n buf.push(29);\n buf.push(22);\n std::cout << buf.front() << std::endl; buf.pop();\n std::cout << buf.front() << std::endl; buf.pop();\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1153, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "#include \n#include \n\nint main() {\n std::queue container;\n container.push(97);\n std::cout << container.front() << std::endl; container.pop();\n container.push(30);\n container.push(86);\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1154, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "#include \n#include \n\nint main() {\n std::queue buf;\n buf.push(19);\n std::cout << buf.front() << std::endl; buf.pop();\n buf.push(27);\n buf.push(71);\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1155, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "#include \n#include \n\nint main() {\n std::queue container;\n container.push(97);\n std::cout << container.front() << std::endl; container.pop();\n container.push(4);\n container.push(77);\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1156, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "#include \n#include \n\nint main() {\n std::queue q;\n q.push(70);\n std::cout << q.front() << std::endl; q.pop();\n q.push(25);\n q.push(1);\n return 0;\n}", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1157, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "#include \n#include \n\nint main() {\n std::queue box_;\n box_.push(83.42);\n box_.push(3.55);\n box_.push(21.11);\n std::cout << box_.front() << std::endl; box_.pop();\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1158, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "#include \n#include \n\nint main() {\n std::queue container;\n container.push(43.22);\n container.push(45.04);\n container.push(13.49);\n std::cout << container.front() << std::endl; container.pop();\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1159, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "#include \n#include \n\nint main() {\n std::queue q;\n q.push(71.91);\n q.push(92.0);\n q.push(12.87);\n std::cout << q.front() << std::endl; q.pop();\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1160, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "#include \n#include \n\nint main() {\n std::queue box_;\n box_.push(27.04);\n box_.push(86.59);\n box_.push(99.31);\n std::cout << box_.front() << std::endl; box_.pop();\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1161, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#include \n\nint main() {\n std::queue q;\n q.push(96.88);\n q.push(80.56);\n std::cout << q.front() << std::endl; q.pop();\n q.push(23.02);\n std::cout << q.front() << std::endl; q.pop();\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1162, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#include \n\nint main() {\n std::queue s;\n s.push(51.2);\n s.push(28.33);\n std::cout << s.front() << std::endl; s.pop();\n s.push(51.77);\n std::cout << s.front() << std::endl; s.pop();\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1163, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#include \n\nint main() {\n std::queue coll;\n coll.push(69.11);\n coll.push(89.33);\n std::cout << coll.front() << std::endl; coll.pop();\n coll.push(10.94);\n std::cout << coll.front() << std::endl; coll.pop();\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1164, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "#include \n#include \n\nint main() {\n std::queue container;\n container.push(32.44);\n container.push(84.3);\n std::cout << container.front() << std::endl; container.pop();\n container.push(87.88);\n std::cout << container.front() << std::endl; container.pop();\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1165, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#include \n\nint main() {\n std::queue coll;\n coll.push(63.1);\n coll.push(25.35);\n coll.push(59.05);\n coll.push(87.34);\n std::cout << coll.front() << std::endl; coll.pop();\n std::cout << coll.front() << std::endl; coll.pop();\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1166, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#include \n\nint main() {\n std::queue box_;\n box_.push(15.99);\n box_.push(81.57);\n box_.push(73.62);\n box_.push(28.98);\n std::cout << box_.front() << std::endl; box_.pop();\n std::cout << box_.front() << std::endl; box_.pop();\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1167, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#include \n\nint main() {\n std::queue container;\n container.push(85.86);\n container.push(75.2);\n container.push(1.32);\n container.push(7.66);\n std::cout << container.front() << std::endl; container.pop();\n std::cout << container.front() << std::endl; container.pop();\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1168, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "#include \n#include \n\nint main() {\n std::queue s;\n s.push(4.84);\n s.push(69.11);\n s.push(61.72);\n s.push(63.47);\n std::cout << s.front() << std::endl; s.pop();\n std::cout << s.front() << std::endl; s.pop();\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1169, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "#include \n#include \n\nint main() {\n std::queue container;\n container.push(66.04);\n std::cout << container.front() << std::endl; container.pop();\n container.push(30.71);\n container.push(23.96);\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1170, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "#include \n#include \n\nint main() {\n std::queue buf;\n buf.push(67.13);\n std::cout << buf.front() << std::endl; buf.pop();\n buf.push(63.37);\n buf.push(60.19);\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1171, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "#include \n#include \n\nint main() {\n std::queue container;\n container.push(48.61);\n std::cout << container.front() << std::endl; container.pop();\n container.push(12.12);\n container.push(88.21);\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1172, "language": "C++", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "#include \n#include \n\nint main() {\n std::queue buf;\n buf.push(42.54);\n std::cout << buf.front() << std::endl; buf.pop();\n buf.push(25.49);\n buf.push(43.06);\n return 0;\n}", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1173, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut s: VecDeque = VecDeque::new();\n s.push_back(60);\n s.push_back(41);\n s.push_back(85);\n println!(\"{:?}\", s.pop_front());\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1174, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut buf: VecDeque = VecDeque::new();\n buf.push_back(90);\n buf.push_back(51);\n buf.push_back(91);\n println!(\"{:?}\", buf.pop_front());\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1175, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut box_: VecDeque = VecDeque::new();\n box_.push_back(63);\n box_.push_back(77);\n box_.push_back(53);\n println!(\"{:?}\", box_.pop_front());\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1176, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, pop.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut s: VecDeque = VecDeque::new();\n s.push_back(4);\n s.push_back(38);\n s.push_back(35);\n println!(\"{:?}\", s.pop_front());\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1177, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut s: VecDeque = VecDeque::new();\n s.push_back(53);\n s.push_back(8);\n println!(\"{:?}\", s.pop_front());\n s.push_back(99);\n println!(\"{:?}\", s.pop_front());\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1178, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut buf: VecDeque = VecDeque::new();\n buf.push_back(87);\n buf.push_back(41);\n println!(\"{:?}\", buf.pop_front());\n buf.push_back(51);\n println!(\"{:?}\", buf.pop_front());\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1179, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut box_: VecDeque = VecDeque::new();\n box_.push_back(52);\n box_.push_back(34);\n println!(\"{:?}\", box_.pop_front());\n box_.push_back(35);\n println!(\"{:?}\", box_.pop_front());\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1180, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, pop, push, pop.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut coll: VecDeque = VecDeque::new();\n coll.push_back(29);\n coll.push_back(44);\n println!(\"{:?}\", coll.pop_front());\n coll.push_back(6);\n println!(\"{:?}\", coll.pop_front());\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1181, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut box_: VecDeque = VecDeque::new();\n box_.push_back(53);\n box_.push_back(29);\n box_.push_back(74);\n box_.push_back(22);\n println!(\"{:?}\", box_.pop_front());\n println!(\"{:?}\", box_.pop_front());\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1182, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut coll: VecDeque = VecDeque::new();\n coll.push_back(15);\n coll.push_back(79);\n coll.push_back(79);\n coll.push_back(43);\n println!(\"{:?}\", coll.pop_front());\n println!(\"{:?}\", coll.pop_front());\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1183, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut container: VecDeque = VecDeque::new();\n container.push_back(3);\n container.push_back(93);\n container.push_back(3);\n container.push_back(49);\n println!(\"{:?}\", container.pop_front());\n println!(\"{:?}\", container.pop_front());\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1184, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, push, push, push, pop, pop.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut coll: VecDeque = VecDeque::new();\n coll.push_back(43);\n coll.push_back(46);\n coll.push_back(99);\n coll.push_back(99);\n println!(\"{:?}\", coll.pop_front());\n println!(\"{:?}\", coll.pop_front());\n}", "explanation": "Queue with int elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1185, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut coll: VecDeque = VecDeque::new();\n coll.push_back(7);\n println!(\"{:?}\", coll.pop_front());\n coll.push_back(27);\n coll.push_back(47);\n}", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1186, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut container: VecDeque = VecDeque::new();\n container.push_back(26);\n println!(\"{:?}\", container.pop_front());\n container.push_back(69);\n container.push_back(51);\n}", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1187, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut coll: VecDeque = VecDeque::new();\n coll.push_back(30);\n println!(\"{:?}\", coll.pop_front());\n coll.push_back(21);\n coll.push_back(48);\n}", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1188, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of ints and run the operation sequence: push, pop, push, push.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut buf: VecDeque = VecDeque::new();\n buf.push_back(53);\n println!(\"{:?}\", buf.pop_front());\n buf.push_back(71);\n buf.push_back(94);\n}", "explanation": "Queue with int elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1189, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut s: VecDeque = VecDeque::new();\n s.push_back(94.06);\n s.push_back(4.57);\n s.push_back(2.98);\n println!(\"{:?}\", s.pop_front());\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1190, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut q: VecDeque = VecDeque::new();\n q.push_back(50.65);\n q.push_back(79.34);\n q.push_back(5.19);\n println!(\"{:?}\", q.pop_front());\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1191, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut q: VecDeque = VecDeque::new();\n q.push_back(23.77);\n q.push_back(77.47);\n q.push_back(25.48);\n println!(\"{:?}\", q.pop_front());\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1192, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, pop.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut q: VecDeque = VecDeque::new();\n q.push_back(81.49);\n q.push_back(38.41);\n q.push_back(40.67);\n println!(\"{:?}\", q.pop_front());\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'pop']."} {"id": 1193, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut buf: VecDeque = VecDeque::new();\n buf.push_back(86.34);\n buf.push_back(8.58);\n println!(\"{:?}\", buf.pop_front());\n buf.push_back(70.65);\n println!(\"{:?}\", buf.pop_front());\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1194, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut q: VecDeque = VecDeque::new();\n q.push_back(2.46);\n q.push_back(83.19);\n println!(\"{:?}\", q.pop_front());\n q.push_back(16.03);\n println!(\"{:?}\", q.pop_front());\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1195, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut box_: VecDeque = VecDeque::new();\n box_.push_back(20.23);\n box_.push_back(60.96);\n println!(\"{:?}\", box_.pop_front());\n box_.push_back(33.05);\n println!(\"{:?}\", box_.pop_front());\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1196, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, pop, push, pop.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut q: VecDeque = VecDeque::new();\n q.push_back(30.91);\n q.push_back(46.43);\n println!(\"{:?}\", q.pop_front());\n q.push_back(96.96);\n println!(\"{:?}\", q.pop_front());\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'pop', 'push', 'pop']."} {"id": 1197, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut box_: VecDeque = VecDeque::new();\n box_.push_back(29.83);\n box_.push_back(10.21);\n box_.push_back(96.72);\n box_.push_back(56.54);\n println!(\"{:?}\", box_.pop_front());\n println!(\"{:?}\", box_.pop_front());\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1198, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut container: VecDeque = VecDeque::new();\n container.push_back(51.15);\n container.push_back(38.86);\n container.push_back(99.32);\n container.push_back(73.03);\n println!(\"{:?}\", container.pop_front());\n println!(\"{:?}\", container.pop_front());\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1199, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut coll: VecDeque = VecDeque::new();\n coll.push_back(11.72);\n coll.push_back(23.18);\n coll.push_back(97.54);\n coll.push_back(40.34);\n println!(\"{:?}\", coll.pop_front());\n println!(\"{:?}\", coll.pop_front());\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1200, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, push, push, push, pop, pop.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut container: VecDeque = VecDeque::new();\n container.push_back(11.79);\n container.push_back(31.75);\n container.push_back(15.23);\n container.push_back(63.36);\n println!(\"{:?}\", container.pop_front());\n println!(\"{:?}\", container.pop_front());\n}", "explanation": "Queue with float elements, ops=['push', 'push', 'push', 'push', 'pop', 'pop']."} {"id": 1201, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut s: VecDeque = VecDeque::new();\n s.push_back(86.62);\n println!(\"{:?}\", s.pop_front());\n s.push_back(25.75);\n s.push_back(14.99);\n}", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1202, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut container: VecDeque = VecDeque::new();\n container.push_back(83.97);\n println!(\"{:?}\", container.pop_front());\n container.push_back(84.13);\n container.push_back(76.3);\n}", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1203, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut q: VecDeque = VecDeque::new();\n q.push_back(76.97);\n println!(\"{:?}\", q.pop_front());\n q.push_back(31.83);\n q.push_back(34.45);\n}", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1204, "language": "Rust", "category": "Data Structures", "difficulty": "intermediate", "task_description": "Implement a queue of floats and run the operation sequence: push, pop, push, push.", "code": "use std::collections::VecDeque;\n\nfn main() {\n let mut s: VecDeque = VecDeque::new();\n s.push_back(4.61);\n println!(\"{:?}\", s.pop_front());\n s.push_back(60.27);\n s.push_back(87.27);\n}", "explanation": "Queue with float elements, ops=['push', 'pop', 'push', 'push']."} {"id": 1205, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"racecar\".", "code": "def compute_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(compute_palindrome('racecar'))", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1206, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"racecar\".", "code": "def perform_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(perform_palindrome('racecar'))", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1207, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"hello world\".", "code": "def handle_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(handle_palindrome('hello world'))", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1208, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"hello world\".", "code": "def apply_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(apply_palindrome('hello world'))", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1209, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"A man a plan a canal Panama\".", "code": "def execute_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(execute_palindrome('A man a plan a canal Panama'))", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1210, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"A man a plan a canal Panama\".", "code": "def apply_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(apply_palindrome('A man a plan a canal Panama'))", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1211, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"Rust is fun\".", "code": "def run_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(run_palindrome('Rust is fun'))", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1212, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"Rust is fun\".", "code": "def execute_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(execute_palindrome('Rust is fun'))", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1213, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"level\".", "code": "def run_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(run_palindrome('level'))", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1214, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"level\".", "code": "def compute_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(compute_palindrome('level'))", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1215, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"OpenAI Claude\".", "code": "def perform_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(perform_palindrome('OpenAI Claude'))", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1216, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"OpenAI Claude\".", "code": "def handle_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(handle_palindrome('OpenAI Claude'))", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1217, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"was it a car or a cat i saw\".", "code": "def compute_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(compute_palindrome('was it a car or a cat i saw'))", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1218, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"was it a car or a cat i saw\".", "code": "def run_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(run_palindrome('was it a car or a cat i saw'))", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1219, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"noon\".", "code": "def perform_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(perform_palindrome('noon'))", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1220, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"noon\".", "code": "def run_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(run_palindrome('noon'))", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1221, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"data science\".", "code": "def execute_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(execute_palindrome('data science'))", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1222, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"step on no pets\".", "code": "def apply_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(apply_palindrome('step on no pets'))", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1223, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"step on no pets\".", "code": "def perform_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(perform_palindrome('step on no pets'))", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1224, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"coding\".", "code": "def perform_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(perform_palindrome('coding'))", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1225, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"coding\".", "code": "def process_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(process_palindrome('coding'))", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1226, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"madam im adam\".", "code": "def process_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(process_palindrome('madam im adam'))", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1227, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"madam im adam\".", "code": "def run_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(run_palindrome('madam im adam'))", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1228, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"kayak\".", "code": "def perform_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(perform_palindrome('kayak'))", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1229, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"kayak\".", "code": "def process_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(process_palindrome('kayak'))", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1230, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"the quick brown fox\".", "code": "def run_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(run_palindrome('the quick brown fox'))", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1231, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"the quick brown fox\".", "code": "def handle_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(handle_palindrome('the quick brown fox'))", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1232, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"civic\".", "code": "def apply_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(apply_palindrome('civic'))", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1233, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"civic\".", "code": "def process_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(process_palindrome('civic'))", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1234, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"never odd or even\".", "code": "def handle_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(handle_palindrome('never odd or even'))", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1235, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"never odd or even\".", "code": "def execute_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(execute_palindrome('never odd or even'))", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1236, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"python programming\".", "code": "def perform_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(perform_palindrome('python programming'))", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1237, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"python programming\".", "code": "def process_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(process_palindrome('python programming'))", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1238, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"deified\".", "code": "def handle_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(handle_palindrome('deified'))", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1239, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"algorithms and data structures\".", "code": "def run_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(run_palindrome('algorithms and data structures'))", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1240, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"algorithms and data structures\".", "code": "def apply_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(apply_palindrome('algorithms and data structures'))", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1241, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"rotor\".", "code": "def process_palindrome(s):\n cleaned = s.lower().replace(\" \", \"\")\n return cleaned == cleaned[::-1]\n\nprint(process_palindrome('rotor'))", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1242, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"racecar\".", "code": "function run_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(run_palindrome(\"racecar\"));", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1243, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"hello world\".", "code": "function handle_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(handle_palindrome(\"hello world\"));", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1244, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"hello world\".", "code": "function perform_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(perform_palindrome(\"hello world\"));", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1245, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"A man a plan a canal Panama\".", "code": "function apply_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(apply_palindrome(\"A man a plan a canal Panama\"));", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1246, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"A man a plan a canal Panama\".", "code": "function execute_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(execute_palindrome(\"A man a plan a canal Panama\"));", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1247, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"Rust is fun\".", "code": "function run_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(run_palindrome(\"Rust is fun\"));", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1248, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"Rust is fun\".", "code": "function handle_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(handle_palindrome(\"Rust is fun\"));", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1249, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"level\".", "code": "function perform_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(perform_palindrome(\"level\"));", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1250, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"level\".", "code": "function apply_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(apply_palindrome(\"level\"));", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1251, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"OpenAI Claude\".", "code": "function execute_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(execute_palindrome(\"OpenAI Claude\"));", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1252, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"OpenAI Claude\".", "code": "function run_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(run_palindrome(\"OpenAI Claude\"));", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1253, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"was it a car or a cat i saw\".", "code": "function run_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(run_palindrome(\"was it a car or a cat i saw\"));", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1254, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"was it a car or a cat i saw\".", "code": "function process_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(process_palindrome(\"was it a car or a cat i saw\"));", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1255, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"noon\".", "code": "function compute_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(compute_palindrome(\"noon\"));", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1256, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"noon\".", "code": "function process_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(process_palindrome(\"noon\"));", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1257, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"data science\".", "code": "function run_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(run_palindrome(\"data science\"));", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1258, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"data science\".", "code": "function compute_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(compute_palindrome(\"data science\"));", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1259, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"step on no pets\".", "code": "function perform_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(perform_palindrome(\"step on no pets\"));", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1260, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"coding\".", "code": "function compute_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(compute_palindrome(\"coding\"));", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1261, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"coding\".", "code": "function execute_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(execute_palindrome(\"coding\"));", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1262, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"madam im adam\".", "code": "function compute_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(compute_palindrome(\"madam im adam\"));", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1263, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"madam im adam\".", "code": "function execute_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(execute_palindrome(\"madam im adam\"));", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1264, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"kayak\".", "code": "function compute_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(compute_palindrome(\"kayak\"));", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1265, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"kayak\".", "code": "function execute_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(execute_palindrome(\"kayak\"));", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1266, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"the quick brown fox\".", "code": "function perform_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(perform_palindrome(\"the quick brown fox\"));", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1267, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"the quick brown fox\".", "code": "function handle_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(handle_palindrome(\"the quick brown fox\"));", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1268, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"civic\".", "code": "function handle_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(handle_palindrome(\"civic\"));", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1269, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"civic\".", "code": "function compute_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(compute_palindrome(\"civic\"));", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1270, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"never odd or even\".", "code": "function execute_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(execute_palindrome(\"never odd or even\"));", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1271, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"never odd or even\".", "code": "function perform_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(perform_palindrome(\"never odd or even\"));", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1272, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"python programming\".", "code": "function handle_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(handle_palindrome(\"python programming\"));", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1273, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"python programming\".", "code": "function apply_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(apply_palindrome(\"python programming\"));", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1274, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"deified\".", "code": "function execute_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(execute_palindrome(\"deified\"));", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1275, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"deified\".", "code": "function perform_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(perform_palindrome(\"deified\"));", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1276, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"algorithms and data structures\".", "code": "function compute_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(compute_palindrome(\"algorithms and data structures\"));", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1277, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"algorithms and data structures\".", "code": "function execute_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(execute_palindrome(\"algorithms and data structures\"));", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1278, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"rotor\".", "code": "function execute_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(execute_palindrome(\"rotor\"));", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1279, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"rotor\".", "code": "function compute_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(compute_palindrome(\"rotor\"));", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1280, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"racecar\".", "code": "function run_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { run_palindrome };\nconsole.log(run_palindrome(\"racecar\"));", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1281, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"hello world\".", "code": "function handle_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { handle_palindrome };\nconsole.log(handle_palindrome(\"hello world\"));", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1282, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"hello world\".", "code": "function compute_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { compute_palindrome };\nconsole.log(compute_palindrome(\"hello world\"));", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1283, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"A man a plan a canal Panama\".", "code": "function perform_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { perform_palindrome };\nconsole.log(perform_palindrome(\"A man a plan a canal Panama\"));", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1284, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"Rust is fun\".", "code": "function apply_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { apply_palindrome };\nconsole.log(apply_palindrome(\"Rust is fun\"));", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1285, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"Rust is fun\".", "code": "function handle_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { handle_palindrome };\nconsole.log(handle_palindrome(\"Rust is fun\"));", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1286, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"level\".", "code": "function handle_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { handle_palindrome };\nconsole.log(handle_palindrome(\"level\"));", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1287, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"level\".", "code": "function execute_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { execute_palindrome };\nconsole.log(execute_palindrome(\"level\"));", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1288, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"OpenAI Claude\".", "code": "function perform_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { perform_palindrome };\nconsole.log(perform_palindrome(\"OpenAI Claude\"));", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1289, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"OpenAI Claude\".", "code": "function apply_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { apply_palindrome };\nconsole.log(apply_palindrome(\"OpenAI Claude\"));", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1290, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"was it a car or a cat i saw\".", "code": "function run_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { run_palindrome };\nconsole.log(run_palindrome(\"was it a car or a cat i saw\"));", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1291, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"was it a car or a cat i saw\".", "code": "function process_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { process_palindrome };\nconsole.log(process_palindrome(\"was it a car or a cat i saw\"));", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1292, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"noon\".", "code": "function compute_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { compute_palindrome };\nconsole.log(compute_palindrome(\"noon\"));", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1293, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"noon\".", "code": "function run_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { run_palindrome };\nconsole.log(run_palindrome(\"noon\"));", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1294, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"data science\".", "code": "function handle_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { handle_palindrome };\nconsole.log(handle_palindrome(\"data science\"));", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1295, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"step on no pets\".", "code": "function run_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { run_palindrome };\nconsole.log(run_palindrome(\"step on no pets\"));", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1296, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"step on no pets\".", "code": "function process_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { process_palindrome };\nconsole.log(process_palindrome(\"step on no pets\"));", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1297, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"coding\".", "code": "function process_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { process_palindrome };\nconsole.log(process_palindrome(\"coding\"));", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1298, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"coding\".", "code": "function compute_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { compute_palindrome };\nconsole.log(compute_palindrome(\"coding\"));", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1299, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"madam im adam\".", "code": "function perform_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { perform_palindrome };\nconsole.log(perform_palindrome(\"madam im adam\"));", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1300, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"madam im adam\".", "code": "function handle_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { handle_palindrome };\nconsole.log(handle_palindrome(\"madam im adam\"));", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1301, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"kayak\".", "code": "function handle_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { handle_palindrome };\nconsole.log(handle_palindrome(\"kayak\"));", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1302, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"kayak\".", "code": "function perform_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { perform_palindrome };\nconsole.log(perform_palindrome(\"kayak\"));", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1303, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"the quick brown fox\".", "code": "function process_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { process_palindrome };\nconsole.log(process_palindrome(\"the quick brown fox\"));", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1304, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"the quick brown fox\".", "code": "function execute_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { execute_palindrome };\nconsole.log(execute_palindrome(\"the quick brown fox\"));", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1305, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"civic\".", "code": "function run_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { run_palindrome };\nconsole.log(run_palindrome(\"civic\"));", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1306, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"civic\".", "code": "function compute_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { compute_palindrome };\nconsole.log(compute_palindrome(\"civic\"));", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1307, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"never odd or even\".", "code": "function process_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { process_palindrome };\nconsole.log(process_palindrome(\"never odd or even\"));", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1308, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"python programming\".", "code": "function execute_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { execute_palindrome };\nconsole.log(execute_palindrome(\"python programming\"));", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1309, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"python programming\".", "code": "function run_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { run_palindrome };\nconsole.log(run_palindrome(\"python programming\"));", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1310, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"deified\".", "code": "function execute_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { execute_palindrome };\nconsole.log(execute_palindrome(\"deified\"));", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1311, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"deified\".", "code": "function handle_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { handle_palindrome };\nconsole.log(handle_palindrome(\"deified\"));", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1312, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"algorithms and data structures\".", "code": "function process_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { process_palindrome };\nconsole.log(process_palindrome(\"algorithms and data structures\"));", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1313, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"algorithms and data structures\".", "code": "function compute_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { compute_palindrome };\nconsole.log(compute_palindrome(\"algorithms and data structures\"));", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1314, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"rotor\".", "code": "function perform_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { perform_palindrome };\nconsole.log(perform_palindrome(\"rotor\"));", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1315, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"rotor\".", "code": "function execute_palindrome(s) {\n const cleaned = s.toLowerCase().replaceAll(\" \", \"\");\n return cleaned === cleaned.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { execute_palindrome };\nconsole.log(execute_palindrome(\"rotor\"));", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1316, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"racecar\".", "code": "public class Main {\n static boolean handle_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(handle_palindrome(\"racecar\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1317, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"racecar\".", "code": "public class Main {\n static boolean compute_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(compute_palindrome(\"racecar\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1318, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"hello world\".", "code": "public class Main {\n static boolean perform_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(perform_palindrome(\"hello world\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1319, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"hello world\".", "code": "public class Main {\n static boolean process_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(process_palindrome(\"hello world\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1320, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"A man a plan a canal Panama\".", "code": "public class Main {\n static boolean handle_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(handle_palindrome(\"A man a plan a canal Panama\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1321, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"A man a plan a canal Panama\".", "code": "public class Main {\n static boolean compute_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(compute_palindrome(\"A man a plan a canal Panama\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1322, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"Rust is fun\".", "code": "public class Main {\n static boolean compute_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(compute_palindrome(\"Rust is fun\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1323, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"Rust is fun\".", "code": "public class Main {\n static boolean apply_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(apply_palindrome(\"Rust is fun\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1324, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"level\".", "code": "public class Main {\n static boolean apply_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(apply_palindrome(\"level\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1325, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"level\".", "code": "public class Main {\n static boolean run_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(run_palindrome(\"level\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1326, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"OpenAI Claude\".", "code": "public class Main {\n static boolean execute_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(execute_palindrome(\"OpenAI Claude\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1327, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"OpenAI Claude\".", "code": "public class Main {\n static boolean perform_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(perform_palindrome(\"OpenAI Claude\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1328, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"was it a car or a cat i saw\".", "code": "public class Main {\n static boolean compute_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(compute_palindrome(\"was it a car or a cat i saw\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1329, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"noon\".", "code": "public class Main {\n static boolean execute_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(execute_palindrome(\"noon\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1330, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"noon\".", "code": "public class Main {\n static boolean apply_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(apply_palindrome(\"noon\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1331, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"data science\".", "code": "public class Main {\n static boolean run_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(run_palindrome(\"data science\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1332, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"data science\".", "code": "public class Main {\n static boolean compute_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(compute_palindrome(\"data science\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1333, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"step on no pets\".", "code": "public class Main {\n static boolean execute_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(execute_palindrome(\"step on no pets\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1334, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"coding\".", "code": "public class Main {\n static boolean perform_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(perform_palindrome(\"coding\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1335, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"madam im adam\".", "code": "public class Main {\n static boolean handle_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(handle_palindrome(\"madam im adam\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1336, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"madam im adam\".", "code": "public class Main {\n static boolean process_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(process_palindrome(\"madam im adam\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1337, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"kayak\".", "code": "public class Main {\n static boolean execute_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(execute_palindrome(\"kayak\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1338, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"kayak\".", "code": "public class Main {\n static boolean handle_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(handle_palindrome(\"kayak\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1339, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"the quick brown fox\".", "code": "public class Main {\n static boolean process_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(process_palindrome(\"the quick brown fox\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1340, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"the quick brown fox\".", "code": "public class Main {\n static boolean perform_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(perform_palindrome(\"the quick brown fox\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1341, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"civic\".", "code": "public class Main {\n static boolean handle_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(handle_palindrome(\"civic\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1342, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"civic\".", "code": "public class Main {\n static boolean compute_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(compute_palindrome(\"civic\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1343, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"never odd or even\".", "code": "public class Main {\n static boolean handle_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(handle_palindrome(\"never odd or even\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1344, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"never odd or even\".", "code": "public class Main {\n static boolean compute_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(compute_palindrome(\"never odd or even\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1345, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"python programming\".", "code": "public class Main {\n static boolean execute_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(execute_palindrome(\"python programming\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1346, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"python programming\".", "code": "public class Main {\n static boolean process_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(process_palindrome(\"python programming\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1347, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"deified\".", "code": "public class Main {\n static boolean handle_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(handle_palindrome(\"deified\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1348, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"deified\".", "code": "public class Main {\n static boolean apply_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(apply_palindrome(\"deified\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1349, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"algorithms and data structures\".", "code": "public class Main {\n static boolean execute_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(execute_palindrome(\"algorithms and data structures\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1350, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"rotor\".", "code": "public class Main {\n static boolean perform_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(perform_palindrome(\"rotor\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1351, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"rotor\".", "code": "public class Main {\n static boolean apply_palindrome(String s) {\n String cleaned = s.toLowerCase().replace(\" \", \"\");\n return cleaned.equals(new StringBuilder(cleaned).reverse().toString());\n }\n\n public static void main(String[] args) {\n System.out.println(apply_palindrome(\"rotor\"));\n }\n}", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1352, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"racecar\".", "code": "#include \n#include \n\nint run_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", run_palindrome(\"racecar\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1353, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"racecar\".", "code": "#include \n#include \n\nint compute_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", compute_palindrome(\"racecar\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1354, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"hello world\".", "code": "#include \n#include \n\nint execute_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", execute_palindrome(\"hello world\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1355, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"hello world\".", "code": "#include \n#include \n\nint apply_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", apply_palindrome(\"hello world\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1356, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"A man a plan a canal Panama\".", "code": "#include \n#include \n\nint apply_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", apply_palindrome(\"A man a plan a canal Panama\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1357, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"A man a plan a canal Panama\".", "code": "#include \n#include \n\nint execute_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", execute_palindrome(\"A man a plan a canal Panama\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1358, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"Rust is fun\".", "code": "#include \n#include \n\nint execute_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", execute_palindrome(\"Rust is fun\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1359, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"Rust is fun\".", "code": "#include \n#include \n\nint compute_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", compute_palindrome(\"Rust is fun\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1360, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"level\".", "code": "#include \n#include \n\nint apply_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", apply_palindrome(\"level\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1361, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"level\".", "code": "#include \n#include \n\nint perform_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", perform_palindrome(\"level\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1362, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"OpenAI Claude\".", "code": "#include \n#include \n\nint apply_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", apply_palindrome(\"OpenAI Claude\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1363, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"OpenAI Claude\".", "code": "#include \n#include \n\nint execute_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", execute_palindrome(\"OpenAI Claude\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1364, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"was it a car or a cat i saw\".", "code": "#include \n#include \n\nint perform_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", perform_palindrome(\"was it a car or a cat i saw\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1365, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"was it a car or a cat i saw\".", "code": "#include \n#include \n\nint run_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", run_palindrome(\"was it a car or a cat i saw\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1366, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"noon\".", "code": "#include \n#include \n\nint handle_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", handle_palindrome(\"noon\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1367, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"data science\".", "code": "#include \n#include \n\nint process_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", process_palindrome(\"data science\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1368, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"data science\".", "code": "#include \n#include \n\nint apply_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", apply_palindrome(\"data science\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1369, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"step on no pets\".", "code": "#include \n#include \n\nint handle_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", handle_palindrome(\"step on no pets\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1370, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"coding\".", "code": "#include \n#include \n\nint process_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", process_palindrome(\"coding\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1371, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"coding\".", "code": "#include \n#include \n\nint apply_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", apply_palindrome(\"coding\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1372, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"madam im adam\".", "code": "#include \n#include \n\nint execute_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", execute_palindrome(\"madam im adam\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1373, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"madam im adam\".", "code": "#include \n#include \n\nint handle_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", handle_palindrome(\"madam im adam\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1374, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"kayak\".", "code": "#include \n#include \n\nint handle_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", handle_palindrome(\"kayak\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1375, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"the quick brown fox\".", "code": "#include \n#include \n\nint run_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", run_palindrome(\"the quick brown fox\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1376, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"the quick brown fox\".", "code": "#include \n#include \n\nint apply_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", apply_palindrome(\"the quick brown fox\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1377, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"civic\".", "code": "#include \n#include \n\nint process_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", process_palindrome(\"civic\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1378, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"civic\".", "code": "#include \n#include \n\nint compute_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", compute_palindrome(\"civic\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1379, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"never odd or even\".", "code": "#include \n#include \n\nint process_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", process_palindrome(\"never odd or even\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1380, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"python programming\".", "code": "#include \n#include \n\nint handle_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", handle_palindrome(\"python programming\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1381, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"python programming\".", "code": "#include \n#include \n\nint execute_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", execute_palindrome(\"python programming\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1382, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"deified\".", "code": "#include \n#include \n\nint apply_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", apply_palindrome(\"deified\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1383, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"deified\".", "code": "#include \n#include \n\nint run_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", run_palindrome(\"deified\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1384, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"algorithms and data structures\".", "code": "#include \n#include \n\nint run_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", run_palindrome(\"algorithms and data structures\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1385, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"algorithms and data structures\".", "code": "#include \n#include \n\nint perform_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", perform_palindrome(\"algorithms and data structures\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1386, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"rotor\".", "code": "#include \n#include \n\nint run_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", run_palindrome(\"rotor\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1387, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"rotor\".", "code": "#include \n#include \n\nint compute_palindrome(const char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n if (s[i] != s[len - 1 - i]) return 0;\n }\n return 1;\n}\n\nint main(void) {\n printf(\"%d\\n\", compute_palindrome(\"rotor\"));\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1388, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"racecar\".", "code": "#include \n#include \n#include \n\nbool compute_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << compute_palindrome(\"racecar\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1389, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"racecar\".", "code": "#include \n#include \n#include \n\nbool execute_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << execute_palindrome(\"racecar\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1390, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"hello world\".", "code": "#include \n#include \n#include \n\nbool apply_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << apply_palindrome(\"hello world\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1391, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"hello world\".", "code": "#include \n#include \n#include \n\nbool process_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << process_palindrome(\"hello world\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1392, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"A man a plan a canal Panama\".", "code": "#include \n#include \n#include \n\nbool handle_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << handle_palindrome(\"A man a plan a canal Panama\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1393, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"A man a plan a canal Panama\".", "code": "#include \n#include \n#include \n\nbool execute_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << execute_palindrome(\"A man a plan a canal Panama\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1394, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"Rust is fun\".", "code": "#include \n#include \n#include \n\nbool run_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << run_palindrome(\"Rust is fun\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1395, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"level\".", "code": "#include \n#include \n#include \n\nbool apply_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << apply_palindrome(\"level\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1396, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"level\".", "code": "#include \n#include \n#include \n\nbool run_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << run_palindrome(\"level\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1397, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"OpenAI Claude\".", "code": "#include \n#include \n#include \n\nbool perform_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << perform_palindrome(\"OpenAI Claude\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1398, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"OpenAI Claude\".", "code": "#include \n#include \n#include \n\nbool run_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << run_palindrome(\"OpenAI Claude\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1399, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"was it a car or a cat i saw\".", "code": "#include \n#include \n#include \n\nbool compute_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << compute_palindrome(\"was it a car or a cat i saw\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1400, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"noon\".", "code": "#include \n#include \n#include \n\nbool apply_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << apply_palindrome(\"noon\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1401, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"noon\".", "code": "#include \n#include \n#include \n\nbool execute_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << execute_palindrome(\"noon\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1402, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"data science\".", "code": "#include \n#include \n#include \n\nbool compute_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << compute_palindrome(\"data science\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1403, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"data science\".", "code": "#include \n#include \n#include \n\nbool execute_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << execute_palindrome(\"data science\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1404, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"step on no pets\".", "code": "#include \n#include \n#include \n\nbool process_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << process_palindrome(\"step on no pets\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1405, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"step on no pets\".", "code": "#include \n#include \n#include \n\nbool execute_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << execute_palindrome(\"step on no pets\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1406, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"coding\".", "code": "#include \n#include \n#include \n\nbool apply_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << apply_palindrome(\"coding\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1407, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"coding\".", "code": "#include \n#include \n#include \n\nbool handle_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << handle_palindrome(\"coding\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1408, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"madam im adam\".", "code": "#include \n#include \n#include \n\nbool handle_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << handle_palindrome(\"madam im adam\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1409, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"madam im adam\".", "code": "#include \n#include \n#include \n\nbool perform_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << perform_palindrome(\"madam im adam\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1410, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"kayak\".", "code": "#include \n#include \n#include \n\nbool apply_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << apply_palindrome(\"kayak\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1411, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"kayak\".", "code": "#include \n#include \n#include \n\nbool compute_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << compute_palindrome(\"kayak\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1412, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"the quick brown fox\".", "code": "#include \n#include \n#include \n\nbool perform_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << perform_palindrome(\"the quick brown fox\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1413, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"the quick brown fox\".", "code": "#include \n#include \n#include \n\nbool handle_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << handle_palindrome(\"the quick brown fox\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1414, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"civic\".", "code": "#include \n#include \n#include \n\nbool apply_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << apply_palindrome(\"civic\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1415, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"civic\".", "code": "#include \n#include \n#include \n\nbool run_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << run_palindrome(\"civic\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1416, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"never odd or even\".", "code": "#include \n#include \n#include \n\nbool execute_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << execute_palindrome(\"never odd or even\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1417, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"never odd or even\".", "code": "#include \n#include \n#include \n\nbool run_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << run_palindrome(\"never odd or even\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1418, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"python programming\".", "code": "#include \n#include \n#include \n\nbool run_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << run_palindrome(\"python programming\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1419, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"python programming\".", "code": "#include \n#include \n#include \n\nbool perform_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << perform_palindrome(\"python programming\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1420, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"deified\".", "code": "#include \n#include \n#include \n\nbool apply_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << apply_palindrome(\"deified\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1421, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"deified\".", "code": "#include \n#include \n#include \n\nbool compute_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << compute_palindrome(\"deified\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1422, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"algorithms and data structures\".", "code": "#include \n#include \n#include \n\nbool perform_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << perform_palindrome(\"algorithms and data structures\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1423, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"algorithms and data structures\".", "code": "#include \n#include \n#include \n\nbool process_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << process_palindrome(\"algorithms and data structures\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1424, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"rotor\".", "code": "#include \n#include \n#include \n\nbool execute_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << execute_palindrome(\"rotor\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1425, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"rotor\".", "code": "#include \n#include \n#include \n\nbool run_palindrome(std::string s) {\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::string reversed(s.rbegin(), s.rend());\n return s == reversed;\n}\n\nint main() {\n std::cout << run_palindrome(\"rotor\") << std::endl;\n return 0;\n}", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1426, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"racecar\".", "code": "fn perform_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", perform_palindrome(\"racecar\"));\n}", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1427, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"racecar\".", "code": "fn compute_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", compute_palindrome(\"racecar\"));\n}", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1428, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"hello world\".", "code": "fn handle_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", handle_palindrome(\"hello world\"));\n}", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1429, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"hello world\".", "code": "fn process_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", process_palindrome(\"hello world\"));\n}", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1430, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"A man a plan a canal Panama\".", "code": "fn apply_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", apply_palindrome(\"A man a plan a canal Panama\"));\n}", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1431, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"A man a plan a canal Panama\".", "code": "fn compute_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", compute_palindrome(\"A man a plan a canal Panama\"));\n}", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1432, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"Rust is fun\".", "code": "fn apply_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", apply_palindrome(\"Rust is fun\"));\n}", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1433, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"Rust is fun\".", "code": "fn run_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", run_palindrome(\"Rust is fun\"));\n}", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1434, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"level\".", "code": "fn apply_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", apply_palindrome(\"level\"));\n}", "explanation": "Palindrome Check operation, function named 'apply_palindrome'."} {"id": 1435, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"level\".", "code": "fn perform_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", perform_palindrome(\"level\"));\n}", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1436, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"OpenAI Claude\".", "code": "fn compute_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", compute_palindrome(\"OpenAI Claude\"));\n}", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1437, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"OpenAI Claude\".", "code": "fn perform_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", perform_palindrome(\"OpenAI Claude\"));\n}", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1438, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"was it a car or a cat i saw\".", "code": "fn run_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", run_palindrome(\"was it a car or a cat i saw\"));\n}", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1439, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"was it a car or a cat i saw\".", "code": "fn handle_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", handle_palindrome(\"was it a car or a cat i saw\"));\n}", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1440, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"noon\".", "code": "fn execute_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", execute_palindrome(\"noon\"));\n}", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1441, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"data science\".", "code": "fn handle_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", handle_palindrome(\"data science\"));\n}", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1442, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"data science\".", "code": "fn run_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", run_palindrome(\"data science\"));\n}", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1443, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"step on no pets\".", "code": "fn compute_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", compute_palindrome(\"step on no pets\"));\n}", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1444, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"step on no pets\".", "code": "fn handle_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", handle_palindrome(\"step on no pets\"));\n}", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1445, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"coding\".", "code": "fn perform_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", perform_palindrome(\"coding\"));\n}", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1446, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"coding\".", "code": "fn process_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", process_palindrome(\"coding\"));\n}", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1447, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"madam im adam\".", "code": "fn handle_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", handle_palindrome(\"madam im adam\"));\n}", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1448, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"madam im adam\".", "code": "fn run_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", run_palindrome(\"madam im adam\"));\n}", "explanation": "Palindrome Check operation, function named 'run_palindrome'."} {"id": 1449, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"kayak\".", "code": "fn compute_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", compute_palindrome(\"kayak\"));\n}", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1450, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"kayak\".", "code": "fn execute_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", execute_palindrome(\"kayak\"));\n}", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1451, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"the quick brown fox\".", "code": "fn handle_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", handle_palindrome(\"the quick brown fox\"));\n}", "explanation": "Palindrome Check operation, function named 'handle_palindrome'."} {"id": 1452, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"the quick brown fox\".", "code": "fn process_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", process_palindrome(\"the quick brown fox\"));\n}", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1453, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"civic\".", "code": "fn execute_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", execute_palindrome(\"civic\"));\n}", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1454, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"civic\".", "code": "fn compute_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", compute_palindrome(\"civic\"));\n}", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1455, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"never odd or even\".", "code": "fn compute_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", compute_palindrome(\"never odd or even\"));\n}", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1456, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"never odd or even\".", "code": "fn process_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", process_palindrome(\"never odd or even\"));\n}", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1457, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"python programming\".", "code": "fn compute_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", compute_palindrome(\"python programming\"));\n}", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1458, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"deified\".", "code": "fn execute_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", execute_palindrome(\"deified\"));\n}", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1459, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"deified\".", "code": "fn process_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", process_palindrome(\"deified\"));\n}", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1460, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"algorithms and data structures\".", "code": "fn execute_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", execute_palindrome(\"algorithms and data structures\"));\n}", "explanation": "Palindrome Check operation, function named 'execute_palindrome'."} {"id": 1461, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"algorithms and data structures\".", "code": "fn compute_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", compute_palindrome(\"algorithms and data structures\"));\n}", "explanation": "Palindrome Check operation, function named 'compute_palindrome'."} {"id": 1462, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"rotor\".", "code": "fn process_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", process_palindrome(\"rotor\"));\n}", "explanation": "Palindrome Check operation, function named 'process_palindrome'."} {"id": 1463, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'palindrome check' on the string \"rotor\".", "code": "fn perform_palindrome(s: &str) -> bool {\n let cleaned: String = s.to_lowercase().chars().filter(|c| *c != ' ').collect();\n let reversed: String = cleaned.chars().rev().collect();\n cleaned == reversed\n}\n\nfn main() {\n println!(\"{}\", perform_palindrome(\"rotor\"));\n}", "explanation": "Palindrome Check operation, function named 'perform_palindrome'."} {"id": 1464, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"racecar\".", "code": "def compute_reverse(s):\n return s[::-1]\n\nprint(compute_reverse('racecar'))", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1465, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"racecar\".", "code": "def perform_reverse(s):\n return s[::-1]\n\nprint(perform_reverse('racecar'))", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1466, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"hello world\".", "code": "def run_reverse(s):\n return s[::-1]\n\nprint(run_reverse('hello world'))", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1467, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"A man a plan a canal Panama\".", "code": "def process_reverse(s):\n return s[::-1]\n\nprint(process_reverse('A man a plan a canal Panama'))", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1468, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"A man a plan a canal Panama\".", "code": "def perform_reverse(s):\n return s[::-1]\n\nprint(perform_reverse('A man a plan a canal Panama'))", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1469, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"Rust is fun\".", "code": "def perform_reverse(s):\n return s[::-1]\n\nprint(perform_reverse('Rust is fun'))", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1470, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"Rust is fun\".", "code": "def compute_reverse(s):\n return s[::-1]\n\nprint(compute_reverse('Rust is fun'))", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1471, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"level\".", "code": "def compute_reverse(s):\n return s[::-1]\n\nprint(compute_reverse('level'))", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1472, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"level\".", "code": "def perform_reverse(s):\n return s[::-1]\n\nprint(perform_reverse('level'))", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1473, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"OpenAI Claude\".", "code": "def process_reverse(s):\n return s[::-1]\n\nprint(process_reverse('OpenAI Claude'))", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1474, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"OpenAI Claude\".", "code": "def execute_reverse(s):\n return s[::-1]\n\nprint(execute_reverse('OpenAI Claude'))", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1475, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"was it a car or a cat i saw\".", "code": "def apply_reverse(s):\n return s[::-1]\n\nprint(apply_reverse('was it a car or a cat i saw'))", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1476, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"was it a car or a cat i saw\".", "code": "def process_reverse(s):\n return s[::-1]\n\nprint(process_reverse('was it a car or a cat i saw'))", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1477, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"noon\".", "code": "def apply_reverse(s):\n return s[::-1]\n\nprint(apply_reverse('noon'))", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1478, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"noon\".", "code": "def perform_reverse(s):\n return s[::-1]\n\nprint(perform_reverse('noon'))", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1479, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"data science\".", "code": "def run_reverse(s):\n return s[::-1]\n\nprint(run_reverse('data science'))", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1480, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"data science\".", "code": "def execute_reverse(s):\n return s[::-1]\n\nprint(execute_reverse('data science'))", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1481, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"step on no pets\".", "code": "def perform_reverse(s):\n return s[::-1]\n\nprint(perform_reverse('step on no pets'))", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1482, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"step on no pets\".", "code": "def run_reverse(s):\n return s[::-1]\n\nprint(run_reverse('step on no pets'))", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1483, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"coding\".", "code": "def run_reverse(s):\n return s[::-1]\n\nprint(run_reverse('coding'))", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1484, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"coding\".", "code": "def handle_reverse(s):\n return s[::-1]\n\nprint(handle_reverse('coding'))", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1485, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"madam im adam\".", "code": "def run_reverse(s):\n return s[::-1]\n\nprint(run_reverse('madam im adam'))", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1486, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"madam im adam\".", "code": "def perform_reverse(s):\n return s[::-1]\n\nprint(perform_reverse('madam im adam'))", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1487, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"kayak\".", "code": "def apply_reverse(s):\n return s[::-1]\n\nprint(apply_reverse('kayak'))", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1488, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"kayak\".", "code": "def perform_reverse(s):\n return s[::-1]\n\nprint(perform_reverse('kayak'))", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1489, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"the quick brown fox\".", "code": "def apply_reverse(s):\n return s[::-1]\n\nprint(apply_reverse('the quick brown fox'))", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1490, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"the quick brown fox\".", "code": "def execute_reverse(s):\n return s[::-1]\n\nprint(execute_reverse('the quick brown fox'))", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1491, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"civic\".", "code": "def apply_reverse(s):\n return s[::-1]\n\nprint(apply_reverse('civic'))", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1492, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"civic\".", "code": "def process_reverse(s):\n return s[::-1]\n\nprint(process_reverse('civic'))", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1493, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"never odd or even\".", "code": "def process_reverse(s):\n return s[::-1]\n\nprint(process_reverse('never odd or even'))", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1494, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"never odd or even\".", "code": "def compute_reverse(s):\n return s[::-1]\n\nprint(compute_reverse('never odd or even'))", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1495, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"python programming\".", "code": "def process_reverse(s):\n return s[::-1]\n\nprint(process_reverse('python programming'))", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1496, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"python programming\".", "code": "def execute_reverse(s):\n return s[::-1]\n\nprint(execute_reverse('python programming'))", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1497, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"deified\".", "code": "def perform_reverse(s):\n return s[::-1]\n\nprint(perform_reverse('deified'))", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1498, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"deified\".", "code": "def handle_reverse(s):\n return s[::-1]\n\nprint(handle_reverse('deified'))", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1499, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"algorithms and data structures\".", "code": "def perform_reverse(s):\n return s[::-1]\n\nprint(perform_reverse('algorithms and data structures'))", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1500, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"rotor\".", "code": "def handle_reverse(s):\n return s[::-1]\n\nprint(handle_reverse('rotor'))", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1501, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"rotor\".", "code": "def apply_reverse(s):\n return s[::-1]\n\nprint(apply_reverse('rotor'))", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1502, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"racecar\".", "code": "function apply_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(apply_reverse(\"racecar\"));", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1503, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"racecar\".", "code": "function handle_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(handle_reverse(\"racecar\"));", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1504, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"hello world\".", "code": "function process_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(process_reverse(\"hello world\"));", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1505, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"hello world\".", "code": "function run_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(run_reverse(\"hello world\"));", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1506, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"A man a plan a canal Panama\".", "code": "function apply_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(apply_reverse(\"A man a plan a canal Panama\"));", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1507, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"Rust is fun\".", "code": "function process_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(process_reverse(\"Rust is fun\"));", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1508, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"level\".", "code": "function run_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(run_reverse(\"level\"));", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1509, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"level\".", "code": "function perform_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(perform_reverse(\"level\"));", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1510, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"OpenAI Claude\".", "code": "function perform_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(perform_reverse(\"OpenAI Claude\"));", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1511, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"OpenAI Claude\".", "code": "function process_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(process_reverse(\"OpenAI Claude\"));", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1512, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"was it a car or a cat i saw\".", "code": "function compute_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(compute_reverse(\"was it a car or a cat i saw\"));", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1513, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"was it a car or a cat i saw\".", "code": "function process_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(process_reverse(\"was it a car or a cat i saw\"));", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1514, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"noon\".", "code": "function apply_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(apply_reverse(\"noon\"));", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1515, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"noon\".", "code": "function execute_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(execute_reverse(\"noon\"));", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1516, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"data science\".", "code": "function compute_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(compute_reverse(\"data science\"));", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1517, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"data science\".", "code": "function apply_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(apply_reverse(\"data science\"));", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1518, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"step on no pets\".", "code": "function handle_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(handle_reverse(\"step on no pets\"));", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1519, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"step on no pets\".", "code": "function perform_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(perform_reverse(\"step on no pets\"));", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1520, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"coding\".", "code": "function execute_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(execute_reverse(\"coding\"));", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1521, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"coding\".", "code": "function perform_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(perform_reverse(\"coding\"));", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1522, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"madam im adam\".", "code": "function process_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(process_reverse(\"madam im adam\"));", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1523, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"madam im adam\".", "code": "function compute_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(compute_reverse(\"madam im adam\"));", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1524, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"kayak\".", "code": "function apply_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(apply_reverse(\"kayak\"));", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1525, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"kayak\".", "code": "function perform_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(perform_reverse(\"kayak\"));", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1526, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"the quick brown fox\".", "code": "function apply_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(apply_reverse(\"the quick brown fox\"));", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1527, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"the quick brown fox\".", "code": "function compute_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(compute_reverse(\"the quick brown fox\"));", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1528, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"civic\".", "code": "function perform_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(perform_reverse(\"civic\"));", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1529, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"civic\".", "code": "function handle_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(handle_reverse(\"civic\"));", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1530, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"never odd or even\".", "code": "function execute_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(execute_reverse(\"never odd or even\"));", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1531, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"never odd or even\".", "code": "function perform_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(perform_reverse(\"never odd or even\"));", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1532, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"python programming\".", "code": "function compute_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(compute_reverse(\"python programming\"));", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1533, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"python programming\".", "code": "function execute_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(execute_reverse(\"python programming\"));", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1534, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"deified\".", "code": "function process_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(process_reverse(\"deified\"));", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1535, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"deified\".", "code": "function perform_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(perform_reverse(\"deified\"));", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1536, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"algorithms and data structures\".", "code": "function run_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(run_reverse(\"algorithms and data structures\"));", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1537, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"rotor\".", "code": "function apply_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(apply_reverse(\"rotor\"));", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1538, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"rotor\".", "code": "function perform_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(perform_reverse(\"rotor\"));", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1539, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"racecar\".", "code": "function perform_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { perform_reverse };\nconsole.log(perform_reverse(\"racecar\"));", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1540, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"racecar\".", "code": "function process_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { process_reverse };\nconsole.log(process_reverse(\"racecar\"));", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1541, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"hello world\".", "code": "function process_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { process_reverse };\nconsole.log(process_reverse(\"hello world\"));", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1542, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"hello world\".", "code": "function handle_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { handle_reverse };\nconsole.log(handle_reverse(\"hello world\"));", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1543, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"A man a plan a canal Panama\".", "code": "function apply_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { apply_reverse };\nconsole.log(apply_reverse(\"A man a plan a canal Panama\"));", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1544, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"Rust is fun\".", "code": "function execute_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { execute_reverse };\nconsole.log(execute_reverse(\"Rust is fun\"));", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1545, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"Rust is fun\".", "code": "function handle_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { handle_reverse };\nconsole.log(handle_reverse(\"Rust is fun\"));", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1546, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"level\".", "code": "function perform_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { perform_reverse };\nconsole.log(perform_reverse(\"level\"));", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1547, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"level\".", "code": "function compute_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { compute_reverse };\nconsole.log(compute_reverse(\"level\"));", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1548, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"OpenAI Claude\".", "code": "function process_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { process_reverse };\nconsole.log(process_reverse(\"OpenAI Claude\"));", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1549, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"OpenAI Claude\".", "code": "function handle_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { handle_reverse };\nconsole.log(handle_reverse(\"OpenAI Claude\"));", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1550, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"was it a car or a cat i saw\".", "code": "function run_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { run_reverse };\nconsole.log(run_reverse(\"was it a car or a cat i saw\"));", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1551, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"was it a car or a cat i saw\".", "code": "function process_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { process_reverse };\nconsole.log(process_reverse(\"was it a car or a cat i saw\"));", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1552, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"noon\".", "code": "function compute_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { compute_reverse };\nconsole.log(compute_reverse(\"noon\"));", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1553, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"noon\".", "code": "function execute_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { execute_reverse };\nconsole.log(execute_reverse(\"noon\"));", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1554, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"data science\".", "code": "function handle_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { handle_reverse };\nconsole.log(handle_reverse(\"data science\"));", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1555, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"data science\".", "code": "function perform_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { perform_reverse };\nconsole.log(perform_reverse(\"data science\"));", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1556, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"step on no pets\".", "code": "function execute_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { execute_reverse };\nconsole.log(execute_reverse(\"step on no pets\"));", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1557, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"step on no pets\".", "code": "function run_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { run_reverse };\nconsole.log(run_reverse(\"step on no pets\"));", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1558, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"coding\".", "code": "function handle_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { handle_reverse };\nconsole.log(handle_reverse(\"coding\"));", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1559, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"coding\".", "code": "function perform_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { perform_reverse };\nconsole.log(perform_reverse(\"coding\"));", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1560, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"madam im adam\".", "code": "function perform_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { perform_reverse };\nconsole.log(perform_reverse(\"madam im adam\"));", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1561, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"madam im adam\".", "code": "function apply_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { apply_reverse };\nconsole.log(apply_reverse(\"madam im adam\"));", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1562, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"kayak\".", "code": "function apply_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { apply_reverse };\nconsole.log(apply_reverse(\"kayak\"));", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1563, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"kayak\".", "code": "function process_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { process_reverse };\nconsole.log(process_reverse(\"kayak\"));", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1564, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"the quick brown fox\".", "code": "function compute_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { compute_reverse };\nconsole.log(compute_reverse(\"the quick brown fox\"));", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1565, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"civic\".", "code": "function execute_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { execute_reverse };\nconsole.log(execute_reverse(\"civic\"));", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1566, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"civic\".", "code": "function compute_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { compute_reverse };\nconsole.log(compute_reverse(\"civic\"));", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1567, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"never odd or even\".", "code": "function process_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { process_reverse };\nconsole.log(process_reverse(\"never odd or even\"));", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1568, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"never odd or even\".", "code": "function compute_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { compute_reverse };\nconsole.log(compute_reverse(\"never odd or even\"));", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1569, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"python programming\".", "code": "function run_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { run_reverse };\nconsole.log(run_reverse(\"python programming\"));", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1570, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"python programming\".", "code": "function execute_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { execute_reverse };\nconsole.log(execute_reverse(\"python programming\"));", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1571, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"deified\".", "code": "function apply_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { apply_reverse };\nconsole.log(apply_reverse(\"deified\"));", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1572, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"deified\".", "code": "function perform_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { perform_reverse };\nconsole.log(perform_reverse(\"deified\"));", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1573, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"algorithms and data structures\".", "code": "function process_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { process_reverse };\nconsole.log(process_reverse(\"algorithms and data structures\"));", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1574, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"algorithms and data structures\".", "code": "function execute_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { execute_reverse };\nconsole.log(execute_reverse(\"algorithms and data structures\"));", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1575, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"rotor\".", "code": "function run_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { run_reverse };\nconsole.log(run_reverse(\"rotor\"));", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1576, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"rotor\".", "code": "function process_reverse(s) {\n return s.split(\"\").reverse().join(\"\");\n}\n\nmodule.exports = { process_reverse };\nconsole.log(process_reverse(\"rotor\"));", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1577, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"racecar\".", "code": "public class Main {\n static String process_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(process_reverse(\"racecar\"));\n }\n}", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1578, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"hello world\".", "code": "public class Main {\n static String handle_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(handle_reverse(\"hello world\"));\n }\n}", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1579, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"hello world\".", "code": "public class Main {\n static String perform_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(perform_reverse(\"hello world\"));\n }\n}", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1580, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"A man a plan a canal Panama\".", "code": "public class Main {\n static String process_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(process_reverse(\"A man a plan a canal Panama\"));\n }\n}", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1581, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"A man a plan a canal Panama\".", "code": "public class Main {\n static String handle_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(handle_reverse(\"A man a plan a canal Panama\"));\n }\n}", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1582, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"Rust is fun\".", "code": "public class Main {\n static String compute_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(compute_reverse(\"Rust is fun\"));\n }\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1583, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"Rust is fun\".", "code": "public class Main {\n static String execute_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(execute_reverse(\"Rust is fun\"));\n }\n}", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1584, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"level\".", "code": "public class Main {\n static String perform_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(perform_reverse(\"level\"));\n }\n}", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1585, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"level\".", "code": "public class Main {\n static String process_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(process_reverse(\"level\"));\n }\n}", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1586, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"OpenAI Claude\".", "code": "public class Main {\n static String apply_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(apply_reverse(\"OpenAI Claude\"));\n }\n}", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1587, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"OpenAI Claude\".", "code": "public class Main {\n static String handle_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(handle_reverse(\"OpenAI Claude\"));\n }\n}", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1588, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"was it a car or a cat i saw\".", "code": "public class Main {\n static String apply_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(apply_reverse(\"was it a car or a cat i saw\"));\n }\n}", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1589, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"was it a car or a cat i saw\".", "code": "public class Main {\n static String process_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(process_reverse(\"was it a car or a cat i saw\"));\n }\n}", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1590, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"noon\".", "code": "public class Main {\n static String handle_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(handle_reverse(\"noon\"));\n }\n}", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1591, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"noon\".", "code": "public class Main {\n static String perform_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(perform_reverse(\"noon\"));\n }\n}", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1592, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"data science\".", "code": "public class Main {\n static String compute_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(compute_reverse(\"data science\"));\n }\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1593, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"data science\".", "code": "public class Main {\n static String run_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(run_reverse(\"data science\"));\n }\n}", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1594, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"step on no pets\".", "code": "public class Main {\n static String process_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(process_reverse(\"step on no pets\"));\n }\n}", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1595, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"step on no pets\".", "code": "public class Main {\n static String perform_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(perform_reverse(\"step on no pets\"));\n }\n}", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1596, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"coding\".", "code": "public class Main {\n static String handle_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(handle_reverse(\"coding\"));\n }\n}", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1597, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"coding\".", "code": "public class Main {\n static String compute_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(compute_reverse(\"coding\"));\n }\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1598, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"madam im adam\".", "code": "public class Main {\n static String apply_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(apply_reverse(\"madam im adam\"));\n }\n}", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1599, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"madam im adam\".", "code": "public class Main {\n static String perform_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(perform_reverse(\"madam im adam\"));\n }\n}", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1600, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"kayak\".", "code": "public class Main {\n static String perform_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(perform_reverse(\"kayak\"));\n }\n}", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1601, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"kayak\".", "code": "public class Main {\n static String apply_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(apply_reverse(\"kayak\"));\n }\n}", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1602, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"the quick brown fox\".", "code": "public class Main {\n static String handle_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(handle_reverse(\"the quick brown fox\"));\n }\n}", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1603, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"the quick brown fox\".", "code": "public class Main {\n static String perform_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(perform_reverse(\"the quick brown fox\"));\n }\n}", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1604, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"civic\".", "code": "public class Main {\n static String apply_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(apply_reverse(\"civic\"));\n }\n}", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1605, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"civic\".", "code": "public class Main {\n static String perform_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(perform_reverse(\"civic\"));\n }\n}", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1606, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"never odd or even\".", "code": "public class Main {\n static String handle_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(handle_reverse(\"never odd or even\"));\n }\n}", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1607, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"never odd or even\".", "code": "public class Main {\n static String compute_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(compute_reverse(\"never odd or even\"));\n }\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1608, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"python programming\".", "code": "public class Main {\n static String process_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(process_reverse(\"python programming\"));\n }\n}", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1609, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"python programming\".", "code": "public class Main {\n static String run_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(run_reverse(\"python programming\"));\n }\n}", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1610, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"deified\".", "code": "public class Main {\n static String perform_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(perform_reverse(\"deified\"));\n }\n}", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1611, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"deified\".", "code": "public class Main {\n static String compute_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(compute_reverse(\"deified\"));\n }\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1612, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"algorithms and data structures\".", "code": "public class Main {\n static String handle_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(handle_reverse(\"algorithms and data structures\"));\n }\n}", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1613, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"algorithms and data structures\".", "code": "public class Main {\n static String compute_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(compute_reverse(\"algorithms and data structures\"));\n }\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1614, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"rotor\".", "code": "public class Main {\n static String handle_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(handle_reverse(\"rotor\"));\n }\n}", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1615, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"rotor\".", "code": "public class Main {\n static String execute_reverse(String s) {\n return new StringBuilder(s).reverse().toString();\n }\n\n public static void main(String[] args) {\n System.out.println(execute_reverse(\"rotor\"));\n }\n}", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1616, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"racecar\".", "code": "#include \n#include \n\nvoid compute_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"racecar\";\n compute_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1617, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"racecar\".", "code": "#include \n#include \n\nvoid run_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"racecar\";\n run_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1618, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"hello world\".", "code": "#include \n#include \n\nvoid handle_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"hello world\";\n handle_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1619, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"hello world\".", "code": "#include \n#include \n\nvoid apply_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"hello world\";\n apply_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1620, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"A man a plan a canal Panama\".", "code": "#include \n#include \n\nvoid handle_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"A man a plan a canal Panama\";\n handle_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1621, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"A man a plan a canal Panama\".", "code": "#include \n#include \n\nvoid compute_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"A man a plan a canal Panama\";\n compute_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1622, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"Rust is fun\".", "code": "#include \n#include \n\nvoid handle_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"Rust is fun\";\n handle_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1623, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"level\".", "code": "#include \n#include \n\nvoid compute_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"level\";\n compute_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1624, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"OpenAI Claude\".", "code": "#include \n#include \n\nvoid perform_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"OpenAI Claude\";\n perform_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1625, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"OpenAI Claude\".", "code": "#include \n#include \n\nvoid run_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"OpenAI Claude\";\n run_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1626, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"was it a car or a cat i saw\".", "code": "#include \n#include \n\nvoid compute_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"was it a car or a cat i saw\";\n compute_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1627, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"was it a car or a cat i saw\".", "code": "#include \n#include \n\nvoid process_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"was it a car or a cat i saw\";\n process_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1628, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"noon\".", "code": "#include \n#include \n\nvoid run_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"noon\";\n run_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1629, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"noon\".", "code": "#include \n#include \n\nvoid compute_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"noon\";\n compute_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1630, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"data science\".", "code": "#include \n#include \n\nvoid execute_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"data science\";\n execute_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1631, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"data science\".", "code": "#include \n#include \n\nvoid compute_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"data science\";\n compute_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1632, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"step on no pets\".", "code": "#include \n#include \n\nvoid compute_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"step on no pets\";\n compute_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1633, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"step on no pets\".", "code": "#include \n#include \n\nvoid apply_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"step on no pets\";\n apply_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1634, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"coding\".", "code": "#include \n#include \n\nvoid perform_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"coding\";\n perform_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1635, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"coding\".", "code": "#include \n#include \n\nvoid execute_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"coding\";\n execute_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1636, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"madam im adam\".", "code": "#include \n#include \n\nvoid run_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"madam im adam\";\n run_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1637, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"madam im adam\".", "code": "#include \n#include \n\nvoid apply_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"madam im adam\";\n apply_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1638, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"kayak\".", "code": "#include \n#include \n\nvoid perform_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"kayak\";\n perform_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1639, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"the quick brown fox\".", "code": "#include \n#include \n\nvoid apply_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"the quick brown fox\";\n apply_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1640, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"the quick brown fox\".", "code": "#include \n#include \n\nvoid handle_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"the quick brown fox\";\n handle_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1641, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"civic\".", "code": "#include \n#include \n\nvoid process_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"civic\";\n process_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1642, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"civic\".", "code": "#include \n#include \n\nvoid apply_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"civic\";\n apply_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1643, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"never odd or even\".", "code": "#include \n#include \n\nvoid execute_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"never odd or even\";\n execute_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1644, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"never odd or even\".", "code": "#include \n#include \n\nvoid run_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"never odd or even\";\n run_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1645, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"python programming\".", "code": "#include \n#include \n\nvoid handle_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"python programming\";\n handle_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1646, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"python programming\".", "code": "#include \n#include \n\nvoid execute_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"python programming\";\n execute_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1647, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"deified\".", "code": "#include \n#include \n\nvoid execute_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"deified\";\n execute_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1648, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"deified\".", "code": "#include \n#include \n\nvoid handle_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"deified\";\n handle_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1649, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"algorithms and data structures\".", "code": "#include \n#include \n\nvoid perform_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"algorithms and data structures\";\n perform_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1650, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"algorithms and data structures\".", "code": "#include \n#include \n\nvoid run_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"algorithms and data structures\";\n run_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1651, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"rotor\".", "code": "#include \n#include \n\nvoid compute_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"rotor\";\n compute_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1652, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"rotor\".", "code": "#include \n#include \n\nvoid perform_reverse(char* s) {\n int len = (int) strlen(s);\n for (int i = 0; i < len / 2; i++) {\n char t = s[i];\n s[i] = s[len - 1 - i];\n s[len - 1 - i] = t;\n }\n}\n\nint main(void) {\n char s[] = \"rotor\";\n perform_reverse(s);\n printf(\"%s\\n\", s);\n return 0;\n}", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1653, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"racecar\".", "code": "#include \n#include \n#include \n\nstd::string apply_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << apply_reverse(\"racecar\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1654, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"racecar\".", "code": "#include \n#include \n#include \n\nstd::string perform_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << perform_reverse(\"racecar\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1655, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"hello world\".", "code": "#include \n#include \n#include \n\nstd::string apply_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << apply_reverse(\"hello world\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1656, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"hello world\".", "code": "#include \n#include \n#include \n\nstd::string compute_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << compute_reverse(\"hello world\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1657, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"A man a plan a canal Panama\".", "code": "#include \n#include \n#include \n\nstd::string handle_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << handle_reverse(\"A man a plan a canal Panama\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1658, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"A man a plan a canal Panama\".", "code": "#include \n#include \n#include \n\nstd::string compute_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << compute_reverse(\"A man a plan a canal Panama\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1659, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"Rust is fun\".", "code": "#include \n#include \n#include \n\nstd::string perform_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << perform_reverse(\"Rust is fun\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1660, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"Rust is fun\".", "code": "#include \n#include \n#include \n\nstd::string execute_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << execute_reverse(\"Rust is fun\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1661, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"level\".", "code": "#include \n#include \n#include \n\nstd::string execute_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << execute_reverse(\"level\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1662, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"level\".", "code": "#include \n#include \n#include \n\nstd::string apply_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << apply_reverse(\"level\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1663, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"OpenAI Claude\".", "code": "#include \n#include \n#include \n\nstd::string perform_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << perform_reverse(\"OpenAI Claude\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1664, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"OpenAI Claude\".", "code": "#include \n#include \n#include \n\nstd::string apply_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << apply_reverse(\"OpenAI Claude\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1665, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"was it a car or a cat i saw\".", "code": "#include \n#include \n#include \n\nstd::string compute_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << compute_reverse(\"was it a car or a cat i saw\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1666, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"was it a car or a cat i saw\".", "code": "#include \n#include \n#include \n\nstd::string process_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << process_reverse(\"was it a car or a cat i saw\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1667, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"noon\".", "code": "#include \n#include \n#include \n\nstd::string execute_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << execute_reverse(\"noon\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1668, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"noon\".", "code": "#include \n#include \n#include \n\nstd::string apply_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << apply_reverse(\"noon\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1669, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"data science\".", "code": "#include \n#include \n#include \n\nstd::string handle_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << handle_reverse(\"data science\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1670, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"data science\".", "code": "#include \n#include \n#include \n\nstd::string compute_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << compute_reverse(\"data science\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1671, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"step on no pets\".", "code": "#include \n#include \n#include \n\nstd::string handle_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << handle_reverse(\"step on no pets\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1672, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"step on no pets\".", "code": "#include \n#include \n#include \n\nstd::string run_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << run_reverse(\"step on no pets\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1673, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"coding\".", "code": "#include \n#include \n#include \n\nstd::string compute_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << compute_reverse(\"coding\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1674, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"coding\".", "code": "#include \n#include \n#include \n\nstd::string process_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << process_reverse(\"coding\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1675, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"madam im adam\".", "code": "#include \n#include \n#include \n\nstd::string process_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << process_reverse(\"madam im adam\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1676, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"madam im adam\".", "code": "#include \n#include \n#include \n\nstd::string execute_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << execute_reverse(\"madam im adam\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1677, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"kayak\".", "code": "#include \n#include \n#include \n\nstd::string perform_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << perform_reverse(\"kayak\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1678, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"the quick brown fox\".", "code": "#include \n#include \n#include \n\nstd::string handle_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << handle_reverse(\"the quick brown fox\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1679, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"the quick brown fox\".", "code": "#include \n#include \n#include \n\nstd::string run_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << run_reverse(\"the quick brown fox\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1680, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"civic\".", "code": "#include \n#include \n#include \n\nstd::string handle_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << handle_reverse(\"civic\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1681, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"civic\".", "code": "#include \n#include \n#include \n\nstd::string run_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << run_reverse(\"civic\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1682, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"never odd or even\".", "code": "#include \n#include \n#include \n\nstd::string execute_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << execute_reverse(\"never odd or even\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1683, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"never odd or even\".", "code": "#include \n#include \n#include \n\nstd::string compute_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << compute_reverse(\"never odd or even\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1684, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"python programming\".", "code": "#include \n#include \n#include \n\nstd::string compute_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << compute_reverse(\"python programming\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1685, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"python programming\".", "code": "#include \n#include \n#include \n\nstd::string execute_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << execute_reverse(\"python programming\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1686, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"deified\".", "code": "#include \n#include \n#include \n\nstd::string run_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << run_reverse(\"deified\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1687, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"deified\".", "code": "#include \n#include \n#include \n\nstd::string perform_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << perform_reverse(\"deified\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1688, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"algorithms and data structures\".", "code": "#include \n#include \n#include \n\nstd::string execute_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << execute_reverse(\"algorithms and data structures\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1689, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"algorithms and data structures\".", "code": "#include \n#include \n#include \n\nstd::string process_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << process_reverse(\"algorithms and data structures\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1690, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"rotor\".", "code": "#include \n#include \n#include \n\nstd::string compute_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << compute_reverse(\"rotor\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1691, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"rotor\".", "code": "#include \n#include \n#include \n\nstd::string perform_reverse(std::string s) {\n std::reverse(s.begin(), s.end());\n return s;\n}\n\nint main() {\n std::cout << perform_reverse(\"rotor\") << std::endl;\n return 0;\n}", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1692, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"racecar\".", "code": "fn process_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", process_reverse(\"racecar\"));\n}", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1693, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"racecar\".", "code": "fn perform_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", perform_reverse(\"racecar\"));\n}", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1694, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"hello world\".", "code": "fn compute_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", compute_reverse(\"hello world\"));\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1695, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"hello world\".", "code": "fn apply_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", apply_reverse(\"hello world\"));\n}", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1696, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"A man a plan a canal Panama\".", "code": "fn process_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", process_reverse(\"A man a plan a canal Panama\"));\n}", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1697, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"A man a plan a canal Panama\".", "code": "fn handle_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", handle_reverse(\"A man a plan a canal Panama\"));\n}", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1698, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"Rust is fun\".", "code": "fn run_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", run_reverse(\"Rust is fun\"));\n}", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1699, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"level\".", "code": "fn compute_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", compute_reverse(\"level\"));\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1700, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"OpenAI Claude\".", "code": "fn perform_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", perform_reverse(\"OpenAI Claude\"));\n}", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1701, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"OpenAI Claude\".", "code": "fn process_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", process_reverse(\"OpenAI Claude\"));\n}", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1702, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"was it a car or a cat i saw\".", "code": "fn handle_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", handle_reverse(\"was it a car or a cat i saw\"));\n}", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1703, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"was it a car or a cat i saw\".", "code": "fn compute_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", compute_reverse(\"was it a car or a cat i saw\"));\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1704, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"noon\".", "code": "fn compute_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", compute_reverse(\"noon\"));\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1705, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"noon\".", "code": "fn handle_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", handle_reverse(\"noon\"));\n}", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1706, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"data science\".", "code": "fn run_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", run_reverse(\"data science\"));\n}", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1707, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"data science\".", "code": "fn execute_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", execute_reverse(\"data science\"));\n}", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1708, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"step on no pets\".", "code": "fn handle_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", handle_reverse(\"step on no pets\"));\n}", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1709, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"step on no pets\".", "code": "fn apply_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", apply_reverse(\"step on no pets\"));\n}", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1710, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"coding\".", "code": "fn process_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", process_reverse(\"coding\"));\n}", "explanation": "Reverse operation, function named 'process_reverse'."} {"id": 1711, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"coding\".", "code": "fn run_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", run_reverse(\"coding\"));\n}", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1712, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"madam im adam\".", "code": "fn apply_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", apply_reverse(\"madam im adam\"));\n}", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1713, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"madam im adam\".", "code": "fn execute_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", execute_reverse(\"madam im adam\"));\n}", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1714, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"kayak\".", "code": "fn run_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", run_reverse(\"kayak\"));\n}", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1715, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"kayak\".", "code": "fn execute_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", execute_reverse(\"kayak\"));\n}", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1716, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"the quick brown fox\".", "code": "fn execute_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", execute_reverse(\"the quick brown fox\"));\n}", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1717, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"the quick brown fox\".", "code": "fn perform_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", perform_reverse(\"the quick brown fox\"));\n}", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1718, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"civic\".", "code": "fn run_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", run_reverse(\"civic\"));\n}", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1719, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"civic\".", "code": "fn perform_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", perform_reverse(\"civic\"));\n}", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1720, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"never odd or even\".", "code": "fn run_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", run_reverse(\"never odd or even\"));\n}", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1721, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"python programming\".", "code": "fn apply_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", apply_reverse(\"python programming\"));\n}", "explanation": "Reverse operation, function named 'apply_reverse'."} {"id": 1722, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"python programming\".", "code": "fn handle_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", handle_reverse(\"python programming\"));\n}", "explanation": "Reverse operation, function named 'handle_reverse'."} {"id": 1723, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"deified\".", "code": "fn compute_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", compute_reverse(\"deified\"));\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1724, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"deified\".", "code": "fn perform_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", perform_reverse(\"deified\"));\n}", "explanation": "Reverse operation, function named 'perform_reverse'."} {"id": 1725, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"algorithms and data structures\".", "code": "fn compute_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", compute_reverse(\"algorithms and data structures\"));\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1726, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"algorithms and data structures\".", "code": "fn execute_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", execute_reverse(\"algorithms and data structures\"));\n}", "explanation": "Reverse operation, function named 'execute_reverse'."} {"id": 1727, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"rotor\".", "code": "fn compute_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", compute_reverse(\"rotor\"));\n}", "explanation": "Reverse operation, function named 'compute_reverse'."} {"id": 1728, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'reverse' on the string \"rotor\".", "code": "fn run_reverse(s: &str) -> String {\n s.chars().rev().collect()\n}\n\nfn main() {\n println!(\"{}\", run_reverse(\"rotor\"));\n}", "explanation": "Reverse operation, function named 'run_reverse'."} {"id": 1729, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"racecar\".", "code": "def perform_word(s):\n return len(s.split())\n\nprint(perform_word('racecar'))", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1730, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"racecar\".", "code": "def run_word(s):\n return len(s.split())\n\nprint(run_word('racecar'))", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1731, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"hello world\".", "code": "def compute_word(s):\n return len(s.split())\n\nprint(compute_word('hello world'))", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1732, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"hello world\".", "code": "def process_word(s):\n return len(s.split())\n\nprint(process_word('hello world'))", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1733, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"A man a plan a canal Panama\".", "code": "def handle_word(s):\n return len(s.split())\n\nprint(handle_word('A man a plan a canal Panama'))", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1734, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"A man a plan a canal Panama\".", "code": "def apply_word(s):\n return len(s.split())\n\nprint(apply_word('A man a plan a canal Panama'))", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1735, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"Rust is fun\".", "code": "def execute_word(s):\n return len(s.split())\n\nprint(execute_word('Rust is fun'))", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1736, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"Rust is fun\".", "code": "def process_word(s):\n return len(s.split())\n\nprint(process_word('Rust is fun'))", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1737, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"level\".", "code": "def run_word(s):\n return len(s.split())\n\nprint(run_word('level'))", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1738, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"OpenAI Claude\".", "code": "def apply_word(s):\n return len(s.split())\n\nprint(apply_word('OpenAI Claude'))", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1739, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"OpenAI Claude\".", "code": "def compute_word(s):\n return len(s.split())\n\nprint(compute_word('OpenAI Claude'))", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1740, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"was it a car or a cat i saw\".", "code": "def execute_word(s):\n return len(s.split())\n\nprint(execute_word('was it a car or a cat i saw'))", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1741, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"was it a car or a cat i saw\".", "code": "def run_word(s):\n return len(s.split())\n\nprint(run_word('was it a car or a cat i saw'))", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1742, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"noon\".", "code": "def execute_word(s):\n return len(s.split())\n\nprint(execute_word('noon'))", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1743, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"noon\".", "code": "def process_word(s):\n return len(s.split())\n\nprint(process_word('noon'))", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1744, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"data science\".", "code": "def handle_word(s):\n return len(s.split())\n\nprint(handle_word('data science'))", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1745, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"data science\".", "code": "def execute_word(s):\n return len(s.split())\n\nprint(execute_word('data science'))", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1746, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"step on no pets\".", "code": "def handle_word(s):\n return len(s.split())\n\nprint(handle_word('step on no pets'))", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1747, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"step on no pets\".", "code": "def compute_word(s):\n return len(s.split())\n\nprint(compute_word('step on no pets'))", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1748, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"coding\".", "code": "def execute_word(s):\n return len(s.split())\n\nprint(execute_word('coding'))", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1749, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"coding\".", "code": "def perform_word(s):\n return len(s.split())\n\nprint(perform_word('coding'))", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1750, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"madam im adam\".", "code": "def execute_word(s):\n return len(s.split())\n\nprint(execute_word('madam im adam'))", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1751, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"madam im adam\".", "code": "def handle_word(s):\n return len(s.split())\n\nprint(handle_word('madam im adam'))", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1752, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"kayak\".", "code": "def execute_word(s):\n return len(s.split())\n\nprint(execute_word('kayak'))", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1753, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"kayak\".", "code": "def apply_word(s):\n return len(s.split())\n\nprint(apply_word('kayak'))", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1754, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"the quick brown fox\".", "code": "def handle_word(s):\n return len(s.split())\n\nprint(handle_word('the quick brown fox'))", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1755, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"civic\".", "code": "def perform_word(s):\n return len(s.split())\n\nprint(perform_word('civic'))", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1756, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"civic\".", "code": "def compute_word(s):\n return len(s.split())\n\nprint(compute_word('civic'))", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1757, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"never odd or even\".", "code": "def apply_word(s):\n return len(s.split())\n\nprint(apply_word('never odd or even'))", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1758, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"never odd or even\".", "code": "def process_word(s):\n return len(s.split())\n\nprint(process_word('never odd or even'))", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1759, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"python programming\".", "code": "def process_word(s):\n return len(s.split())\n\nprint(process_word('python programming'))", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1760, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"python programming\".", "code": "def compute_word(s):\n return len(s.split())\n\nprint(compute_word('python programming'))", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1761, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"deified\".", "code": "def apply_word(s):\n return len(s.split())\n\nprint(apply_word('deified'))", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1762, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"algorithms and data structures\".", "code": "def handle_word(s):\n return len(s.split())\n\nprint(handle_word('algorithms and data structures'))", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1763, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"algorithms and data structures\".", "code": "def apply_word(s):\n return len(s.split())\n\nprint(apply_word('algorithms and data structures'))", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1764, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"rotor\".", "code": "def compute_word(s):\n return len(s.split())\n\nprint(compute_word('rotor'))", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1765, "language": "Python", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"rotor\".", "code": "def run_word(s):\n return len(s.split())\n\nprint(run_word('rotor'))", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1766, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"racecar\".", "code": "function run_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(run_word(\"racecar\"));", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1767, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"racecar\".", "code": "function handle_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(handle_word(\"racecar\"));", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1768, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"hello world\".", "code": "function run_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(run_word(\"hello world\"));", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1769, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"hello world\".", "code": "function process_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(process_word(\"hello world\"));", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1770, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"A man a plan a canal Panama\".", "code": "function perform_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(perform_word(\"A man a plan a canal Panama\"));", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1771, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"A man a plan a canal Panama\".", "code": "function handle_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(handle_word(\"A man a plan a canal Panama\"));", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1772, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"Rust is fun\".", "code": "function handle_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(handle_word(\"Rust is fun\"));", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1773, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"level\".", "code": "function compute_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(compute_word(\"level\"));", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1774, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"OpenAI Claude\".", "code": "function process_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(process_word(\"OpenAI Claude\"));", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1775, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"OpenAI Claude\".", "code": "function handle_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(handle_word(\"OpenAI Claude\"));", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1776, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"was it a car or a cat i saw\".", "code": "function handle_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(handle_word(\"was it a car or a cat i saw\"));", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1777, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"was it a car or a cat i saw\".", "code": "function apply_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(apply_word(\"was it a car or a cat i saw\"));", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1778, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"noon\".", "code": "function handle_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(handle_word(\"noon\"));", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1779, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"noon\".", "code": "function run_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(run_word(\"noon\"));", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1780, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"data science\".", "code": "function process_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(process_word(\"data science\"));", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1781, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"data science\".", "code": "function perform_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(perform_word(\"data science\"));", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1782, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"step on no pets\".", "code": "function handle_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(handle_word(\"step on no pets\"));", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1783, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"coding\".", "code": "function perform_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(perform_word(\"coding\"));", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1784, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"coding\".", "code": "function execute_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(execute_word(\"coding\"));", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1785, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"madam im adam\".", "code": "function apply_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(apply_word(\"madam im adam\"));", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1786, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"kayak\".", "code": "function compute_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(compute_word(\"kayak\"));", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1787, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"kayak\".", "code": "function process_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(process_word(\"kayak\"));", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1788, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"the quick brown fox\".", "code": "function run_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(run_word(\"the quick brown fox\"));", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1789, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"the quick brown fox\".", "code": "function handle_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(handle_word(\"the quick brown fox\"));", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1790, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"civic\".", "code": "function compute_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(compute_word(\"civic\"));", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1791, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"civic\".", "code": "function process_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(process_word(\"civic\"));", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1792, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"never odd or even\".", "code": "function run_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(run_word(\"never odd or even\"));", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1793, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"never odd or even\".", "code": "function execute_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(execute_word(\"never odd or even\"));", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1794, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"python programming\".", "code": "function perform_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(perform_word(\"python programming\"));", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1795, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"python programming\".", "code": "function run_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(run_word(\"python programming\"));", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1796, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"deified\".", "code": "function perform_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(perform_word(\"deified\"));", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1797, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"deified\".", "code": "function handle_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(handle_word(\"deified\"));", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1798, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"algorithms and data structures\".", "code": "function run_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(run_word(\"algorithms and data structures\"));", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1799, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"algorithms and data structures\".", "code": "function perform_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(perform_word(\"algorithms and data structures\"));", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1800, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"rotor\".", "code": "function run_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(run_word(\"rotor\"));", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1801, "language": "JavaScript", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"rotor\".", "code": "function apply_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nconsole.log(apply_word(\"rotor\"));", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1802, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"racecar\".", "code": "function run_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { run_word };\nconsole.log(run_word(\"racecar\"));", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1803, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"racecar\".", "code": "function perform_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { perform_word };\nconsole.log(perform_word(\"racecar\"));", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1804, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"hello world\".", "code": "function handle_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { handle_word };\nconsole.log(handle_word(\"hello world\"));", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1805, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"hello world\".", "code": "function apply_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { apply_word };\nconsole.log(apply_word(\"hello world\"));", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1806, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"A man a plan a canal Panama\".", "code": "function process_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { process_word };\nconsole.log(process_word(\"A man a plan a canal Panama\"));", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1807, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"A man a plan a canal Panama\".", "code": "function run_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { run_word };\nconsole.log(run_word(\"A man a plan a canal Panama\"));", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1808, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"Rust is fun\".", "code": "function handle_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { handle_word };\nconsole.log(handle_word(\"Rust is fun\"));", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1809, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"Rust is fun\".", "code": "function compute_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { compute_word };\nconsole.log(compute_word(\"Rust is fun\"));", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1810, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"level\".", "code": "function apply_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { apply_word };\nconsole.log(apply_word(\"level\"));", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1811, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"level\".", "code": "function handle_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { handle_word };\nconsole.log(handle_word(\"level\"));", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1812, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"OpenAI Claude\".", "code": "function run_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { run_word };\nconsole.log(run_word(\"OpenAI Claude\"));", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1813, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"OpenAI Claude\".", "code": "function apply_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { apply_word };\nconsole.log(apply_word(\"OpenAI Claude\"));", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1814, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"was it a car or a cat i saw\".", "code": "function compute_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { compute_word };\nconsole.log(compute_word(\"was it a car or a cat i saw\"));", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1815, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"noon\".", "code": "function apply_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { apply_word };\nconsole.log(apply_word(\"noon\"));", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1816, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"noon\".", "code": "function perform_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { perform_word };\nconsole.log(perform_word(\"noon\"));", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1817, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"data science\".", "code": "function perform_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { perform_word };\nconsole.log(perform_word(\"data science\"));", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1818, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"data science\".", "code": "function apply_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { apply_word };\nconsole.log(apply_word(\"data science\"));", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1819, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"step on no pets\".", "code": "function run_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { run_word };\nconsole.log(run_word(\"step on no pets\"));", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1820, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"step on no pets\".", "code": "function execute_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { execute_word };\nconsole.log(execute_word(\"step on no pets\"));", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1821, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"coding\".", "code": "function run_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { run_word };\nconsole.log(run_word(\"coding\"));", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1822, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"coding\".", "code": "function execute_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { execute_word };\nconsole.log(execute_word(\"coding\"));", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1823, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"madam im adam\".", "code": "function process_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { process_word };\nconsole.log(process_word(\"madam im adam\"));", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1824, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"madam im adam\".", "code": "function compute_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { compute_word };\nconsole.log(compute_word(\"madam im adam\"));", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1825, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"kayak\".", "code": "function run_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { run_word };\nconsole.log(run_word(\"kayak\"));", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1826, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"kayak\".", "code": "function perform_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { perform_word };\nconsole.log(perform_word(\"kayak\"));", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1827, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"the quick brown fox\".", "code": "function perform_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { perform_word };\nconsole.log(perform_word(\"the quick brown fox\"));", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1828, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"the quick brown fox\".", "code": "function execute_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { execute_word };\nconsole.log(execute_word(\"the quick brown fox\"));", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1829, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"civic\".", "code": "function process_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { process_word };\nconsole.log(process_word(\"civic\"));", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1830, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"civic\".", "code": "function handle_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { handle_word };\nconsole.log(handle_word(\"civic\"));", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1831, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"never odd or even\".", "code": "function execute_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { execute_word };\nconsole.log(execute_word(\"never odd or even\"));", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1832, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"never odd or even\".", "code": "function handle_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { handle_word };\nconsole.log(handle_word(\"never odd or even\"));", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1833, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"python programming\".", "code": "function apply_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { apply_word };\nconsole.log(apply_word(\"python programming\"));", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1834, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"python programming\".", "code": "function handle_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { handle_word };\nconsole.log(handle_word(\"python programming\"));", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1835, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"deified\".", "code": "function compute_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { compute_word };\nconsole.log(compute_word(\"deified\"));", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1836, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"algorithms and data structures\".", "code": "function compute_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { compute_word };\nconsole.log(compute_word(\"algorithms and data structures\"));", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1837, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"algorithms and data structures\".", "code": "function execute_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { execute_word };\nconsole.log(execute_word(\"algorithms and data structures\"));", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1838, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"rotor\".", "code": "function apply_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { apply_word };\nconsole.log(apply_word(\"rotor\"));", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1839, "language": "Node.js", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"rotor\".", "code": "function process_word(s) {\n return s.split(\" \").filter(Boolean).length;\n}\n\nmodule.exports = { process_word };\nconsole.log(process_word(\"rotor\"));", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1840, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"racecar\".", "code": "public class Main {\n static int execute_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(execute_word(\"racecar\"));\n }\n}", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1841, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"hello world\".", "code": "public class Main {\n static int apply_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(apply_word(\"hello world\"));\n }\n}", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1842, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"hello world\".", "code": "public class Main {\n static int run_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(run_word(\"hello world\"));\n }\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1843, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"A man a plan a canal Panama\".", "code": "public class Main {\n static int process_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(process_word(\"A man a plan a canal Panama\"));\n }\n}", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1844, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"A man a plan a canal Panama\".", "code": "public class Main {\n static int perform_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(perform_word(\"A man a plan a canal Panama\"));\n }\n}", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1845, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"Rust is fun\".", "code": "public class Main {\n static int handle_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(handle_word(\"Rust is fun\"));\n }\n}", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1846, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"level\".", "code": "public class Main {\n static int run_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(run_word(\"level\"));\n }\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1847, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"level\".", "code": "public class Main {\n static int handle_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(handle_word(\"level\"));\n }\n}", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1848, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"OpenAI Claude\".", "code": "public class Main {\n static int process_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(process_word(\"OpenAI Claude\"));\n }\n}", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1849, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"OpenAI Claude\".", "code": "public class Main {\n static int handle_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(handle_word(\"OpenAI Claude\"));\n }\n}", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1850, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"was it a car or a cat i saw\".", "code": "public class Main {\n static int compute_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(compute_word(\"was it a car or a cat i saw\"));\n }\n}", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1851, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"was it a car or a cat i saw\".", "code": "public class Main {\n static int run_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(run_word(\"was it a car or a cat i saw\"));\n }\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1852, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"noon\".", "code": "public class Main {\n static int process_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(process_word(\"noon\"));\n }\n}", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1853, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"noon\".", "code": "public class Main {\n static int compute_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(compute_word(\"noon\"));\n }\n}", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1854, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"data science\".", "code": "public class Main {\n static int run_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(run_word(\"data science\"));\n }\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1855, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"data science\".", "code": "public class Main {\n static int perform_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(perform_word(\"data science\"));\n }\n}", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1856, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"step on no pets\".", "code": "public class Main {\n static int handle_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(handle_word(\"step on no pets\"));\n }\n}", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1857, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"step on no pets\".", "code": "public class Main {\n static int run_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(run_word(\"step on no pets\"));\n }\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1858, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"coding\".", "code": "public class Main {\n static int handle_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(handle_word(\"coding\"));\n }\n}", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1859, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"coding\".", "code": "public class Main {\n static int compute_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(compute_word(\"coding\"));\n }\n}", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1860, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"madam im adam\".", "code": "public class Main {\n static int compute_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(compute_word(\"madam im adam\"));\n }\n}", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1861, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"madam im adam\".", "code": "public class Main {\n static int run_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(run_word(\"madam im adam\"));\n }\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1862, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"kayak\".", "code": "public class Main {\n static int perform_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(perform_word(\"kayak\"));\n }\n}", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1863, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"kayak\".", "code": "public class Main {\n static int apply_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(apply_word(\"kayak\"));\n }\n}", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1864, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"the quick brown fox\".", "code": "public class Main {\n static int run_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(run_word(\"the quick brown fox\"));\n }\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1865, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"the quick brown fox\".", "code": "public class Main {\n static int process_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(process_word(\"the quick brown fox\"));\n }\n}", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1866, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"civic\".", "code": "public class Main {\n static int compute_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(compute_word(\"civic\"));\n }\n}", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1867, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"civic\".", "code": "public class Main {\n static int run_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(run_word(\"civic\"));\n }\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1868, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"never odd or even\".", "code": "public class Main {\n static int handle_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(handle_word(\"never odd or even\"));\n }\n}", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1869, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"python programming\".", "code": "public class Main {\n static int run_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(run_word(\"python programming\"));\n }\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1870, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"python programming\".", "code": "public class Main {\n static int perform_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(perform_word(\"python programming\"));\n }\n}", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1871, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"deified\".", "code": "public class Main {\n static int execute_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(execute_word(\"deified\"));\n }\n}", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1872, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"deified\".", "code": "public class Main {\n static int apply_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(apply_word(\"deified\"));\n }\n}", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1873, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"algorithms and data structures\".", "code": "public class Main {\n static int process_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(process_word(\"algorithms and data structures\"));\n }\n}", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1874, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"algorithms and data structures\".", "code": "public class Main {\n static int run_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(run_word(\"algorithms and data structures\"));\n }\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1875, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"rotor\".", "code": "public class Main {\n static int apply_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(apply_word(\"rotor\"));\n }\n}", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1876, "language": "Java", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"rotor\".", "code": "public class Main {\n static int process_word(String s) {\n return s.trim().split(\"\\\\s+\").length;\n }\n\n public static void main(String[] args) {\n System.out.println(process_word(\"rotor\"));\n }\n}", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1877, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"racecar\".", "code": "#include \n#include \n\nint compute_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", compute_word(\"racecar\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1878, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"racecar\".", "code": "#include \n#include \n\nint perform_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", perform_word(\"racecar\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1879, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"hello world\".", "code": "#include \n#include \n\nint perform_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", perform_word(\"hello world\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1880, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"hello world\".", "code": "#include \n#include \n\nint process_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", process_word(\"hello world\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1881, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"A man a plan a canal Panama\".", "code": "#include \n#include \n\nint perform_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", perform_word(\"A man a plan a canal Panama\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1882, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"A man a plan a canal Panama\".", "code": "#include \n#include \n\nint apply_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", apply_word(\"A man a plan a canal Panama\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1883, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"Rust is fun\".", "code": "#include \n#include \n\nint run_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", run_word(\"Rust is fun\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1884, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"Rust is fun\".", "code": "#include \n#include \n\nint apply_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", apply_word(\"Rust is fun\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1885, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"level\".", "code": "#include \n#include \n\nint apply_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", apply_word(\"level\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1886, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"level\".", "code": "#include \n#include \n\nint process_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", process_word(\"level\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1887, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"OpenAI Claude\".", "code": "#include \n#include \n\nint handle_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", handle_word(\"OpenAI Claude\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1888, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"OpenAI Claude\".", "code": "#include \n#include \n\nint compute_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", compute_word(\"OpenAI Claude\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1889, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"was it a car or a cat i saw\".", "code": "#include \n#include \n\nint handle_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", handle_word(\"was it a car or a cat i saw\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1890, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"was it a car or a cat i saw\".", "code": "#include \n#include \n\nint execute_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", execute_word(\"was it a car or a cat i saw\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1891, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"noon\".", "code": "#include \n#include \n\nint execute_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", execute_word(\"noon\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1892, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"noon\".", "code": "#include \n#include \n\nint run_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", run_word(\"noon\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1893, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"data science\".", "code": "#include \n#include \n\nint perform_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", perform_word(\"data science\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1894, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"data science\".", "code": "#include \n#include \n\nint run_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", run_word(\"data science\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1895, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"step on no pets\".", "code": "#include \n#include \n\nint process_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", process_word(\"step on no pets\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1896, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"step on no pets\".", "code": "#include \n#include \n\nint run_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", run_word(\"step on no pets\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1897, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"coding\".", "code": "#include \n#include \n\nint perform_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", perform_word(\"coding\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1898, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"madam im adam\".", "code": "#include \n#include \n\nint run_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", run_word(\"madam im adam\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1899, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"kayak\".", "code": "#include \n#include \n\nint apply_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", apply_word(\"kayak\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1900, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"kayak\".", "code": "#include \n#include \n\nint process_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", process_word(\"kayak\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1901, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"the quick brown fox\".", "code": "#include \n#include \n\nint compute_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", compute_word(\"the quick brown fox\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1902, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"the quick brown fox\".", "code": "#include \n#include \n\nint run_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", run_word(\"the quick brown fox\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1903, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"civic\".", "code": "#include \n#include \n\nint compute_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", compute_word(\"civic\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1904, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"civic\".", "code": "#include \n#include \n\nint perform_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", perform_word(\"civic\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1905, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"never odd or even\".", "code": "#include \n#include \n\nint perform_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", perform_word(\"never odd or even\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1906, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"never odd or even\".", "code": "#include \n#include \n\nint process_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", process_word(\"never odd or even\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1907, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"python programming\".", "code": "#include \n#include \n\nint execute_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", execute_word(\"python programming\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1908, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"python programming\".", "code": "#include \n#include \n\nint apply_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", apply_word(\"python programming\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1909, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"deified\".", "code": "#include \n#include \n\nint apply_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", apply_word(\"deified\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1910, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"deified\".", "code": "#include \n#include \n\nint run_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", run_word(\"deified\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1911, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"algorithms and data structures\".", "code": "#include \n#include \n\nint execute_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", execute_word(\"algorithms and data structures\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1912, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"algorithms and data structures\".", "code": "#include \n#include \n\nint compute_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", compute_word(\"algorithms and data structures\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1913, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"rotor\".", "code": "#include \n#include \n\nint apply_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", apply_word(\"rotor\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1914, "language": "C", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"rotor\".", "code": "#include \n#include \n\nint run_word(const char* s) {\n int count = 0;\n int in_word = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n if (s[i] != ' ' && !in_word) { in_word = 1; count++; }\n else if (s[i] == ' ') { in_word = 0; }\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", run_word(\"rotor\"));\n return 0;\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1915, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"racecar\".", "code": "#include \n#include \n#include \n\nint perform_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << perform_word(\"racecar\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1916, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"racecar\".", "code": "#include \n#include \n#include \n\nint compute_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << compute_word(\"racecar\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1917, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"hello world\".", "code": "#include \n#include \n#include \n\nint apply_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << apply_word(\"hello world\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1918, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"hello world\".", "code": "#include \n#include \n#include \n\nint execute_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << execute_word(\"hello world\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1919, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"A man a plan a canal Panama\".", "code": "#include \n#include \n#include \n\nint compute_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << compute_word(\"A man a plan a canal Panama\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1920, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"A man a plan a canal Panama\".", "code": "#include \n#include \n#include \n\nint process_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << process_word(\"A man a plan a canal Panama\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1921, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"Rust is fun\".", "code": "#include \n#include \n#include \n\nint apply_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << apply_word(\"Rust is fun\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1922, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"Rust is fun\".", "code": "#include \n#include \n#include \n\nint handle_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << handle_word(\"Rust is fun\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1923, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"level\".", "code": "#include \n#include \n#include \n\nint run_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << run_word(\"level\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1924, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"level\".", "code": "#include \n#include \n#include \n\nint execute_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << execute_word(\"level\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1925, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"OpenAI Claude\".", "code": "#include \n#include \n#include \n\nint apply_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << apply_word(\"OpenAI Claude\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1926, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"OpenAI Claude\".", "code": "#include \n#include \n#include \n\nint run_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << run_word(\"OpenAI Claude\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1927, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"was it a car or a cat i saw\".", "code": "#include \n#include \n#include \n\nint apply_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << apply_word(\"was it a car or a cat i saw\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1928, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"was it a car or a cat i saw\".", "code": "#include \n#include \n#include \n\nint perform_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << perform_word(\"was it a car or a cat i saw\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1929, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"noon\".", "code": "#include \n#include \n#include \n\nint process_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << process_word(\"noon\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1930, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"noon\".", "code": "#include \n#include \n#include \n\nint handle_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << handle_word(\"noon\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1931, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"data science\".", "code": "#include \n#include \n#include \n\nint process_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << process_word(\"data science\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1932, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"data science\".", "code": "#include \n#include \n#include \n\nint compute_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << compute_word(\"data science\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1933, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"step on no pets\".", "code": "#include \n#include \n#include \n\nint perform_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << perform_word(\"step on no pets\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1934, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"step on no pets\".", "code": "#include \n#include \n#include \n\nint execute_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << execute_word(\"step on no pets\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1935, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"coding\".", "code": "#include \n#include \n#include \n\nint compute_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << compute_word(\"coding\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1936, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"coding\".", "code": "#include \n#include \n#include \n\nint handle_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << handle_word(\"coding\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1937, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"madam im adam\".", "code": "#include \n#include \n#include \n\nint execute_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << execute_word(\"madam im adam\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1938, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"madam im adam\".", "code": "#include \n#include \n#include \n\nint apply_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << apply_word(\"madam im adam\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1939, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"kayak\".", "code": "#include \n#include \n#include \n\nint execute_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << execute_word(\"kayak\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1940, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"kayak\".", "code": "#include \n#include \n#include \n\nint perform_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << perform_word(\"kayak\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1941, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"the quick brown fox\".", "code": "#include \n#include \n#include \n\nint apply_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << apply_word(\"the quick brown fox\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1942, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"the quick brown fox\".", "code": "#include \n#include \n#include \n\nint run_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << run_word(\"the quick brown fox\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1943, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"civic\".", "code": "#include \n#include \n#include \n\nint run_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << run_word(\"civic\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1944, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"civic\".", "code": "#include \n#include \n#include \n\nint process_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << process_word(\"civic\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1945, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"never odd or even\".", "code": "#include \n#include \n#include \n\nint run_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << run_word(\"never odd or even\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1946, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"never odd or even\".", "code": "#include \n#include \n#include \n\nint compute_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << compute_word(\"never odd or even\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1947, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"python programming\".", "code": "#include \n#include \n#include \n\nint process_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << process_word(\"python programming\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1948, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"deified\".", "code": "#include \n#include \n#include \n\nint apply_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << apply_word(\"deified\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1949, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"deified\".", "code": "#include \n#include \n#include \n\nint run_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << run_word(\"deified\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1950, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"algorithms and data structures\".", "code": "#include \n#include \n#include \n\nint run_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << run_word(\"algorithms and data structures\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1951, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"algorithms and data structures\".", "code": "#include \n#include \n#include \n\nint compute_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << compute_word(\"algorithms and data structures\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1952, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"rotor\".", "code": "#include \n#include \n#include \n\nint process_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << process_word(\"rotor\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1953, "language": "C++", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"rotor\".", "code": "#include \n#include \n#include \n\nint execute_word(const std::string& s) {\n std::istringstream iss(s);\n int count = 0;\n std::string word;\n while (iss >> word) count++;\n return count;\n}\n\nint main() {\n std::cout << execute_word(\"rotor\") << std::endl;\n return 0;\n}", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1954, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"racecar\".", "code": "fn perform_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", perform_word(\"racecar\"));\n}", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1955, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"racecar\".", "code": "fn compute_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", compute_word(\"racecar\"));\n}", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1956, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"hello world\".", "code": "fn compute_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", compute_word(\"hello world\"));\n}", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1957, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"hello world\".", "code": "fn run_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", run_word(\"hello world\"));\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1958, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"A man a plan a canal Panama\".", "code": "fn compute_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", compute_word(\"A man a plan a canal Panama\"));\n}", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1959, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"A man a plan a canal Panama\".", "code": "fn perform_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", perform_word(\"A man a plan a canal Panama\"));\n}", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1960, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"Rust is fun\".", "code": "fn compute_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", compute_word(\"Rust is fun\"));\n}", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1961, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"Rust is fun\".", "code": "fn apply_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", apply_word(\"Rust is fun\"));\n}", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1962, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"level\".", "code": "fn apply_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", apply_word(\"level\"));\n}", "explanation": "Word Count operation, function named 'apply_word'."} {"id": 1963, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"level\".", "code": "fn process_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", process_word(\"level\"));\n}", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1964, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"OpenAI Claude\".", "code": "fn execute_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", execute_word(\"OpenAI Claude\"));\n}", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1965, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"OpenAI Claude\".", "code": "fn compute_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", compute_word(\"OpenAI Claude\"));\n}", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1966, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"was it a car or a cat i saw\".", "code": "fn handle_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", handle_word(\"was it a car or a cat i saw\"));\n}", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1967, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"was it a car or a cat i saw\".", "code": "fn compute_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", compute_word(\"was it a car or a cat i saw\"));\n}", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1968, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"noon\".", "code": "fn compute_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", compute_word(\"noon\"));\n}", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1969, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"noon\".", "code": "fn run_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", run_word(\"noon\"));\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1970, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"data science\".", "code": "fn process_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", process_word(\"data science\"));\n}", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1971, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"data science\".", "code": "fn run_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", run_word(\"data science\"));\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1972, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"step on no pets\".", "code": "fn compute_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", compute_word(\"step on no pets\"));\n}", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1973, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"coding\".", "code": "fn perform_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", perform_word(\"coding\"));\n}", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1974, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"coding\".", "code": "fn process_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", process_word(\"coding\"));\n}", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1975, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"madam im adam\".", "code": "fn execute_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", execute_word(\"madam im adam\"));\n}", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1976, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"madam im adam\".", "code": "fn process_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", process_word(\"madam im adam\"));\n}", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1977, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"kayak\".", "code": "fn compute_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", compute_word(\"kayak\"));\n}", "explanation": "Word Count operation, function named 'compute_word'."} {"id": 1978, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"kayak\".", "code": "fn perform_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", perform_word(\"kayak\"));\n}", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1979, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"the quick brown fox\".", "code": "fn process_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", process_word(\"the quick brown fox\"));\n}", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1980, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"the quick brown fox\".", "code": "fn execute_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", execute_word(\"the quick brown fox\"));\n}", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1981, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"civic\".", "code": "fn perform_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", perform_word(\"civic\"));\n}", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1982, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"civic\".", "code": "fn run_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", run_word(\"civic\"));\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1983, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"never odd or even\".", "code": "fn handle_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", handle_word(\"never odd or even\"));\n}", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1984, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"python programming\".", "code": "fn process_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", process_word(\"python programming\"));\n}", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1985, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"python programming\".", "code": "fn execute_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", execute_word(\"python programming\"));\n}", "explanation": "Word Count operation, function named 'execute_word'."} {"id": 1986, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"deified\".", "code": "fn process_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", process_word(\"deified\"));\n}", "explanation": "Word Count operation, function named 'process_word'."} {"id": 1987, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"deified\".", "code": "fn handle_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", handle_word(\"deified\"));\n}", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1988, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"algorithms and data structures\".", "code": "fn perform_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", perform_word(\"algorithms and data structures\"));\n}", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1989, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"algorithms and data structures\".", "code": "fn handle_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", handle_word(\"algorithms and data structures\"));\n}", "explanation": "Word Count operation, function named 'handle_word'."} {"id": 1990, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"rotor\".", "code": "fn perform_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", perform_word(\"rotor\"));\n}", "explanation": "Word Count operation, function named 'perform_word'."} {"id": 1991, "language": "Rust", "category": "String Manipulation", "difficulty": "beginner", "task_description": "Perform 'word count' on the string \"rotor\".", "code": "fn run_word(s: &str) -> usize {\n s.split_whitespace().count()\n}\n\nfn main() {\n println!(\"{}\", run_word(\"rotor\"));\n}", "explanation": "Word Count operation, function named 'run_word'."} {"id": 1992, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"racecar\".", "code": "def run_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(run_vowel('racecar'))", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 1993, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"racecar\".", "code": "def compute_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(compute_vowel('racecar'))", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 1994, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"hello world\".", "code": "def compute_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(compute_vowel('hello world'))", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 1995, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"hello world\".", "code": "def run_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(run_vowel('hello world'))", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 1996, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"A man a plan a canal Panama\".", "code": "def perform_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(perform_vowel('A man a plan a canal Panama'))", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 1997, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"A man a plan a canal Panama\".", "code": "def execute_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(execute_vowel('A man a plan a canal Panama'))", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 1998, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"Rust is fun\".", "code": "def handle_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(handle_vowel('Rust is fun'))", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 1999, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"Rust is fun\".", "code": "def apply_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(apply_vowel('Rust is fun'))", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2000, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"level\".", "code": "def apply_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(apply_vowel('level'))", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2001, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"level\".", "code": "def perform_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(perform_vowel('level'))", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2002, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"OpenAI Claude\".", "code": "def apply_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(apply_vowel('OpenAI Claude'))", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2003, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"OpenAI Claude\".", "code": "def execute_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(execute_vowel('OpenAI Claude'))", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2004, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"was it a car or a cat i saw\".", "code": "def execute_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(execute_vowel('was it a car or a cat i saw'))", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2005, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"was it a car or a cat i saw\".", "code": "def run_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(run_vowel('was it a car or a cat i saw'))", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2006, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"noon\".", "code": "def process_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(process_vowel('noon'))", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2007, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"data science\".", "code": "def compute_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(compute_vowel('data science'))", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2008, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"step on no pets\".", "code": "def process_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(process_vowel('step on no pets'))", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2009, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"step on no pets\".", "code": "def handle_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(handle_vowel('step on no pets'))", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2010, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"coding\".", "code": "def execute_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(execute_vowel('coding'))", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2011, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"coding\".", "code": "def perform_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(perform_vowel('coding'))", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2012, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"madam im adam\".", "code": "def perform_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(perform_vowel('madam im adam'))", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2013, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"madam im adam\".", "code": "def apply_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(apply_vowel('madam im adam'))", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2014, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"kayak\".", "code": "def process_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(process_vowel('kayak'))", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2015, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"kayak\".", "code": "def run_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(run_vowel('kayak'))", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2016, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"the quick brown fox\".", "code": "def execute_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(execute_vowel('the quick brown fox'))", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2017, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"the quick brown fox\".", "code": "def perform_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(perform_vowel('the quick brown fox'))", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2018, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"civic\".", "code": "def process_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(process_vowel('civic'))", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2019, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"civic\".", "code": "def compute_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(compute_vowel('civic'))", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2020, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"never odd or even\".", "code": "def perform_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(perform_vowel('never odd or even'))", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2021, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"python programming\".", "code": "def compute_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(compute_vowel('python programming'))", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2022, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"python programming\".", "code": "def run_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(run_vowel('python programming'))", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2023, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"deified\".", "code": "def run_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(run_vowel('deified'))", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2024, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"deified\".", "code": "def process_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(process_vowel('deified'))", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2025, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"algorithms and data structures\".", "code": "def handle_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(handle_vowel('algorithms and data structures'))", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2026, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"algorithms and data structures\".", "code": "def perform_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(perform_vowel('algorithms and data structures'))", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2027, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"rotor\".", "code": "def compute_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(compute_vowel('rotor'))", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2028, "language": "Python", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"rotor\".", "code": "def perform_vowel(s):\n return sum(1 for c in s.lower() if c in \"aeiou\")\n\nprint(perform_vowel('rotor'))", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2029, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"racecar\".", "code": "function perform_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(perform_vowel(\"racecar\"));", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2030, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"hello world\".", "code": "function process_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(process_vowel(\"hello world\"));", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2031, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"hello world\".", "code": "function apply_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(apply_vowel(\"hello world\"));", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2032, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"A man a plan a canal Panama\".", "code": "function run_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(run_vowel(\"A man a plan a canal Panama\"));", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2033, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"A man a plan a canal Panama\".", "code": "function process_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(process_vowel(\"A man a plan a canal Panama\"));", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2034, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"Rust is fun\".", "code": "function apply_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(apply_vowel(\"Rust is fun\"));", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2035, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"Rust is fun\".", "code": "function handle_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(handle_vowel(\"Rust is fun\"));", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2036, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"level\".", "code": "function execute_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(execute_vowel(\"level\"));", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2037, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"level\".", "code": "function compute_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(compute_vowel(\"level\"));", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2038, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"OpenAI Claude\".", "code": "function compute_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(compute_vowel(\"OpenAI Claude\"));", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2039, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"OpenAI Claude\".", "code": "function execute_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(execute_vowel(\"OpenAI Claude\"));", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2040, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"was it a car or a cat i saw\".", "code": "function execute_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(execute_vowel(\"was it a car or a cat i saw\"));", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2041, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"noon\".", "code": "function apply_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(apply_vowel(\"noon\"));", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2042, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"data science\".", "code": "function handle_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(handle_vowel(\"data science\"));", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2043, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"data science\".", "code": "function perform_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(perform_vowel(\"data science\"));", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2044, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"step on no pets\".", "code": "function apply_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(apply_vowel(\"step on no pets\"));", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2045, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"step on no pets\".", "code": "function process_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(process_vowel(\"step on no pets\"));", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2046, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"coding\".", "code": "function compute_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(compute_vowel(\"coding\"));", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2047, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"coding\".", "code": "function execute_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(execute_vowel(\"coding\"));", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2048, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"madam im adam\".", "code": "function run_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(run_vowel(\"madam im adam\"));", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2049, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"madam im adam\".", "code": "function handle_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(handle_vowel(\"madam im adam\"));", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2050, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"kayak\".", "code": "function apply_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(apply_vowel(\"kayak\"));", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2051, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"kayak\".", "code": "function run_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(run_vowel(\"kayak\"));", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2052, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"the quick brown fox\".", "code": "function compute_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(compute_vowel(\"the quick brown fox\"));", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2053, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"the quick brown fox\".", "code": "function perform_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(perform_vowel(\"the quick brown fox\"));", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2054, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"civic\".", "code": "function perform_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(perform_vowel(\"civic\"));", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2055, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"civic\".", "code": "function apply_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(apply_vowel(\"civic\"));", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2056, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"never odd or even\".", "code": "function handle_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(handle_vowel(\"never odd or even\"));", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2057, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"never odd or even\".", "code": "function compute_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(compute_vowel(\"never odd or even\"));", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2058, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"python programming\".", "code": "function execute_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(execute_vowel(\"python programming\"));", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2059, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"python programming\".", "code": "function perform_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(perform_vowel(\"python programming\"));", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2060, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"deified\".", "code": "function process_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(process_vowel(\"deified\"));", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2061, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"deified\".", "code": "function execute_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(execute_vowel(\"deified\"));", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2062, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"algorithms and data structures\".", "code": "function run_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(run_vowel(\"algorithms and data structures\"));", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2063, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"algorithms and data structures\".", "code": "function handle_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(handle_vowel(\"algorithms and data structures\"));", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2064, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"rotor\".", "code": "function perform_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(perform_vowel(\"rotor\"));", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2065, "language": "JavaScript", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"rotor\".", "code": "function compute_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nconsole.log(compute_vowel(\"rotor\"));", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2066, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"racecar\".", "code": "function compute_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { compute_vowel };\nconsole.log(compute_vowel(\"racecar\"));", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2067, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"racecar\".", "code": "function process_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { process_vowel };\nconsole.log(process_vowel(\"racecar\"));", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2068, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"hello world\".", "code": "function run_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { run_vowel };\nconsole.log(run_vowel(\"hello world\"));", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2069, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"hello world\".", "code": "function handle_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { handle_vowel };\nconsole.log(handle_vowel(\"hello world\"));", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2070, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"A man a plan a canal Panama\".", "code": "function process_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { process_vowel };\nconsole.log(process_vowel(\"A man a plan a canal Panama\"));", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2071, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"A man a plan a canal Panama\".", "code": "function apply_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { apply_vowel };\nconsole.log(apply_vowel(\"A man a plan a canal Panama\"));", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2072, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"Rust is fun\".", "code": "function run_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { run_vowel };\nconsole.log(run_vowel(\"Rust is fun\"));", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2073, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"Rust is fun\".", "code": "function perform_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { perform_vowel };\nconsole.log(perform_vowel(\"Rust is fun\"));", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2074, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"level\".", "code": "function handle_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { handle_vowel };\nconsole.log(handle_vowel(\"level\"));", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2075, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"level\".", "code": "function compute_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { compute_vowel };\nconsole.log(compute_vowel(\"level\"));", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2076, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"OpenAI Claude\".", "code": "function compute_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { compute_vowel };\nconsole.log(compute_vowel(\"OpenAI Claude\"));", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2077, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"OpenAI Claude\".", "code": "function run_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { run_vowel };\nconsole.log(run_vowel(\"OpenAI Claude\"));", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2078, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"was it a car or a cat i saw\".", "code": "function execute_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { execute_vowel };\nconsole.log(execute_vowel(\"was it a car or a cat i saw\"));", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2079, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"was it a car or a cat i saw\".", "code": "function apply_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { apply_vowel };\nconsole.log(apply_vowel(\"was it a car or a cat i saw\"));", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2080, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"noon\".", "code": "function perform_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { perform_vowel };\nconsole.log(perform_vowel(\"noon\"));", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2081, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"noon\".", "code": "function compute_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { compute_vowel };\nconsole.log(compute_vowel(\"noon\"));", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2082, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"data science\".", "code": "function process_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { process_vowel };\nconsole.log(process_vowel(\"data science\"));", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2083, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"data science\".", "code": "function handle_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { handle_vowel };\nconsole.log(handle_vowel(\"data science\"));", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2084, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"step on no pets\".", "code": "function handle_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { handle_vowel };\nconsole.log(handle_vowel(\"step on no pets\"));", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2085, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"step on no pets\".", "code": "function process_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { process_vowel };\nconsole.log(process_vowel(\"step on no pets\"));", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2086, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"coding\".", "code": "function perform_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { perform_vowel };\nconsole.log(perform_vowel(\"coding\"));", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2087, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"coding\".", "code": "function compute_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { compute_vowel };\nconsole.log(compute_vowel(\"coding\"));", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2088, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"madam im adam\".", "code": "function handle_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { handle_vowel };\nconsole.log(handle_vowel(\"madam im adam\"));", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2089, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"madam im adam\".", "code": "function process_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { process_vowel };\nconsole.log(process_vowel(\"madam im adam\"));", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2090, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"kayak\".", "code": "function execute_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { execute_vowel };\nconsole.log(execute_vowel(\"kayak\"));", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2091, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"kayak\".", "code": "function compute_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { compute_vowel };\nconsole.log(compute_vowel(\"kayak\"));", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2092, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"the quick brown fox\".", "code": "function perform_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { perform_vowel };\nconsole.log(perform_vowel(\"the quick brown fox\"));", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2093, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"civic\".", "code": "function execute_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { execute_vowel };\nconsole.log(execute_vowel(\"civic\"));", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2094, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"civic\".", "code": "function apply_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { apply_vowel };\nconsole.log(apply_vowel(\"civic\"));", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2095, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"never odd or even\".", "code": "function run_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { run_vowel };\nconsole.log(run_vowel(\"never odd or even\"));", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2096, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"never odd or even\".", "code": "function execute_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { execute_vowel };\nconsole.log(execute_vowel(\"never odd or even\"));", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2097, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"python programming\".", "code": "function run_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { run_vowel };\nconsole.log(run_vowel(\"python programming\"));", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2098, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"python programming\".", "code": "function perform_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { perform_vowel };\nconsole.log(perform_vowel(\"python programming\"));", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2099, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"deified\".", "code": "function execute_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { execute_vowel };\nconsole.log(execute_vowel(\"deified\"));", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2100, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"deified\".", "code": "function compute_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { compute_vowel };\nconsole.log(compute_vowel(\"deified\"));", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2101, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"algorithms and data structures\".", "code": "function execute_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { execute_vowel };\nconsole.log(execute_vowel(\"algorithms and data structures\"));", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2102, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"algorithms and data structures\".", "code": "function run_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { run_vowel };\nconsole.log(run_vowel(\"algorithms and data structures\"));", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2103, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"rotor\".", "code": "function run_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { run_vowel };\nconsole.log(run_vowel(\"rotor\"));", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2104, "language": "Node.js", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"rotor\".", "code": "function execute_vowel(s) {\n return [...s.toLowerCase()].filter(c => \"aeiou\".includes(c)).length;\n}\n\nmodule.exports = { execute_vowel };\nconsole.log(execute_vowel(\"rotor\"));", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2105, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"racecar\".", "code": "public class Main {\n static int process_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(process_vowel(\"racecar\"));\n }\n}", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2106, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"racecar\".", "code": "public class Main {\n static int compute_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(compute_vowel(\"racecar\"));\n }\n}", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2107, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"hello world\".", "code": "public class Main {\n static int compute_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(compute_vowel(\"hello world\"));\n }\n}", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2108, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"A man a plan a canal Panama\".", "code": "public class Main {\n static int compute_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(compute_vowel(\"A man a plan a canal Panama\"));\n }\n}", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2109, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"A man a plan a canal Panama\".", "code": "public class Main {\n static int apply_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(apply_vowel(\"A man a plan a canal Panama\"));\n }\n}", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2110, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"Rust is fun\".", "code": "public class Main {\n static int run_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(run_vowel(\"Rust is fun\"));\n }\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2111, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"Rust is fun\".", "code": "public class Main {\n static int handle_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(handle_vowel(\"Rust is fun\"));\n }\n}", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2112, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"level\".", "code": "public class Main {\n static int run_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(run_vowel(\"level\"));\n }\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2113, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"level\".", "code": "public class Main {\n static int apply_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(apply_vowel(\"level\"));\n }\n}", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2114, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"OpenAI Claude\".", "code": "public class Main {\n static int perform_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(perform_vowel(\"OpenAI Claude\"));\n }\n}", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2115, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"OpenAI Claude\".", "code": "public class Main {\n static int run_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(run_vowel(\"OpenAI Claude\"));\n }\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2116, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"was it a car or a cat i saw\".", "code": "public class Main {\n static int handle_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(handle_vowel(\"was it a car or a cat i saw\"));\n }\n}", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2117, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"was it a car or a cat i saw\".", "code": "public class Main {\n static int execute_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(execute_vowel(\"was it a car or a cat i saw\"));\n }\n}", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2118, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"noon\".", "code": "public class Main {\n static int perform_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(perform_vowel(\"noon\"));\n }\n}", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2119, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"noon\".", "code": "public class Main {\n static int handle_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(handle_vowel(\"noon\"));\n }\n}", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2120, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"data science\".", "code": "public class Main {\n static int perform_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(perform_vowel(\"data science\"));\n }\n}", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2121, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"data science\".", "code": "public class Main {\n static int run_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(run_vowel(\"data science\"));\n }\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2122, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"step on no pets\".", "code": "public class Main {\n static int compute_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(compute_vowel(\"step on no pets\"));\n }\n}", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2123, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"step on no pets\".", "code": "public class Main {\n static int run_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(run_vowel(\"step on no pets\"));\n }\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2124, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"coding\".", "code": "public class Main {\n static int process_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(process_vowel(\"coding\"));\n }\n}", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2125, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"coding\".", "code": "public class Main {\n static int perform_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(perform_vowel(\"coding\"));\n }\n}", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2126, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"madam im adam\".", "code": "public class Main {\n static int apply_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(apply_vowel(\"madam im adam\"));\n }\n}", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2127, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"madam im adam\".", "code": "public class Main {\n static int execute_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(execute_vowel(\"madam im adam\"));\n }\n}", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2128, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"kayak\".", "code": "public class Main {\n static int process_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(process_vowel(\"kayak\"));\n }\n}", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2129, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"kayak\".", "code": "public class Main {\n static int perform_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(perform_vowel(\"kayak\"));\n }\n}", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2130, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"the quick brown fox\".", "code": "public class Main {\n static int run_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(run_vowel(\"the quick brown fox\"));\n }\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2131, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"the quick brown fox\".", "code": "public class Main {\n static int execute_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(execute_vowel(\"the quick brown fox\"));\n }\n}", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2132, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"civic\".", "code": "public class Main {\n static int compute_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(compute_vowel(\"civic\"));\n }\n}", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2133, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"civic\".", "code": "public class Main {\n static int process_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(process_vowel(\"civic\"));\n }\n}", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2134, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"never odd or even\".", "code": "public class Main {\n static int handle_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(handle_vowel(\"never odd or even\"));\n }\n}", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2135, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"never odd or even\".", "code": "public class Main {\n static int perform_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(perform_vowel(\"never odd or even\"));\n }\n}", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2136, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"python programming\".", "code": "public class Main {\n static int execute_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(execute_vowel(\"python programming\"));\n }\n}", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2137, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"python programming\".", "code": "public class Main {\n static int compute_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(compute_vowel(\"python programming\"));\n }\n}", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2138, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"deified\".", "code": "public class Main {\n static int compute_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(compute_vowel(\"deified\"));\n }\n}", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2139, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"algorithms and data structures\".", "code": "public class Main {\n static int apply_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(apply_vowel(\"algorithms and data structures\"));\n }\n}", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2140, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"algorithms and data structures\".", "code": "public class Main {\n static int compute_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(compute_vowel(\"algorithms and data structures\"));\n }\n}", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2141, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"rotor\".", "code": "public class Main {\n static int run_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(run_vowel(\"rotor\"));\n }\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2142, "language": "Java", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"rotor\".", "code": "public class Main {\n static int perform_vowel(String s) {\n int count = 0;\n for (char c : s.toLowerCase().toCharArray()) {\n if (\"aeiou\".indexOf(c) >= 0) count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n System.out.println(perform_vowel(\"rotor\"));\n }\n}", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2143, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"racecar\".", "code": "#include \n#include \n#include \n\nint run_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", run_vowel(\"racecar\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2144, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"racecar\".", "code": "#include \n#include \n#include \n\nint process_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", process_vowel(\"racecar\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2145, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"hello world\".", "code": "#include \n#include \n#include \n\nint handle_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", handle_vowel(\"hello world\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2146, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"hello world\".", "code": "#include \n#include \n#include \n\nint execute_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", execute_vowel(\"hello world\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2147, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"A man a plan a canal Panama\".", "code": "#include \n#include \n#include \n\nint execute_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", execute_vowel(\"A man a plan a canal Panama\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2148, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"A man a plan a canal Panama\".", "code": "#include \n#include \n#include \n\nint handle_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", handle_vowel(\"A man a plan a canal Panama\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2149, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"Rust is fun\".", "code": "#include \n#include \n#include \n\nint execute_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", execute_vowel(\"Rust is fun\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2150, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"Rust is fun\".", "code": "#include \n#include \n#include \n\nint compute_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", compute_vowel(\"Rust is fun\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2151, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"level\".", "code": "#include \n#include \n#include \n\nint execute_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", execute_vowel(\"level\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2152, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"level\".", "code": "#include \n#include \n#include \n\nint run_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", run_vowel(\"level\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2153, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"OpenAI Claude\".", "code": "#include \n#include \n#include \n\nint run_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", run_vowel(\"OpenAI Claude\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2154, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"OpenAI Claude\".", "code": "#include \n#include \n#include \n\nint apply_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", apply_vowel(\"OpenAI Claude\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2155, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"was it a car or a cat i saw\".", "code": "#include \n#include \n#include \n\nint process_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", process_vowel(\"was it a car or a cat i saw\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2156, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"was it a car or a cat i saw\".", "code": "#include \n#include \n#include \n\nint apply_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", apply_vowel(\"was it a car or a cat i saw\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2157, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"noon\".", "code": "#include \n#include \n#include \n\nint compute_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", compute_vowel(\"noon\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2158, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"noon\".", "code": "#include \n#include \n#include \n\nint execute_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", execute_vowel(\"noon\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2159, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"data science\".", "code": "#include \n#include \n#include \n\nint perform_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", perform_vowel(\"data science\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2160, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"data science\".", "code": "#include \n#include \n#include \n\nint run_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", run_vowel(\"data science\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2161, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"step on no pets\".", "code": "#include \n#include \n#include \n\nint handle_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", handle_vowel(\"step on no pets\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2162, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"step on no pets\".", "code": "#include \n#include \n#include \n\nint run_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", run_vowel(\"step on no pets\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2163, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"coding\".", "code": "#include \n#include \n#include \n\nint execute_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", execute_vowel(\"coding\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2164, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"coding\".", "code": "#include \n#include \n#include \n\nint handle_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", handle_vowel(\"coding\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2165, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"madam im adam\".", "code": "#include \n#include \n#include \n\nint run_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", run_vowel(\"madam im adam\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2166, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"madam im adam\".", "code": "#include \n#include \n#include \n\nint execute_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", execute_vowel(\"madam im adam\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2167, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"kayak\".", "code": "#include \n#include \n#include \n\nint apply_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", apply_vowel(\"kayak\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2168, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"kayak\".", "code": "#include \n#include \n#include \n\nint process_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", process_vowel(\"kayak\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2169, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"the quick brown fox\".", "code": "#include \n#include \n#include \n\nint process_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", process_vowel(\"the quick brown fox\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2170, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"the quick brown fox\".", "code": "#include \n#include \n#include \n\nint run_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", run_vowel(\"the quick brown fox\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2171, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"civic\".", "code": "#include \n#include \n#include \n\nint handle_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", handle_vowel(\"civic\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2172, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"never odd or even\".", "code": "#include \n#include \n#include \n\nint process_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", process_vowel(\"never odd or even\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2173, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"never odd or even\".", "code": "#include \n#include \n#include \n\nint execute_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", execute_vowel(\"never odd or even\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2174, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"python programming\".", "code": "#include \n#include \n#include \n\nint compute_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", compute_vowel(\"python programming\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2175, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"python programming\".", "code": "#include \n#include \n#include \n\nint handle_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", handle_vowel(\"python programming\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2176, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"deified\".", "code": "#include \n#include \n#include \n\nint apply_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", apply_vowel(\"deified\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2177, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"deified\".", "code": "#include \n#include \n#include \n\nint handle_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", handle_vowel(\"deified\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2178, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"algorithms and data structures\".", "code": "#include \n#include \n#include \n\nint apply_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", apply_vowel(\"algorithms and data structures\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2179, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"rotor\".", "code": "#include \n#include \n#include \n\nint perform_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", perform_vowel(\"rotor\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2180, "language": "C", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"rotor\".", "code": "#include \n#include \n#include \n\nint run_vowel(const char* s) {\n int count = 0;\n for (int i = 0; s[i] != '\\0'; i++) {\n char c = tolower(s[i]);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main(void) {\n printf(\"%d\\n\", run_vowel(\"rotor\"));\n return 0;\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2181, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"racecar\".", "code": "#include \n#include \n#include \n\nint execute_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << execute_vowel(\"racecar\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2182, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"racecar\".", "code": "#include \n#include \n#include \n\nint run_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << run_vowel(\"racecar\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2183, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"hello world\".", "code": "#include \n#include \n#include \n\nint compute_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << compute_vowel(\"hello world\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2184, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"hello world\".", "code": "#include \n#include \n#include \n\nint apply_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << apply_vowel(\"hello world\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2185, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"A man a plan a canal Panama\".", "code": "#include \n#include \n#include \n\nint handle_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << handle_vowel(\"A man a plan a canal Panama\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2186, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"A man a plan a canal Panama\".", "code": "#include \n#include \n#include \n\nint run_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << run_vowel(\"A man a plan a canal Panama\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2187, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"Rust is fun\".", "code": "#include \n#include \n#include \n\nint execute_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << execute_vowel(\"Rust is fun\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2188, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"Rust is fun\".", "code": "#include \n#include \n#include \n\nint compute_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << compute_vowel(\"Rust is fun\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2189, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"level\".", "code": "#include \n#include \n#include \n\nint compute_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << compute_vowel(\"level\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2190, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"level\".", "code": "#include \n#include \n#include \n\nint apply_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << apply_vowel(\"level\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2191, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"OpenAI Claude\".", "code": "#include \n#include \n#include \n\nint compute_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << compute_vowel(\"OpenAI Claude\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2192, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"OpenAI Claude\".", "code": "#include \n#include \n#include \n\nint perform_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << perform_vowel(\"OpenAI Claude\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2193, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"was it a car or a cat i saw\".", "code": "#include \n#include \n#include \n\nint process_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << process_vowel(\"was it a car or a cat i saw\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2194, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"was it a car or a cat i saw\".", "code": "#include \n#include \n#include \n\nint perform_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << perform_vowel(\"was it a car or a cat i saw\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2195, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"noon\".", "code": "#include \n#include \n#include \n\nint perform_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << perform_vowel(\"noon\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2196, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"data science\".", "code": "#include \n#include \n#include \n\nint apply_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << apply_vowel(\"data science\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2197, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"data science\".", "code": "#include \n#include \n#include \n\nint perform_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << perform_vowel(\"data science\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2198, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"step on no pets\".", "code": "#include \n#include \n#include \n\nint compute_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << compute_vowel(\"step on no pets\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2199, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"step on no pets\".", "code": "#include \n#include \n#include \n\nint execute_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << execute_vowel(\"step on no pets\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2200, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"coding\".", "code": "#include \n#include \n#include \n\nint execute_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << execute_vowel(\"coding\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2201, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"madam im adam\".", "code": "#include \n#include \n#include \n\nint run_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << run_vowel(\"madam im adam\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2202, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"madam im adam\".", "code": "#include \n#include \n#include \n\nint handle_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << handle_vowel(\"madam im adam\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2203, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"kayak\".", "code": "#include \n#include \n#include \n\nint apply_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << apply_vowel(\"kayak\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2204, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"kayak\".", "code": "#include \n#include \n#include \n\nint run_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << run_vowel(\"kayak\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2205, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"the quick brown fox\".", "code": "#include \n#include \n#include \n\nint run_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << run_vowel(\"the quick brown fox\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2206, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"the quick brown fox\".", "code": "#include \n#include \n#include \n\nint apply_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << apply_vowel(\"the quick brown fox\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2207, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"civic\".", "code": "#include \n#include \n#include \n\nint run_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << run_vowel(\"civic\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2208, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"civic\".", "code": "#include \n#include \n#include \n\nint compute_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << compute_vowel(\"civic\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2209, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"never odd or even\".", "code": "#include \n#include \n#include \n\nint apply_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << apply_vowel(\"never odd or even\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2210, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"never odd or even\".", "code": "#include \n#include \n#include \n\nint run_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << run_vowel(\"never odd or even\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2211, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"python programming\".", "code": "#include \n#include \n#include \n\nint handle_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << handle_vowel(\"python programming\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2212, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"python programming\".", "code": "#include \n#include \n#include \n\nint apply_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << apply_vowel(\"python programming\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2213, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"deified\".", "code": "#include \n#include \n#include \n\nint handle_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << handle_vowel(\"deified\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2214, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"deified\".", "code": "#include \n#include \n#include \n\nint run_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << run_vowel(\"deified\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2215, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"algorithms and data structures\".", "code": "#include \n#include \n#include \n\nint compute_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << compute_vowel(\"algorithms and data structures\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2216, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"algorithms and data structures\".", "code": "#include \n#include \n#include \n\nint process_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << process_vowel(\"algorithms and data structures\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2217, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"rotor\".", "code": "#include \n#include \n#include \n\nint execute_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << execute_vowel(\"rotor\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2218, "language": "C++", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"rotor\".", "code": "#include \n#include \n#include \n\nint apply_vowel(const std::string& s) {\n int count = 0;\n for (char c : s) {\n c = tolower(c);\n if (c=='a'||c=='e'||c=='i'||c=='o'||c=='u') count++;\n }\n return count;\n}\n\nint main() {\n std::cout << apply_vowel(\"rotor\") << std::endl;\n return 0;\n}", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2219, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"racecar\".", "code": "fn compute_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", compute_vowel(\"racecar\"));\n}", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2220, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"racecar\".", "code": "fn apply_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", apply_vowel(\"racecar\"));\n}", "explanation": "Vowel Count operation, function named 'apply_vowel'."} {"id": 2221, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"hello world\".", "code": "fn run_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", run_vowel(\"hello world\"));\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2222, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"hello world\".", "code": "fn perform_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", perform_vowel(\"hello world\"));\n}", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2223, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"A man a plan a canal Panama\".", "code": "fn handle_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", handle_vowel(\"A man a plan a canal Panama\"));\n}", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2224, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"A man a plan a canal Panama\".", "code": "fn perform_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", perform_vowel(\"A man a plan a canal Panama\"));\n}", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2225, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"Rust is fun\".", "code": "fn process_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", process_vowel(\"Rust is fun\"));\n}", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2226, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"Rust is fun\".", "code": "fn run_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", run_vowel(\"Rust is fun\"));\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2227, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"level\".", "code": "fn execute_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", execute_vowel(\"level\"));\n}", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2228, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"level\".", "code": "fn perform_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", perform_vowel(\"level\"));\n}", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2229, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"OpenAI Claude\".", "code": "fn run_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", run_vowel(\"OpenAI Claude\"));\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2230, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"was it a car or a cat i saw\".", "code": "fn run_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", run_vowel(\"was it a car or a cat i saw\"));\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2231, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"was it a car or a cat i saw\".", "code": "fn handle_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", handle_vowel(\"was it a car or a cat i saw\"));\n}", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2232, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"noon\".", "code": "fn perform_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", perform_vowel(\"noon\"));\n}", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2233, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"noon\".", "code": "fn process_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", process_vowel(\"noon\"));\n}", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2234, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"data science\".", "code": "fn execute_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", execute_vowel(\"data science\"));\n}", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2235, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"data science\".", "code": "fn handle_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", handle_vowel(\"data science\"));\n}", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2236, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"step on no pets\".", "code": "fn handle_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", handle_vowel(\"step on no pets\"));\n}", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2237, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"step on no pets\".", "code": "fn execute_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", execute_vowel(\"step on no pets\"));\n}", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2238, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"coding\".", "code": "fn execute_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", execute_vowel(\"coding\"));\n}", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2239, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"madam im adam\".", "code": "fn process_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", process_vowel(\"madam im adam\"));\n}", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2240, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"madam im adam\".", "code": "fn execute_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", execute_vowel(\"madam im adam\"));\n}", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2241, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"kayak\".", "code": "fn execute_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", execute_vowel(\"kayak\"));\n}", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2242, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"kayak\".", "code": "fn perform_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", perform_vowel(\"kayak\"));\n}", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2243, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"the quick brown fox\".", "code": "fn run_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", run_vowel(\"the quick brown fox\"));\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2244, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"the quick brown fox\".", "code": "fn process_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", process_vowel(\"the quick brown fox\"));\n}", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2245, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"civic\".", "code": "fn compute_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", compute_vowel(\"civic\"));\n}", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2246, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"civic\".", "code": "fn execute_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", execute_vowel(\"civic\"));\n}", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2247, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"never odd or even\".", "code": "fn handle_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", handle_vowel(\"never odd or even\"));\n}", "explanation": "Vowel Count operation, function named 'handle_vowel'."} {"id": 2248, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"python programming\".", "code": "fn execute_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", execute_vowel(\"python programming\"));\n}", "explanation": "Vowel Count operation, function named 'execute_vowel'."} {"id": 2249, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"python programming\".", "code": "fn perform_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", perform_vowel(\"python programming\"));\n}", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2250, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"deified\".", "code": "fn run_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", run_vowel(\"deified\"));\n}", "explanation": "Vowel Count operation, function named 'run_vowel'."} {"id": 2251, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"deified\".", "code": "fn perform_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", perform_vowel(\"deified\"));\n}", "explanation": "Vowel Count operation, function named 'perform_vowel'."} {"id": 2252, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"algorithms and data structures\".", "code": "fn process_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", process_vowel(\"algorithms and data structures\"));\n}", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2253, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"algorithms and data structures\".", "code": "fn compute_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", compute_vowel(\"algorithms and data structures\"));\n}", "explanation": "Vowel Count operation, function named 'compute_vowel'."} {"id": 2254, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"rotor\".", "code": "fn process_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", process_vowel(\"rotor\"));\n}", "explanation": "Vowel Count operation, function named 'process_vowel'."} {"id": 2255, "language": "Rust", "category": "String Manipulation", "difficulty": "intermediate", "task_description": "Perform 'vowel count' on the string \"rotor\".", "code": "fn perform_vowel(s: &str) -> usize {\n s.to_lowercase().chars().filter(|c| \"aeiou\".contains(*c)).count()\n}\n\nfn main() {\n println!(\"{}\", perform_vowel(\"rotor\"));\n}", "explanation": "Vowel Count operation, function named 'perform_vowel'."}