question stringlengths 398 460 | answer stringclasses 2
values | metadata dict | difficulty int64 2 5 |
|---|---|---|---|
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 90,
"string_length": 37,
"words": [
"ppujsxvzontogvnbktblarfruebfwdcxfvgg",
"mmovqaujypnyhupksnkibezeockzfwlazuhh"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 91,
"string_length": 38,
"words": [
"ytyktdpuuvomrfjywzrgtiryerraqzeioqqno",
"ibinbdlqqswovjzimgvybcviuvvetgucwttfw"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 92,
"string_length": 38,
"words": [
"dddwsjiicctxiuburwhdonheldantuduayrocc",
"zzzenwdfvvdsfbtbceizulipazhldbzbhqcuvv"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 93,
"string_length": 36,
"words": [
"gqnxsfwlugeepusfeauedlhrjcnbginqwmbu",
"rjokntequrvvwunyvauvpqzlygoxrsojeixu"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 94,
"string_length": 40,
"words": [
"pqvnzqpzpntvvtbtlqnjrkdpzhavemhjdwgrnkb",
"fbgedbfdfeyggylyabeqvsifdzwgckzqinuvesl"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 95,
"string_length": 32,
"words": [
"ycloyoafaaysshqzbqobyynnoyrlnai",
"xwsvxvutuuxbbzmhomvoxxqqvxisquy"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 96,
"string_length": 34,
"words": [
"nvezxyrkffyscfethwoanoasgpjshaqpi",
"qzpexjhrggjcagptyobkqbkcmiscykliu"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 97,
"string_length": 31,
"words": [
"tthdsyljtbchqdyaazykriesskxjkpg",
"zzqvurdczmtqyurssprobhnuuolcofa"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 98,
"string_length": 32,
"words": [
"sdhcanwuzthmupkoqnxkfzhodbhkhbb",
"zybsrtaiwgbeihvfqtpvlwbfykbvbkk"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 99,
"string_length": 39,
"words": [
"gqgnswshmelkzlgcdeqkqeqemzabjhtqkwgzxiu",
"bmbtqcqkenildibvznmlmnmnedygskpmlcbujaf"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 100,
"string_length": 40,
"words": [
"wzulpuzgvkqiarrqjwbgienbxbbcouhnlsdazyyp",
"twaroawnbpgceiigutmqckqmhmmvyalqrszewddo"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 101,
"string_length": 33,
"words": [
"pccrmffjgmitowblzuctykvneajjvgjle",
"smmbzhhoxzyikvluwjmigetqunootxouc"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 102,
"string_length": 38,
"words": [
"rzrhqchfmxcacdphraltntmjxmdtvtofedxoh",
"dkdgcwgpizwtwuxgdtayeyisziuyfyvpjuzvg"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 103,
"string_length": 37,
"words": [
"sshdhdqaiztnpepozdyaqpjpgpxmdkhdmlhsf",
"ggjnjncrqpxmwzfbpnsrcwywlwuhntjnhdjgo"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 104,
"string_length": 33,
"words": [
"ybzulvubkfyrspfdjvxcoyxxqqgyhczs",
"ilvoywolgxispdxumwnzrinnttaijzvp"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 105,
"string_length": 40,
"words": [
"otzdmnxrbldwcpjxfruvzueqacgqnvdrvfuturgo",
"gtnqzomkheqwyirmxkfsnfucayjaosqksxftfkjg"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 106,
"string_length": 37,
"words": [
"bhlevweknhmmtobnuesggzrcnmwwxoakynmgq",
"yfjevoemxhccqnyxsewppdthxcoolnimaxcpg"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 107,
"string_length": 32,
"words": [
"ofsgopuvfrrzoyxmwfaslqlvfldezfh",
"eypleorhyggseivfcywpukuhyumqsyx"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 108,
"string_length": 36,
"words": [
"vrufmdydxpfqrqlsifgbnwxkgswjzpjuxvjk",
"powmlkfkavmhchoqbmgzrxaigqxujvuwapui"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 109,
"string_length": 37,
"words": [
"ndllgxgriduglkfuzzypaiubuczanaghciyjg",
"cxjjouozgxvojkfvwwhtdgvivhwdcdoeaghro"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 110,
"string_length": 37,
"words": [
"obtiisjtzcdututjjyyevhprijrzoymlvacbv",
"xlsddgvsweajsjsvvbbrczkydvywxdqucoelc"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 111,
"string_length": 38,
"words": [
"emgkmcahvbmhtwbvljpnhqzgzgzwmxzvoyulk",
"nucjuzabytubketyxowhbrqcqcqeusqygdpxj"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 112,
"string_length": 34,
"words": [
"bqxsemwnnjajonxxteujphuikzaesjcpgk",
"kxuwgbdpphshnpuujgyhtryicqsgkhltoc"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 113,
"string_length": 40,
"words": [
"ujkmewgazcjrtcbydvagwvimbgiaukwqptqbpzfa",
"hfucxysrokfjnkfaeqrsyqgcmsgrhuyplnpmloir"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 114,
"string_length": 38,
"words": [
"djfzdkofrfspoojsgibpwgfazepcrfbjxulti",
"pkrepugrvrhbggkhcwfbicrteqbjvrfkoyxmw"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 115,
"string_length": 40,
"words": [
"zslyrcsimuimqjwdyjylgteulpkahhnhjjnnyfk",
"skrmpekgwbgwlqnamqmrzoybrftjccicqqiimdt"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 116,
"string_length": 34,
"words": [
"imjjwwpisugprevqrokdznginluykhcenu",
"yvaawwoynpdojskcjzbfltrytipdbehstp"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 117,
"string_length": 37,
"words": [
"xatsqphcmyycswoqwprhzqkcvczketsrrzmk",
"pxrbtajhzwwhboutoadjltihnhlifrbddlzi"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 118,
"string_length": 32,
"words": [
"ognqvqsippmaxuudvsodtuzddhvfmxun",
"mkuctcqoeexnvppdtqfdbpwddjtyxvpu"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 119,
"string_length": 39,
"words": [
"zwqjdqdpnqttqnbsawhqvlxefpqzcejkpsekqt",
"pvybzyzwiyffyiqecvgyxuntdwyphtbmwetmyf"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 120,
"string_length": 31,
"words": [
"wamjuxzmbwkxkgwjefxbpswdastxaec",
"xpznwsvzqxksxjxnfusqioxlpoyspfb"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 121,
"string_length": 39,
"words": [
"gyqvvlftnypxtaxzawbnrwlqxywcgtsaidczfic",
"mnjffepyzuakyhkthxlzvxejkuxomynhrsotpro"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 122,
"string_length": 32,
"words": [
"eqowrosvuwxnnrnlunpykjxrivervwph",
"gcoftonmlrjkktkslkxahwjtqmgtmrxi"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 123,
"string_length": 31,
"words": [
"nrcmyqvhbtpawihnqtmefevzkrofno",
"fwmihyrgkxetacgfyxiujurzowljfl"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 124,
"string_length": 33,
"words": [
"rmspdlhzqvizeqtzyevacxpexebntsgjr",
"vfjzhqxsvdasuvnscudlipzupuownjymg"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 125,
"string_length": 34,
"words": [
"yyjddamjqprupahzqrsadmrwlwyfhlsxwd",
"ffillsniqvuxvsckduaslnujmjfwcmayjl"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 126,
"string_length": 32,
"words": [
"ofcvkjtthimlyokesvyhvfmxsbyufhmh",
"mlupvzrrgcihymvoqpygpbidqwytbgig"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 127,
"string_length": 35,
"words": [
"zaabjegrsqcfbavupzgvoxqlmmtlwiprudu",
"zookcupbvsxjkoghtzpgqdswllfwyetbhmr"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 128,
"string_length": 36,
"words": [
"gyceibouqagcsxzgzhysjckddkgilcajsyol",
"jlkhpsnbfejktwvjvyltmiqxxqjpakemtlna"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 129,
"string_length": 39,
"words": [
"mghoyzffkvzprobnqwagmngsdscqwlabvukhma",
"otxapreeykrchasdflntodtvgvmflqnskjyxon"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 130,
"string_length": 36,
"words": [
"udokvdnxgmaceycbnpqgxwkyussowdmxtsm",
"aywznylorqgpujpelihroxzjaddwxyqomdq"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 131,
"string_length": 36,
"words": [
"jdtcdnlffxdvgxfyioueogstzqfvxhhemal",
"bwagwsykkuwfqukietlntqmajzkfuhhnvdy"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 132,
"string_length": 31,
"words": [
"slcimlhrnthxkwnpxqpehxpybpchzx",
"tlrkilnmxunqyvxoqgoznqopsornfq"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 133,
"string_length": 38,
"words": [
"dnaeraqjejdtkzkxjlvltlqigpchldaboeyxr",
"udxhwxtphpuvgbgipzlzvztcqfsyzuxemhjiw"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 134,
"string_length": 31,
"words": [
"ciwwwgisulqekqdzcwnspodykympoe",
"ikjjjzksdxoceoqvijwsgmqtetngmc"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 135,
"string_length": 34,
"words": [
"gnpwddeikmkxdrgjjdunmbvffjmllyskx",
"xftnjjlraeamjyxoojkfespvvoeccqwam"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 136,
"string_length": 32,
"words": [
"xcyqzxjkecjzaoihdieeowssgmeglszv",
"cbiqlcryhbrlexkaukhhxjmnndhnfmlo"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 137,
"string_length": 34,
"words": [
"raxgccukdytzvuspqnkngkhqribjageyc",
"yjlanngtfzeusgbrkqtqatokypwvjahzn"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 138,
"string_length": 33,
"words": [
"segxtfswfvzawwjeybpoedkomtrlclpb",
"vozrymvsmcxbsskoqljuodpuwyaigijl"
]
} | 5 |
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 | {
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 139,
"string_length": 40,
"words": [
"pyjjycxrsjueetlwevpxkdohecjvwfhfdnbcigor",
"jxaaxzrqpagvvhnbvdjrmikwjzadbcwcisezoukq"
]
} | 5 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.