question stringlengths 142 5.52k | answer stringlengths 1 5.1k | source_dataset stringclasses 10
values | metadata_json stringlengths 168 15.4k |
|---|---|---|---|
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 450 degrees clockwise:
7 4 3 9 2 8 2 1 4 4 0 6 0 8 2 3 9 1 5 1 1 0 6 3 0 3 5 2 4 1 4 3 1 3
1 5 0 0 9 9 9 5 4 4 1 4 2 5 0 9 7 1 0 5 4 0 0 5 9 5 0 3 6 7 7 2 1 0
3 0 0 7 7... | 6 7 1 8 5 4 6 4 3 1 5 0 7 3 1 0 8 9 3 4 4 9 6 1 2 3 2 3 6 2 7 3 1 7
0 8 9 8 5 5 2 9 4 3 3 5 3 9 5 2 0 0 5 4 6 6 0 6 6 5 9 3 2 3 3 0 5 4
3 9 0 4 3 9 1 8 2 6 4 1 5 0 2 0 8 8 1 1 5 4 2 2 8 6 1 7 1 6 5 0 0 3
3 8 0 3 1 8 1 6 5 1 3 8 4 4 9 1 1 0 8 0 1 0 8 3 0 9 6 1 1 4 1 7 0 9
5 4 8 2 0 6 8 0 3 1 0 6 9 9 7 2 9 8 4 8 6 5 7 2 ... | rotate_matrix | {"difficulty": {"n": [25, 50], "num_rotations": [5, 15]}, "matrix": [[7, 4, 3, 9, 2, 8, 2, 1, 4, 4, 0, 6, 0, 8, 2, 3, 9, 1, 5, 1, 1, 0, 6, 3, 0, 3, 5, 2, 4, 1, 4, 3, 1, 3], [1, 5, 0, 0, 9, 9, 9, 5, 4, 4, 1, 4, 2, 5, 0, 9, 7, 1, 0, 5, 4, 0, 0, 5, 9, 5, 0, 3, 6, 7, 7, 2, 1, 0], [3, 0, 0, 7, 7, 6, 3, 7, 2, 6, 3, 9, 9, 8, ... |
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"... | [["aethered", "reheated"], ["afghan", "hafgan"], ["agues", "usage"], ["alterer", "realter", "relater"], ["anacreontic", "canceration"], ["asp", "pas", "sap", "spa"], ["ata", "taa"], ["athecae", "chaetae"], ["babkas", "kababs"], ["badge", "begad", "debag"], ["bakli", "kibla"], ["bark", "kbar"], ["bedell", "belled", "deb... | group_anagrams | {"anagram_groups": 35, "difficulty": {"anagram_groups": [10, 50], "words_per_group": [2, 5]}, "solution": [["aethered", "reheated"], ["afghan", "hafgan"], ["agues", "usage"], ["alterer", "realter", "relater"], ["anacreontic", "canceration"], ["asp", "pas", "sap", "spa"], ["ata", "taa"], ["athecae", "chaetae"], ["babkas... |
Sort these numbers in ascending order: 80.34, 496.538, -259.009, 317.5, -185.403, -302.9652, 388.86, -169.704, 371.688, -189.818, -330.432, 111.693, -199.03, 497.642, 486.38, -151.333, 479.9428, -296.7532, -18.28, 20.64, 73.26, 117.129, -259.5032, -188.202, 230.626, 119.968, 204.568, -140.25, -346.6916, 69.08, -378.4, ... | ['-424.2139', '-408.4976', '-382.324', '-378.4', '-352.627', '-351.2501', '-346.6916', '-337.45', '-335.269', '-331.1997', '-330.432', '-323.0083', '-322.121', '-313.63', '-304.2777', '-302.9652', '-300.7156', '-298.6414', '-296.7532', '-296.2', '-291.859', '-274.79', '-272.8139', '-259.5032', '-259.009', '-223.661', '... | number_sorting | {"difficulty": {"decimals": [2, 4], "numbers": [50, 100], "value": [-500, 500]}, "direction": "ascending", "numbers": 94, "original_numbers": ["80.34", "496.538", "-259.009", "317.5", "-185.403", "-302.9652", "388.86", "-169.704", "371.688", "-189.818", "-330.432", "111.693", "-199.03", "497.642", "486.38", "-151.333",... |
Solve this cryptarithm:
DVC
WHHMV
HCPNN
VHVNW
XDMW
HHN
BHXBB
+ MMD
--------
BNPMDW
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... | B=1,C=7,D=2,H=4,M=9,N=6,P=0,V=5,W=3,X=8 | cryptarithm | {"difficulty": {"words": [5, 10]}, "digit_to_letter": {"0": "P", "1": "B", "2": "D", "3": "W", "4": "H", "5": "V", "6": "N", "7": "C", "8": "X", "9": "M"}, "letter_to_digit": {"B": 1, "C": 7, "D": 2, "H": 4, "M": 9, "N": 6, "P": 0, "V": 5, "W": 3, "X": 8}, "letters": ["C", "W", "B", "D", "P", "H", "M", "N", "X", "V"], ... |
Decrypt this Caesar cipher text: SBEKTBUII JEE RKJ JE RU IXQBB MU FHETKSU JXQJ MU CYWXJ RKJ YI YJ EV QDO MXQJ MU DUUT YI DEJ HQYD. Provide only the decrypted text as your final answer. | CLOUDLESS TOO BUT TO BE SHALL WE PRODUCE THAT WE MIGHT BUT IS IT OF ANY WHAT WE NEED IS NOT RAIN | caesar_cipher | {"cipher_text": "SBEKTBUII JEE RKJ JE RU IXQBB MU FHETKSU JXQJ MU CYWXJ RKJ YI YJ EV QDO MXQJ MU DUUT YI DEJ HQYD", "clear_text": "CLOUDLESS TOO BUT TO BE SHALL WE PRODUCE THAT WE MIGHT BUT IS IT OF ANY WHAT WE NEED IS NOT RAIN", "difficulty": {"rotation": [15, 25], "words": [15, 25]}, "num_words": 22, "rotation": 16, ... |
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": 176} |
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, 0, 2, 1, 1, 1, 1, 1, 1, 0, 1, 1, 2, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 2, 1, 0, 0, 1, 1, 1, 1, 1], [1, 2, 2, 1, 1, 1, 0, 1, 1, 1, 1,... |
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"... | [["aeger", "agree", "eagre"], ["agists", "gassit", "staigs"], ["allyic", "lacily"], ["anelectric", "electrican"], ["appealer", "papelera", "reappeal"], ["applier", "aripple"], ["bagong", "gobang"], ["begoud", "bogued"], ["besoot", "bootes"], ["bf", "fb"], ["birretta", "brattier"], ["brailles", "liberals"], ["canchi", "... | group_anagrams | {"anagram_groups": 49, "difficulty": {"anagram_groups": [10, 50], "words_per_group": [2, 5]}, "solution": [["aeger", "agree", "eagre"], ["agists", "gassit", "staigs"], ["allyic", "lacily"], ["anelectric", "electrican"], ["appealer", "papelera", "reappeal"], ["applier", "aripple"], ["bagong", "gobang"], ["begoud", "bogu... |
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 1260 degrees clockwise:
9 2 7 5 1 8 0 3 9 0 5 6 6 0 9 6 1 3 7 0 1 7 9 8 8 2
5 4 6 0 7 0 1 9 5 4 3 7 1 7 3 8 0 0 2 5 3 8 3 2 8 1
9 2 0 0 2 4 8 2 9 8 6 0 3 3 3 5 3 4 9 9 ... | 9 9 4 3 5 7 1 5 3 1 4 0 9 4 1 3 3 9 3 8 0 4 9 3 8 7
1 5 3 7 0 9 0 9 1 7 3 6 2 3 1 8 1 1 1 5 4 9 7 3 6 0
8 6 3 2 2 7 1 9 8 4 6 4 9 9 0 2 4 3 3 6 1 8 6 1 9 9
4 7 2 4 1 7 4 0 5 4 0 8 2 7 5 2 8 0 4 8 8 7 9 4 6 5
2 9 5 5 3 0 0 5 1 2 1 3 2 9 0 2 7 2 0 5 7 7 5 6 4 6
8 6 8 3 2 3 3 7 1 1 7 6 6 9 1 3 4 2 9 3 4 4 6 7 3 3
2 9 5 3 ... | rotate_matrix | {"difficulty": {"n": [25, 50], "num_rotations": [5, 15]}, "matrix": [[9, 2, 7, 5, 1, 8, 0, 3, 9, 0, 5, 6, 6, 0, 9, 6, 1, 3, 7, 0, 1, 7, 9, 8, 8, 2], [5, 4, 6, 0, 7, 0, 1, 9, 5, 4, 3, 7, 1, 7, 3, 8, 0, 0, 2, 5, 3, 8, 3, 2, 8, 1], [9, 2, 0, 0, 2, 4, 8, 2, 9, 8, 6, 0, 3, 3, 3, 5, 3, 4, 9, 9, 9, 4, 4, 6, 8, 3], [1, 9, 7, 7... |
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", "empty B", "pour A->B", "fill A", "pour A->B", "fill A", "pour A->B"] | jugs | {"difficulty": {"difficulty": 10, "num_jugs": 4}, "puzzle": {"jug_capacities": [4, 11, 4, 11], "min_moves": 11, "target": 9}, "source_dataset": "jugs", "source_index": 1084} |
Transform the word ladder 'FALSE' to 'DREGS' 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. | FALSE,VALSE,VALVE,CALVE,CARVE,CARTE,CARTS,PARTS,PARPS,PERPS,PEEPS,PREPS,PRESS,DRESS,DREGS | word_ladder | {"chain_length": 15, "difficulty": {"word_length": [3, 5]}, "end_word": "DREGS", "source_dataset": "word_ladder", "source_index": 3084, "start_word": "FALSE", "word_length": 5} |
Decrypt this Caesar cipher text: LOWFLQ QWSJK SYG ALK KMTKUJAHLAGF DAKL UGFLSAFWV TML S XWO ZMFVJWV LZGMKSFV SFV LZWF EJ. Provide only the decrypted text as your final answer. | TWENTY YEARS AGO ITS SUBSCRIPTION LIST CONTAINED BUT A FEW HUNDRED THOUSAND AND THEN MR | caesar_cipher | {"cipher_text": "LOWFLQ QWSJK SYG ALK KMTKUJAHLAGF DAKL UGFLSAFWV TML S XWO ZMFVJWV LZGMKSFV SFV LZWF EJ", "clear_text": "TWENTY YEARS AGO ITS SUBSCRIPTION LIST CONTAINED BUT A FEW HUNDRED THOUSAND AND THEN MR", "difficulty": {"rotation": [15, 25], "words": [15, 25]}, "num_words": 15, "rotation": 18, "source_dataset": ... |
Transform the word ladder 'BIMBO' to 'LUMPS' 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. | BIMBO,LIMBO,LIMBS,LIMPS,LUMPS | word_ladder | {"chain_length": 5, "difficulty": {"word_length": [3, 5]}, "end_word": "LUMPS", "source_dataset": "word_ladder", "source_index": 892, "start_word": "BIMBO", "word_length": 5} |
Solve this cryptarithm:
TBK
KKSYY
KXXHT
BSY
OBY
XXQ
XHXX
SFOT
+ SSKTT
--------
BTHYFX
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=1,F=3,H=7,K=4,O=2,Q=8,S=5,T=6,X=9,Y=0 | cryptarithm | {"difficulty": {"words": [5, 10]}, "digit_to_letter": {"0": "Y", "1": "B", "2": "O", "3": "F", "4": "K", "5": "S", "6": "T", "7": "H", "8": "Q", "9": "X"}, "letter_to_digit": {"B": 1, "F": 3, "H": 7, "K": 4, "O": 2, "Q": 8, "S": 5, "T": 6, "X": 9, "Y": 0}, "letters": ["F", "O", "Y", "K", "H", "S", "X", "B", "Q", "T"], ... |
Transform the word ladder 'MEWS' to 'MOLE' 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. | MEWS,MOWS,MODS,MODE,MOLE | word_ladder | {"chain_length": 5, "difficulty": {"word_length": [3, 5]}, "end_word": "MOLE", "source_dataset": "word_ladder", "source_index": 1942, "start_word": "MEWS", "word_length": 4} |
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": 2574} |
Solve this cryptarithm:
CZZQW
CRRNQ
WQAC
GNG
URA
GGC
NARA
UCRZ
CGZ
+ ZUV
--------
RVNVCN
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. Out... | A=2,C=4,G=8,N=9,Q=7,R=1,U=5,V=0,W=6,Z=3 | cryptarithm | {"difficulty": {"words": [5, 10]}, "digit_to_letter": {"0": "V", "1": "R", "2": "A", "3": "Z", "4": "C", "5": "U", "6": "W", "7": "Q", "8": "G", "9": "N"}, "letter_to_digit": {"A": 2, "C": 4, "G": 8, "N": 9, "Q": 7, "R": 1, "U": 5, "V": 0, "W": 6, "Z": 3}, "letters": ["U", "G", "N", "Z", "A", "Q", "R", "C", "V", "W"], ... |
Decrypt this Caesar cipher text: GFW JWSVADQ MFVWJKLSFVK ZGO S ESF KALMSLWV SK KEALZ AK EMKL TW TWKWL OALZ JWIMWKLK GX SDD CAFVK. Provide only the decrypted text as your final answer. | ONE READILY UNDERSTANDS HOW A MAN SITUATED AS SMITH IS MUST BE BESET WITH REQUESTS OF ALL KINDS | caesar_cipher | {"cipher_text": "GFW JWSVADQ MFVWJKLSFVK ZGO S ESF KALMSLWV SK KEALZ AK EMKL TW TWKWL OALZ JWIMWKLK GX SDD CAFVK", "clear_text": "ONE READILY UNDERSTANDS HOW A MAN SITUATED AS SMITH IS MUST BE BESET WITH REQUESTS OF ALL KINDS", "difficulty": {"rotation": [15, 25], "words": [15, 25]}, "num_words": 18, "rotation": 18, "s... |
Transform the word ladder 'NAV' to 'HAW' 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. | NAV,NAH,HAH,HAW | word_ladder | {"chain_length": 4, "difficulty": {"word_length": [3, 5]}, "end_word": "HAW", "source_dataset": "word_ladder", "source_index": 1178, "start_word": "NAV", "word_length": 3} |
Sort these numbers in ascending order: 268.63, -78.581, 168.61, -445.9262, 320.24, 318.8549, -333.61, 50.18, 316.941, -461.195, -235.6877, 128.0875, 121.44, 329.54, -6.5552, -13.079, 341.1, 157.875, -461.007, 336.86, -189.36, 160.6, -378.637, 412.329, -310.615, -474.7472, -120.457, 190.091, -159.68, 274.3386, -27.86, 3... | ['-486.3495', '-482.85', '-474.7472', '-471.17', '-461.195', '-461.007', '-445.9262', '-416.5938', '-398.6108', '-378.637', '-352.38', '-333.61', '-332.91', '-310.615', '-300.78', '-271.881', '-249.023', '-235.6877', '-207.44', '-205.7591', '-189.36', '-159.68', '-136.73', '-126.493', '-120.457', '-94.766', '-85.48', '... | number_sorting | {"difficulty": {"decimals": [2, 4], "numbers": [50, 100], "value": [-500, 500]}, "direction": "ascending", "numbers": 69, "original_numbers": ["268.63", "-78.581", "168.61", "-445.9262", "320.24", "318.8549", "-333.61", "50.18", "316.941", "-461.195", "-235.6877", "128.0875", "121.44", "329.54", "-6.5552", "-13.079", "... |
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": 153} |
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"... | [["aesthesis", "esthesias"], ["algicidal", "diallagic"], ["angelically", "englacially"], ["antecornu", "connature"], ["apian", "apina"], ["aposthume", "peamouths"], ["asnort", "astron", "satron", "tronas"], ["atangle", "galante", "langate"], ["bepaste", "bespate"], ["blarney", "renably"], ["celosias", "sociales"], ["ch... | group_anagrams | {"anagram_groups": 48, "difficulty": {"anagram_groups": [10, 50], "words_per_group": [2, 5]}, "solution": [["aesthesis", "esthesias"], ["algicidal", "diallagic"], ["angelically", "englacially"], ["antecornu", "connature"], ["apian", "apina"], ["aposthume", "peamouths"], ["asnort", "astron", "satron", "tronas"], ["atang... |
Decrypt this Caesar cipher text: KYV JTVEV NYVIV KYV MZCCRXV DRZU UZJTLJJVJ ZEKVIVJKZEX GYZCFJFGYZTRC GIFSCVDJ NZKY YVI CFMVI JYFNJ PFLI MVIP RTLKV GFNVI FW FSJVIMRKZFE. Provide only the decrypted text as your final answer. | THE SCENE WHERE THE VILLAGE MAID DISCUSSES INTERESTING PHILOSOPHICAL PROBLEMS WITH HER LOVER SHOWS YOUR VERY ACUTE POWER OF OBSERVATION | caesar_cipher | {"cipher_text": "KYV JTVEV NYVIV KYV MZCCRXV DRZU UZJTLJJVJ ZEKVIVJKZEX GYZCFJFGYZTRC GIFSCVDJ NZKY YVI CFMVI JYFNJ PFLI MVIP RTLKV GFNVI FW FSJVIMRKZFE", "clear_text": "THE SCENE WHERE THE VILLAGE MAID DISCUSSES INTERESTING PHILOSOPHICAL PROBLEMS WITH HER LOVER SHOWS YOUR VERY ACUTE POWER OF OBSERVATION", "difficulty"... |
Sort these numbers in ascending order: 196.038, 227.519, -189.58, 261.6084, -66.29, -427.4959, -422.27, 155.605, -234.347, -321.1943, 491.901, -478.013, -396.657, 146.937, 481.46, 208.317, 415.93, -235.5785, 126.89, 466.492, 194.45, 293.18, -303.629, 376.96, 299.229, 104.21, -359.907, 475.706, -146.75, 109.8, 240.285, ... | ['-494.668', '-485.981', '-478.013', '-465.84', '-460.514', '-447.64', '-427.4959', '-422.27', '-396.657', '-385.52', '-376.9974', '-366.029', '-359.907', '-332.21', '-321.1943', '-303.629', '-284.1786', '-235.5785', '-234.347', '-220.033', '-210.159', '-189.58', '-186.722', '-173.389', '-155.0465', '-146.75', '-128.97... | number_sorting | {"difficulty": {"decimals": [2, 4], "numbers": [50, 100], "value": [-500, 500]}, "direction": "ascending", "numbers": 75, "original_numbers": ["196.038", "227.519", "-189.58", "261.6084", "-66.29", "-427.4959", "-422.27", "155.605", "-234.347", "-321.1943", "491.901", "-478.013", "-396.657", "146.937", "481.46", "208.3... |
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-10 number 90680 to base-17
| 117d2 | base_conversion | {"decimal_value": 90680, "difficulty": {"base": [9, 18], "value": [10000, 100000]}, "source_base": 10, "source_dataset": "base_conversion", "source_index": 2905, "source_repr": "90680", "target_base": 17, "target_repr": "117d2"} |
Decrypt this Caesar cipher text: YV X GRPQ LC QEFKDP EBOB DOBXQ YOFQXFK EXP YBZLJB X ZLILKV LC QEB RKFQBA QEB BKDIFPE XOB KLQ VBQ OBZLKZFIBA QL QEB PFQRXQFLK. Provide only the decrypted text as your final answer. | BY A JUST OF THINGS HERE GREAT BRITAIN HAS BECOME A COLONY OF THE UNITED THE ENGLISH ARE NOT YET RECONCILED TO THE SITUATION | caesar_cipher | {"cipher_text": "YV X GRPQ LC QEFKDP EBOB DOBXQ YOFQXFK EXP YBZLJB X ZLILKV LC QEB RKFQBA QEB BKDIFPE XOB KLQ VBQ OBZLKZFIBA QL QEB PFQRXQFLK", "clear_text": "BY A JUST OF THINGS HERE GREAT BRITAIN HAS BECOME A COLONY OF THE UNITED THE ENGLISH ARE NOT YET RECONCILED TO THE SITUATION", "difficulty": {"rotation": [15, 25... |
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"... | [["achromats", "trachomas"], ["adelia", "aldeia"], ["afrit", "trifa"], ["authorise", "thioureas"], ["batocrinus", "incubators"], ["bleacher", "rebleach"], ["caestus", "cuestas"], ["chinoa", "noahic"], ["debutant", "unbatted"], ["depit", "tepid"], ["erbia", "rebia"], ["faired", "frieda"], ["glutting", "guttling"], ["her... | group_anagrams | {"anagram_groups": 25, "difficulty": {"anagram_groups": [10, 50], "words_per_group": [2, 5]}, "solution": [["achromats", "trachomas"], ["adelia", "aldeia"], ["afrit", "trifa"], ["authorise", "thioureas"], ["batocrinus", "incubators"], ["bleacher", "rebleach"], ["caestus", "cuestas"], ["chinoa", "noahic"], ["debutant", ... |
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": 505} |
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", "fill B", "pour B->A", "empty A", "pour B->A", "fill B", "pour B->A", "pour B->C", "pour A->B", "pour B->C"] | jugs | {"difficulty": {"difficulty": 10, "num_jugs": 4}, "puzzle": {"jug_capacities": [12, 11, 12, 11], "min_moves": 11, "target": 8}, "source_dataset": "jugs", "source_index": 3853} |
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, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1], [1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1], [0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 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->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": [7, 10, 7, 7], "min_moves": 12, "target": 8}, "source_dataset": "jugs", "source_index": 1073} |
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"... | [["aeries", "easier"], ["amiranha", "maharani"], ["appius", "sipapu"], ["banjoist", "bostanji"], ["bellote", "lobelet"], ["besteer", "rebeset"], ["bilders", "bridles"], ["burbliest", "rubbliest", "stubblier"], ["cacoxenite", "excecation"], ["cathy", "cyath", "yacht"], ["cephen", "penche"], ["cesural", "recusal"], ["cou... | group_anagrams | {"anagram_groups": 34, "difficulty": {"anagram_groups": [10, 50], "words_per_group": [2, 5]}, "solution": [["aeries", "easier"], ["amiranha", "maharani"], ["appius", "sipapu"], ["banjoist", "bostanji"], ["bellote", "lobelet"], ["besteer", "rebeset"], ["bilders", "bridles"], ["burbliest", "rubbliest", "stubblier"], ["ca... |
Decrypt this Caesar cipher text: IWT UDJCSPIXDC XH RDBBXIITS ID RDBEANXCV LXIW IWT APLH GTVJAPIXCV RWPGXIXTH PCS RWPGXIPQAT SDCPIXDCH XC PAA HIPITH DU IWT JCXITS HIPITH. Provide only the decrypted text as your final answer. | THE FOUNDATION IS COMMITTED TO COMPLYING WITH THE LAWS REGULATING CHARITIES AND CHARITABLE DONATIONS IN ALL STATES OF THE UNITED STATES | caesar_cipher | {"cipher_text": "IWT UDJCSPIXDC XH RDBBXIITS ID RDBEANXCV LXIW IWT APLH GTVJAPIXCV RWPGXIXTH PCS RWPGXIPQAT SDCPIXDCH XC PAA HIPITH DU IWT JCXITS HIPITH", "clear_text": "THE FOUNDATION IS COMMITTED TO COMPLYING WITH THE LAWS REGULATING CHARITIES AND CHARITABLE DONATIONS IN ALL STATES OF THE UNITED STATES", "difficulty"... |
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 1080 degrees clockwise:
1 1 1 5 8 1 8 1 2 1 0 1 2 1 8 6 8 1 7 4 0 4 9 5 0 4 7 3 6 6 4 1 5 6 1 3 5
6 0 1 7 8 5 9 9 5 4 5 7 9 6 6 7 5 8 4 2 1 3 1 3 6 8 7 7 9 8 7 9 6 2 5 ... | 1 1 1 5 8 1 8 1 2 1 0 1 2 1 8 6 8 1 7 4 0 4 9 5 0 4 7 3 6 6 4 1 5 6 1 3 5
6 0 1 7 8 5 9 9 5 4 5 7 9 6 6 7 5 8 4 2 1 3 1 3 6 8 7 7 9 8 7 9 6 2 5 0 6
5 0 0 6 0 4 7 6 7 7 8 5 5 3 3 6 2 1 6 2 8 6 9 4 0 8 5 6 6 4 7 8 4 1 9 6 9
6 7 6 5 1 6 6 7 5 2 6 2 7 4 8 1 1 3 4 1 3 7 2 1 1 8 3 1 2 5 8 9 0 3 5 5 3
5 5 5 3 0 0 4 4 1 4 5 2 ... | rotate_matrix | {"difficulty": {"n": [25, 50], "num_rotations": [5, 15]}, "matrix": [[1, 1, 1, 5, 8, 1, 8, 1, 2, 1, 0, 1, 2, 1, 8, 6, 8, 1, 7, 4, 0, 4, 9, 5, 0, 4, 7, 3, 6, 6, 4, 1, 5, 6, 1, 3, 5], [6, 0, 1, 7, 8, 5, 9, 9, 5, 4, 5, 7, 9, 6, 6, 7, 5, 8, 4, 2, 1, 3, 1, 3, 6, 8, 7, 7, 9, 8, 7, 9, 6, 2, 5, 0, 6], [5, 0, 0, 6, 0, 4, 7, 6, ... |
Solve this cryptarithm:
DVDCC
XQNCC
DNVP
XPGD
NCTPV
XCVDD
+ GQN
--------
PQZGTN
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" (... | C=0,D=2,G=8,N=7,P=1,Q=9,T=6,V=5,X=4,Z=3 | cryptarithm | {"difficulty": {"words": [5, 10]}, "digit_to_letter": {"0": "C", "1": "P", "2": "D", "3": "Z", "4": "X", "5": "V", "6": "T", "7": "N", "8": "G", "9": "Q"}, "letter_to_digit": {"C": 0, "D": 2, "G": 8, "N": 7, "P": 1, "Q": 9, "T": 6, "V": 5, "X": 4, "Z": 3}, "letters": ["Q", "T", "C", "N", "G", "V", "D", "P", "Z", "X"], ... |
Sort these numbers in descending order: 34.7538, -14.77, 37.316, 328.3125, -106.96, 273.236, -234.6055, 258.42, 379.5448, 441.6873, -252.604, 319.89, -121.797, 384.9, -7.37, 20.5876, -135.763, 373.035, 306.978, -135.77, 401.6, 65.736, 404.65, 496.67, -61.936, -167.038, 39.9883, 428.893, -90.1553, 233.79, 352.07, -251.1... | ['498.879', '496.67', '491.491', '478.3763', '474.4088', '454.24', '441.6873', '428.893', '404.65', '401.6', '394.91', '384.9', '379.5448', '373.035', '365.3', '359.94', '353.147', '352.9285', '352.07', '350.43', '328.3125', '319.89', '315.43', '306.978', '273.236', '258.42', '256.2904', '233.79', '223.409', '215.093',... | number_sorting | {"difficulty": {"decimals": [2, 4], "numbers": [50, 100], "value": [-500, 500]}, "direction": "descending", "numbers": 80, "original_numbers": ["34.7538", "-14.77", "37.316", "328.3125", "-106.96", "273.236", "-234.6055", "258.42", "379.5448", "441.6873", "-252.604", "319.89", "-121.797", "384.9", "-7.37", "20.5876", "... |
Transform the word ladder 'ROWER' to 'GORGE' 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. | ROWER,BOWER,BORER,BORES,FORES,FORTS,FORTE,FORGE,GORGE | word_ladder | {"chain_length": 9, "difficulty": {"word_length": [3, 5]}, "end_word": "GORGE", "source_dataset": "word_ladder", "source_index": 3685, "start_word": "ROWER", "word_length": 5} |
Decrypt this Caesar cipher text: PCS PI IWT RPAA DU XBETGPIXKT WT HEGXCVH UGDB WXH QTS PCS TCITGH WXH BTRWPCXRPA SGTHHTG. Provide only the decrypted text as your final answer. | AND AT THE CALL OF IMPERATIVE HE SPRINGS FROM HIS BED AND ENTERS HIS MECHANICAL DRESSER | caesar_cipher | {"cipher_text": "PCS PI IWT RPAA DU XBETGPIXKT WT HEGXCVH UGDB WXH QTS PCS TCITGH WXH BTRWPCXRPA SGTHHTG", "clear_text": "AND AT THE CALL OF IMPERATIVE HE SPRINGS FROM HIS BED AND ENTERS HIS MECHANICAL DRESSER", "difficulty": {"rotation": [15, 25], "words": [15, 25]}, "num_words": 16, "rotation": 15, "source_dataset": ... |
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, 2, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], [0, 1, 1, 1, 1, 1, 2, 1, 0, 1, 1, 1, 1, 2, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1], [1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1], [1, 1, 1, 0, 1, 0, 1, 1, 0, ... |
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 1350 degrees clockwise:
5 9 6 8 7 3 9 3 9 8 4 7 9 4 6 4 9 8 9 2 8 8 2 9 3 6 6 2 3
1 7 1 0 9 5 4 0 6 4 9 1 9 7 2 0 9 9 8 9 5 8 1 5 9 3 3 2 6
9 3 1 4 3 2 9 8 7 5 5 7 1 1 ... | 3 6 2 4 0 1 4 3 7 7 7 4 1 0 3 2 4 6 0 0 3 7 2 2 4 1 6 7 5
2 2 0 3 7 3 0 7 7 1 9 5 8 1 8 5 7 0 2 9 0 0 1 2 3 0 8 3 3
6 3 0 1 3 2 8 6 8 1 9 9 6 1 1 5 2 8 3 2 7 1 3 1 6 0 7 5 4
6 3 5 4 0 1 1 4 6 9 2 5 4 5 2 2 0 9 9 2 9 4 3 9 9 3 7 0 3
3 9 9 8 7 0 4 9 9 9 6 7 9 2 3 8 1 7 5 4 6 3 3 0 9 4 8 9 5
9 5 6 9 8 2 1 3 7 6 4 4 6 7 1 ... | rotate_matrix | {"difficulty": {"n": [25, 50], "num_rotations": [5, 15]}, "matrix": [[5, 9, 6, 8, 7, 3, 9, 3, 9, 8, 4, 7, 9, 4, 6, 4, 9, 8, 9, 2, 8, 8, 2, 9, 3, 6, 6, 2, 3], [1, 7, 1, 0, 9, 5, 4, 0, 6, 4, 9, 1, 9, 7, 2, 0, 9, 9, 8, 9, 5, 8, 1, 5, 9, 3, 3, 2, 6], [9, 3, 1, 4, 3, 2, 9, 8, 7, 5, 5, 7, 1, 1, 9, 8, 1, 2, 2, 6, 6, 0, 9, 6, ... |
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 ... | ["No solution"] | jugs | {"difficulty": {"difficulty": 10, "num_jugs": 4}, "puzzle": {"jug_capacities": [11, 11, 11, 9], "min_moves": 10, "target": 3}, "source_dataset": "jugs", "source_index": 2212} |
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": 3289} |
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 ... | ["No solution"] | jugs | {"difficulty": {"difficulty": 10, "num_jugs": 4}, "puzzle": {"jug_capacities": [11, 11, 11, 8], "min_moves": 12, "target": 7}, "source_dataset": "jugs", "source_index": 2303} |
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 36360 to base-17
| ab1c | base_conversion | {"decimal_value": 52338, "difficulty": {"base": [9, 18], "value": [10000, 100000]}, "source_base": 11, "source_dataset": "base_conversion", "source_index": 374, "source_repr": "36360", "target_base": 17, "target_repr": "ab1c"} |
Decrypt this Caesar cipher text: YJ UNYIJI RUSQKIU EV JXU UVVEHJI EV XKDTHUTI EV LEBKDJUUHI QDT TEDQJYEDI VHEC FUEFBU YD QBB MQBAI EV BYVU. Provide only the decrypted text as your final answer. | IT EXISTS BECAUSE OF THE EFFORTS OF HUNDREDS OF VOLUNTEERS AND DONATIONS FROM PEOPLE IN ALL WALKS OF LIFE | caesar_cipher | {"cipher_text": "YJ UNYIJI RUSQKIU EV JXU UVVEHJI EV XKDTHUTI EV LEBKDJUUHI QDT TEDQJYEDI VHEC FUEFBU YD QBB MQBAI EV BYVU", "clear_text": "IT EXISTS BECAUSE OF THE EFFORTS OF HUNDREDS OF VOLUNTEERS AND DONATIONS FROM PEOPLE IN ALL WALKS OF LIFE", "difficulty": {"rotation": [15, 25], "words": [15, 25]}, "num_words": 19... |
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": 2369} |
Transform the word ladder 'FOE' to 'SOU' 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. | FOE,FOX,SOX,SOU | word_ladder | {"chain_length": 4, "difficulty": {"word_length": [3, 5]}, "end_word": "SOU", "source_dataset": "word_ladder", "source_index": 82, "start_word": "FOE", "word_length": 3} |
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-10 number 98490 to base-18
| gfhc | base_conversion | {"decimal_value": 98490, "difficulty": {"base": [9, 18], "value": [10000, 100000]}, "source_base": 10, "source_dataset": "base_conversion", "source_index": 2939, "source_repr": "98490", "target_base": 18, "target_repr": "gfhc"} |
Transform the word ladder 'BLEAT' to 'FORTS' 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. | BLEAT,BLEST,BLAST,BLASE,BLAME,FLAME,FLAMS,FOAMS,FORMS,FORTS | word_ladder | {"chain_length": 10, "difficulty": {"word_length": [3, 5]}, "end_word": "FORTS", "source_dataset": "word_ladder", "source_index": 1764, "start_word": "BLEAT", "word_length": 5} |
Solve this cryptarithm:
MXMZP
PSTED
XMMZ
XJPPD
MOEM
MJD
+ TXJM
--------
EPMXDX
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" (... | D=5,E=2,J=7,M=9,O=6,P=1,S=0,T=3,X=8,Z=4 | cryptarithm | {"difficulty": {"words": [5, 10]}, "digit_to_letter": {"0": "S", "1": "P", "2": "E", "3": "T", "4": "Z", "5": "D", "6": "O", "7": "J", "8": "X", "9": "M"}, "letter_to_digit": {"D": 5, "E": 2, "J": 7, "M": 9, "O": 6, "P": 1, "S": 0, "T": 3, "X": 8, "Z": 4}, "letters": ["S", "O", "D", "Z", "X", "E", "J", "T", "P", "M"], ... |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 9