question stringlengths 53 5.78k | answer stringlengths 1 27.2k ⌀ | source_dataset stringclasses 34
values | metadata_json stringlengths 74 27.4k |
|---|---|---|---|
Given two strings representing a ransom note and a magazine, return True if you can construct the ransom note using the letters in the magazine, and False otherwise.
Each letter in the magazine string can only be used once in your ransom note.
Ransom note: sxycukhcefujckreysvchxmeephirqoadkynetenkzjscfqwncrszfjjulftw... | False | ransom_note | {"difficulty": {"magazine_length": [100, 500], "note_length": [50, 100]}, "magazine": "eeahvhzlknpthgyrmjckhuhrcxewmoguwpfqfbzdowziixybvbavwyyzahghslqeritrqjtuqtmehyoxzwrjexswserkfcvdemaezpdcwyxlyoaxarsiuzcxskpznjglypkulmflshdicdgfmaufodvdhxofywdfloc", "magazine_length": 163, "note_length": 80, "ransom_note": "sxycukhc... |
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 d7c5 to hexadecimal
| b243 | base_conversion | {"decimal_value": 45635, "difficulty": {"base": [9, 18], "value": [10000, 100000]}, "source_base": 15, "source_dataset": "base_conversion", "source_index": 1, "source_repr": "d7c5", "target_base": 16, "target_repr": "b243"} |
How many times does the letter "g" appear in the text: "France means to be the trusty defender Well said exclaimed Mr Smith How is it he asked turning to the Russian ambassador that you Russians are not content with your vast empire the most extensive in the world stretching from the banks of"? | 2 | letter_counting | {"difficulty": {"words": [25, 50]}, "source_dataset": "letter_counting", "source_index": 2, "span": ["France", "means", "to", "be", "the", "trusty", "defender", "Well", "said", "exclaimed", "Mr", "Smith", "How", "is", "it", "he", "asked", "turning", "to", "the", "Russian", "ambassador", "that", "you", "Russians", "are"... |
Please provide a coloring for this graph such that every vertex is not connected to a vertex of the same color. The graph has these properties:
Vertices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
Edges: [(0, 5), (0, 7), (1, 9), (2, 5), (2, 9), (3, 9), (7, 10), (8, 9)]
Possible colors: [1, 2, 3, 4]
Return your solution as a ... | null | graph_color | {"difficulty": {"num_colors": 4, "num_vertices": [10, 20]}, "num_vertices": 11, "possible_answer": {"0": 1, "1": 1, "2": 1, "3": 1, "4": 1, "5": 2, "6": 1, "7": 2, "8": 1, "9": 2, "10": 1}, "puzzle": {"color_options": [1, 2, 3, 4], "edges": [[0, 5], [0, 7], [1, 9], [2, 5], [2, 9], [3, 9], [7, 10], [8, 9]], "num_colors"... |
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 4 0 58 0 0 4 4 0 | string_synthesis | {"difficulty": {"initial_blocks": [50, 100]}, "initial_blocks": [66, 70, 62], "solution": [0, 4, 0, 58, 0, 0, 4, 4, 0], "source_dataset": "string_synthesis", "source_index": 4, "states": [[66, 70, 62, 0, 0, 0, 0, 0, 0], [65, 69, 61, 1, 0, 0, 0, 0, 0], [64, 68, 60, 2, 0, 0, 0, 0, 0], [63, 67, 59, 3, 0, 0, 0, 0, 0], [62,... |
Two strings are isomorphic if the characters in one string can be replaced to get the second string.
All occurrences of a character must be replaced with another character while preserving the order of characters.
No two characters may map to the same character, but a character may map to itself.
Return True if the ... | True | isomorphic_strings | {"difficulty": {"string_length": [50, 100]}, "solution": true, "solvable": true, "source_dataset": "isomorphic_strings", "source_index": 5, "string_length": 64, "words": ["zcscpcllfsikbvqznbsjejxjdjpxkzgbxocijuywvprgminzgrguvtmkdtoyoly", "znintnwwbiefscozhsiugujuvutjfzlsjaneuxrkctylpehzlylxcdpfvdarawr"]} |
Your task is, given a list of letters, to form a valid palindrome.
A palindrome is a phrase that reads the same forwards and backwards.
If there are multiple possible answers, only respond with one of them. You must use all the letters provided.
Your output should be a single string, with no spaces or punctuation.
... | dkmgpmhxqrheermgtpknwszznsllsnzzswnkptgmreehrqxhmpgmkd | palindrome_generation | {"difficulty": {"length": [50, 100]}, "generated_palindrome": "dkmgpmhxqrheermgtpknwszznsllsnzzswnkptgmreehrqxhmpgmkd", "length": 54, "letters": ["x", "m", "m", "e", "e", "h", "n", "m", "z", "h", "l", "k", "d", "g", "s", "q", "g", "k", "q", "g", "r", "t", "m", "d", "e", "n", "p", "s", "k", "s", "p", "h", "t", "p", "z",... |
Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 49 | binary_alternation | {"difficulty": {"n": [50, 500]}, "n": 187, "solution": 49, "solvable": true, "source_dataset": "binary_alternation", "source_index": 7, "string": "11010101110000000011101101010000000001001111101010001110100111011011110011000110111000001111000101011110010010110010101110111111100010011110011011000110000100100010101011100... |
Keep all numbers smaller than 0.8903 in this list: ['-383.907', '472.094', '-233.1502', '-70.5336', '-221.97', '143.7990', '-323.23', '-341.99', '-376.98', '-8.80', '-99.2976', '-487.2848', '26.5942', '204.82', '473.5191', '-493.438', '264.20', '150.7600', '-111.16', '380.40', '-64.83', '95.628', '-150.42', '-363.32', ... | ['-383.907', '-233.1502', '-70.5336', '-221.97', '-323.23', '-341.99', '-376.98', '-8.80', '-99.2976', '-487.2848', '-493.438', '-111.16', '-64.83', '-150.42', '-363.32', '-260.1971', '-60.715', '-1.3163', '-309.6479', '-478.3402', '-200.62', '-208.077', '-118.38', '-254.54', '-18.302', '-192.9785', '-462.95', '-39.15'... | number_filtering | {"difficulty": {"decimals": [2, 4], "numbers": [50, 100], "value": [-500, 500]}, "filter_value": "0.8903", "numbers": 54, "operation": "keep_smaller", "original_numbers": ["-383.907", "472.094", "-233.1502", "-70.5336", "-221.97", "143.7990", "-323.23", "-341.99", "-376.98", "-8.80", "-99.2976", "-487.2848", "26.5942",... |
This is a 'Game of Life' grid. We consider a game halted if there are no cells alive.
Will this game halt at or before 50 steps? Assume a Moore neighborhood and wrapping topology. If it will halt, reply 'True'. If it won't halt, reply 'False'.
Initial board:
[[0 0 0 ... 0 0 0]
[0 0 0 ... 0 0 0]
[0 0 0 ... 0 0 0]
..... | True | game_of_life_halting | {"difficulty": {"difficulty": 2, "grid_size_x": 50, "grid_size_y": 50, "max_simulation_steps": 50, "num_oscillators": 7}, "grid_size_x": 50, "grid_size_y": 50, "placed_patterns": [{"name": "non-oscillator", "position": [37, 10]}, {"name": "non-oscillator", "position": [15, 31]}, {"name": "non-oscillator", "position": [... |
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: winter, EBOOK, phrase, donati... | words, winter, weeks, wealthy, vital, virus, truth, trifling, texts, table, support, states, resolved, produce, phrase, mummy, months, methods, machinery, located, learn, immediate, images, growing, future, fully, first, finishing, famous, failing, donations, direction, derive, death, button, breathe, block, beyond, ar... | word_sorting | {"difficulty": {"num_words": [25, 50], "word_length": [5, 10]}, "direction": "descending", "num_words": 50, "original_words": ["winter", "EBOOK", "phrase", "donations", "truth", "Archive", "weeks", "NOTICE", "support", "months", "trifling", "resolved", "direction", "texts", "finishing", "Special", "mummy", "Samuel", "g... |
Your job is to perform max/average pooling on the given matrix.
The stride is equal to the kernel size, meaning there is no overlap between the pooling regions.
Your output should be a matrix in the same format as the input matrix.
The output matrix is smaller than the input matrix when the kernel size is greater than... | 9 9 7 9 9 9 9 8 8
9 9 9 9 9 8 9 9 8
9 9 9 9 9 9 9 9 9
9 9 9 8 9 9 9 9 2
9 9 8 9 8 9 9 9 7
9 9 9 9 9 9 9 9 9
9 9 9 9 9 9 9 9 8
9 9 9 9 9 9 9 8 8
8 8 9 8 9 9 9 9 7 | pool_matrix | {"cols": 41, "difficulty": {"cols": [25, 50], "pool_size": [5, 7], "rows": [25, 50]}, "matrix": [[9, 9, 4, 9, 5, 9, 3, 3, 8, 5, 5, 2, 3, 3, 7, 5, 1, 4, 4, 2, 9, 6, 7, 6, 7, 9, 9, 3, 6, 9, 7, 5, 5, 1, 3, 2, 5, 6, 7, 0, 1], [0, 5, 5, 3, 7, 6, 5, 2, 3, 1, 0, 7, 1, 6, 0, 9, 5, 4, 2, 9, 9, 2, 5, 5, 3, 5, 3, 5, 3, 0, 4, 4, 0... |
Transform the word ladder 'RUB' to 'ISM' 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. | RUB,RIB,RID,AID,ADD,ADS,ASS,ASH,ISH,ISM | word_ladder | {"chain_length": 10, "difficulty": {"word_length": [3, 5]}, "end_word": "ISM", "source_dataset": "word_ladder", "source_index": 12, "start_word": "RUB", "word_length": 3} |
Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
1 1 1 0 1 1 1 1 ... | 1 2 1 0 1 2 3 2 2 1 1 0 1 2 3 3 2 2 3 2 2 1 0 0 0 1 2 1 0 1 0 1
0 1 1 0 1 1 2 1 1 0 1 0 1 2 3 2 1 1 2 1 1 1 1 1 1 1 2 2 1 1 1 0
0 1 2 1 1 0 1 0 0 1 1 0 0 1 2 1 0 0 1 0 0 0 1 2 1 0 1 1 0 0 0 0
0 1 1 0 0 0 1 1 1 2 2 1 1 1 2 1 1 1 1 0 1 1 1 2 1 1 2 2 1 0 0 0
1 1 0 1 1 1 1 0 1 1 1 0 1 0 1 0 0 0 1 1 2 1 0 1 0 1 2 2 1 0 0 1
... | binary_matrix | {"difficulty": {"n": [25, 50], "p_zero": 0.25}, "matrix": [[1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1], [0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 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, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0... |
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: His, narrative, reporter, Smith, reach, are, of, the, day, numerous, he, and, or, ebook, irritation, astronomical, on, was, Paris, s, is, world, AND, and, derivative, be, teleph... | telephote, be, derivative, and, AND, world, is, s, Paris, was, on, astronomical, irritation, ebook, or, and, he, numerous, day, the, of, are, reach, Smith, reporter, narrative, His | word_sequence_reversal | {"difficulty": {"words": [25, 50]}, "num_words": 27, "source_dataset": "word_sequence_reversal", "source_index": 14, "words": ["His", "narrative", "reporter", "Smith", "reach", "are", "of", "the", "day", "numerous", "he", "and", "or", "ebook", "irritation", "astronomical", "on", "was", "Paris", "s", "is", "world", "AND... |
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 39384 to hexadecimal
| 99d8 | base_conversion | {"decimal_value": 39384, "difficulty": {"base": [9, 18], "value": [10000, 100000]}, "source_base": 10, "source_dataset": "base_conversion", "source_index": 15, "source_repr": "39384", "target_base": 16, "target_repr": "99d8"} |
Given a string, partition it such that every substring is a palindrome.
A palindrome is a word that reads the same backward as forward.
You may return all possible palindrome partitioning in any order.
Your output should be a list of lists, where each list represents a palindrome partition, e.g. [["a","a","b"],["aa"... | [["j", "t", "b", "t", "x", "x", "u", "u"], ["j", "t", "b", "t", "x", "x", "uu"], ["j", "t", "b", "t", "xx", "u", "u"], ["j", "t", "b", "t", "xx", "uu"], ["j", "tbt", "x", "x", "u", "u"], ["j", "tbt", "x", "x", "uu"], ["j", "tbt", "xx", "u", "u"], ["j", "tbt", "xx", "uu"]] | palindrome_partitioning | {"difficulty": {"string_len": [5, 15], "substring_palindrome_len": [1, 5]}, "solution": [["j", "t", "b", "t", "x", "x", "u", "u"], ["j", "t", "b", "t", "x", "x", "uu"], ["j", "t", "b", "t", "xx", "u", "u"], ["j", "t", "b", "t", "xx", "uu"], ["j", "tbt", "x", "x", "u", "u"], ["j", "tbt", "x", "x", "uu"], ["j", "tbt", "x... |
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": 17} |
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"... | [["academes", "madecase"], ["adherents", "neatherds"], ["aglare", "alarge", "alegar", "galera", "laager"], ["alisier", "israeli", "resilia"], ["annuloid", "uninodal"], ["asweat", "awaste"], ["barcoo", "baroco"], ["befathered", "featherbed"], ["bop", "pob"], ["brasiletto", "strobilate"], ["brave", "breva"], ["chloralose... | group_anagrams | {"anagram_groups": 30, "difficulty": {"anagram_groups": [10, 50], "words_per_group": [2, 5]}, "solution": [["academes", "madecase"], ["adherents", "neatherds"], ["aglare", "alarge", "alegar", "galera", "laager"], ["alisier", "israeli", "resilia"], ["annuloid", "uninodal"], ["asweat", "awaste"], ["barcoo", "baroco"], ["... |
Keep all numbers larger than 16.10 in this list: ['-403.9771', '230.422', '243.40', '155.5165', '-99.2882', '-311.3019', '-28.8428', '-490.60', '223.119', '-75.5878', '-93.36', '-325.289', '-134.92', '273.02', '-355.856', '-354.2333', '374.147', '213.19', '125.2681', '245.202', '412.2959', '-417.0679', '-498.428', '175... | ['230.422', '243.40', '155.5165', '223.119', '273.02', '374.147', '213.19', '125.2681', '245.202', '412.2959', '175.68', '177.9224', '295.955', '305.2166', '52.1092', '480.19', '192.5444', '291.301', '79.164', '390.320', '440.6192', '65.40', '238.94', '287.15', '40.323', '275.792', '76.882', '175.54'] | number_filtering | {"difficulty": {"decimals": [2, 4], "numbers": [50, 100], "value": [-500, 500]}, "filter_value": "16.10", "numbers": 62, "operation": "keep_larger", "original_numbers": ["-403.9771", "230.422", "243.40", "155.5165", "-99.2882", "-311.3019", "-28.8428", "-490.60", "223.119", "-75.5878", "-93.36", "-325.289", "-134.92", ... |
Transform the word ladder 'SHRUB' to 'NESTS' 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. | SHRUB,SCRUB,SCRUM,STRUM,STRUT,STOUT,STOUP,STOMP,STAMP,SCAMP,SCAMS,SEAMS,TEAMS,TEATS,TESTS,NESTS | word_ladder | {"chain_length": 16, "difficulty": {"word_length": [3, 5]}, "end_word": "NESTS", "source_dataset": "word_ladder", "source_index": 20, "start_word": "SHRUB", "word_length": 5} |
For the following matrix:
5 9 2 3 3 7 2 1 5 0 3 1 7 4 2 6 7 5 9 1 6 1 4 7 0 5 7 1 0 7 1 1 3 2 6 4 5 3 5
7 4 2 1 0 9 8 5 0 2 5 3 4 5 0 8 2 8 9 8 0 9 8 5 0 6 1 0 0 3 6 7 7 3 3 5 3 8 8
3 2 7 1 8 0 5 8 2 7 9 1 2 9 7 3 1 2 4 6 4 7 3 3 4 4 3 2 1 0 9 4 7 0 1 0 6 4 5
5 6 8 4 4 8 4 4 2 5 4 2 2 3 8 1 6 9 8 5 8 2 9 7 7 8 1 7 7 2 ... | 2 5 2 9 3 1 1 0 1 8 0 4 4 7 1 2 4 1 7 6 5 9 1 1 8 5
8 3 7 8 6 1 1 1 8 0 8 4 2 2 5 0 2 8 2 2 4 2 2 2 8 3
5 8 3 3 0 9 6 3 4 5 8 2 5 4 9 4 9 5 1 9 1 6 6 1 3 5
2 9 1 2 3 1 0 7 5 3 5 5 3 9 6 4 0 4 7 5 7 1 3 9 5 4
0 0 1 8 0 8 1 5 5 7 7 4 6 8 6 8 3 2 2 2 4 3 9 4 3 6
2 4 0 5 8 9 5 4 5 4 5 8 6 5 4 2 9 0 2 2 6 8 9 8 3 2
3 8 3 7 ... | manipulate_matrix | {"cols": 39, "difficulty": {"cols": [25, 50], "num_transforms": [3, 10], "rows": [25, 50]}, "matrix": [[5, 9, 2, 3, 3, 7, 2, 1, 5, 0, 3, 1, 7, 4, 2, 6, 7, 5, 9, 1, 6, 1, 4, 7, 0, 5, 7, 1, 0, 7, 1, 1, 3, 2, 6, 4, 5, 3, 5], [7, 4, 2, 1, 0, 9, 8, 5, 0, 2, 5, 3, 4, 5, 0, 8, 2, 8, 9, 8, 0, 9, 8, 5, 0, 6, 1, 0, 0, 3, 6, 7, 7... |
Remove all numbers smaller than 369.369 in this list: ['339.623', '57.971', '-21.08', '-340.591', '172.8365', '-498.567', '-211.322', '-278.4074', '-367.76', '-288.291', '375.2214', '461.0461', '-168.963', '389.59', '150.328', '-254.649', '-482.1436', '231.550', '-150.659', '240.515', '85.1706', '278.73', '-438.041', '... | ['375.2214', '461.0461', '389.59', '419.89', '402.902', '431.24', '385.7340', '456.466', '432.291', '493.7975', '495.586', '496.01', '489.1928', '443.16'] | number_filtering | {"difficulty": {"decimals": [2, 4], "numbers": [50, 100], "value": [-500, 500]}, "filter_value": "369.369", "numbers": 82, "operation": "remove_smaller", "original_numbers": ["339.623", "57.971", "-21.08", "-340.591", "172.8365", "-498.567", "-211.322", "-278.4074", "-367.76", "-288.291", "375.2214", "461.0461", "-168.... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | copies providing access distributing Project Gutenberg electronic works provided royalty gross profits derive Project Gutenberg works calculated using method already calculate applicable taxes owner Project Gutenberg trademark agreed donate royalties under paragraph Project | letter_jumble | {"corruption_level": 0.41818217383751255, "difficulty": {"corruption_level": [0.3, 0.6], "word_len": [5, 30], "words": [25, 50]}, "num_words": 33, "original_words": ["copies", "providing", "access", "distributing", "Project", "Gutenberg", "electronic", "works", "provided", "royalty", "gross", "profits", "derive", "Proj... |
Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 100 | binary_alternation | {"difficulty": {"n": [50, 500]}, "n": 400, "solution": 100, "solvable": true, "source_dataset": "binary_alternation", "source_index": 24, "string": "001111111001111001001001011101100001000100101011011000010101110101111000100001111100000011101100010000001100111111100011110110000100001011101110110011011000101100100101101... |
Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 24 | binary_alternation | {"difficulty": {"n": [50, 500]}, "n": 110, "solution": 24, "solvable": true, "source_dataset": "binary_alternation", "source_index": 25, "string": "00100001001010001000110001111110000001011000111101011101001000011110111010101011011011100110101111001000111100"} |
Spell this word backward (example: sun -> nus): untainting | gnitniatnu | spell_backward | {"difficulty": {"word_len": [5, 20]}, "source_dataset": "spell_backward", "source_index": 26, "word": "untainting", "word_len": 10} |
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, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 0, 2, 1, 1, 2, 1, 1, 2, 2, 2, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1], [1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 0, 0, 1, 1, 0, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 2, 1, 1, 1, 1, 0, 1, 0, 0, 2,... |
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 ... | 25 0 0 51 0 0 11 11 0 | string_synthesis | {"difficulty": {"initial_blocks": [50, 100]}, "initial_blocks": [87, 62, 84], "solution": [25, 0, 0, 51, 0, 0, 11, 11, 0], "source_dataset": "string_synthesis", "source_index": 28, "states": [[87, 62, 84, 0, 0, 0, 0, 0, 0], [86, 61, 83, 1, 0, 0, 0, 0, 0], [85, 60, 82, 2, 0, 0, 0, 0, 0], [84, 59, 81, 3, 0, 0, 0, 0, 0], ... |
Two strings are isomorphic if the characters in one string can be replaced to get the second string.
All occurrences of a character must be replaced with another character while preserving the order of characters.
No two characters may map to the same character, but a character may map to itself.
Return True if the ... | False | isomorphic_strings | {"difficulty": {"string_length": [50, 100]}, "solution": false, "solvable": false, "source_dataset": "isomorphic_strings", "source_index": 29, "string_length": 81, "words": ["uonzesnatyluhfcutrkybufguwizvhxctuepgnpqxyaoedqbjqkgaxgjhdfudbppalhxbzxwyxzsgfcva", "cwlqjnlsvxrcmuecvfbxocuacyhqimdevcjgalgzdxswjtzokztasdakmtuc... |
Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 70 | binary_alternation | {"difficulty": {"n": [50, 500]}, "n": 280, "solution": 70, "solvable": true, "source_dataset": "binary_alternation", "source_index": 30, "string": "0101101101100011110000000111001011000011000101000011011111101100001100010001000101000011000100111010110010111110110011101100001101100000101110001011100111111000000110100100... |
Please provide a coloring for this graph such that every vertex is not connected to a vertex of the same color. The graph has these properties:
Vertices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16]
Edges: [(0, 4), (0, 8), (1, 4), (1, 5), (2, 9), (2, 13), (3, 7), (3, 8), (5, 13), (7, 14), (8, 9), (8, 15)... | null | graph_color | {"difficulty": {"num_colors": 4, "num_vertices": [10, 20]}, "num_vertices": 17, "possible_answer": {"0": 1, "1": 1, "2": 1, "3": 1, "4": 2, "5": 2, "6": 1, "7": 2, "8": 2, "9": 3, "10": 1, "11": 1, "12": 1, "13": 3, "14": 1, "15": 1, "16": 3}, "puzzle": {"color_options": [1, 2, 3, 4], "edges": [[0, 4], [0, 8], [1, 4], ... |
There is a dismantling engineer who has old machines A, B, and C.
He discovered that he can obtain a batch of new parts X, Y, Z through the following rules:
1. One unit of machine A can be dismanteled into two units of part X and one unit of part Y.
2. Two units of machine B can be dismanteled into one unit of part X.
... | 0 0 0 34 0 99 | string_splitting | {"difficulty": {"initial_machines": [50, 100]}, "initial_machines": [51, 62, 96], "solution": [0, 0, 0, 34, 0, 99], "source_dataset": "string_splitting", "source_index": 32, "states": [[51, 62, 96, 0, 0, 0], [50, 62, 96, 2, 1, 0], [49, 62, 96, 4, 2, 0], [48, 62, 96, 6, 3, 0], [47, 62, 96, 8, 4, 0], [46, 62, 96, 10, 5, ... |
For the following matrix:
2 2 6 7 7 7 7 4 3 3 9 5 7 3 3 6 1 1 7 8 4 6 8 5 6 8 6 2 5 2 6 5 8 3 4 0 8 0 6 6 2 8 3
1 8 6 6 4 8 5 2 9 9 7 5 7 9 3 5 7 5 0 9 6 2 8 4 3 8 9 8 2 9 1 6 0 0 5 8 2 0 9 6 0 8 4
3 5 5 1 6 3 3 9 8 6 9 3 6 4 8 4 4 2 0 2 1 9 9 9 6 2 1 7 6 5 7 5 7 8 6 3 3 4 9 2 0 9 6
1 2 3 8 6 5 5 7 8 1 4 4 4 1 3 1 1 8 ... | 2 2 0 7 7 7 7 0 3 3 1 5 7 3 3 0 1 1 7 9 0 0 9 5 0 9 0 2 5 2 0 5 9 3 0 1 9 1 0 0 2 9
1 9 0 0 0 9 5 2 1 1 7 5 7 1 3 5 7 5 1 1 0 2 9 0 3 9 1 9 2 1 1 0 1 1 5 9 2 1 1 0 1 9
3 5 5 1 0 3 3 1 9 0 1 3 0 0 9 0 0 2 1 2 1 1 1 1 0 2 1 7 0 5 7 5 7 9 0 3 3 0 1 2 1 1
1 2 3 9 0 5 5 7 9 1 0 0 0 1 3 1 1 9 7 3 2 5 1 2 9 1 1 9 5 9 0 1 9 5 ... | manipulate_matrix | {"cols": 43, "difficulty": {"cols": [25, 50], "num_transforms": [3, 10], "rows": [25, 50]}, "matrix": [[2, 2, 6, 7, 7, 7, 7, 4, 3, 3, 9, 5, 7, 3, 3, 6, 1, 1, 7, 8, 4, 6, 8, 5, 6, 8, 6, 2, 5, 2, 6, 5, 8, 3, 4, 0, 8, 0, 6, 6, 2, 8, 3], [1, 8, 6, 6, 4, 8, 5, 2, 9, 9, 7, 5, 7, 9, 3, 5, 7, 5, 0, 9, 6, 2, 8, 4, 3, 8, 9, 8, 2... |
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", "empty B", "pour A->B", "fill A", "pour A->B", "empty B", "pour A->B", "empty B", "pour A->B", "fill A", "pour A->B", "empty B", "pour A->B"] | jugs | {"difficulty": {"difficulty": 10, "num_jugs": 4}, "puzzle": {"jug_capacities": [11, 6, 11, 6], "min_moves": 13, "target": 3}, "source_dataset": "jugs", "source_index": 34} |
Given a string consisting of characters A, B, C, D, and E, your job is to insert a character according to the following pattern:
1. If there is a substring ABCD in the string, insert the character A after the substring.
2. If there is a substring BCDE in the string, insert the character B after the substring.
3. If the... | CEAACEECCBCBBADCBDEDDDBBECECACEACBDEEEDEEDECEAEDCCCEBAEDDCEAEBBAEBCDDEEBAAACECCBCDCAAAD | string_insertion | {"difficulty": {"string_length": [50, 100]}, "solution": "CEAACEECCBCBBADCBDEDDDBBECECACEACBDEEEDEEDECEAEDCCCEBAEDDCEAEBBAEBCDDEEBAAACECCBCDCAAAD", "source_dataset": "string_insertion", "source_index": 35, "string": "CEAACEECCBCBBADCBDEDDDBBECECACEACBDEEEDEEDECEAEDCCCEBAEDDCEAEBBAEBCDDEEBAAACECCBCDCAAAD", "string_lengt... |
Given a string consisting of characters A, B, C, D, and E, your job is to insert a character according to the following pattern:
1. If there is a substring ABCD in the string, insert the character A after the substring.
2. If there is a substring BCDE in the string, insert the character B after the substring.
3. If the... | DAEEDACABDCDDCBDCDBBCCDCACCCBBDAAACABCDAECECDDDBBBDBBBBCEEBBCCBECEDEDBDBECDDBBEACEEAAEDDEBEABADA | string_insertion | {"difficulty": {"string_length": [50, 100]}, "solution": "DAEEDACABDCDDCBDCDBBCCDCACCCBBDAAACABCDAECECDDDBBBDBBBBCEEBBCCBECEDEDBDBECDDBBEACEEAAEDDEBEABADA", "source_dataset": "string_insertion", "source_index": 36, "string": "DAEEDACABDCDDCBDCDBBCCDCACCCBBDAAACABCDECECDDDBBBDBBBBCEEBBCCBECEDEDBDBECDDBBEACEEAAEDDEBEABAD... |
Decrypt this Caesar cipher text: RHN TZKXX MATM RHN ATOX GH KXFXWBXL YHK LMKBVM UKXTVA HY PTKKTGMR HK UKXTVA HY VHGMKTVM XQVXIM MAHLX IKHOBWXW BG ITKTZKTIA. Provide only the decrypted text as your final answer. | YOU AGREE THAT YOU HAVE NO REMEDIES FOR STRICT BREACH OF WARRANTY OR BREACH OF CONTRACT EXCEPT THOSE PROVIDED IN PARAGRAPH | caesar_cipher | {"cipher_text": "RHN TZKXX MATM RHN ATOX GH KXFXWBXL YHK LMKBVM UKXTVA HY PTKKTGMR HK UKXTVA HY VHGMKTVM XQVXIM MAHLX IKHOBWXW BG ITKTZKTIA", "clear_text": "YOU AGREE THAT YOU HAVE NO REMEDIES FOR STRICT BREACH OF WARRANTY OR BREACH OF CONTRACT EXCEPT THOSE PROVIDED IN PARAGRAPH", "difficulty": {"rotation": [15, 25], "... |
Please provide a coloring for this graph such that every vertex is not connected to a vertex of the same color. The graph has these properties:
Vertices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]
Edges: [(1, 11), (1, 12), (2, 8), (2, 9), (3, 4), (3, 9), (11, 12)]
Possible colors: [1, 2, 3, 4]
Return your solution as... | null | graph_color | {"difficulty": {"num_colors": 4, "num_vertices": [10, 20]}, "num_vertices": 13, "possible_answer": {"0": 1, "1": 1, "2": 1, "3": 1, "4": 2, "5": 1, "6": 1, "7": 1, "8": 2, "9": 2, "10": 1, "11": 2, "12": 3}, "puzzle": {"color_options": [1, 2, 3, 4], "edges": [[1, 11], [1, 12], [2, 8], [2, 9], [3, 4], [3, 9], [11, 12]],... |
Sort these numbers in descending order: -119.2474, -321.2, -366.76, -248.849, 30.8126, 38.6291, -10.725, 222.2256, -283.308, 322.3254, -287.409, 160.5679, -161.1933, 28.72, -30.961, -457.3485, -492.38, -137.4685, -419.1836, 400.2423, -37.3, -142.48, 452.4254, -339.188, 95.42, 443.9106, -323.98, -476.696, 183.865, -418.... | ['491.122', '463.807', '452.4254', '443.9106', '407.206', '400.2423', '399.97', '382.522', '380.431', '379.568', '357.866', '346.13', '325.13', '322.3254', '288.2042', '270.82', '270.57', '263.9933', '251.51', '222.2256', '221.66', '220.73', '183.865', '174.3', '160.5679', '140.434', '132.01', '99.668', '95.42', '85.69... | number_sorting | {"difficulty": {"decimals": [2, 4], "numbers": [50, 100], "value": [-500, 500]}, "direction": "descending", "numbers": 75, "original_numbers": ["-119.2474", "-321.2", "-366.76", "-248.849", "30.8126", "38.6291", "-10.725", "222.2256", "-283.308", "322.3254", "-287.409", "160.5679", "-161.1933", "28.72", "-30.961", "-45... |
Decrypt this Caesar cipher text: KEALZ VGWK AK LG UGFFWUL ZAK LZW OAJWK GX OZAUZ UGEEMFAUSLW OALZ ZAK HSJAK ESFKAGF. Provide only the decrypted text as your final answer. | SMITH DOES IS TO CONNECT HIS THE WIRES OF WHICH COMMUNICATE WITH HIS PARIS MANSION | caesar_cipher | {"cipher_text": "KEALZ VGWK AK LG UGFFWUL ZAK LZW OAJWK GX OZAUZ UGEEMFAUSLW OALZ ZAK HSJAK ESFKAGF", "clear_text": "SMITH DOES IS TO CONNECT HIS THE WIRES OF WHICH COMMUNICATE WITH HIS PARIS MANSION", "difficulty": {"rotation": [15, 25], "words": [15, 25]}, "num_words": 15, "rotation": 18, "source_dataset": "caesar_ci... |
Keep all numbers larger than 494.03 in this list: ['-40.47', '205.5132', '-150.2631', '300.0205', '-378.6881', '-44.05', '158.8160', '447.078', '-270.29', '460.86', '-311.405', '-129.938', '463.32', '-96.933', '55.400', '-339.5782', '138.46', '-494.355', '-352.3955', '-337.46', '341.1747', '-262.775', '299.403', '-373.... | ['498.445'] | number_filtering | {"difficulty": {"decimals": [2, 4], "numbers": [50, 100], "value": [-500, 500]}, "filter_value": "494.03", "numbers": 59, "operation": "keep_larger", "original_numbers": ["-40.47", "205.5132", "-150.2631", "300.0205", "-378.6881", "-44.05", "158.8160", "447.078", "-270.29", "460.86", "-311.405", "-129.938", "463.32", "... |
Restore the correct order of words in the following sentence: available of the our polar Transform their regions, for snow-cap, send territory disposal; portion the of this energy relieved man's become heat will then at to the surplus a into use. a vast heat poles; | Transform into heat heat a a portion of of the the the surplus energy at our disposal; send this to poles; then polar regions, relieved their snow-cap, will become vast territory available for man's use. | sentence_reordering | {"difficulty": {"words_in_sentence": [20, 50]}, "source_dataset": "sentence_reordering", "source_index": 42, "word_count": 37} |
Solve this cryptarithm:
KGPGP
PKAJP
PQKJJ
HJKMZ
MJMMF
ZAGG
QKQGZ
+ QGG
--------
HQJFGH
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... | A=5,F=9,G=4,H=3,J=0,K=8,M=2,P=7,Q=1,Z=6 | cryptarithm | {"difficulty": {"words": [5, 10]}, "digit_to_letter": {"0": "J", "1": "Q", "2": "M", "3": "H", "4": "G", "5": "A", "6": "Z", "7": "P", "8": "K", "9": "F"}, "letter_to_digit": {"A": 5, "F": 9, "G": 4, "H": 3, "J": 0, "K": 8, "M": 2, "P": 7, "Q": 1, "Z": 6}, "letters": ["P", "F", "A", "H", "Q", "Z", "G", "K", "M", "J"], ... |
Given a matrix, your job is to generate a list of elements in spiral order, starting from the top-left element.
The spiral order is clockwise, starting from the top-left corner. More precisely:
- Start from the top-left corner and move right along the top row.
- Move down along the right column.
- Move left along the ... | 7 5 7 7 8 0 7 4 7 1 6 1 3 6 0 9 5 8 4 7 8 8 8 9 6 4 8 5 3 0 3 3 9 8 0 0 9 9 3 7 9 7 4 1 6 5 2 0 2 5 6 5 9 3 9 0 4 8 4 7 5 9 9 3 1 9 6 8 2 7 7 7 9 3 4 6 8 9 6 9 8 0 3 2 0 3 4 0 7 9 8 1 9 2 4 7 2 5 7 6 1 9 2 3 9 0 3 2 8 1 6 6 4 9 3 3 0 2 1 7 8 2 2 9 8 6 4 0 7 7 2 0 9 5 1 7 6 9 7 9 4 3 2 1 1 1 3 3 9 4 7 0 9 2 5 1 7 2 3 6 ... | spiral_matrix | {"difficulty": {"n": [25, 50]}, "matrix": [[7, 5, 7, 7, 8, 0, 7, 4, 7, 1, 6, 1, 3, 6, 0, 9, 5, 8, 4, 7, 8, 8, 8, 9, 6], [7, 2, 5, 7, 6, 1, 9, 2, 3, 9, 0, 3, 2, 8, 1, 6, 6, 4, 9, 3, 3, 0, 2, 1, 4], [4, 1, 7, 7, 9, 2, 7, 1, 3, 9, 9, 5, 1, 4, 0, 1, 7, 5, 0, 4, 8, 1, 2, 7, 8], [2, 4, 0, 9, 9, 8, 4, 0, 9, 7, 5, 3, 7, 9, 9, ... |
Decrypt this Caesar cipher text: FK QEB JFOOLO LC QEB MELKLQBIBMELQB FP PBBK QEB PXJB ZEXJYBO XQ MXOFP TEFZE XMMBXOBA FK FQ QEFP JLOKFKD. Provide only the decrypted text as your final answer. | IN THE MIRROR OF THE PHONOTELEPHOTE IS SEEN THE SAME CHAMBER AT PARIS WHICH APPEARED IN IT THIS MORNING | caesar_cipher | {"cipher_text": "FK QEB JFOOLO LC QEB MELKLQBIBMELQB FP PBBK QEB PXJB ZEXJYBO XQ MXOFP TEFZE XMMBXOBA FK FQ QEFP JLOKFKD", "clear_text": "IN THE MIRROR OF THE PHONOTELEPHOTE IS SEEN THE SAME CHAMBER AT PARIS WHICH APPEARED IN IT THIS MORNING", "difficulty": {"rotation": [15, 25], "words": [15, 25]}, "num_words": 19, "r... |
How many times does the letter "c" appear in the text: "by Jules Verne and Michel Verne END OF THE PROJECT GUTENBERG EBOOK IN THE YEAR 2889 Updated editions will replace the previous one the old editions will be renamed"? | 3 | letter_counting | {"difficulty": {"words": [25, 50]}, "source_dataset": "letter_counting", "source_index": 46, "span": ["by", "Jules", "Verne", "and", "Michel", "Verne", "END", "OF", "THE", "PROJECT", "GUTENBERG", "EBOOK", "IN", "THE", "YEAR", "2889", "Updated", "editions", "will", "replace", "the", "previous", "one", "the", "old", "edi... |
Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 67 | binary_alternation | {"difficulty": {"n": [50, 500]}, "n": 265, "solution": 67, "solvable": true, "source_dataset": "binary_alternation", "source_index": 47, "string": "1010001101101100011011001111010011111011001011110101000101110101011111100100111110110001011000011001000101100011100011010011100100100001000010010010111010001011001100110010... |
Solve this cryptarithm:
ZTQZ
ZAJZ
QTS
OVTUJ
OJT
+ ZKOSO
-------
TKKQU
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=2,J=7,K=3,O=4,Q=8,S=0,T=6,U=9,V=5,Z=1 | cryptarithm | {"difficulty": {"words": [5, 10]}, "digit_to_letter": {"0": "S", "1": "Z", "2": "A", "3": "K", "4": "O", "5": "V", "6": "T", "7": "J", "8": "Q", "9": "U"}, "letter_to_digit": {"A": 2, "J": 7, "K": 3, "O": 4, "Q": 8, "S": 0, "T": 6, "U": 9, "V": 5, "Z": 1}, "letters": ["O", "T", "K", "U", "A", "S", "V", "Q", "J", "Z"], ... |
Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 84 | binary_alternation | {"difficulty": {"n": [50, 500]}, "n": 329, "solution": 84, "solvable": true, "source_dataset": "binary_alternation", "source_index": 49, "string": "0100001011000101111010010110001000110001101000011011110001100101000111100011001010010100100000000101011001010111000110001100011011110000101000011111110010011001010101111001... |
Your task is to unsramble words in a sentence.
For each word in a sentence, the letter may have been randomly shuffled. Your task is to unscramble the words.
The order of the words in the sentence is preserved. Moreover, the style of the sentence is preserved (i.e. punctuation, capitalization, new lines, etc.).
Your... | BREACH CONTRACT EXCEPT THOSE PROVIDED PARAGRAPH AGREE FOUNDATION TRADEMARK OWNER DISTRIBUTOR UNDER AGREEMENT LIABLE ACTUAL DIRECT INDIRECT CONSEQUENTIAL PUNITIVE INCIDENTAL DAMAGES NOTICE POSSIBILITY DAMAGE LIMITED RIGHT REPLACEMENT REFUND discover defect electronic within | letter_jumble | {"corruption_level": 0.48594266827692817, "difficulty": {"corruption_level": [0.3, 0.6], "word_len": [5, 30], "words": [25, 50]}, "num_words": 32, "original_words": ["BREACH", "CONTRACT", "EXCEPT", "THOSE", "PROVIDED", "PARAGRAPH", "AGREE", "FOUNDATION", "TRADEMARK", "OWNER", "DISTRIBUTOR", "UNDER", "AGREEMENT", "LIABL... |
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": 51, "start_word": "FOE", "word_length": 3} |
Your task is, given a list of letters, to form a valid palindrome.
A palindrome is a phrase that reads the same forwards and backwards.
If there are multiple possible answers, only respond with one of them. You must use all the letters provided.
Your output should be a single string, with no spaces or punctuation.
... | rvhmjlabdhyhifjiwneqfgmmhvhmmgfqenwijfihyhdbaljmhvr | palindrome_generation | {"difficulty": {"length": [50, 100]}, "generated_palindrome": "rvhmjlabdhyhifjiwneqfgmmhvhmmgfqenwijfihyhdbaljmhvr", "length": 51, "letters": ["n", "b", "i", "h", "a", "v", "h", "m", "h", "j", "j", "q", "n", "d", "h", "l", "y", "f", "l", "a", "w", "g", "h", "h", "v", "m", "q", "w", "r", "v", "g", "y", "j", "i", "j", "m... |
Spell this word backward (example: sun -> nus): robing | gnibor | spell_backward | {"difficulty": {"word_len": [5, 20]}, "source_dataset": "spell_backward", "source_index": 53, "word": "robing", "word_len": 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 ... | ["fill A", "pour A->B", "pour A->C", "fill A", "pour A->C", "empty B", "pour A->B", "empty B", "pour A->B", "fill A", "pour A->B", "empty B", "pour A->B", "empty B", "pour A->B", "fill A", "pour A->B"] | jugs | {"difficulty": {"difficulty": 10, "num_jugs": 4}, "puzzle": {"jug_capacities": [13, 7, 7, 13], "min_moves": 17, "target": 10}, "source_dataset": "jugs", "source_index": 54} |
Solve this cryptarithm:
ARV
QVWUZ
UQV
AQLW
+ WLWA
-------
WQPWP
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=1,L=7,P=4,Q=2,R=0,U=9,V=6,W=3,Z=8 | cryptarithm | {"difficulty": {"words": [5, 10]}, "digit_to_letter": {"0": "R", "1": "A", "2": "Q", "3": "W", "4": "P", "6": "V", "7": "L", "8": "Z", "9": "U"}, "letter_to_digit": {"A": 1, "L": 7, "P": 4, "Q": 2, "R": 0, "U": 9, "V": 6, "W": 3, "Z": 8}, "letters": ["U", "V", "W", "P", "Z", "L", "R", "Q", "A"], "result_letters": "WQPW... |
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"] | jugs | {"difficulty": {"difficulty": 10, "num_jugs": 4}, "puzzle": {"jug_capacities": [9, 13, 11, 13], "min_moves": 10, "target": 12}, "source_dataset": "jugs", "source_index": 56} |
How many times does the letter "a" appear in the text: "I shall have succeeded in solving the problem Indeed it may take only a few days And then Then sir I shall simply have determined"? | 9 | letter_counting | {"difficulty": {"words": [25, 50]}, "source_dataset": "letter_counting", "source_index": 57, "span": ["I", "shall", "have", "succeeded", "in", "solving", "the", "problem", "Indeed", "it", "may", "take", "only", "a", "few", "days", "And", "then", "Then", "sir", "I", "shall", "simply", "have", "determined"], "span_length... |
Decrypt this Caesar cipher text: NPMHCAR CZMMIQ YPC MDRCL APCYRCB DPMK QCTCPYJ NPGLRCB YJJ MD UFGAF YPC AMLDGPKCB YQ LMR NPMRCARCB ZW AMNWPGEFR GL RFC S. Provide only the decrypted text as your final answer. | PROJECT EBOOKS ARE OFTEN CREATED FROM SEVERAL PRINTED ALL OF WHICH ARE CONFIRMED AS NOT PROTECTED BY COPYRIGHT IN THE U | caesar_cipher | {"cipher_text": "NPMHCAR CZMMIQ YPC MDRCL APCYRCB DPMK QCTCPYJ NPGLRCB YJJ MD UFGAF YPC AMLDGPKCB YQ LMR NPMRCARCB ZW AMNWPGEFR GL RFC S", "clear_text": "PROJECT EBOOKS ARE OFTEN CREATED FROM SEVERAL PRINTED ALL OF WHICH ARE CONFIRMED AS NOT PROTECTED BY COPYRIGHT IN THE U", "difficulty": {"rotation": [15, 25], "words"... |
Given a string, partition it such that every substring is a palindrome.
A palindrome is a word that reads the same backward as forward.
You may return all possible palindrome partitioning in any order.
Your output should be a list of lists, where each list represents a palindrome partition, e.g. [["a","a","b"],["aa"... | [["p", "p", "q", "e", "e", "q"], ["p", "p", "q", "ee", "q"], ["p", "p", "qeeq"], ["pp", "q", "e", "e", "q"], ["pp", "q", "ee", "q"], ["pp", "qeeq"]] | palindrome_partitioning | {"difficulty": {"string_len": [5, 15], "substring_palindrome_len": [1, 5]}, "solution": [["p", "p", "q", "e", "e", "q"], ["p", "p", "q", "ee", "q"], ["p", "p", "qeeq"], ["pp", "q", "e", "e", "q"], ["pp", "q", "ee", "q"], ["pp", "qeeq"]], "source_dataset": "palindrome_partitioning", "source_index": 59, "string": "ppqeeq... |
Count how many prime numbers there are between 18553 and 41992 (inclusive) ? | 2267 | count_primes | {"difficulty": {"n": [10000, 50000]}, "end": 41992, "n": [18553, 41992], "primes": [18553, 18583, 18587, 18593, 18617, 18637, 18661, 18671, 18679, 18691, 18701, 18713, 18719, 18731, 18743, 18749, 18757, 18773, 18787, 18793, 18797, 18803, 18839, 18859, 18869, 18899, 18911, 18913, 18917, 18919, 18947, 18959, 18973, 18979... |
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: astonish, gutenberg, early, be... | ACTUAL, American, DAMAGES, according, additions, astonish, before, cholera, dresser, early, editors, especially, expend, gathered, granted, gutenberg, identify, located, lover, means, newspaper, notice, notifies, occupant, recount, sixty, statements | word_sorting | {"difficulty": {"num_words": [25, 50], "word_length": [5, 10]}, "direction": "ascending", "num_words": 27, "original_words": ["astonish", "gutenberg", "early", "before", "cholera", "means", "especially", "American", "granted", "newspaper", "dresser", "gathered", "occupant", "located", "according", "identify", "notifies... |
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: man, Gutenberg, the, I, the, ANY, Certainly, in, performing, West, and, to, confirmation, including, the, works, freely, without, involve, almost, Singularly, all, LIMITED, edit... | with, done, of, editions, LIMITED, all, Singularly, almost, involve, without, freely, works, the, including, confirmation, to, and, West, performing, in, Certainly, ANY, the, I, the, Gutenberg, man | word_sequence_reversal | {"difficulty": {"words": [25, 50]}, "num_words": 27, "source_dataset": "word_sequence_reversal", "source_index": 62, "words": ["man", "Gutenberg", "the", "I", "the", "ANY", "Certainly", "in", "performing", "West", "and", "to", "confirmation", "including", "the", "works", "freely", "without", "involve", "almost", "Singu... |
There is a dismantling engineer who has old machines A, B, and C.
He discovered that he can obtain a batch of new parts X, Y, Z through the following rules:
1. One unit of machine A can be dismanteled into two units of part X and one unit of part Y.
2. Two units of machine B can be dismanteled into one unit of part X.
... | 0 1 0 83 0 137 | string_splitting | {"difficulty": {"initial_machines": [50, 100]}, "initial_machines": [92, 73, 90], "solution": [0, 1, 0, 83, 0, 137], "source_dataset": "string_splitting", "source_index": 63, "states": [[92, 73, 90, 0, 0, 0], [91, 73, 90, 2, 1, 0], [90, 73, 90, 4, 2, 0], [89, 73, 90, 6, 3, 0], [88, 73, 90, 8, 4, 0], [87, 73, 90, 10, 5,... |
Restore the correct order of words in the following sentence: paying Gutenberg royalties registered charge terms used eBook, of use Gutenberg is of for not trademark. and an for except may Project including following by if a trademark you Project be license, trademark, the the the | Project Project Gutenberg Gutenberg is a registered trademark, and may not be used if you charge for for an eBook, except by following the the the terms of of trademark license, including paying royalties use trademark. | sentence_reordering | {"difficulty": {"words_in_sentence": [20, 50]}, "source_dataset": "sentence_reordering", "source_index": 64, "word_count": 36} |
This is a 'Game of Life' grid. We consider a game halted if there are no cells alive.
Will this game halt at or before 50 steps? Assume a Moore neighborhood and wrapping topology. If it will halt, reply 'True'. If it won't halt, reply 'False'.
Initial board:
[[0 0 0 ... 0 0 0]
[0 0 0 ... 0 0 0]
[0 0 0 ... 0 0 0]
..... | True | game_of_life_halting | {"difficulty": {"difficulty": 2, "grid_size_x": 50, "grid_size_y": 50, "max_simulation_steps": 50, "num_oscillators": 7}, "grid_size_x": 50, "grid_size_y": 50, "placed_patterns": [{"name": "non-oscillator", "position": [42, 8]}, {"name": "non-oscillator", "position": [9, 31]}, {"name": "non-oscillator", "position": [16... |
Decrypt this Caesar cipher text: RTBG VZR SGD BNTQRD NE ENQ HS VZR MNS SHKK SGD XDZQ SGZS SGD EZLNTR NRVZKC MHDQ LZCD SGHR FQDZS CHRBNUDQX. Provide only the decrypted text as your final answer. | SUCH WAS THE COURSE OF FOR IT WAS NOT TILL THE YEAR THAT THE FAMOUS OSWALD NIER MADE THIS GREAT DISCOVERY | caesar_cipher | {"cipher_text": "RTBG VZR SGD BNTQRD NE ENQ HS VZR MNS SHKK SGD XDZQ SGZS SGD EZLNTR NRVZKC MHDQ LZCD SGHR FQDZS CHRBNUDQX", "clear_text": "SUCH WAS THE COURSE OF FOR IT WAS NOT TILL THE YEAR THAT THE FAMOUS OSWALD NIER MADE THIS GREAT DISCOVERY", "difficulty": {"rotation": [15, 25], "words": [15, 25]}, "num_words": 21... |
Please provide a coloring for this graph such that every vertex is not connected to a vertex of the same color. The graph has these properties:
Vertices: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13]
Edges: [(0, 7), (1, 10), (2, 12), (4, 9), (4, 12), (7, 12), (8, 10), (8, 12)]
Possible colors: [1, 2, 3, 4]
Return yo... | null | graph_color | {"difficulty": {"num_colors": 4, "num_vertices": [10, 20]}, "num_vertices": 14, "possible_answer": {"0": 1, "1": 1, "2": 1, "3": 1, "4": 1, "5": 1, "6": 1, "7": 2, "8": 1, "9": 2, "10": 2, "11": 1, "12": 3, "13": 1}, "puzzle": {"color_options": [1, 2, 3, 4], "edges": [[0, 7], [1, 10], [2, 12], [4, 9], [4, 12], [7, 12],... |
Transform the word ladder 'WRITE' to 'SENSE' 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. | WRITE,WHITE,WHILE,WHOLE,WHOSE,CHOSE,CHASE,CEASE,TEASE,TENSE,SENSE | word_ladder | {"chain_length": 11, "difficulty": {"word_length": [3, 5]}, "end_word": "SENSE", "source_dataset": "word_ladder", "source_index": 68, "start_word": "WRITE", "word_length": 5} |
Your job is to repeatedly transform a string according to a set of rules until no further transformations can be performed, or a state is repeated.
Evaluate the following rules in order, and apply the first applicable rule to the string:
1. If the string ends with 'ba', replace it with 'ab'.
2. If the string prefix is... | aabaccaccaacacbcbbaaacacbcbbaccbbabacbccaaacbccacccbcabacaccbabbcaaabcbbbccbcbcbccbbcbcbbbabcbbacab | string_manipulation | {"difficulty": {"num_rules": [3, 8], "string_length": [50, 100]}, "num_rules": 3, "selected_rules": ["If the string ends with 'ba', replace it with 'ab'.", "If the string prefix is 'cb', replace it with 'aa' and delete the last character.", "If the string ends with 'aa', replace it with 'cc'."], "solution": "aabaccacca... |
Keep all numbers smaller than -189.216 in this list: ['368.0287', '-228.2027', '455.1163', '-275.30', '-388.1280', '-346.8430', '287.5424', '-267.95', '-18.5464', '294.64', '458.375', '-422.737', '248.99', '499.389', '-457.7508', '-324.99', '-258.77', '-247.364', '-173.12', '-186.8243', '119.87', '223.3877', '-354.30',... | ['-228.2027', '-275.30', '-388.1280', '-346.8430', '-267.95', '-422.737', '-457.7508', '-324.99', '-258.77', '-247.364', '-354.30', '-350.2843', '-491.85', '-288.79', '-341.51', '-498.09', '-488.0796', '-206.0674', '-239.944', '-189.67', '-478.387', '-382.936', '-387.787', '-232.0608', '-426.05', '-493.9373', '-474.03'... | number_filtering | {"difficulty": {"decimals": [2, 4], "numbers": [50, 100], "value": [-500, 500]}, "filter_value": "-189.216", "numbers": 87, "operation": "keep_smaller", "original_numbers": ["368.0287", "-228.2027", "455.1163", "-275.30", "-388.1280", "-346.8430", "287.5424", "-267.95", "-18.5464", "294.64", "458.375", "-422.737", "248... |
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-12 number 23331 to base-10
| 47125 | base_conversion | {"decimal_value": 47125, "difficulty": {"base": [9, 18], "value": [10000, 100000]}, "source_base": 12, "source_dataset": "base_conversion", "source_index": 71, "source_repr": "23331", "target_base": 10, "target_repr": "47125"} |
This is a 'Game of Life' grid. We consider a game halted if there are no cells alive.
Will this game halt at or before 50 steps? Assume a Moore neighborhood and wrapping topology. If it will halt, reply 'True'. If it won't halt, reply 'False'.
Initial board:
[[0 0 0 ... 0 0 0]
[0 0 0 ... 0 0 0]
[0 0 0 ... 0 0 0]
..... | False | game_of_life_halting | {"difficulty": {"difficulty": 2, "grid_size_x": 50, "grid_size_y": 50, "max_simulation_steps": 50, "num_oscillators": 7}, "grid_size_x": 50, "grid_size_y": 50, "placed_patterns": [{"name": "mold", "position": [6, 27]}, {"name": "mold", "position": [7, 3]}, {"name": "mold", "position": [35, 36]}, {"name": "mold", "posit... |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 3