question stringlengths 142 5.52k | answer stringlengths 1 5.1k | source_dataset stringclasses 10
values | metadata_json stringlengths 168 15.4k |
|---|---|---|---|
You are a police officer. A maniac has planted a bomb next to a public fountain.
To defuse the bomb, you must solve a puzzle. The puzzle is solved when you fill any of the available jugs with the target amount of water.
You have three move types: 'fill', 'empty' and 'pour'.
To fill Jug A, you 'fill A'.
To empty Jug ... | ["fill C", "pour C->A", "fill C", "pour C->A", "fill C", "pour C->A", "fill C", "pour C->A", "pour A->B", "pour B->C", "pour C->A"] | jugs | {"difficulty": {"difficulty": 10, "num_jugs": 4}, "puzzle": {"jug_capacities": [13, 10, 3, 10], "min_moves": 11, "target": 5}, "source_dataset": "jugs", "source_index": 125} |
An anagram is a word formed by rearranging the letters of a different word, using all the original letters exactly once.
Your job is to group the anagrams together. You can return the answer in any order.
The output is a list of lists of strings, where each outer list contains a group of anagrams, e.g. [["eat", "tea"... | [["acopon", "poonac"], ["addy", "dyad"], ["admonitions", "dominations"], ["ailments", "melanist", "mentalis", "smaltine", "stileman"], ["aletap", "palate", "platea"], ["amnionate", "anamniote", "emanation"], ["cir", "ric"], ["deuteranopic", "preeducation"], ["diasters", "disaster", "disrates"], ["encrinital", "tricenni... | group_anagrams | {"anagram_groups": 22, "difficulty": {"anagram_groups": [10, 50], "words_per_group": [2, 5]}, "solution": [["acopon", "poonac"], ["addy", "dyad"], ["admonitions", "dominations"], ["ailments", "melanist", "mentalis", "smaltine", "stileman"], ["aletap", "palate", "platea"], ["amnionate", "anamniote", "emanation"], ["cir"... |
You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | -1 | rotten_oranges | {"difficulty": {"n": [25, 50]}, "matrix": [[0, 1, 1, 0, 2, 1, 1, 1, 1, 1, 1, 1, 0, 2, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 2], [1, 1, 2, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 2... |
What will this Game of Life board look like after 2 steps of simulation? Assume a Moore neighborhood and wrapping topology. Reply as array of arrays representing rows in the grid from top to bottom in JSON format. (An empty 3x3 grid would look like this: [[0,0,0],[0,0,0],[0,0,0]])
[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0... | [[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,... | game_of_life | {"difficulty": {"filled_cells_weights": 0.2, "grid_size_x": 50, "grid_size_y": 50, "simulation_steps": 2}, "filled_cells": 10, "grid_size_x": 50, "grid_size_y": 50, "simulation_steps": 2, "source_dataset": "game_of_life", "source_index": 77} |
You are a police officer. A maniac has planted a bomb next to a public fountain.
To defuse the bomb, you must solve a puzzle. The puzzle is solved when you fill any of the available jugs with the target amount of water.
You have three move types: 'fill', 'empty' and 'pour'.
To fill Jug A, you 'fill A'.
To empty Jug ... | ["fill A", "pour A->B", "fill A", "pour A->B", "fill A", "pour A->B", "fill A", "pour A->B", "pour A->C", "fill A", "pour A->C"] | jugs | {"difficulty": {"difficulty": 10, "num_jugs": 4}, "puzzle": {"jug_capacities": [3, 11, 11, 11], "min_moves": 11, "target": 4}, "source_dataset": "jugs", "source_index": 112} |
Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-11 number 3274a to base-17
| 9b55 | base_conversion | {"decimal_value": 47486, "difficulty": {"base": [9, 18], "value": [10000, 100000]}, "source_base": 11, "source_dataset": "base_conversion", "source_index": 43, "source_repr": "3274a", "target_base": 17, "target_repr": "9b55"} |
Sort these numbers in ascending order: -216.41, -10.866, 493.45, 333.111, -1.2756, 254.289, 108.6024, 446.996, -238.675, -101.3982, -169.8, -374.236, -456.19, -350.607, 28.509, 35.74, -258.514, -364.2986, -387.43, 406.55, 44.156, 51.79, 262.169, 208.55, 211.504, 152.2215, 95.56, -342.74, -181.353, 37.82, 457.623, -77.2... | ['-497.68', '-487.05', '-483.26', '-459.59', '-456.19', '-455.76', '-429.52', '-397.184', '-391.59', '-387.43', '-386.063', '-379.1485', '-375.63', '-374.236', '-365.518', '-364.2986', '-350.607', '-342.74', '-327.6382', '-322.34', '-278.69', '-258.514', '-255.887', '-251.6751', '-240.069', '-238.675', '-216.41', '-186... | number_sorting | {"difficulty": {"decimals": [2, 4], "numbers": [50, 100], "value": [-500, 500]}, "direction": "ascending", "numbers": 96, "original_numbers": ["-216.41", "-10.866", "493.45", "333.111", "-1.2756", "254.289", "108.6024", "446.996", "-238.675", "-101.3982", "-169.8", "-374.236", "-456.19", "-350.607", "28.509", "35.74", ... |
Transform the word ladder 'HOW' to 'WOP' by changing one letter at a time.
Provide your answer as a comma-separated sequence of uppercase letters without spaces.
Each step must be a valid English word. | HOW,HOP,WOP | word_ladder | {"chain_length": 3, "difficulty": {"word_length": [3, 5]}, "end_word": "WOP", "source_dataset": "word_ladder", "source_index": 0, "start_word": "HOW", "word_length": 3} |
Decrypt this Caesar cipher text: VG FGL UZSJYW S XWW XGJ SUUWKK UGHQAFY GJ VAKLJATMLAFY SFQ HJGBWUL OGJCK MFDWKK QGM UGEHDQ OALZ HSJSYJSHZ. Provide only the decrypted text as your final answer. | DO NOT CHARGE A FEE FOR ACCESS COPYING OR DISTRIBUTING ANY PROJECT WORKS UNLESS YOU COMPLY WITH PARAGRAPH | caesar_cipher | {"cipher_text": "VG FGL UZSJYW S XWW XGJ SUUWKK UGHQAFY GJ VAKLJATMLAFY SFQ HJGBWUL OGJCK MFDWKK QGM UGEHDQ OALZ HSJSYJSHZ", "clear_text": "DO NOT CHARGE A FEE FOR ACCESS COPYING OR DISTRIBUTING ANY PROJECT WORKS UNLESS YOU COMPLY WITH PARAGRAPH", "difficulty": {"rotation": [15, 25], "words": [15, 25]}, "num_words": 18... |
You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | 7 | rotten_oranges | {"difficulty": {"n": [25, 50]}, "matrix": [[1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 0, 1, 2, 2, 1, 1, 1, 0, 0, 1, 2, 0], [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0], [1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1, ... |
Solve this cryptarithm:
ZEERE
EZDZ
LLZL
EFFD
DZTEL
RHHLE
TIZL
TIR
+ ZHDZ
--------
ZEVDLE
Each letter stands for a unique digit (0-9). No leading letter can be zero.
Provide a comma separated mapping from letters to digits that satisfies the equation in your final answer. Output forma... | D=2,E=5,F=0,H=8,I=7,L=4,R=9,T=3,V=6,Z=1 | cryptarithm | {"difficulty": {"words": [5, 10]}, "digit_to_letter": {"0": "F", "1": "Z", "2": "D", "3": "T", "4": "L", "5": "E", "6": "V", "7": "I", "8": "H", "9": "R"}, "letter_to_digit": {"D": 2, "E": 5, "F": 0, "H": 8, "I": 7, "L": 4, "R": 9, "T": 3, "V": 6, "Z": 1}, "letters": ["L", "R", "H", "Z", "V", "I", "E", "D", "F", "T"], ... |
Given a square matrix, your job is to rotate it clockwise.
Your output should be a matrix in the same format as the input.
Rotate the matrix below by 810 degrees clockwise:
2 6 0 2 0 4 1 8 0 3 7 4 3 7 2 9 6 3 7 9 8 9 8 5 6 9 5 3 1 8 0 9 5 8 1 9 2 5
1 4 4 5 2 0 7 3 1 7 2 3 9 9 0 5 5 6 1 1 5 9 1 4 7 2 6 2 3 2 2 9 1 6 9... | 6 1 9 5 9 8 8 9 1 4 9 7 9 0 1 8 9 3 8 1 7 1 5 5 8 0 3 9 6 7 8 4 8 3 9 8 1 2
4 1 4 6 1 6 8 4 8 1 2 8 2 4 4 4 8 9 3 5 8 0 7 6 7 9 0 4 3 5 7 9 9 3 0 6 4 6
3 6 6 1 8 4 1 8 5 9 6 0 3 9 5 1 5 4 5 8 5 9 5 4 0 9 3 6 2 4 5 6 0 7 1 2 4 0
6 6 3 2 7 1 8 8 2 0 0 9 2 0 8 9 4 7 6 7 2 3 3 2 3 7 1 8 0 7 3 3 3 8 8 9 5 2
3 0 4 8 0 8 5 6 ... | rotate_matrix | {"difficulty": {"n": [25, 50], "num_rotations": [5, 15]}, "matrix": [[2, 6, 0, 2, 0, 4, 1, 8, 0, 3, 7, 4, 3, 7, 2, 9, 6, 3, 7, 9, 8, 9, 8, 5, 6, 9, 5, 3, 1, 8, 0, 9, 5, 8, 1, 9, 2, 5], [1, 4, 4, 5, 2, 0, 7, 3, 1, 7, 2, 3, 9, 9, 0, 5, 5, 6, 1, 1, 5, 9, 1, 4, 7, 2, 6, 2, 3, 2, 2, 9, 1, 6, 9, 3, 0, 7], [8, 6, 2, 9, 4, 7, ... |
An anagram is a word formed by rearranging the letters of a different word, using all the original letters exactly once.
Your job is to group the anagrams together. You can return the answer in any order.
The output is a list of lists of strings, where each outer list contains a group of anagrams, e.g. [["eat", "tea"... | [["adenous", "douanes"], ["affairs", "raffias"], ["altars", "astral", "ratals", "talars", "tarsal"], ["altruist", "titulars", "ultraist"], ["amassed", "damasse"], ["angeles", "senegal"], ["anthemas", "heatsman"], ["apartness", "repassant"], ["besoms", "emboss"], ["biform", "obfirm"], ["boney", "ebony"], ["burglaries", ... | group_anagrams | {"anagram_groups": 47, "difficulty": {"anagram_groups": [10, 50], "words_per_group": [2, 5]}, "solution": [["adenous", "douanes"], ["affairs", "raffias"], ["altars", "astral", "ratals", "talars", "tarsal"], ["altruist", "titulars", "ultraist"], ["amassed", "damasse"], ["angeles", "senegal"], ["anthemas", "heatsman"], [... |
What will this Game of Life board look like after 2 steps of simulation? Assume a Moore neighborhood and wrapping topology. Reply as array of arrays representing rows in the grid from top to bottom in JSON format. (An empty 3x3 grid would look like this: [[0,0,0],[0,0,0],[0,0,0]])
[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0... | [[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,... | game_of_life | {"difficulty": {"filled_cells_weights": 0.2, "grid_size_x": 50, "grid_size_y": 50, "simulation_steps": 2}, "filled_cells": 10, "grid_size_x": 50, "grid_size_y": 50, "simulation_steps": 2, "source_dataset": "game_of_life", "source_index": 21} |
What will this Game of Life board look like after 2 steps of simulation? Assume a Moore neighborhood and wrapping topology. Reply as array of arrays representing rows in the grid from top to bottom in JSON format. (An empty 3x3 grid would look like this: [[0,0,0],[0,0,0],[0,0,0]])
[[0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0... | [[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,... | game_of_life | {"difficulty": {"filled_cells_weights": 0.2, "grid_size_x": 50, "grid_size_y": 50, "simulation_steps": 2}, "filled_cells": 10, "grid_size_x": 50, "grid_size_y": 50, "simulation_steps": 2, "source_dataset": "game_of_life", "source_index": 114} |
What will this Game of Life board look like after 2 steps of simulation? Assume a Moore neighborhood and wrapping topology. Reply as array of arrays representing rows in the grid from top to bottom in JSON format. (An empty 3x3 grid would look like this: [[0,0,0],[0,0,0],[0,0,0]])
[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0... | [[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,... | game_of_life | {"difficulty": {"filled_cells_weights": 0.2, "grid_size_x": 50, "grid_size_y": 50, "simulation_steps": 2}, "filled_cells": 10, "grid_size_x": 50, "grid_size_y": 50, "simulation_steps": 2, "source_dataset": "game_of_life", "source_index": 59} |
What will this Game of Life board look like after 2 steps of simulation? Assume a Moore neighborhood and wrapping topology. Reply as array of arrays representing rows in the grid from top to bottom in JSON format. (An empty 3x3 grid would look like this: [[0,0,0],[0,0,0],[0,0,0]])
[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0... | [[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,... | game_of_life | {"difficulty": {"filled_cells_weights": 0.2, "grid_size_x": 50, "grid_size_y": 50, "simulation_steps": 2}, "filled_cells": 10, "grid_size_x": 50, "grid_size_y": 50, "simulation_steps": 2, "source_dataset": "game_of_life", "source_index": 40} |
Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-15 number 1b155 to base-9
| 143708 | base_conversion | {"decimal_value": 88055, "difficulty": {"base": [9, 18], "value": [10000, 100000]}, "source_base": 15, "source_dataset": "base_conversion", "source_index": 119, "source_repr": "1b155", "target_base": 9, "target_repr": "143708"} |
Transform the word ladder 'KNOWN' to 'BRAVO' by changing one letter at a time.
Provide your answer as a comma-separated sequence of uppercase letters without spaces.
Each step must be a valid English word. | KNOWN,KNOWS,KNOBS,SNOBS,SLOBS,GLOBS,GLOBE,GLOVE,GROVE,GRAVE,BRAVE,BRAVO | word_ladder | {"chain_length": 12, "difficulty": {"word_length": [3, 5]}, "end_word": "BRAVO", "source_dataset": "word_ladder", "source_index": 52, "start_word": "KNOWN", "word_length": 5} |
Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-13 number a315 to hexadecimal
| 57df | base_conversion | {"decimal_value": 22495, "difficulty": {"base": [9, 18], "value": [10000, 100000]}, "source_base": 13, "source_dataset": "base_conversion", "source_index": 88, "source_repr": "a315", "target_base": 16, "target_repr": "57df"} |
You are a police officer. A maniac has planted a bomb next to a public fountain.
To defuse the bomb, you must solve a puzzle. The puzzle is solved when you fill any of the available jugs with the target amount of water.
You have three move types: 'fill', 'empty' and 'pour'.
To fill Jug A, you 'fill A'.
To empty Jug ... | ["fill A", "pour A->B", "fill A", "pour A->B", "empty B", "pour A->B", "fill A", "pour A->B", "empty B", "pour A->B", "fill A", "pour A->B", "empty B", "pour A->B", "fill A", "pour A->B", "empty B", "pour A->B", "fill A", "pour A->B"] | jugs | {"difficulty": {"difficulty": 10, "num_jugs": 4}, "puzzle": {"jug_capacities": [11, 13, 11, 11], "min_moves": 20, "target": 1}, "source_dataset": "jugs", "source_index": 108} |
You are a police officer. A maniac has planted a bomb next to a public fountain.
To defuse the bomb, you must solve a puzzle. The puzzle is solved when you fill any of the available jugs with the target amount of water.
You have three move types: 'fill', 'empty' and 'pour'.
To fill Jug A, you 'fill A'.
To empty Jug ... | ["fill C", "pour C->A", "fill C", "pour C->A", "empty A", "pour C->A", "fill C", "pour C->A", "pour C->B", "pour A->C", "pour C->B"] | jugs | {"difficulty": {"difficulty": 10, "num_jugs": 4}, "puzzle": {"jug_capacities": [11, 11, 9, 11], "min_moves": 10, "target": 3}, "source_dataset": "jugs", "source_index": 115} |
Sort these numbers in ascending order: 157.2, 465.473, -408.6585, -317.464, -335.77, 428.696, -328.096, -431.82, 344.37, -471.93, -272.496, 149.8606, -398.66, -218.04, 102.954, 106.3597, 58.366, -398.0783, -373.616, -257.421, 72.8524, -119.24, 37.788, 410.449, -243.044, -189.919, 57.26, -269.6, 353.347, 231.371, -95.29... | ['-475.0', '-471.93', '-458.3041', '-452.85', '-442.73', '-431.82', '-412.322', '-408.6585', '-405.728', '-398.66', '-398.0783', '-394.11', '-381.72', '-373.616', '-371.16', '-354.6305', '-344.5766', '-335.77', '-328.096', '-317.464', '-310.68', '-304.293', '-272.496', '-269.6', '-265.0375', '-261.8931', '-260.81', '-2... | number_sorting | {"difficulty": {"decimals": [2, 4], "numbers": [50, 100], "value": [-500, 500]}, "direction": "ascending", "numbers": 85, "original_numbers": ["157.2", "465.473", "-408.6585", "-317.464", "-335.77", "428.696", "-328.096", "-431.82", "344.37", "-471.93", "-272.496", "149.8606", "-398.66", "-218.04", "102.954", "106.3597... |
An anagram is a word formed by rearranging the letters of a different word, using all the original letters exactly once.
Your job is to group the anagrams together. You can return the answer in any order.
The output is a list of lists of strings, where each outer list contains a group of anagrams, e.g. [["eat", "tea"... | [["afley", "fleay", "leafy"], ["barless", "braless"], ["befleaed", "feedable"], ["bimethyls", "bismethyl"], ["chilean", "chinela", "echinal", "nichael"], ["colpeurynter", "counterreply"], ["enigmatist", "estimating"], ["fenagle", "leefang"], ["fritts", "strift"], ["groten", "tonger"], ["insectology", "scientology"], ["... | group_anagrams | {"anagram_groups": 19, "difficulty": {"anagram_groups": [10, 50], "words_per_group": [2, 5]}, "solution": [["afley", "fleay", "leafy"], ["barless", "braless"], ["befleaed", "feedable"], ["bimethyls", "bismethyl"], ["chilean", "chinela", "echinal", "nichael"], ["colpeurynter", "counterreply"], ["enigmatist", "estimating... |
Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-11 number 17712 to base-13
| b3b1 | base_conversion | {"decimal_value": 24818, "difficulty": {"base": [9, 18], "value": [10000, 100000]}, "source_base": 11, "source_dataset": "base_conversion", "source_index": 109, "source_repr": "17712", "target_base": 13, "target_repr": "b3b1"} |
Sort these numbers in descending order: 48.26, 447.38, -83.811, -468.41, -102.551, 315.53, 43.0553, -74.43, -281.54, -183.95, -112.2407, -143.566, 254.79, -393.9469, 13.0593, 433.342, -387.9253, 34.95, 106.798, -410.1112, 33.2, 448.082, 223.71, 300.952, 136.9828, 236.2311, 270.0, -327.1054, 405.36, -264.9021, -399.3155... | ['454.94', '448.082', '447.38', '433.342', '415.17', '405.36', '356.044', '347.191', '315.53', '314.983', '314.79', '313.8892', '300.952', '289.1324', '270.0', '254.79', '239.0461', '236.2311', '223.71', '183.67', '145.44', '136.9828', '106.798', '105.78', '79.4268', '48.65', '48.26', '43.0553', '34.95', '33.2', '14.25... | number_sorting | {"difficulty": {"decimals": [2, 4], "numbers": [50, 100], "value": [-500, 500]}, "direction": "descending", "numbers": 67, "original_numbers": ["48.26", "447.38", "-83.811", "-468.41", "-102.551", "315.53", "43.0553", "-74.43", "-281.54", "-183.95", "-112.2407", "-143.566", "254.79", "-393.9469", "13.0593", "433.342", ... |
Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-17 number 10b72 to base-13
| 30697 | base_conversion | {"decimal_value": 86821, "difficulty": {"base": [9, 18], "value": [10000, 100000]}, "source_base": 17, "source_dataset": "base_conversion", "source_index": 53, "source_repr": "10b72", "target_base": 13, "target_repr": "30697"} |
Decrypt this Caesar cipher text: GLQRCYB MD ZCGLE RFC CYPRF AFPMLGAJC GQ CTCPW KMPLGLE QNMICL RM GL GLRCPCQRGLE AMLTCPQYRGMLQ UGRF YLB JCYPL RFC LCUQ MD RFC BYW. Provide only the decrypted text as your final answer. | INSTEAD OF BEING THE EARTH CHRONICLE IS EVERY MORNING SPOKEN TO IN INTERESTING CONVERSATIONS WITH AND LEARN THE NEWS OF THE DAY | caesar_cipher | {"cipher_text": "GLQRCYB MD ZCGLE RFC CYPRF AFPMLGAJC GQ CTCPW KMPLGLE QNMICL RM GL GLRCPCQRGLE AMLTCPQYRGMLQ UGRF YLB JCYPL RFC LCUQ MD RFC BYW", "clear_text": "INSTEAD OF BEING THE EARTH CHRONICLE IS EVERY MORNING SPOKEN TO IN INTERESTING CONVERSATIONS WITH AND LEARN THE NEWS OF THE DAY", "difficulty": {"rotation": [... |
An anagram is a word formed by rearranging the letters of a different word, using all the original letters exactly once.
Your job is to group the anagrams together. You can return the answer in any order.
The output is a list of lists of strings, where each outer list contains a group of anagrams, e.g. [["eat", "tea"... | [["althea", "elatha"], ["amylo", "loamy"], ["ancistroid", "indicators"], ["apsid", "sapid", "spaid"], ["atabrine", "rabatine"], ["bayonet", "betoyan"], ["bistro", "orbits"], ["bodices", "ceboids"], ["breasting", "brigantes"], ["bros", "robs"], ["cart", "trac"], ["catalyte", "cattleya"], ["consoler", "coronels"], ["cott... | group_anagrams | {"anagram_groups": 48, "difficulty": {"anagram_groups": [10, 50], "words_per_group": [2, 5]}, "solution": [["althea", "elatha"], ["amylo", "loamy"], ["ancistroid", "indicators"], ["apsid", "sapid", "spaid"], ["atabrine", "rabatine"], ["bayonet", "betoyan"], ["bistro", "orbits"], ["bodices", "ceboids"], ["breasting", "b... |
Decrypt this Caesar cipher text: CH NBY JLIDYWN AONYHVYLA FCNYLULS ULWBCPY ZIOHXUNCIH QUM WLYUNYX NI JLIPCXY U MYWOLY UHX JYLGUHYHN ZONOLY ZIL JLIDYWN UHX ZONOLY AYHYLUNCIHM. Provide only the decrypted text as your final answer. | IN THE PROJECT GUTENBERG LITERARY ARCHIVE FOUNDATION WAS CREATED TO PROVIDE A SECURE AND PERMANENT FUTURE FOR PROJECT AND FUTURE GENERATIONS | caesar_cipher | {"cipher_text": "CH NBY JLIDYWN AONYHVYLA FCNYLULS ULWBCPY ZIOHXUNCIH QUM WLYUNYX NI JLIPCXY U MYWOLY UHX JYLGUHYHN ZONOLY ZIL JLIDYWN UHX ZONOLY AYHYLUNCIHM", "clear_text": "IN THE PROJECT GUTENBERG LITERARY ARCHIVE FOUNDATION WAS CREATED TO PROVIDE A SECURE AND PERMANENT FUTURE FOR PROJECT AND FUTURE GENERATIONS", "d... |
Decrypt this Caesar cipher text: ADHMF ZANUD ZKK Z OQZBSHBZK GZR QDCTBDC SGD OQNAKDL NE DWHRSDMBD SN HSR RHLOKDRS SDQLR. Provide only the decrypted text as your final answer. | BEING ABOVE ALL A PRACTICAL HAS REDUCED THE PROBLEM OF EXISTENCE TO ITS SIMPLEST TERMS | caesar_cipher | {"cipher_text": "ADHMF ZANUD ZKK Z OQZBSHBZK GZR QDCTBDC SGD OQNAKDL NE DWHRSDMBD SN HSR RHLOKDRS SDQLR", "clear_text": "BEING ABOVE ALL A PRACTICAL HAS REDUCED THE PROBLEM OF EXISTENCE TO ITS SIMPLEST TERMS", "difficulty": {"rotation": [15, 25], "words": [15, 25]}, "num_words": 15, "rotation": 25, "source_dataset": "c... |
Solve this cryptarithm:
YUOGG
KMUJI
JYJON
MAIUU
IUIU
+ YUGN
--------
KIIJIJ
Each letter stands for a unique digit (0-9). No leading letter can be zero.
Provide a comma separated mapping from letters to digits that satisfies the equation in your final answer. Output format: "A=1,B=2,C=3" (without q... | A=1,G=9,I=3,J=6,K=2,M=8,N=7,O=4,U=0,Y=5 | cryptarithm | {"difficulty": {"words": [5, 10]}, "digit_to_letter": {"0": "U", "1": "A", "2": "K", "3": "I", "4": "O", "5": "Y", "6": "J", "7": "N", "8": "M", "9": "G"}, "letter_to_digit": {"A": 1, "G": 9, "I": 3, "J": 6, "K": 2, "M": 8, "N": 7, "O": 4, "U": 0, "Y": 5}, "letters": ["I", "M", "Y", "N", "A", "K", "J", "G", "U", "O"], ... |
An anagram is a word formed by rearranging the letters of a different word, using all the original letters exactly once.
Your job is to group the anagrams together. You can return the answer in any order.
The output is a list of lists of strings, where each outer list contains a group of anagrams, e.g. [["eat", "tea"... | [["acetum", "macute", "mucate", "tecuma"], ["adulterating", "triangulated"], ["akka", "kaka"], ["anither", "hairnet", "therian"], ["areel", "earle"], ["astatizer", "zaratites"], ["autoradiographic", "radioautographic"], ["banuyo", "boyuna"], ["bilby", "libby"], ["biltongs", "boltings"], ["blastomycetous", "cytoblastemo... | group_anagrams | {"anagram_groups": 44, "difficulty": {"anagram_groups": [10, 50], "words_per_group": [2, 5]}, "solution": [["acetum", "macute", "mucate", "tecuma"], ["adulterating", "triangulated"], ["akka", "kaka"], ["anither", "hairnet", "therian"], ["areel", "earle"], ["astatizer", "zaratites"], ["autoradiographic", "radioautograph... |
Solve this cryptarithm:
TTVRB
QCPGN
RRNVN
CBZG
RBC
TVZP
ZNPP
QGVB
+ NBNC
--------
QQRZQG
Each letter stands for a unique digit (0-9). No leading letter can be zero.
Provide a comma separated mapping from letters to digits that satisfies the equation in your final answer. Output forma... | B=7,C=5,G=6,N=8,P=0,Q=1,R=2,T=4,V=3,Z=9 | cryptarithm | {"difficulty": {"words": [5, 10]}, "digit_to_letter": {"0": "P", "1": "Q", "2": "R", "3": "V", "4": "T", "5": "C", "6": "G", "7": "B", "8": "N", "9": "Z"}, "letter_to_digit": {"B": 7, "C": 5, "G": 6, "N": 8, "P": 0, "Q": 1, "R": 2, "T": 4, "V": 3, "Z": 9}, "letters": ["B", "Z", "N", "G", "P", "R", "T", "C", "Q", "V"], ... |
You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | 7 | rotten_oranges | {"difficulty": {"n": [25, 50]}, "matrix": [[1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 2, 1, 0, 1, 1, 1, 1, 0], [1, 0, 1, 1, 1, 1, 1, 0, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 2, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1], [1, 1, 1, ... |
You are a police officer. A maniac has planted a bomb next to a public fountain.
To defuse the bomb, you must solve a puzzle. The puzzle is solved when you fill any of the available jugs with the target amount of water.
You have three move types: 'fill', 'empty' and 'pour'.
To fill Jug A, you 'fill A'.
To empty Jug ... | ["fill A", "pour A->C", "fill B", "empty C", "pour A->C", "fill A", "pour A->C", "empty C", "pour A->C", "empty C", "pour A->C", "pour B->C"] | jugs | {"difficulty": {"difficulty": 10, "num_jugs": 4}, "puzzle": {"jug_capacities": [13, 13, 8, 8], "min_moves": 11, "target": 7}, "source_dataset": "jugs", "source_index": 22} |
What will this Game of Life board look like after 2 steps of simulation? Assume a Moore neighborhood and wrapping topology. Reply as array of arrays representing rows in the grid from top to bottom in JSON format. (An empty 3x3 grid would look like this: [[0,0,0],[0,0,0],[0,0,0]])
[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0... | [[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,... | game_of_life | {"difficulty": {"filled_cells_weights": 0.2, "grid_size_x": 50, "grid_size_y": 50, "simulation_steps": 2}, "filled_cells": 10, "grid_size_x": 50, "grid_size_y": 50, "simulation_steps": 2, "source_dataset": "game_of_life", "source_index": 7} |
You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | -1 | rotten_oranges | {"difficulty": {"n": [25, 50]}, "matrix": [[2, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1], [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1], [1, 0, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 0, 1,... |
Transform the word ladder 'TIFF' to 'MAZE' by changing one letter at a time.
Provide your answer as a comma-separated sequence of uppercase letters without spaces.
Each step must be a valid English word. | TIFF,RIFF,RIFE,RICE,RACE,RAZE,MAZE | word_ladder | {"chain_length": 7, "difficulty": {"word_length": [3, 5]}, "end_word": "MAZE", "source_dataset": "word_ladder", "source_index": 23, "start_word": "TIFF", "word_length": 4} |
An anagram is a word formed by rearranging the letters of a different word, using all the original letters exactly once.
Your job is to group the anagrams together. You can return the answer in any order.
The output is a list of lists of strings, where each outer list contains a group of anagrams, e.g. [["eat", "tea"... | [["adit", "dita"], ["anc", "can"], ["apis", "psia"], ["atypic", "typica"], ["boe", "obe"], ["capstan", "captans", "catnaps"], ["curdier", "curried"], ["fainly", "naifly"], ["habitat", "tabitha"], ["harebrain", "herbarian"], ["martinico", "mortician"], ["mules", "mulse"], ["sanitizer", "triazines"], ["unsusceptible", "u... | group_anagrams | {"anagram_groups": 14, "difficulty": {"anagram_groups": [10, 50], "words_per_group": [2, 5]}, "solution": [["adit", "dita"], ["anc", "can"], ["apis", "psia"], ["atypic", "typica"], ["boe", "obe"], ["capstan", "captans", "catnaps"], ["curdier", "curried"], ["fainly", "naifly"], ["habitat", "tabitha"], ["harebrain", "her... |
Transform the word ladder 'ELK' to 'DUO' by changing one letter at a time.
Provide your answer as a comma-separated sequence of uppercase letters without spaces.
Each step must be a valid English word. | ELK,EEK,EEL,DEL,DOL,DOO,DUO | word_ladder | {"chain_length": 7, "difficulty": {"word_length": [3, 5]}, "end_word": "DUO", "source_dataset": "word_ladder", "source_index": 47, "start_word": "ELK", "word_length": 3} |
Sort these numbers in descending order: 351.4, -484.11, -255.4802, -90.68, 72.04, 86.487, -400.0824, -6.759, 137.36, 127.452, 469.179, -136.48, -72.9, -253.538, 199.2355, 136.39, 97.96, 188.4337, -18.34, 72.951, -248.9216, 431.675, -119.3424, -367.7855, 23.75, -354.95, -344.765, -341.8527, -146.691, 170.46, 405.067, -7... | ['481.1166', '469.179', '468.49', '456.13', '450.7596', '431.675', '419.9309', '405.067', '351.4', '332.8132', '310.21', '297.2361', '224.966', '209.44', '199.2355', '188.4337', '183.6633', '170.46', '140.099', '137.36', '136.39', '134.593', '127.452', '97.96', '86.487', '72.951', '72.04', '24.74', '23.75', '-4.586', '... | number_sorting | {"difficulty": {"decimals": [2, 4], "numbers": [50, 100], "value": [-500, 500]}, "direction": "descending", "numbers": 61, "original_numbers": ["351.4", "-484.11", "-255.4802", "-90.68", "72.04", "86.487", "-400.0824", "-6.759", "137.36", "127.452", "469.179", "-136.48", "-72.9", "-253.538", "199.2355", "136.39", "97.9... |
You are given an n x n grid where each cell can have one of three values:
- 0 representing an empty cell
- 1 representing a fresh orange
- 2 representing a rotten orange
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Your task is determine the minimum number of minu... | -1 | rotten_oranges | {"difficulty": {"n": [25, 50]}, "matrix": [[1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1], [1, 0, 1, 1, 1, 0, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 0, 1, 1, 1, 0, 0], [1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1], [1, 1, 1, 1, 1, 1, ... |
You are a police officer. A maniac has planted a bomb next to a public fountain.
To defuse the bomb, you must solve a puzzle. The puzzle is solved when you fill any of the available jugs with the target amount of water.
You have three move types: 'fill', 'empty' and 'pour'.
To fill Jug A, you 'fill A'.
To empty Jug ... | ["fill B", "pour B->A", "empty A", "pour B->A", "fill B", "pour B->A", "empty A", "pour B->A", "fill B", "pour B->A", "pour B->C", "fill B", "pour B->C"] | jugs | {"difficulty": {"difficulty": 10, "num_jugs": 4}, "puzzle": {"jug_capacities": [8, 9, 8, 8], "min_moves": 12, "target": 4}, "source_dataset": "jugs", "source_index": 64} |
Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-9 number 127651 to base-18
| d62a | base_conversion | {"decimal_value": 77806, "difficulty": {"base": [9, 18], "value": [10000, 100000]}, "source_base": 9, "source_dataset": "base_conversion", "source_index": 65, "source_repr": "127651", "target_base": 18, "target_repr": "d62a"} |
An anagram is a word formed by rearranging the letters of a different word, using all the original letters exactly once.
Your job is to group the anagrams together. You can return the answer in any order.
The output is a list of lists of strings, where each outer list contains a group of anagrams, e.g. [["eat", "tea"... | [["alkylic", "lilacky"], ["argling", "glaring"], ["canonise", "noisance"], ["crawls", "scrawl"], ["disperato", "posteriad"], ["lavish", "vishal"], ["lids", "sild", "slid"], ["pitta", "tapit"], ["pterography", "typographer"], ["revisit", "visiter"], ["travoy", "votary"]] | group_anagrams | {"anagram_groups": 11, "difficulty": {"anagram_groups": [10, 50], "words_per_group": [2, 5]}, "solution": [["alkylic", "lilacky"], ["argling", "glaring"], ["canonise", "noisance"], ["crawls", "scrawl"], ["disperato", "posteriad"], ["lavish", "vishal"], ["lids", "sild", "slid"], ["pitta", "tapit"], ["pterography", "typo... |
Solve this cryptarithm:
JUM
JQVQQ
BMWV
ABBTM
+ BMU
--------
TBCQBU
Each letter stands for a unique digit (0-9). No leading letter can be zero.
Provide a comma separated mapping from letters to digits that satisfies the equation in your final answer. Output format: "A=1,B=2,C=3" (without quotes)
| A=5,B=3,C=6,J=7,M=9,Q=8,T=1,U=2,V=4,W=0 | cryptarithm | {"difficulty": {"words": [5, 10]}, "digit_to_letter": {"0": "W", "1": "T", "2": "U", "3": "B", "4": "V", "5": "A", "6": "C", "7": "J", "8": "Q", "9": "M"}, "letter_to_digit": {"A": 5, "B": 3, "C": 6, "J": 7, "M": 9, "Q": 8, "T": 1, "U": 2, "V": 4, "W": 0}, "letters": ["T", "M", "J", "B", "V", "Q", "A", "W", "C", "U"], ... |
Decrypt this Caesar cipher text: LZW EGGF AK AEEWSKMJSTDQ DWKK VAKLSFL LZSF QWL OALZ ESJK GMJ UGEEMFAUSLAGF AK XMDDQ WKLSTDAKZWV. Provide only the decrypted text as your final answer. | THE MOON IS IMMEASURABLY LESS DISTANT THAN YET WITH MARS OUR COMMUNICATION IS FULLY ESTABLISHED | caesar_cipher | {"cipher_text": "LZW EGGF AK AEEWSKMJSTDQ DWKK VAKLSFL LZSF QWL OALZ ESJK GMJ UGEEMFAUSLAGF AK XMDDQ WKLSTDAKZWV", "clear_text": "THE MOON IS IMMEASURABLY LESS DISTANT THAN YET WITH MARS OUR COMMUNICATION IS FULLY ESTABLISHED", "difficulty": {"rotation": [15, 25], "words": [15, 25]}, "num_words": 15, "rotation": 18, "s... |
Decrypt this Caesar cipher text: TCIGPCRTS QN IWT UDGVTIUJA DU IWT HBXIW SXS CDI CDIXRT IWPI XI LPH VGDLXCV SPGZ. Provide only the decrypted text as your final answer. | ENTRANCED BY THE FORGETFUL OF THE SMITH DID NOT NOTICE THAT IT WAS GROWING DARK | caesar_cipher | {"cipher_text": "TCIGPCRTS QN IWT UDGVTIUJA DU IWT HBXIW SXS CDI CDIXRT IWPI XI LPH VGDLXCV SPGZ", "clear_text": "ENTRANCED BY THE FORGETFUL OF THE SMITH DID NOT NOTICE THAT IT WAS GROWING DARK", "difficulty": {"rotation": [15, 25], "words": [15, 25]}, "num_words": 15, "rotation": 15, "source_dataset": "caesar_cipher",... |
Decrypt this Caesar cipher text: MGCNB YHNYLYX NBY BY ZIOHX NBY IJYLUNILM MCNNCHA QCNB ZIFXYX ULGM UN NBYCL GINCIHFYMM UHX CHKOCLYX UM NI NBY WUOMY IZ NBYCL CHUWNCIH. Provide only the decrypted text as your final answer. | SMITH ENTERED THE HE FOUND THE OPERATORS SITTING WITH FOLDED ARMS AT THEIR MOTIONLESS AND INQUIRED AS TO THE CAUSE OF THEIR INACTION | caesar_cipher | {"cipher_text": "MGCNB YHNYLYX NBY BY ZIOHX NBY IJYLUNILM MCNNCHA QCNB ZIFXYX ULGM UN NBYCL GINCIHFYMM UHX CHKOCLYX UM NI NBY WUOMY IZ NBYCL CHUWNCIH", "clear_text": "SMITH ENTERED THE HE FOUND THE OPERATORS SITTING WITH FOLDED ARMS AT THEIR MOTIONLESS AND INQUIRED AS TO THE CAUSE OF THEIR INACTION", "difficulty": {"ro... |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6