question stringlengths 53 2.32k | answer stringlengths 1 5.65k | metadata stringlengths 73 5.85k | dataset_source stringclasses 34
values |
|---|---|---|---|
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"... | [["adits", "ditas", "staid"], ["cytomere", "merocyte"], ["palinodist", "plastinoid"]] | {"source_dataset": "group_anagrams", "source_index": 0, "words": ["ditas", "adits", "staid", "plastinoid", "palinodist", "cytomere", "merocyte"], "solution": [["adits", "ditas", "staid"], ["cytomere", "merocyte"], ["palinodist", "plastinoid"]], "anagram_groups": 3, "difficulty": {"anagram_groups": [2, 10], "words_per_g... | group_anagrams |
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"... | [["decors", "escrod", "scored"], ["muriates", "semitaur"]] | {"source_dataset": "group_anagrams", "source_index": 1, "words": ["escrod", "decors", "scored", "semitaur", "muriates"], "solution": [["decors", "escrod", "scored"], ["muriates", "semitaur"]], "anagram_groups": 2, "difficulty": {"anagram_groups": [2, 10], "words_per_group": [2, 5]}} | group_anagrams |
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"... | [["arrester", "rearrest"], ["bf", "fb"], ["canun", "cunan"], ["diplomats", "tadpolism"], ["granitite", "iterating"], ["helium", "humlie"], ["nazim", "nizam"], ["slipstring", "striplings"]] | {"source_dataset": "group_anagrams", "source_index": 2, "words": ["granitite", "iterating", "helium", "humlie", "nizam", "nazim", "striplings", "slipstring", "rearrest", "arrester", "bf", "fb", "tadpolism", "diplomats", "cunan", "canun"], "solution": [["arrester", "rearrest"], ["bf", "fb"], ["canun", "cunan"], ["diplom... | group_anagrams |
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"... | [["anglican", "canaling"], ["cheero", "cohere"], ["converters", "reconverts"], ["dawny", "wandy"], ["eldern", "lender"], ["fp", "pf"]] | {"source_dataset": "group_anagrams", "source_index": 3, "words": ["eldern", "lender", "fp", "pf", "cohere", "cheero", "anglican", "canaling", "converters", "reconverts", "wandy", "dawny"], "solution": [["anglican", "canaling"], ["cheero", "cohere"], ["converters", "reconverts"], ["dawny", "wandy"], ["eldern", "lender"]... | group_anagrams |
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"... | [["ahmet", "mathe"], ["drapers", "sparred"], ["interplead", "peridental"]] | {"source_dataset": "group_anagrams", "source_index": 4, "words": ["drapers", "sparred", "ahmet", "mathe", "interplead", "peridental"], "solution": [["ahmet", "mathe"], ["drapers", "sparred"], ["interplead", "peridental"]], "anagram_groups": 3, "difficulty": {"anagram_groups": [2, 10], "words_per_group": [2, 5]}} | group_anagrams |
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"... | [["alumin", "alumni", "lumina", "unmail"], ["cheeped", "depeche"], ["deduces", "seduced"], ["endothecia", "theodicean"], ["esteems", "mestees"], ["holdership", "shipholder"], ["imperatives", "semiprivate"]] | {"source_dataset": "group_anagrams", "source_index": 5, "words": ["unmail", "lumina", "alumin", "alumni", "endothecia", "theodicean", "shipholder", "holdership", "mestees", "esteems", "semiprivate", "imperatives", "deduces", "seduced", "depeche", "cheeped"], "solution": [["alumin", "alumni", "lumina", "unmail"], ["chee... | group_anagrams |
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"... | [["atlantis", "natalist"], ["bonsela", "eslabon", "sonable"], ["contoid", "odontic"], ["cp", "pc"], ["gerundive", "ungrieved"], ["harateen", "theraean"], ["horseless", "shoreless"], ["nonenergic", "nongeneric"], ["noseless", "soleness"], ["premating", "tampering"]] | {"source_dataset": "group_anagrams", "source_index": 6, "words": ["cp", "pc", "natalist", "atlantis", "horseless", "shoreless", "nonenergic", "nongeneric", "harateen", "theraean", "contoid", "odontic", "tampering", "premating", "gerundive", "ungrieved", "eslabon", "bonsela", "sonable", "soleness", "noseless"], "solutio... | group_anagrams |
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"... | [["argentine", "tangerine"], ["dees", "seed"], ["eductions", "seduction"]] | {"source_dataset": "group_anagrams", "source_index": 7, "words": ["dees", "seed", "eductions", "seduction", "argentine", "tangerine"], "solution": [["argentine", "tangerine"], ["dees", "seed"], ["eductions", "seduction"]], "anagram_groups": 3, "difficulty": {"anagram_groups": [2, 10], "words_per_group": [2, 5]}} | group_anagrams |
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"... | [["celative", "velicate"], ["chorions", "isochron"], ["desex", "dexes", "sexed"], ["fester", "freest"], ["lilts", "still", "tills"], ["mortuarian", "muratorian"], ["petary", "pratey", "tapery", "tepary"], ["shouted", "southed"], ["thein", "thine"]] | {"source_dataset": "group_anagrams", "source_index": 8, "words": ["shouted", "southed", "chorions", "isochron", "desex", "dexes", "sexed", "lilts", "tills", "still", "thein", "thine", "velicate", "celative", "muratorian", "mortuarian", "fester", "freest", "tapery", "tepary", "pratey", "petary"], "solution": [["celative... | group_anagrams |
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"... | [["beagle", "glebae"], ["ceps", "psec", "spec"], ["genesis", "seeings"], ["histrionics", "trichinosis"], ["rubasses", "surbases"]] | {"source_dataset": "group_anagrams", "source_index": 9, "words": ["surbases", "rubasses", "seeings", "genesis", "trichinosis", "histrionics", "beagle", "glebae", "ceps", "psec", "spec"], "solution": [["beagle", "glebae"], ["ceps", "psec", "spec"], ["genesis", "seeings"], ["histrionics", "trichinosis"], ["rubasses", "su... | group_anagrams |
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"... | [["alypin", "pialyn", "plainy"], ["fondu", "found"], ["glistened", "legendist"], ["orycteropus", "prosecutory"], ["shyster", "thyrses"], ["subtruncated", "unsubtracted"]] | {"source_dataset": "group_anagrams", "source_index": 10, "words": ["pialyn", "alypin", "plainy", "unsubtracted", "subtruncated", "prosecutory", "orycteropus", "legendist", "glistened", "fondu", "found", "shyster", "thyrses"], "solution": [["alypin", "pialyn", "plainy"], ["fondu", "found"], ["glistened", "legendist"], [... | group_anagrams |
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"... | [["ethine", "theine"], ["fluorated", "outflared"], ["generated", "greatened"], ["noneffusiveness", "unoffensiveness"], ["oarman", "ramona", "romana"]] | {"source_dataset": "group_anagrams", "source_index": 11, "words": ["theine", "ethine", "generated", "greatened", "unoffensiveness", "noneffusiveness", "fluorated", "outflared", "ramona", "oarman", "romana"], "solution": [["ethine", "theine"], ["fluorated", "outflared"], ["generated", "greatened"], ["noneffusiveness", "... | group_anagrams |
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"... | [["conformer", "reconform"], ["entireties", "eternities"], ["fm", "mf"], ["hopis", "ophis"]] | {"source_dataset": "group_anagrams", "source_index": 12, "words": ["eternities", "entireties", "ophis", "hopis", "conformer", "reconform", "mf", "fm"], "solution": [["conformer", "reconform"], ["entireties", "eternities"], ["fm", "mf"], ["hopis", "ophis"]], "anagram_groups": 4, "difficulty": {"anagram_groups": [2, 10],... | group_anagrams |
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"... | [["balanites", "basaltine", "stainable"], ["bouffon", "buffoon"], ["pactional", "pactolian", "placation"]] | {"source_dataset": "group_anagrams", "source_index": 13, "words": ["bouffon", "buffoon", "balanites", "basaltine", "stainable", "pactolian", "placation", "pactional"], "solution": [["balanites", "basaltine", "stainable"], ["bouffon", "buffoon"], ["pactional", "pactolian", "placation"]], "anagram_groups": 3, "difficulty... | group_anagrams |
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"... | [["care", "crea"], ["carminette", "remittance"], ["constrainers", "contrariness"], ["elogy", "goyle"], ["feudalism", "sulfamide"], ["grips", "sprig"], ["hematolin", "maholtine"], ["lurries", "surlier"], ["nexus", "unsex"], ["petrolist", "portliest"]] | {"source_dataset": "group_anagrams", "source_index": 14, "words": ["care", "crea", "sulfamide", "feudalism", "lurries", "surlier", "sprig", "grips", "constrainers", "contrariness", "petrolist", "portliest", "hematolin", "maholtine", "elogy", "goyle", "nexus", "unsex", "carminette", "remittance"], "solution": [["care", ... | group_anagrams |
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"... | [["detruss", "dusters"], ["intertwin", "inwritten"]] | {"source_dataset": "group_anagrams", "source_index": 15, "words": ["detruss", "dusters", "inwritten", "intertwin"], "solution": [["detruss", "dusters"], ["intertwin", "inwritten"]], "anagram_groups": 2, "difficulty": {"anagram_groups": [2, 10], "words_per_group": [2, 5]}} | group_anagrams |
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"... | [["aik", "kai"], ["bridelace", "calibered"], ["bughouse", "housebug"], ["listwork", "slitwork"], ["owners", "resown", "rowens", "worsen"]] | {"source_dataset": "group_anagrams", "source_index": 16, "words": ["housebug", "bughouse", "rowens", "resown", "worsen", "owners", "listwork", "slitwork", "bridelace", "calibered", "kai", "aik"], "solution": [["aik", "kai"], ["bridelace", "calibered"], ["bughouse", "housebug"], ["listwork", "slitwork"], ["owners", "res... | group_anagrams |
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"... | [["adeline", "aliened", "delaine"], ["anisopod", "isopodan"], ["aubretias", "aubrietas"], ["everglade", "leveraged"], ["loxotic", "toxicol"]] | {"source_dataset": "group_anagrams", "source_index": 17, "words": ["anisopod", "isopodan", "toxicol", "loxotic", "everglade", "leveraged", "adeline", "delaine", "aliened", "aubrietas", "aubretias"], "solution": [["adeline", "aliened", "delaine"], ["anisopod", "isopodan"], ["aubretias", "aubrietas"], ["everglade", "leve... | group_anagrams |
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"... | [["barad", "draba"], ["carers", "racers", "screar"], ["chordal", "dorlach"], ["clupeoids", "discouple"], ["infarction", "infraction"], ["radiators", "sartoriad"]] | {"source_dataset": "group_anagrams", "source_index": 18, "words": ["discouple", "clupeoids", "infarction", "infraction", "draba", "barad", "chordal", "dorlach", "racers", "screar", "carers", "radiators", "sartoriad"], "solution": [["barad", "draba"], ["carers", "racers", "screar"], ["chordal", "dorlach"], ["clupeoids",... | group_anagrams |
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"... | [["brontides", "stonebird"], ["calkers", "lackers", "slacker"], ["comfits", "scomfit"], ["criey", "ricey"], ["crimpage", "pergamic"], ["horotelic", "ochrolite"], ["purin", "unrip"], ["rarely", "rearly"], ["unhearsed", "unsheared"]] | {"source_dataset": "group_anagrams", "source_index": 19, "words": ["brontides", "stonebird", "horotelic", "ochrolite", "lackers", "calkers", "slacker", "rarely", "rearly", "unhearsed", "unsheared", "criey", "ricey", "scomfit", "comfits", "pergamic", "crimpage", "unrip", "purin"], "solution": [["brontides", "stonebird"]... | group_anagrams |
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 | {"source_dataset": "isomorphic_strings", "source_index": 0, "words": ["ui", "yz"], "solution": true, "solvable": true, "string_length": 3, "difficulty": {"string_length": [2, 10]}} | isomorphic_strings |
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 | {"source_dataset": "isomorphic_strings", "source_index": 1, "words": ["r", "z"], "solution": true, "solvable": true, "string_length": 2, "difficulty": {"string_length": [2, 10]}} | isomorphic_strings |
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 | {"source_dataset": "isomorphic_strings", "source_index": 2, "words": ["ehijhgjg", "gdtxirxr"], "solution": false, "solvable": false, "string_length": 8, "difficulty": {"string_length": [2, 10]}} | isomorphic_strings |
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 | {"source_dataset": "isomorphic_strings", "source_index": 3, "words": ["ufjxg", "omgjd"], "solution": true, "solvable": true, "string_length": 6, "difficulty": {"string_length": [2, 10]}} | isomorphic_strings |
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 | {"source_dataset": "isomorphic_strings", "source_index": 4, "words": ["di", "vw"], "solution": true, "solvable": true, "string_length": 3, "difficulty": {"string_length": [2, 10]}} | isomorphic_strings |
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 | {"source_dataset": "isomorphic_strings", "source_index": 5, "words": ["mdubps", "btvdqk"], "solution": true, "solvable": true, "string_length": 7, "difficulty": {"string_length": [2, 10]}} | isomorphic_strings |
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 | {"source_dataset": "isomorphic_strings", "source_index": 6, "words": ["mmfcrhsxc", "rrfadzgba"], "solution": true, "solvable": true, "string_length": 10, "difficulty": {"string_length": [2, 10]}} | isomorphic_strings |
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 | {"source_dataset": "isomorphic_strings", "source_index": 7, "words": ["gr", "tv"], "solution": true, "solvable": true, "string_length": 3, "difficulty": {"string_length": [2, 10]}} | isomorphic_strings |
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 | {"source_dataset": "isomorphic_strings", "source_index": 8, "words": ["nixolzvoz", "lntvygwvs"], "solution": false, "solvable": false, "string_length": 9, "difficulty": {"string_length": [2, 10]}} | isomorphic_strings |
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 | {"source_dataset": "isomorphic_strings", "source_index": 9, "words": ["mimuu", "hxhbp"], "solution": false, "solvable": false, "string_length": 5, "difficulty": {"string_length": [2, 10]}} | isomorphic_strings |
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 | {"source_dataset": "isomorphic_strings", "source_index": 10, "words": ["wxazs", "fmqsk"], "solution": true, "solvable": true, "string_length": 6, "difficulty": {"string_length": [2, 10]}} | isomorphic_strings |
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 | {"source_dataset": "isomorphic_strings", "source_index": 11, "words": ["eetw", "ppmf"], "solution": true, "solvable": true, "string_length": 5, "difficulty": {"string_length": [2, 10]}} | isomorphic_strings |
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 | {"source_dataset": "isomorphic_strings", "source_index": 12, "words": ["fxi", "puf"], "solution": true, "solvable": true, "string_length": 4, "difficulty": {"string_length": [2, 10]}} | isomorphic_strings |
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 | {"source_dataset": "isomorphic_strings", "source_index": 13, "words": ["ccw", "azt"], "solution": false, "solvable": false, "string_length": 3, "difficulty": {"string_length": [2, 10]}} | isomorphic_strings |
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 | {"source_dataset": "isomorphic_strings", "source_index": 14, "words": ["kfmegpldj", "fidyuonlr"], "solution": true, "solvable": true, "string_length": 10, "difficulty": {"string_length": [2, 10]}} | isomorphic_strings |
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 | {"source_dataset": "isomorphic_strings", "source_index": 15, "words": ["p", "j"], "solution": true, "solvable": true, "string_length": 2, "difficulty": {"string_length": [2, 10]}} | isomorphic_strings |
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 | {"source_dataset": "isomorphic_strings", "source_index": 16, "words": ["kqyn", "sybm"], "solution": true, "solvable": true, "string_length": 5, "difficulty": {"string_length": [2, 10]}} | isomorphic_strings |
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 | {"source_dataset": "isomorphic_strings", "source_index": 17, "words": ["kjfj", "bzaz"], "solution": true, "solvable": true, "string_length": 5, "difficulty": {"string_length": [2, 10]}} | isomorphic_strings |
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 | {"source_dataset": "isomorphic_strings", "source_index": 18, "words": ["ziyqv", "xfmos"], "solution": true, "solvable": true, "string_length": 6, "difficulty": {"string_length": [2, 10]}} | isomorphic_strings |
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 | {"source_dataset": "isomorphic_strings", "source_index": 19, "words": ["cllsjnoy", "iccnfubt"], "solution": true, "solvable": true, "string_length": 9, "difficulty": {"string_length": [2, 10]}} | isomorphic_strings |
You are a police officer. A maniac has planted a bomb next to a public fountain.
To defuse the bomb, you must solve a puzzle. The puzzle is solved when you fill any of the available jugs with the target amount of water.
You have three move types: 'fill', 'empty' and 'pour'.
To fill Jug A, you 'fill A'.
To empty Jug ... | ["fill A", "pour A->C", "fill B", "empty C", "pour A->C", "empty C", "pour A->C", "empty C", "pour A->C", "pour B->C"] | {"source_dataset": "jugs", "source_index": 0, "puzzle": {"jug_capacities": [13, 13, 4], "target": 10, "min_moves": 10}, "difficulty": {"num_jugs": 3, "difficulty": 10}} | jugs |
You are a police officer. A maniac has planted a bomb next to a public fountain.
To defuse the bomb, you must solve a puzzle. The puzzle is solved when you fill any of the available jugs with the target amount of water.
You have three move types: 'fill', 'empty' and 'pour'.
To fill Jug A, you 'fill A'.
To empty Jug ... | ["fill A", "pour A->B", "fill A", "pour A->B", "pour A->C", "fill A", "pour A->C", "empty B", "pour A->B", "fill A", "pour A->B", "fill A", "pour A->B"] | {"source_dataset": "jugs", "source_index": 1, "puzzle": {"jug_capacities": [7, 10, 10], "target": 5, "min_moves": 13}, "difficulty": {"num_jugs": 3, "difficulty": 10}} | jugs |
You are a police officer. A maniac has planted a bomb next to a public fountain.
To defuse the bomb, you must solve a puzzle. The puzzle is solved when you fill any of the available jugs with the target amount of water.
You have three move types: 'fill', 'empty' and 'pour'.
To fill Jug A, you 'fill A'.
To empty Jug ... | ["fill B", "pour B->A", "empty A", "pour B->A", "fill B", "pour B->A", "empty A", "pour B->A", "fill B", "pour B->A", "pour B->C"] | {"source_dataset": "jugs", "source_index": 2, "puzzle": {"jug_capacities": [7, 10, 7], "target": 2, "min_moves": 11}, "difficulty": {"num_jugs": 3, "difficulty": 10}} | jugs |
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", "fill A", "pour A->B", "empty B", "pour A->B", "fill A", "pour A->B", "empty B", "pour A->B", "fill A", "pour A->B", "empty B", "pour A->B", "fill A", "pour A->B"] | {"source_dataset": "jugs", "source_index": 3, "puzzle": {"jug_capacities": [13, 11, 13], "target": 12, "min_moves": 22}, "difficulty": {"num_jugs": 3, "difficulty": 10}} | jugs |
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"] | {"source_dataset": "jugs", "source_index": 4, "puzzle": {"jug_capacities": [6, 7, 7], "target": 3, "min_moves": 10}, "difficulty": {"num_jugs": 3, "difficulty": 10}} | jugs |
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", "fill A", "pour A->B", "empty B", "pour A->B", "fill A", "pour A->B", "empty B", "pour A->B", "fill A", "pour A->B"] | {"source_dataset": "jugs", "source_index": 5, "puzzle": {"jug_capacities": [11, 9, 9], "target": 10, "min_moves": 17}, "difficulty": {"num_jugs": 3, "difficulty": 10}} | jugs |
You are a police officer. A maniac has planted a bomb next to a public fountain.
To defuse the bomb, you must solve a puzzle. The puzzle is solved when you fill any of the available jugs with the target amount of water.
You have three move types: 'fill', 'empty' and 'pour'.
To fill Jug A, you 'fill A'.
To empty Jug ... | ["fill B", "pour B->A", "fill B", "pour B->A", "empty A", "pour B->A", "fill B", "pour B->A", "fill B", "pour B->A"] | {"source_dataset": "jugs", "source_index": 6, "puzzle": {"jug_capacities": [9, 5, 5], "target": 2, "min_moves": 10}, "difficulty": {"num_jugs": 3, "difficulty": 10}} | jugs |
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", "empty A", "pour B->A"] | {"source_dataset": "jugs", "source_index": 7, "puzzle": {"jug_capacities": [8, 11, 11], "target": 1, "min_moves": 12}, "difficulty": {"num_jugs": 3, "difficulty": 10}} | jugs |
You are a police officer. A maniac has planted a bomb next to a public fountain.
To defuse the bomb, you must solve a puzzle. The puzzle is solved when you fill any of the available jugs with the target amount of water.
You have three move types: 'fill', 'empty' and 'pour'.
To fill Jug A, you 'fill A'.
To empty Jug ... | ["fill A", "pour A->C", "empty C", "pour A->C", "empty C", "pour A->C", "fill A", "pour A->C", "empty C", "pour A->C"] | {"source_dataset": "jugs", "source_index": 8, "puzzle": {"jug_capacities": [9, 13, 4], "target": 2, "min_moves": 10}, "difficulty": {"num_jugs": 3, "difficulty": 10}} | jugs |
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", "empty A", "pour B->A", "fill B", "pour B->A", "empty A", "pour B->A"] | {"source_dataset": "jugs", "source_index": 9, "puzzle": {"jug_capacities": [6, 11, 11], "target": 3, "min_moves": 14}, "difficulty": {"num_jugs": 3, "difficulty": 10}} | jugs |
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", "empty A", "pour B->A", "fill B", "pour B->A", "empty A", "pour B->A", "fill B", "pour B->A", "pour B->C", "fill B", "pour B->C"] | {"source_dataset": "jugs", "source_index": 10, "puzzle": {"jug_capacities": [11, 13, 11], "target": 12, "min_moves": 21}, "difficulty": {"num_jugs": 3, "difficulty": 10}} | jugs |
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", "empty A", "pour B->A", "fill B", "pour B->A", "empty A", "pour B->A"] | {"source_dataset": "jugs", "source_index": 11, "puzzle": {"jug_capacities": [4, 9, 9], "target": 2, "min_moves": 10}, "difficulty": {"num_jugs": 3, "difficulty": 10}} | jugs |
You are a police officer. A maniac has planted a bomb next to a public fountain.
To defuse the bomb, you must solve a puzzle. The puzzle is solved when you fill any of the available jugs with the target amount of water.
You have three move types: 'fill', 'empty' and 'pour'.
To fill Jug A, you 'fill A'.
To empty Jug ... | ["fill A", "pour A->C", "fill B", "empty C", "pour A->C", "fill A", "pour A->C", "empty C", "pour A->C", "fill A", "pour A->C", "empty C", "pour A->C", "pour B->C"] | {"source_dataset": "jugs", "source_index": 12, "puzzle": {"jug_capacities": [10, 10, 9], "target": 4, "min_moves": 14}, "difficulty": {"num_jugs": 3, "difficulty": 10}} | jugs |
You are a police officer. A maniac has planted a bomb next to a public fountain.
To defuse the bomb, you must solve a puzzle. The puzzle is solved when you fill any of the available jugs with the target amount of water.
You have three move types: 'fill', 'empty' and 'pour'.
To fill Jug A, you 'fill A'.
To empty Jug ... | ["fill B", "pour B->A", "fill B", "pour B->A", "fill B", "pour B->A", "fill B", "pour B->A", "fill B", "pour B->A", "pour B->C", "pour A->B", "pour B->C"] | {"source_dataset": "jugs", "source_index": 13, "puzzle": {"jug_capacities": [13, 3, 13], "target": 5, "min_moves": 13}, "difficulty": {"num_jugs": 3, "difficulty": 10}} | jugs |
You are a police officer. A maniac has planted a bomb next to a public fountain.
To defuse the bomb, you must solve a puzzle. The puzzle is solved when you fill any of the available jugs with the target amount of water.
You have three move types: 'fill', 'empty' and 'pour'.
To fill Jug A, you 'fill A'.
To empty Jug ... | ["fill A", "pour A->B", "fill A", "pour A->B", "fill A", "pour A->B", "fill A", "pour A->B", "fill A", "pour A->C", "pour B->C"] | {"source_dataset": "jugs", "source_index": 14, "puzzle": {"jug_capacities": [3, 13, 10], "target": 5, "min_moves": 11}, "difficulty": {"num_jugs": 3, "difficulty": 10}} | jugs |
You are a police officer. A maniac has planted a bomb next to a public fountain.
To defuse the bomb, you must solve a puzzle. The puzzle is solved when you fill any of the available jugs with the target amount of water.
You have three move types: 'fill', 'empty' and 'pour'.
To fill Jug A, you 'fill A'.
To empty Jug ... | ["fill B", "pour B->A", "fill B", "pour B->A", "empty A", "pour B->A", "fill B", "pour B->A", "empty A", "pour B->A", "fill B", "pour B->A", "pour B->C", "pour A->B", "pour B->C"] | {"source_dataset": "jugs", "source_index": 15, "puzzle": {"jug_capacities": [13, 12, 13], "target": 8, "min_moves": 15}, "difficulty": {"num_jugs": 3, "difficulty": 10}} | jugs |
You are a police officer. A maniac has planted a bomb next to a public fountain.
To defuse the bomb, you must solve a puzzle. The puzzle is solved when you fill any of the available jugs with the target amount of water.
You have three move types: 'fill', 'empty' and 'pour'.
To fill Jug A, you 'fill A'.
To empty Jug ... | ["fill B", "pour B->A", "fill B", "pour B->A", "empty A", "pour B->A", "fill B", "pour B->A", "pour B->C", "pour A->B", "pour B->C", "fill B", "pour B->C"] | {"source_dataset": "jugs", "source_index": 16, "puzzle": {"jug_capacities": [13, 9, 13], "target": 6, "min_moves": 13}, "difficulty": {"num_jugs": 3, "difficulty": 10}} | jugs |
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", "fill A", "pour A->B"] | {"source_dataset": "jugs", "source_index": 17, "puzzle": {"jug_capacities": [7, 5, 12], "target": 6, "min_moves": 10}, "difficulty": {"num_jugs": 3, "difficulty": 10}} | jugs |
You are a police officer. A maniac has planted a bomb next to a public fountain.
To defuse the bomb, you must solve a puzzle. The puzzle is solved when you fill any of the available jugs with the target amount of water.
You have three move types: 'fill', 'empty' and 'pour'.
To fill Jug A, you 'fill A'.
To empty Jug ... | ["fill A", "pour A->C", "fill B", "empty C", "pour A->C", "empty C", "pour A->C", "fill A", "pour A->C", "empty C", "pour A->C", "empty C", "pour A->C", "empty C", "pour A->C", "pour B->C"] | {"source_dataset": "jugs", "source_index": 18, "puzzle": {"jug_capacities": [13, 13, 5], "target": 9, "min_moves": 16}, "difficulty": {"num_jugs": 3, "difficulty": 10}} | jugs |
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", "empty A", "pour B->A", "fill B", "pour B->A", "empty A", "pour B->A", "pour B->C", "fill B", "pour B->C"] | {"source_dataset": "jugs", "source_index": 19, "puzzle": {"jug_capacities": [5, 11, 5], "target": 8, "min_moves": 13}, "difficulty": {"num_jugs": 3, "difficulty": 10}} | jugs |
How many times does the letter "a" appear in the text: "bed and enters his mechanical dresser Two minutes later the machine deposited him all dressed"? | 6 | {"source_dataset": "letter_counting", "source_index": 0, "span_length": 15, "target_letter": "a", "span": ["bed", "and", "enters", "his", "mechanical", "dresser", "Two", "minutes", "later", "the", "machine", "deposited", "him", "all", "dressed"], "difficulty": {"words": [5, 15]}} | letter_counting |
How many times does the letter "w" appear in the text: "it into a watering place"? | 1 | {"source_dataset": "letter_counting", "source_index": 1, "span_length": 5, "target_letter": "w", "span": ["it", "into", "a", "watering", "place"], "difficulty": {"words": [5, 15]}} | letter_counting |
How many times does the letter "t" appear in the text: "readable form accessible by the widest array of equipment including outdated"? | 5 | {"source_dataset": "letter_counting", "source_index": 2, "span_length": 11, "target_letter": "t", "span": ["readable", "form", "accessible", "by", "the", "widest", "array", "of", "equipment", "including", "outdated"], "difficulty": {"words": [5, 15]}} | letter_counting |
How many times does the letter "n" appear in the text: "does not contain a notice indicating that it is"? | 6 | {"source_dataset": "letter_counting", "source_index": 3, "span_length": 9, "target_letter": "n", "span": ["does", "not", "contain", "a", "notice", "indicating", "that", "it", "is"], "difficulty": {"words": [5, 15]}} | letter_counting |
How many times does the letter "a" appear in the text: "keeping this work in the same"? | 1 | {"source_dataset": "letter_counting", "source_index": 4, "span_length": 6, "target_letter": "a", "span": ["keeping", "this", "work", "in", "the", "same"], "difficulty": {"words": [5, 15]}} | letter_counting |
How many times does the letter "r" appear in the text: "years ago its subscription list contained but a few hundred"? | 3 | {"source_dataset": "letter_counting", "source_index": 5, "span_length": 10, "target_letter": "r", "span": ["years", "ago", "its", "subscription", "list", "contained", "but", "a", "few", "hundred"], "difficulty": {"words": [5, 15]}} | letter_counting |
How many times does the letter "e" appear in the text: "me As in the morning the table rose out of the floor Again"? | 6 | {"source_dataset": "letter_counting", "source_index": 6, "span_length": 13, "target_letter": "e", "span": ["me", "As", "in", "the", "morning", "the", "table", "rose", "out", "of", "the", "floor", "Again"], "difficulty": {"words": [5, 15]}} | letter_counting |
How many times does the letter "t" appear in the text: "said Faithburn was dead quite certainly"? | 3 | {"source_dataset": "letter_counting", "source_index": 7, "span_length": 6, "target_letter": "t", "span": ["said", "Faithburn", "was", "dead", "quite", "certainly"], "difficulty": {"words": [5, 15]}} | letter_counting |
How many times does the letter "n" appear in the text: "these eight had only impracticable schemes to propose In fact one of"? | 3 | {"source_dataset": "letter_counting", "source_index": 8, "span_length": 12, "target_letter": "n", "span": ["these", "eight", "had", "only", "impracticable", "schemes", "to", "propose", "In", "fact", "one", "of"], "difficulty": {"words": [5, 15]}} | letter_counting |
How many times does the letter "g" appear in the text: "computers including obsolete old middle aged and new"? | 2 | {"source_dataset": "letter_counting", "source_index": 9, "span_length": 8, "target_letter": "g", "span": ["computers", "including", "obsolete", "old", "middle", "aged", "and", "new"], "difficulty": {"words": [5, 15]}} | letter_counting |
How many times does the letter "y" appear in the text: "to life to day what would he think were"? | 1 | {"source_dataset": "letter_counting", "source_index": 10, "span_length": 9, "target_letter": "y", "span": ["to", "life", "to", "day", "what", "would", "he", "think", "were"], "difficulty": {"words": [5, 15]}} | letter_counting |
How many times does the letter "s" appear in the text: "Though by a just turn about of things here below Great Britain has become"? | 3 | {"source_dataset": "letter_counting", "source_index": 11, "span_length": 14, "target_letter": "s", "span": ["Though", "by", "a", "just", "turn", "about", "of", "things", "here", "below", "Great", "Britain", "has", "become"], "difficulty": {"words": [5, 15]}} | letter_counting |
How many times does the letter "o" appear in the text: "obtaining a copy upon request of the"? | 4 | {"source_dataset": "letter_counting", "source_index": 12, "span_length": 7, "target_letter": "o", "span": ["obtaining", "a", "copy", "upon", "request", "of", "the"], "difficulty": {"words": [5, 15]}} | letter_counting |
How many times does the letter "g" appear in the text: "Madrid but also against the kingdom"? | 2 | {"source_dataset": "letter_counting", "source_index": 13, "span_length": 6, "target_letter": "g", "span": ["Madrid", "but", "also", "against", "the", "kingdom"], "difficulty": {"words": [5, 15]}} | letter_counting |
How many times does the letter "u" appear in the text: "the work of Jules son Michel Verne In any event many of the"? | 1 | {"source_dataset": "letter_counting", "source_index": 14, "span_length": 13, "target_letter": "u", "span": ["the", "work", "of", "Jules", "son", "Michel", "Verne", "In", "any", "event", "many", "of", "the"], "difficulty": {"words": [5, 15]}} | letter_counting |
How many times does the letter "r" appear in the text: "trademark license is very easy"? | 3 | {"source_dataset": "letter_counting", "source_index": 15, "span_length": 5, "target_letter": "r", "span": ["trademark", "license", "is", "very", "easy"], "difficulty": {"words": [5, 15]}} | letter_counting |
How many times does the letter "h" appear in the text: "France means to be the trusty defender Well said exclaimed Mr Smith How is"? | 3 | {"source_dataset": "letter_counting", "source_index": 16, "span_length": 14, "target_letter": "h", "span": ["France", "means", "to", "be", "the", "trusty", "defender", "Well", "said", "exclaimed", "Mr", "Smith", "How", "is"], "difficulty": {"words": [5, 15]}} | letter_counting |
How many times does the letter "t" appear in the text: "him thanks to the progress of hygiene which"? | 3 | {"source_dataset": "letter_counting", "source_index": 17, "span_length": 8, "target_letter": "t", "span": ["him", "thanks", "to", "the", "progress", "of", "hygiene", "which"], "difficulty": {"words": [5, 15]}} | letter_counting |
How many times does the letter "n" appear in the text: "idea of removing an entire city all at once"? | 4 | {"source_dataset": "letter_counting", "source_index": 18, "span_length": 9, "target_letter": "n", "span": ["idea", "of", "removing", "an", "entire", "city", "all", "at", "once"], "difficulty": {"words": [5, 15]}} | letter_counting |
How many times does the letter "u" appear in the text: "simply pointed to the sky which was of a pure blue Yes"? | 2 | {"source_dataset": "letter_counting", "source_index": 19, "span_length": 12, "target_letter": "u", "span": ["simply", "pointed", "to", "the", "sky", "which", "was", "of", "a", "pure", "blue", "Yes"], "difficulty": {"words": [5, 15]}} | letter_counting |
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... | we shall be able to produce | {"source_dataset": "letter_jumble", "source_index": 0, "num_words": 6, "corruption_level": 0.12000860417813355, "scrambled_words": ["ew", "hsall", "eb", "ebla", "ot", "puodrce"], "original_words": ["we", "shall", "be", "able", "to", "produce"], "difficulty": {"word_len": [1, 64], "words": [3, 20], "corruption_level": [... | letter_jumble |
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... | in journalism Well Cash | {"source_dataset": "letter_jumble", "source_index": 1, "num_words": 4, "corruption_level": 0.3288673442377109, "scrambled_words": ["ni", "oiurnalmsj", "Well", "Cahs"], "original_words": ["in", "journalism", "Well", "Cash"], "difficulty": {"word_len": [1, 64], "words": [3, 20], "corruption_level": [0.1, 0.9]}} | letter_jumble |
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... | dear Archibald keep on Since yesterday thanks to you there is a gain of subscribers Mr | {"source_dataset": "letter_jumble", "source_index": 2, "num_words": 16, "corruption_level": 0.516016391169858, "scrambled_words": ["dear", "rchAdbali", "keep", "no", "nSice", "yrstyedae", "atnhks", "ot", "oyu", "rheet", "si", "a", "gain", "fo", "sucrbbisesr", "rM"], "original_words": ["dear", "Archibald", "keep", "on",... | letter_jumble |
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... | understands how a man situated as Smith is must be beset | {"source_dataset": "letter_jumble", "source_index": 3, "num_words": 11, "corruption_level": 0.4341529517652285, "scrambled_words": ["asdenutrnds", "ohw", "a", "amn", "stduetai", "sa", "mSiht", "si", "msut", "eb", "tesbe"], "original_words": ["understands", "how", "a", "man", "situated", "as", "Smith", "is", "must", "be... | letter_jumble |
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... | in the morning a table | {"source_dataset": "letter_jumble", "source_index": 4, "num_words": 5, "corruption_level": 0.41999551677681035, "scrambled_words": ["ni", "eht", "nognimr", "a", "atelb"], "original_words": ["in", "the", "morning", "a", "table"], "difficulty": {"word_len": [1, 64], "words": [3, 20], "corruption_level": [0.1, 0.9]}} | letter_jumble |
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... | electronic work or group of works on different terms than are set forth in | {"source_dataset": "letter_jumble", "source_index": 5, "num_words": 14, "corruption_level": 0.15002014297357943, "scrambled_words": ["electconir", "wokr", "ro", "proug", "fo", "sorkw", "no", "tifferend", "temrs", "htan", "aer", "est", "rofth", "ni"], "original_words": ["electronic", "work", "or", "group", "of", "works"... | letter_jumble |
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... | an extension chair Then touching a knob he established communication with the Central Concert Hall whence our greatest send out | {"source_dataset": "letter_jumble", "source_index": 6, "num_words": 20, "corruption_level": 0.3523628898375718, "scrambled_words": ["na", "eontnsixe", "craih", "nheT", "nouchigt", "a", "kbon", "eh", "hbtalsiseed", "tomumnicacion", "whti", "teh", "Clnrtae", "Concert", "Hall", "nhcwee", "ruo", "grtaeest", "sned", "tuo"],... | letter_jumble |
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... | of journalistic work was now | {"source_dataset": "letter_jumble", "source_index": 7, "num_words": 5, "corruption_level": 0.37546391137387036, "scrambled_words": ["fo", "noircalustji", "wrok", "wsa", "onw"], "original_words": ["of", "journalistic", "work", "was", "now"], "difficulty": {"word_len": [1, 64], "words": [3, 20], "corruption_level": [0.1,... | letter_jumble |
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... | may use this eBook for nearly any purpose such as creation of derivative works reports performances and research | {"source_dataset": "letter_jumble", "source_index": 8, "num_words": 18, "corruption_level": 0.7845563069949968, "scrambled_words": ["yma", "seu", "hist", "koeoB", "orf", "elyanr", "any", "ppuoers", "chus", "sa", "oitrcean", "fo", "evrtaiidve", "roswk", "retsorp", "psmoenrracfe", "dan", "erchrase"], "original_words": ["... | letter_jumble |
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... | think then remarked Mr Smith musingly that if one could | {"source_dataset": "letter_jumble", "source_index": 9, "num_words": 10, "corruption_level": 0.7707922786605893, "scrambled_words": ["tkhin", "thne", "reeakdrm", "rM", "hSimt", "lsuyngim", "that", "fi", "one", "docul"], "original_words": ["think", "then", "remarked", "Mr", "Smith", "musingly", "that", "if", "one", "coul... | letter_jumble |
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... | regulating charities and charitable donations in all states of the United | {"source_dataset": "letter_jumble", "source_index": 10, "num_words": 11, "corruption_level": 0.14361812400836593, "scrambled_words": ["regulitang", "iharitces", "dna", "charitable", "donatnois", "ni", "all", "ttases", "fo", "eht", "Utined"], "original_words": ["regulating", "charities", "and", "charitable", "donations"... | letter_jumble |
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... | forth in this agreement violates the law of the | {"source_dataset": "letter_jumble", "source_index": 11, "num_words": 9, "corruption_level": 0.4651897758368476, "scrambled_words": ["tohfr", "ni", "thsi", "mganreeet", "volitaes", "teh", "lwa", "fo", "hte"], "original_words": ["forth", "in", "this", "agreement", "violates", "the", "law", "of", "the"], "difficulty": {"w... | letter_jumble |
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... | Faithburn was coffined and laid in a | {"source_dataset": "letter_jumble", "source_index": 12, "num_words": 7, "corruption_level": 0.45115014050048674, "scrambled_words": ["Faithnubr", "saw", "fdfconei", "adn", "ldia", "ni", "a"], "original_words": ["Faithburn", "was", "coffined", "and", "laid", "in", "a"], "difficulty": {"word_len": [1, 64], "words": [3, 2... | letter_jumble |
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... | extensive in the world stretching | {"source_dataset": "letter_jumble", "source_index": 13, "num_words": 5, "corruption_level": 0.8903065618910405, "scrambled_words": ["etxenivse", "ni", "eth", "wdrol", "cegishtrnt"], "original_words": ["extensive", "in", "the", "world", "stretching"], "difficulty": {"word_len": [1, 64], "words": [3, 20], "corruption_lev... | letter_jumble |
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... | org donate Section General Information About Project Gutenberg electronic works Professor Michael S Hart was the originator of the Project | {"source_dataset": "letter_jumble", "source_index": 14, "num_words": 20, "corruption_level": 0.10919710084004333, "scrambled_words": ["ogr", "denato", "ceStion", "reneGal", "Infomration", "Atoub", "erojPct", "eutGnberg", "electronci", "wkros", "orPfessor", "Mhciael", "S", "aHrt", "saw", "eht", "ortginaior", "fo", "eht"... | letter_jumble |
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... | would but picture to | {"source_dataset": "letter_jumble", "source_index": 15, "num_words": 4, "corruption_level": 0.39420177095941566, "scrambled_words": ["wuold", "btu", "piceutr", "ot"], "original_words": ["would", "but", "picture", "to"], "difficulty": {"word_len": [1, 64], "words": [3, 20], "corruption_level": [0.1, 0.9]}} | letter_jumble |
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... | cholera the yellow fever that the belligerents might spread | {"source_dataset": "letter_jumble", "source_index": 16, "num_words": 9, "corruption_level": 0.26457919918486406, "scrambled_words": ["hcolera", "teh", "yewlol", "feevr", "ttah", "eht", "rllbigeeents", "migth", "spdear"], "original_words": ["cholera", "the", "yellow", "fever", "that", "the", "belligerents", "might", "sp... | letter_jumble |
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... | Defects such as but not limited to incomplete inaccurate or | {"source_dataset": "letter_jumble", "source_index": 17, "num_words": 10, "corruption_level": 0.16768744547748737, "scrambled_words": ["eDfects", "suhc", "sa", "btu", "nto", "ldmitei", "ot", "itcomplene", "iuaccnrate", "ro"], "original_words": ["Defects", "such", "as", "but", "not", "limited", "to", "incomplete", "inacc... | letter_jumble |
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... | broke in Mr Smith turning to a second scientist Optical science defective | {"source_dataset": "letter_jumble", "source_index": 18, "num_words": 12, "corruption_level": 0.3267366860983245, "scrambled_words": ["borke", "ni", "rM", "mSith", "ntruing", "ot", "a", "sdcone", "ncseitist", "tpOilac", "cniesce", "defcetive"], "original_words": ["broke", "in", "Mr", "Smith", "turning", "to", "a", "seco... | letter_jumble |
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... | that I would do anything so unpatriotic We at home think that your people must now be sated | {"source_dataset": "letter_jumble", "source_index": 19, "num_words": 18, "corruption_level": 0.24536415074283913, "scrambled_words": ["taht", "I", "uowld", "od", "inythang", "os", "pnratuiotic", "eW", "ta", "eomh", "tnihk", "taht", "yuor", "pelpoe", "muts", "won", "eb", "setad"], "original_words": ["that", "I", "would"... | letter_jumble |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.