question stringlengths 53 2.32k | answer stringlengths 1 5.65k | metadata stringlengths 73 5.85k | dataset_source stringclasses 34
values |
|---|---|---|---|
There are nine different blocks [A] [B] [C] {A} {B} {C} (A) (B) (C)
1. One [A], one [B], and one [C] can be combined to form one {A}.
2. One [A] and one [B] can be combined to form one {C}.
3. One [B] and one [C] can be combined to form one {B}.
4. Two [C] can be combined to form one {C}.
5. One {A} and one {C} can be ... | 5 0 0 0 0 0 0 0 0 | {"source_dataset": "string_synthesis", "source_index": 0, "states": [[5, 0, 0, 0, 0, 0, 0, 0, 0]], "solution": [5, 0, 0, 0, 0, 0, 0, 0, 0], "initial_blocks": [5, 0, 0], "difficulty": {"initial_blocks": [0, 5]}} | string_synthesis |
There are nine different blocks [A] [B] [C] {A} {B} {C} (A) (B) (C)
1. One [A], one [B], and one [C] can be combined to form one {A}.
2. One [A] and one [B] can be combined to form one {C}.
3. One [B] and one [C] can be combined to form one {B}.
4. Two [C] can be combined to form one {C}.
5. One {A} and one {C} can be ... | 0 0 1 0 0 1 0 0 1 | {"source_dataset": "string_synthesis", "source_index": 1, "states": [[0, 2, 5, 0, 0, 0, 0, 0, 0], [0, 1, 4, 0, 1, 0, 0, 0, 0], [0, 0, 3, 0, 2, 0, 0, 0, 0], [0, 0, 1, 0, 2, 1, 0, 0, 0], [0, 0, 1, 0, 0, 1, 0, 0, 1]], "solution": [0, 0, 1, 0, 0, 1, 0, 0, 1], "initial_blocks": [0, 2, 5], "difficulty": {"initial_blocks": [0... | string_synthesis |
There are nine different blocks [A] [B] [C] {A} {B} {C} (A) (B) (C)
1. One [A], one [B], and one [C] can be combined to form one {A}.
2. One [A] and one [B] can be combined to form one {C}.
3. One [B] and one [C] can be combined to form one {B}.
4. Two [C] can be combined to form one {C}.
5. One {A} and one {C} can be ... | 0 0 0 3 1 0 0 0 0 | {"source_dataset": "string_synthesis", "source_index": 2, "states": [[3, 4, 4, 0, 0, 0, 0, 0, 0], [2, 3, 3, 1, 0, 0, 0, 0, 0], [1, 2, 2, 2, 0, 0, 0, 0, 0], [0, 1, 1, 3, 0, 0, 0, 0, 0], [0, 0, 0, 3, 1, 0, 0, 0, 0]], "solution": [0, 0, 0, 3, 1, 0, 0, 0, 0], "initial_blocks": [3, 4, 4], "difficulty": {"initial_blocks": [0... | string_synthesis |
There are nine different blocks [A] [B] [C] {A} {B} {C} (A) (B) (C)
1. One [A], one [B], and one [C] can be combined to form one {A}.
2. One [A] and one [B] can be combined to form one {C}.
3. One [B] and one [C] can be combined to form one {B}.
4. Two [C] can be combined to form one {C}.
5. One {A} and one {C} can be ... | 0 0 0 2 1 0 0 0 0 | {"source_dataset": "string_synthesis", "source_index": 3, "states": [[2, 3, 3, 0, 0, 0, 0, 0, 0], [1, 2, 2, 1, 0, 0, 0, 0, 0], [0, 1, 1, 2, 0, 0, 0, 0, 0], [0, 0, 0, 2, 1, 0, 0, 0, 0]], "solution": [0, 0, 0, 2, 1, 0, 0, 0, 0], "initial_blocks": [2, 3, 3], "difficulty": {"initial_blocks": [0, 5]}} | string_synthesis |
There are nine different blocks [A] [B] [C] {A} {B} {C} (A) (B) (C)
1. One [A], one [B], and one [C] can be combined to form one {A}.
2. One [A] and one [B] can be combined to form one {C}.
3. One [B] and one [C] can be combined to form one {B}.
4. Two [C] can be combined to form one {C}.
5. One {A} and one {C} can be ... | 0 3 0 0 0 0 0 0 0 | {"source_dataset": "string_synthesis", "source_index": 4, "states": [[0, 3, 0, 0, 0, 0, 0, 0, 0]], "solution": [0, 3, 0, 0, 0, 0, 0, 0, 0], "initial_blocks": [0, 3, 0], "difficulty": {"initial_blocks": [0, 5]}} | string_synthesis |
There are nine different blocks [A] [B] [C] {A} {B} {C} (A) (B) (C)
1. One [A], one [B], and one [C] can be combined to form one {A}.
2. One [A] and one [B] can be combined to form one {C}.
3. One [B] and one [C] can be combined to form one {B}.
4. Two [C] can be combined to form one {C}.
5. One {A} and one {C} can be ... | 2 0 1 0 0 1 0 0 0 | {"source_dataset": "string_synthesis", "source_index": 5, "states": [[2, 0, 3, 0, 0, 0, 0, 0, 0], [2, 0, 1, 0, 0, 1, 0, 0, 0]], "solution": [2, 0, 1, 0, 0, 1, 0, 0, 0], "initial_blocks": [2, 0, 3], "difficulty": {"initial_blocks": [0, 5]}} | string_synthesis |
There are nine different blocks [A] [B] [C] {A} {B} {C} (A) (B) (C)
1. One [A], one [B], and one [C] can be combined to form one {A}.
2. One [A] and one [B] can be combined to form one {C}.
3. One [B] and one [C] can be combined to form one {B}.
4. Two [C] can be combined to form one {C}.
5. One {A} and one {C} can be ... | 2 0 0 0 0 0 1 1 0 | {"source_dataset": "string_synthesis", "source_index": 6, "states": [[4, 2, 1, 0, 0, 0, 0, 0, 0], [3, 1, 0, 1, 0, 0, 0, 0, 0], [2, 0, 0, 1, 0, 1, 0, 0, 0], [2, 0, 0, 0, 0, 0, 1, 1, 0]], "solution": [2, 0, 0, 0, 0, 0, 1, 1, 0], "initial_blocks": [4, 2, 1], "difficulty": {"initial_blocks": [0, 5]}} | string_synthesis |
There are nine different blocks [A] [B] [C] {A} {B} {C} (A) (B) (C)
1. One [A], one [B], and one [C] can be combined to form one {A}.
2. One [A] and one [B] can be combined to form one {C}.
3. One [B] and one [C] can be combined to form one {B}.
4. Two [C] can be combined to form one {C}.
5. One {A} and one {C} can be ... | 0 0 1 0 0 0 0 0 1 | {"source_dataset": "string_synthesis", "source_index": 7, "states": [[0, 2, 3, 0, 0, 0, 0, 0, 0], [0, 1, 2, 0, 1, 0, 0, 0, 0], [0, 0, 1, 0, 2, 0, 0, 0, 0], [0, 0, 1, 0, 0, 0, 0, 0, 1]], "solution": [0, 0, 1, 0, 0, 0, 0, 0, 1], "initial_blocks": [0, 2, 3], "difficulty": {"initial_blocks": [0, 5]}} | string_synthesis |
There are nine different blocks [A] [B] [C] {A} {B} {C} (A) (B) (C)
1. One [A], one [B], and one [C] can be combined to form one {A}.
2. One [A] and one [B] can be combined to form one {C}.
3. One [B] and one [C] can be combined to form one {B}.
4. Two [C] can be combined to form one {C}.
5. One {A} and one {C} can be ... | 1 0 0 2 0 0 0 0 0 | {"source_dataset": "string_synthesis", "source_index": 8, "states": [[3, 2, 2, 0, 0, 0, 0, 0, 0], [2, 1, 1, 1, 0, 0, 0, 0, 0], [1, 0, 0, 2, 0, 0, 0, 0, 0]], "solution": [1, 0, 0, 2, 0, 0, 0, 0, 0], "initial_blocks": [3, 2, 2], "difficulty": {"initial_blocks": [0, 5]}} | string_synthesis |
There are nine different blocks [A] [B] [C] {A} {B} {C} (A) (B) (C)
1. One [A], one [B], and one [C] can be combined to form one {A}.
2. One [A] and one [B] can be combined to form one {C}.
3. One [B] and one [C] can be combined to form one {B}.
4. Two [C] can be combined to form one {C}.
5. One {A} and one {C} can be ... | 0 0 0 1 1 0 0 0 1 | {"source_dataset": "string_synthesis", "source_index": 9, "states": [[1, 4, 4, 0, 0, 0, 0, 0, 0], [0, 3, 3, 1, 0, 0, 0, 0, 0], [0, 2, 2, 1, 1, 0, 0, 0, 0], [0, 1, 1, 1, 2, 0, 0, 0, 0], [0, 0, 0, 1, 3, 0, 0, 0, 0], [0, 0, 0, 1, 1, 0, 0, 0, 1]], "solution": [0, 0, 0, 1, 1, 0, 0, 0, 1], "initial_blocks": [1, 4, 4], "diffi... | string_synthesis |
There are nine different blocks [A] [B] [C] {A} {B} {C} (A) (B) (C)
1. One [A], one [B], and one [C] can be combined to form one {A}.
2. One [A] and one [B] can be combined to form one {C}.
3. One [B] and one [C] can be combined to form one {B}.
4. Two [C] can be combined to form one {C}.
5. One {A} and one {C} can be ... | 2 0 1 0 0 2 0 0 0 | {"source_dataset": "string_synthesis", "source_index": 10, "states": [[2, 0, 5, 0, 0, 0, 0, 0, 0], [2, 0, 3, 0, 0, 1, 0, 0, 0], [2, 0, 1, 0, 0, 2, 0, 0, 0]], "solution": [2, 0, 1, 0, 0, 2, 0, 0, 0], "initial_blocks": [2, 0, 5], "difficulty": {"initial_blocks": [0, 5]}} | string_synthesis |
There are nine different blocks [A] [B] [C] {A} {B} {C} (A) (B) (C)
1. One [A], one [B], and one [C] can be combined to form one {A}.
2. One [A] and one [B] can be combined to form one {C}.
3. One [B] and one [C] can be combined to form one {B}.
4. Two [C] can be combined to form one {C}.
5. One {A} and one {C} can be ... | 3 0 0 0 0 0 1 1 0 | {"source_dataset": "string_synthesis", "source_index": 11, "states": [[4, 1, 3, 0, 0, 0, 0, 0, 0], [3, 0, 2, 1, 0, 0, 0, 0, 0], [3, 0, 0, 1, 0, 1, 0, 0, 0], [3, 0, 0, 0, 0, 0, 1, 1, 0]], "solution": [3, 0, 0, 0, 0, 0, 1, 1, 0], "initial_blocks": [4, 1, 3], "difficulty": {"initial_blocks": [0, 5]}} | string_synthesis |
There are nine different blocks [A] [B] [C] {A} {B} {C} (A) (B) (C)
1. One [A], one [B], and one [C] can be combined to form one {A}.
2. One [A] and one [B] can be combined to form one {C}.
3. One [B] and one [C] can be combined to form one {B}.
4. Two [C] can be combined to form one {C}.
5. One {A} and one {C} can be ... | 0 0 1 1 0 0 0 0 1 | {"source_dataset": "string_synthesis", "source_index": 12, "states": [[1, 3, 4, 0, 0, 0, 0, 0, 0], [0, 2, 3, 1, 0, 0, 0, 0, 0], [0, 1, 2, 1, 1, 0, 0, 0, 0], [0, 0, 1, 1, 2, 0, 0, 0, 0], [0, 0, 1, 1, 0, 0, 0, 0, 1]], "solution": [0, 0, 1, 1, 0, 0, 0, 0, 1], "initial_blocks": [1, 3, 4], "difficulty": {"initial_blocks": [... | string_synthesis |
There are nine different blocks [A] [B] [C] {A} {B} {C} (A) (B) (C)
1. One [A], one [B], and one [C] can be combined to form one {A}.
2. One [A] and one [B] can be combined to form one {C}.
3. One [B] and one [C] can be combined to form one {B}.
4. Two [C] can be combined to form one {C}.
5. One {A} and one {C} can be ... | 0 0 0 0 1 0 0 0 0 | {"source_dataset": "string_synthesis", "source_index": 13, "states": [[0, 1, 1, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 1, 0, 0, 0, 0]], "solution": [0, 0, 0, 0, 1, 0, 0, 0, 0], "initial_blocks": [0, 1, 1], "difficulty": {"initial_blocks": [0, 5]}} | string_synthesis |
There are nine different blocks [A] [B] [C] {A} {B} {C} (A) (B) (C)
1. One [A], one [B], and one [C] can be combined to form one {A}.
2. One [A] and one [B] can be combined to form one {C}.
3. One [B] and one [C] can be combined to form one {B}.
4. Two [C] can be combined to form one {C}.
5. One {A} and one {C} can be ... | 4 0 1 0 0 1 0 0 0 | {"source_dataset": "string_synthesis", "source_index": 14, "states": [[4, 0, 3, 0, 0, 0, 0, 0, 0], [4, 0, 1, 0, 0, 1, 0, 0, 0]], "solution": [4, 0, 1, 0, 0, 1, 0, 0, 0], "initial_blocks": [4, 0, 3], "difficulty": {"initial_blocks": [0, 5]}} | string_synthesis |
There are nine different blocks [A] [B] [C] {A} {B} {C} (A) (B) (C)
1. One [A], one [B], and one [C] can be combined to form one {A}.
2. One [A] and one [B] can be combined to form one {C}.
3. One [B] and one [C] can be combined to form one {B}.
4. Two [C] can be combined to form one {C}.
5. One {A} and one {C} can be ... | 0 0 0 0 0 1 0 0 1 | {"source_dataset": "string_synthesis", "source_index": 15, "states": [[0, 2, 4, 0, 0, 0, 0, 0, 0], [0, 1, 3, 0, 1, 0, 0, 0, 0], [0, 0, 2, 0, 2, 0, 0, 0, 0], [0, 0, 0, 0, 2, 1, 0, 0, 0], [0, 0, 0, 0, 0, 1, 0, 0, 1]], "solution": [0, 0, 0, 0, 0, 1, 0, 0, 1], "initial_blocks": [0, 2, 4], "difficulty": {"initial_blocks": [... | string_synthesis |
There are nine different blocks [A] [B] [C] {A} {B} {C} (A) (B) (C)
1. One [A], one [B], and one [C] can be combined to form one {A}.
2. One [A] and one [B] can be combined to form one {C}.
3. One [B] and one [C] can be combined to form one {B}.
4. Two [C] can be combined to form one {C}.
5. One {A} and one {C} can be ... | 3 0 0 1 0 0 0 0 0 | {"source_dataset": "string_synthesis", "source_index": 16, "states": [[4, 1, 1, 0, 0, 0, 0, 0, 0], [3, 0, 0, 1, 0, 0, 0, 0, 0]], "solution": [3, 0, 0, 1, 0, 0, 0, 0, 0], "initial_blocks": [4, 1, 1], "difficulty": {"initial_blocks": [0, 5]}} | string_synthesis |
There are nine different blocks [A] [B] [C] {A} {B} {C} (A) (B) (C)
1. One [A], one [B], and one [C] can be combined to form one {A}.
2. One [A] and one [B] can be combined to form one {C}.
3. One [B] and one [C] can be combined to form one {B}.
4. Two [C] can be combined to form one {C}.
5. One {A} and one {C} can be ... | 1 0 1 0 0 2 0 0 0 | {"source_dataset": "string_synthesis", "source_index": 17, "states": [[1, 0, 5, 0, 0, 0, 0, 0, 0], [1, 0, 3, 0, 0, 1, 0, 0, 0], [1, 0, 1, 0, 0, 2, 0, 0, 0]], "solution": [1, 0, 1, 0, 0, 2, 0, 0, 0], "initial_blocks": [1, 0, 5], "difficulty": {"initial_blocks": [0, 5]}} | string_synthesis |
There are nine different blocks [A] [B] [C] {A} {B} {C} (A) (B) (C)
1. One [A], one [B], and one [C] can be combined to form one {A}.
2. One [A] and one [B] can be combined to form one {C}.
3. One [B] and one [C] can be combined to form one {B}.
4. Two [C] can be combined to form one {C}.
5. One {A} and one {C} can be ... | 0 0 0 1 0 0 1 1 0 | {"source_dataset": "string_synthesis", "source_index": 18, "states": [[2, 2, 4, 0, 0, 0, 0, 0, 0], [1, 1, 3, 1, 0, 0, 0, 0, 0], [0, 0, 2, 2, 0, 0, 0, 0, 0], [0, 0, 0, 2, 0, 1, 0, 0, 0], [0, 0, 0, 1, 0, 0, 1, 1, 0]], "solution": [0, 0, 0, 1, 0, 0, 1, 1, 0], "initial_blocks": [2, 2, 4], "difficulty": {"initial_blocks": [... | string_synthesis |
There are nine different blocks [A] [B] [C] {A} {B} {C} (A) (B) (C)
1. One [A], one [B], and one [C] can be combined to form one {A}.
2. One [A] and one [B] can be combined to form one {C}.
3. One [B] and one [C] can be combined to form one {B}.
4. Two [C] can be combined to form one {C}.
5. One {A} and one {C} can be ... | 2 0 1 0 0 0 1 1 0 | {"source_dataset": "string_synthesis", "source_index": 19, "states": [[3, 1, 4, 0, 0, 0, 0, 0, 0], [2, 0, 3, 1, 0, 0, 0, 0, 0], [2, 0, 1, 1, 0, 1, 0, 0, 0], [2, 0, 1, 0, 0, 0, 1, 1, 0]], "solution": [2, 0, 1, 0, 0, 0, 1, 1, 0], "initial_blocks": [3, 1, 4], "difficulty": {"initial_blocks": [0, 5]}} | string_synthesis |
Transform the word ladder 'HAND' to 'GLEE' 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. | HAND,HARD,HERD,HEED,FEED,FLED,FLEE,GLEE | {"source_dataset": "word_ladder", "source_index": 0, "start_word": "HAND", "end_word": "GLEE", "word_length": 4, "chain_length": 8, "difficulty": {"word_length": [4, 4]}} | word_ladder |
Transform the word ladder 'JAZZ' to 'DORM' 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. | JAZZ,JIZZ,FIZZ,FUZZ,FUZE,FAZE,FARE,FARM,FORM,DORM | {"source_dataset": "word_ladder", "source_index": 1, "start_word": "JAZZ", "end_word": "DORM", "word_length": 4, "chain_length": 10, "difficulty": {"word_length": [4, 4]}} | word_ladder |
Transform the word ladder 'SNOG' to 'SUQS' 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. | SNOG,SNAG,SAAG,SANG,SUNG,SUNS,SUQS | {"source_dataset": "word_ladder", "source_index": 2, "start_word": "SNOG", "end_word": "SUQS", "word_length": 4, "chain_length": 7, "difficulty": {"word_length": [4, 4]}} | word_ladder |
Transform the word ladder 'PAYS' to 'SASH' 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. | PAYS,SAYS,SASS,SASH | {"source_dataset": "word_ladder", "source_index": 3, "start_word": "PAYS", "end_word": "SASH", "word_length": 4, "chain_length": 4, "difficulty": {"word_length": [4, 4]}} | word_ladder |
Transform the word ladder 'OFFS' to 'BEEP' 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. | OFFS,OAFS,OATS,BATS,BAES,BEES,BEEP | {"source_dataset": "word_ladder", "source_index": 4, "start_word": "OFFS", "end_word": "BEEP", "word_length": 4, "chain_length": 7, "difficulty": {"word_length": [4, 4]}} | word_ladder |
Transform the word ladder 'BRAD' to 'POEM' 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. | BRAD,BRAT,BRUT,BOUT,POUT,POET,POEM | {"source_dataset": "word_ladder", "source_index": 5, "start_word": "BRAD", "end_word": "POEM", "word_length": 4, "chain_length": 7, "difficulty": {"word_length": [4, 4]}} | word_ladder |
Transform the word ladder 'DICE' to 'TEEN' 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. | DICE,DIRE,FIRE,FIRN,FERN,TERN,TEEN | {"source_dataset": "word_ladder", "source_index": 6, "start_word": "DICE", "end_word": "TEEN", "word_length": 4, "chain_length": 7, "difficulty": {"word_length": [4, 4]}} | word_ladder |
Transform the word ladder 'MAGE' to 'PANG' 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. | MAGE,MANE,PANE,PANG | {"source_dataset": "word_ladder", "source_index": 7, "start_word": "MAGE", "end_word": "PANG", "word_length": 4, "chain_length": 4, "difficulty": {"word_length": [4, 4]}} | word_ladder |
Transform the word ladder 'HOPS' to 'MINI' 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. | HOPS,HOES,HOED,HIED,HIND,MIND,MINI | {"source_dataset": "word_ladder", "source_index": 8, "start_word": "HOPS", "end_word": "MINI", "word_length": 4, "chain_length": 7, "difficulty": {"word_length": [4, 4]}} | word_ladder |
Transform the word ladder 'SHIV' to 'TARP' 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. | SHIV,SHIN,WHIN,WAIN,WARN,TARN,TARP | {"source_dataset": "word_ladder", "source_index": 9, "start_word": "SHIV", "end_word": "TARP", "word_length": 4, "chain_length": 7, "difficulty": {"word_length": [4, 4]}} | word_ladder |
Transform the word ladder 'BOIL' to 'SLAB' 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. | BOIL,SOIL,SOUL,SOUP,SOAP,SLAP,SLAB | {"source_dataset": "word_ladder", "source_index": 10, "start_word": "BOIL", "end_word": "SLAB", "word_length": 4, "chain_length": 7, "difficulty": {"word_length": [4, 4]}} | word_ladder |
Transform the word ladder 'READ' to 'SHIP' 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. | READ,REAM,SEAM,SHAM,SHIM,SHIP | {"source_dataset": "word_ladder", "source_index": 11, "start_word": "READ", "end_word": "SHIP", "word_length": 4, "chain_length": 6, "difficulty": {"word_length": [4, 4]}} | word_ladder |
Transform the word ladder 'PSIS' to 'TEAT' 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. | PSIS,PHIS,THIS,THIN,THAN,THAT,TEAT | {"source_dataset": "word_ladder", "source_index": 12, "start_word": "PSIS", "end_word": "TEAT", "word_length": 4, "chain_length": 7, "difficulty": {"word_length": [4, 4]}} | word_ladder |
Transform the word ladder 'FOAL' to 'DROP' 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. | FOAL,FOOL,COOL,COOP,CROP,DROP | {"source_dataset": "word_ladder", "source_index": 13, "start_word": "FOAL", "end_word": "DROP", "word_length": 4, "chain_length": 6, "difficulty": {"word_length": [4, 4]}} | word_ladder |
Transform the word ladder 'ROPY' to 'SODS' 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. | ROPY,ROPE,RODE,RODS,SODS | {"source_dataset": "word_ladder", "source_index": 14, "start_word": "ROPY", "end_word": "SODS", "word_length": 4, "chain_length": 5, "difficulty": {"word_length": [4, 4]}} | word_ladder |
Transform the word ladder 'MODE' to 'TYRE' 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. | MODE,MORE,TORE,TYRE | {"source_dataset": "word_ladder", "source_index": 15, "start_word": "MODE", "end_word": "TYRE", "word_length": 4, "chain_length": 4, "difficulty": {"word_length": [4, 4]}} | word_ladder |
Transform the word ladder 'FORK' to 'BELL' 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. | FORK,FOLK,FOLD,BOLD,BOLL,BELL | {"source_dataset": "word_ladder", "source_index": 16, "start_word": "FORK", "end_word": "BELL", "word_length": 4, "chain_length": 6, "difficulty": {"word_length": [4, 4]}} | word_ladder |
Transform the word ladder 'CELL' to 'ZITI' 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. | CELL,BELL,BILL,BILE,BITE,BITS,ZITS,ZITI | {"source_dataset": "word_ladder", "source_index": 17, "start_word": "CELL", "end_word": "ZITI", "word_length": 4, "chain_length": 8, "difficulty": {"word_length": [4, 4]}} | word_ladder |
Transform the word ladder 'JADE' to 'TOSS' 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. | JADE,JAPE,TAPE,TAPS,TOPS,TOSS | {"source_dataset": "word_ladder", "source_index": 18, "start_word": "JADE", "end_word": "TOSS", "word_length": 4, "chain_length": 6, "difficulty": {"word_length": [4, 4]}} | word_ladder |
Transform the word ladder 'FEEL' to 'TEEM' 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. | FEEL,FEED,TEED,TEEM | {"source_dataset": "word_ladder", "source_index": 19, "start_word": "FEEL", "end_word": "TEEM", "word_length": 4, "chain_length": 4, "difficulty": {"word_length": [4, 4]}} | word_ladder |
Solve the following problem.
Provide you answer as a comma-separated list of words with a space after the comma.
Reverse this list of words: bed, if, problem, but, Well, an, transmission, nutritive
| nutritive, transmission, an, Well, but, problem, if, bed | {"source_dataset": "word_sequence_reversal", "source_index": 0, "num_words": 8, "words": ["bed", "if", "problem", "but", "Well", "an", "transmission", "nutritive"], "difficulty": {"words": [3, 8]}} | word_sequence_reversal |
Solve the following problem.
Provide you answer as a comma-separated list of words with a space after the comma.
Reverse this list of words: it, pleasure, Gutenberg
| Gutenberg, pleasure, it | {"source_dataset": "word_sequence_reversal", "source_index": 1, "num_words": 3, "words": ["it", "pleasure", "Gutenberg"], "difficulty": {"words": [3, 8]}} | word_sequence_reversal |
Solve the following problem.
Provide you answer as a comma-separated list of words with a space after the comma.
Reverse this list of words: readable, to, he, that, to, possession
| possession, to, that, he, to, readable | {"source_dataset": "word_sequence_reversal", "source_index": 2, "num_words": 6, "words": ["readable", "to", "he", "that", "to", "possession"], "difficulty": {"words": [3, 8]}} | word_sequence_reversal |
Solve the following problem.
Provide you answer as a comma-separated list of words with a space after the comma.
Reverse this list of words: does, IS, by, in, should
| should, in, by, IS, does | {"source_dataset": "word_sequence_reversal", "source_index": 3, "num_words": 5, "words": ["does", "IS", "by", "in", "should"], "difficulty": {"words": [3, 8]}} | word_sequence_reversal |
Solve the following problem.
Provide you answer as a comma-separated list of words with a space after the comma.
Reverse this list of words: keeping, others, the
| the, others, keeping | {"source_dataset": "word_sequence_reversal", "source_index": 4, "num_words": 3, "words": ["keeping", "others", "the"], "difficulty": {"words": [3, 8]}} | word_sequence_reversal |
Solve the following problem.
Provide you answer as a comma-separated list of words with a space after the comma.
Reverse this list of words: years, Project, not, another, ages
| ages, another, not, Project, years | {"source_dataset": "word_sequence_reversal", "source_index": 5, "num_words": 5, "words": ["years", "Project", "not", "another", "ages"], "difficulty": {"words": [3, 8]}} | word_sequence_reversal |
Solve the following problem.
Provide you answer as a comma-separated list of words with a space after the comma.
Reverse this list of words: me, you, of, being, the, map, a
| a, map, the, being, of, you, me | {"source_dataset": "word_sequence_reversal", "source_index": 6, "num_words": 7, "words": ["me", "you", "of", "being", "the", "map", "a"], "difficulty": {"words": [3, 8]}} | word_sequence_reversal |
Solve the following problem.
Provide you answer as a comma-separated list of words with a space after the comma.
Reverse this list of words: said, give, And
| And, give, said | {"source_dataset": "word_sequence_reversal", "source_index": 7, "num_words": 3, "words": ["said", "give", "And"], "difficulty": {"words": [3, 8]}} | word_sequence_reversal |
Solve the following problem.
Provide you answer as a comma-separated list of words with a space after the comma.
Reverse this list of words: these, electronic, kitchen, costs, upward, all
| all, upward, costs, kitchen, electronic, these | {"source_dataset": "word_sequence_reversal", "source_index": 8, "num_words": 6, "words": ["these", "electronic", "kitchen", "costs", "upward", "all"], "difficulty": {"words": [3, 8]}} | word_sequence_reversal |
Solve the following problem.
Provide you answer as a comma-separated list of words with a space after the comma.
Reverse this list of words: computers, That, race, his
| his, race, That, computers | {"source_dataset": "word_sequence_reversal", "source_index": 9, "num_words": 4, "words": ["computers", "That", "race", "his"], "difficulty": {"words": [3, 8]}} | word_sequence_reversal |
Solve the following problem.
Provide you answer as a comma-separated list of words with a space after the comma.
Reverse this list of words: to, number, it, Redistribution, than
| than, Redistribution, it, number, to | {"source_dataset": "word_sequence_reversal", "source_index": 10, "num_words": 5, "words": ["to", "number", "it", "Redistribution", "than"], "difficulty": {"words": [3, 8]}} | word_sequence_reversal |
Solve the following problem.
Provide you answer as a comma-separated list of words with a space after the comma.
Reverse this list of words: Though, provide, widest, a, equipment, copyright, user
| user, copyright, equipment, a, widest, provide, Though | {"source_dataset": "word_sequence_reversal", "source_index": 11, "num_words": 7, "words": ["Though", "provide", "widest", "a", "equipment", "copyright", "user"], "difficulty": {"words": [3, 8]}} | word_sequence_reversal |
Solve the following problem.
Provide you answer as a comma-separated list of words with a space after the comma.
Reverse this list of words: obtaining, having, of, 3
| 3, of, having, obtaining | {"source_dataset": "word_sequence_reversal", "source_index": 12, "num_words": 4, "words": ["obtaining", "having", "of", "3"], "difficulty": {"words": [3, 8]}} | word_sequence_reversal |
Solve the following problem.
Provide you answer as a comma-separated list of words with a space after the comma.
Reverse this list of words: Madrid, Smith, it
| it, Smith, Madrid | {"source_dataset": "word_sequence_reversal", "source_index": 13, "num_words": 3, "words": ["Madrid", "Smith", "it"], "difficulty": {"words": [3, 8]}} | word_sequence_reversal |
Solve the following problem.
Provide you answer as a comma-separated list of words with a space after the comma.
Reverse this list of words: the, THAT, requirements, condition, phrase, the, to
| to, the, phrase, condition, requirements, THAT, the | {"source_dataset": "word_sequence_reversal", "source_index": 14, "num_words": 7, "words": ["the", "THAT", "requirements", "condition", "phrase", "the", "to"], "difficulty": {"words": [3, 8]}} | word_sequence_reversal |
Solve the following problem.
Provide you answer as a comma-separated list of words with a space after the comma.
Reverse this list of words: trademark, in, ask
| ask, in, trademark | {"source_dataset": "word_sequence_reversal", "source_index": 15, "num_words": 3, "words": ["trademark", "in", "ask"], "difficulty": {"words": [3, 8]}} | word_sequence_reversal |
Solve the following problem.
Provide you answer as a comma-separated list of words with a space after the comma.
Reverse this list of words: France, True, and, invented, I, to, work
| work, to, I, invented, and, True, France | {"source_dataset": "word_sequence_reversal", "source_index": 16, "num_words": 7, "words": ["France", "True", "and", "invented", "I", "to", "work"], "difficulty": {"words": [3, 8]}} | word_sequence_reversal |
Solve the following problem.
Provide you answer as a comma-separated list of words with a space after the comma.
Reverse this list of words: him, of, time, during
| during, time, of, him | {"source_dataset": "word_sequence_reversal", "source_index": 17, "num_words": 4, "words": ["him", "of", "time", "during"], "difficulty": {"words": [3, 8]}} | word_sequence_reversal |
Solve the following problem.
Provide you answer as a comma-separated list of words with a space after the comma.
Reverse this list of words: idea, you, to, Nothing, electronically
| electronically, Nothing, to, you, idea | {"source_dataset": "word_sequence_reversal", "source_index": 18, "num_words": 5, "words": ["idea", "you", "to", "Nothing", "electronically"], "difficulty": {"words": [3, 8]}} | word_sequence_reversal |
Solve the following problem.
Provide you answer as a comma-separated list of words with a space after the comma.
Reverse this list of words: simply, has, Yes, them, coming, years
| years, coming, them, Yes, has, simply | {"source_dataset": "word_sequence_reversal", "source_index": 19, "num_words": 6, "words": ["simply", "has", "Yes", "them", "coming", "years"], "difficulty": {"words": [3, 8]}} | word_sequence_reversal |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: DIRECT, given, exclaims, dream... | DIRECT, dreaming, exclaims, given | {"source_dataset": "word_sorting", "source_index": 0, "original_words": ["DIRECT", "given", "exclaims", "dreaming"], "sorted_words": ["DIRECT", "dreaming", "exclaims", "given"], "transformed_words": ["DIRECT", "given", "exclaims", "dreaming"], "direction": "ascending", "num_words": 4, "word_length": 8, "difficulty": {"... | word_sorting |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: heat, begun, sometimes
| sometimes, heat, begun | {"source_dataset": "word_sorting", "source_index": 1, "original_words": ["heat", "begun", "sometimes"], "sorted_words": ["sometimes", "heat", "begun"], "transformed_words": ["heat", "begun", "sometimes"], "direction": "descending", "num_words": 3, "word_length": 9, "difficulty": {"num_words": [3, 10], "word_length": [3... | word_sorting |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: violates, yes, already, comple... | EXPRESS, already, completing, duly, duty, his, pages, violates, yes | {"source_dataset": "word_sorting", "source_index": 2, "original_words": ["violates", "yes", "already", "completing", "pages", "duty", "his", "EXPRESS", "duly"], "sorted_words": ["EXPRESS", "already", "completing", "duly", "duty", "his", "pages", "violates", "yes"], "transformed_words": ["violates", "yes", "already", "c... | word_sorting |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: reaching, telephote, fifteen, ... | City, THE, fifteen, infinite, marriage, reaching, telephote | {"source_dataset": "word_sorting", "source_index": 3, "original_words": ["reaching", "telephote", "fifteen", "THE", "infinite", "marriage", "City"], "sorted_words": ["City", "THE", "fifteen", "infinite", "marriage", "reaching", "telephote"], "transformed_words": ["reaching", "telephote", "fifteen", "THE", "infinite", "... | word_sorting |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: present, HAVE, edifice, using
| HAVE, edifice, present, using | {"source_dataset": "word_sorting", "source_index": 4, "original_words": ["present", "HAVE", "edifice", "using"], "sorted_words": ["HAVE", "edifice", "present", "using"], "transformed_words": ["present", "HAVE", "edifice", "using"], "direction": "ascending", "num_words": 4, "word_length": 7, "difficulty": {"num_words": ... | word_sorting |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: Once, replies, short, men, fib... | Once, fibers, men, performing, plans, replies, short, unimaginable | {"source_dataset": "word_sorting", "source_index": 5, "original_words": ["Once", "replies", "short", "men", "fibers", "unimaginable", "performing", "plans"], "sorted_words": ["Once", "fibers", "men", "performing", "plans", "replies", "short", "unimaginable"], "transformed_words": ["Once", "replies", "short", "men", "fi... | word_sorting |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: artificial, wish, indirectly, ... | artificial, busied, child, country, indirectly, resultant, trifle, wish | {"source_dataset": "word_sorting", "source_index": 6, "original_words": ["artificial", "wish", "indirectly", "trifle", "country", "resultant", "child", "busied"], "sorted_words": ["artificial", "busied", "child", "country", "indirectly", "resultant", "trifle", "wish"], "transformed_words": ["artificial", "wish", "indir... | word_sorting |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: mere, pure, admirable, library... | admirable, library, mere, pure | {"source_dataset": "word_sorting", "source_index": 7, "original_words": ["mere", "pure", "admirable", "library"], "sorted_words": ["admirable", "library", "mere", "pure"], "transformed_words": ["mere", "pure", "admirable", "library"], "direction": "ascending", "num_words": 4, "word_length": 9, "difficulty": {"num_words... | word_sorting |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: formats, novel, every, strain,... | Think, This, due, every, formats, lacks, locomotion, novel, strain, worked | {"source_dataset": "word_sorting", "source_index": 8, "original_words": ["formats", "novel", "every", "strain", "locomotion", "Think", "worked", "lacks", "due", "This"], "sorted_words": ["Think", "This", "due", "every", "formats", "lacks", "locomotion", "novel", "strain", "worked"], "transformed_words": ["formats", "no... | word_sorting |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: transcribe, certain, existenc... | transcribe, posted, feelings, existence, elect, certain | {"source_dataset": "word_sorting", "source_index": 9, "original_words": ["transcribe", "certain", "existence", "elect", "feelings", "posted"], "sorted_words": ["transcribe", "posted", "feelings", "existence", "elect", "certain"], "transformed_words": ["transcribe", "certain", "existence", "elect", "feelings", "posted"]... | word_sorting |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: Mercury, uninhabited, synonymo... | February, Mercury, banks, open, prominently, synonymous, uninhabited | {"source_dataset": "word_sorting", "source_index": 10, "original_words": ["Mercury", "uninhabited", "synonymous", "open", "prominently", "February", "banks"], "sorted_words": ["February", "Mercury", "banks", "open", "prominently", "synonymous", "uninhabited"], "transformed_words": ["Mercury", "uninhabited", "synonymous... | word_sorting |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: simplest, transactions, suspen... | next, side, simplest, suspended, transactions, vision | {"source_dataset": "word_sorting", "source_index": 11, "original_words": ["simplest", "transactions", "suspended", "vision", "next", "side"], "sorted_words": ["next", "side", "simplest", "suspended", "transactions", "vision"], "transformed_words": ["simplest", "transactions", "suspended", "vision", "next", "side"], "di... | word_sorting |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: room, improvement, suspending,... | improvement, paper, room, suspending, telephonic | {"source_dataset": "word_sorting", "source_index": 12, "original_words": ["room", "improvement", "suspending", "telephonic", "paper"], "sorted_words": ["improvement", "paper", "room", "suspending", "telephonic"], "transformed_words": ["room", "improvement", "suspending", "telephonic", "paper"], "direction": "ascending"... | word_sorting |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: cure, bodies, individual, Sout... | South, bodies, cure, individual | {"source_dataset": "word_sorting", "source_index": 13, "original_words": ["cure", "bodies", "individual", "South"], "sorted_words": ["South", "bodies", "cure", "individual"], "transformed_words": ["cure", "bodies", "individual", "South"], "direction": "ascending", "num_words": 4, "word_length": 10, "difficulty": {"num_... | word_sorting |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: streets, wanted, indemnify
| wanted, streets, indemnify | {"source_dataset": "word_sorting", "source_index": 14, "original_words": ["streets", "wanted", "indemnify"], "sorted_words": ["wanted", "streets", "indemnify"], "transformed_words": ["streets", "wanted", "indemnify"], "direction": "descending", "num_words": 3, "word_length": 9, "difficulty": {"num_words": [3, 10], "wor... | word_sorting |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: occurrences, CONTRACT, during... | occurrences, during, CONTRACT | {"source_dataset": "word_sorting", "source_index": 15, "original_words": ["occurrences", "CONTRACT", "during"], "sorted_words": ["occurrences", "during", "CONTRACT"], "transformed_words": ["occurrences", "CONTRACT", "during"], "direction": "descending", "num_words": 3, "word_length": 11, "difficulty": {"num_words": [3,... | word_sorting |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: descendant, decline, Hence, c... | sent, progress, descendant, decline, countries, Hence | {"source_dataset": "word_sorting", "source_index": 16, "original_words": ["descendant", "decline", "Hence", "countries", "sent", "progress"], "sorted_words": ["sent", "progress", "descendant", "decline", "countries", "Hence"], "transformed_words": ["descendant", "decline", "Hence", "countries", "sent", "progress"], "di... | word_sorting |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: These, sleeping, Congress, atm... | Congress, Cooley, These, atmospheric, including, sleeping | {"source_dataset": "word_sorting", "source_index": 17, "original_words": ["These", "sleeping", "Congress", "atmospheric", "including", "Cooley"], "sorted_words": ["Congress", "Cooley", "These", "atmospheric", "including", "sleeping"], "transformed_words": ["These", "sleeping", "Congress", "atmospheric", "including", "C... | word_sorting |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in ascending order (using ASCII/Unicode ordering) and return them as a comma-separated list: has, building, forgotten, edit... | building, editors, forgotten, has, lucky, springs, swarm | {"source_dataset": "word_sorting", "source_index": 18, "original_words": ["has", "building", "forgotten", "editors", "swarm", "springs", "lucky"], "sorted_words": ["building", "editors", "forgotten", "has", "lucky", "springs", "swarm"], "transformed_words": ["has", "building", "forgotten", "editors", "swarm", "springs"... | word_sorting |
Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: confirmation, dissecting, lea... | taxed, never, near, leave, least, hundred, dissecting, confirmation, PROJECT, Donations | {"source_dataset": "word_sorting", "source_index": 19, "original_words": ["confirmation", "dissecting", "least", "hundred", "leave", "Donations", "taxed", "near", "never", "PROJECT"], "sorted_words": ["taxed", "never", "near", "leave", "least", "hundred", "dissecting", "confirmation", "PROJECT", "Donations"], "transfor... | word_sorting |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.