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 ... | False | {
"difficulty": {
"string_length": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 30,
"string_length": 21,
"words": [
"dlkluhfcfwnfxxrradsme",
"mdcdbhaqastpjjvvgmroz"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 31,
"string_length": 24,
"words": [
"qzuroaxsmmlqkzpetbrxnuf",
"ugcwvxroqqduigbhkpwrlcy"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 32,
"string_length": 29,
"words": [
"iibzlxaxzyatnpcfmehsvgldnypss",
"jjqxoukuxeksbgphltcdfafvbegdd"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 33,
"string_length": 27,
"words": [
"xodahhhniredhlemohvvfqzstrp",
"yxbnwwwkautbwitqpwffgdhzsuc"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 34,
"string_length": 25,
"words": [
"oumuujqrucbphgdyxrhwfcwj",
"xyqyyzjgyomsielnagihfohz"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 35,
"string_length": 24,
"words": [
"ciqtfwssqzazyirkvvrrvnx",
"xjvrhcllveneujtgkkttkmi"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 36,
"string_length": 23,
"words": [
"hemwwovokclynzjllpjifu",
"diymmbzbsunxlernnfrock"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 37,
"string_length": 22,
"words": [
"tcdqrsinzqnloeqpnydxr",
"mriegqhodeoayuejopibg"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 38,
"string_length": 24,
"words": [
"nlklsjcpczgftzcllgzweri",
"fagactiqidspodiaasdlzeb"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 39,
"string_length": 28,
"words": [
"ykqzxjsucnhtvjugzjnzowcnxskn",
"zksmbdxqwalycdqemdtmonwtbxkt"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 40,
"string_length": 22,
"words": [
"abbzejmgvkirblqqzkslns",
"qmmdxyvrofpcmnjjdalntl"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 41,
"string_length": 27,
"words": [
"xfpwvupmlkqxzbsxolodkyxbtxc",
"lfyrpeycatzlsqblcadotmlqhlg"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 42,
"string_length": 24,
"words": [
"pshvqjtkaotchvqpabfqahui",
"tzjwhkfyimfojxhtiqshijxa"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 43,
"string_length": 23,
"words": [
"kivxghkctxtmsmqjqhcwcfn",
"mjpfrwnmbfbkakxixwmemts"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 44,
"string_length": 20,
"words": [
"ysrauiimsgvpogrqruqf",
"dbnckzzabuelvangnkgr"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 45,
"string_length": 22,
"words": [
"keyknnisoqtjezunemdbyz",
"obhoaafqinkwbysabdechi"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 46,
"string_length": 26,
"words": [
"ywashfitxyhmuixypcvzcwyaxb",
"msikzqcexmzlgcxmyhojhswixp"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 47,
"string_length": 21,
"words": [
"nfrmdvnhrgxcgxbkdrmqo",
"rkefaartecsocsjmyeflu"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 48,
"string_length": 23,
"words": [
"aqgulgueelrdplxfzhsajih",
"lhungunwwgcfqgkrjayztla"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 49,
"string_length": 21,
"words": [
"hzxxxxevlvbojbhxnkoko",
"hkbbbbpnznurjuhbwbrer"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 50,
"string_length": 26,
"words": [
"kbejgqrhpsgzdqdhjznhfxpmmp",
"zvdouxjasguwcxcaowkaiyxnns"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 51,
"string_length": 27,
"words": [
"dizlzibgtihowjjcqguuyjqrptj",
"allmtlpydlqfkuunoyxxwuojzdu"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 52,
"string_length": 28,
"words": [
"emhlmtkmslxbhdmxwefhunrmbwl",
"qszasjystakvzlskcqozdhmsvca"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 53,
"string_length": 28,
"words": [
"dbqftwbvgtvwwielzotztzoteazi",
"zesymkeidmikkhxlatmamotmxpah"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 54,
"string_length": 25,
"words": [
"hvynzwrylfbgkxclayspxavl",
"koyszglymbqrcuimdyfaudom"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 55,
"string_length": 23,
"words": [
"lpsjsdlsrxhyuekzigfjdf",
"buzyzqbziwftoekrldjyqj"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 56,
"string_length": 25,
"words": [
"pmqdkbvpwsjjupwdknqvkzzgv",
"ayjiovgakqxxnakicbjgouumg"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 57,
"string_length": 26,
"words": [
"tcfeanrqmbofxzgrnahqypkmv",
"mrltbhiufcolnpyihbsuzgqfd"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 58,
"string_length": 22,
"words": [
"jndmbkrehyuzvlmvokebo",
"mfkvoewpgztjcrvcdepod"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 59,
"string_length": 29,
"words": [
"kxrhvcqyrvzxjvqbcwovrmuithebo",
"aygunjptlnkyhnpmjiznlcorvuxmz"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 60,
"string_length": 22,
"words": [
"lkhzumgdktzdbxartpztgx",
"mdcfnhpwdbfwvojipefbpo"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 61,
"string_length": 27,
"words": [
"nvrdwxhqfgpiftudmgidhmcgjcr",
"dnvofaritqzxtckobqporbpqupv"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 62,
"string_length": 20,
"words": [
"dcynbzfrnlvotwmxkegi",
"iksmyxzaxjvnltqdwgfo"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 63,
"string_length": 29,
"words": [
"bsayzzjilmxhntaeytildzdoagta",
"ojcaggmkvdbzywcqawkvpgpxcnwc"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 64,
"string_length": 27,
"words": [
"apbvlxudewzlqrlyfrprdyibdl",
"trluwbegxkvwfywjhyrygjalgw"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 65,
"string_length": 23,
"words": [
"jhqfketnyzfdcizrvxrncem",
"dfqtoapyzutgvjunlhnovae"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 66,
"string_length": 22,
"words": [
"roevuzwnvirkikyvwdgxly",
"hiklprrxlehnenclsmbquc"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 67,
"string_length": 24,
"words": [
"xpcqgrxamuayazdtfdzohfm",
"zoujcrzxebxaxqgfmgqihme"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 68,
"string_length": 26,
"words": [
"tmnwnrmkadirfwsmgelaimkxhv",
"pwqcqhwtkidhxcrwgfokdwblaz"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 69,
"string_length": 23,
"words": [
"yvmbwnkzmoocqybhhcgmrji",
"tkhmpzewhggnstaiinvhoxf"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 70,
"string_length": 27,
"words": [
"guxjzcxstdxevdthndxaemosrhc",
"vdfiaufklefnzelrjeftkmgksru"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 71,
"string_length": 20,
"words": [
"beqlmrfuuumyvodvplzj",
"dsurykbwwwymxviqzrhf"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 72,
"string_length": 23,
"words": [
"yctfaaurbynrbxildmfxcqb",
"hcyzbbnwxhawxmutdejmcpx"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 73,
"string_length": 24,
"words": [
"iiykhuyqkkfpbqdzfajbwns",
"zzbqnibyqqvmlytovkalrcg"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 74,
"string_length": 29,
"words": [
"ujifqeggrryyqpiozkfqkratgokze",
"shbwrtjjkkiirpbxcowrokufjxoat"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 75,
"string_length": 23,
"words": [
"vzmiayxfmrmomsnwgwfqko",
"kuibcapqioidigtyeyqrhd"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 76,
"string_length": 30,
"words": [
"iljusqtgfsvbujbrpwyxrxvejqrxs",
"nqskdvohbdlxksxcutizczljsvczd"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 77,
"string_length": 24,
"words": [
"bhkimcevgomdhhyfsadqipv",
"zbfldxywqvdjbboernjhlgw"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 78,
"string_length": 28,
"words": [
"wgxycdliuuuuvamvnisobmokrso",
"dhlpjfcqoooowygwsqnebgemane"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 79,
"string_length": 21,
"words": [
"ozbzyzwpmsmjxfzmbicm",
"cvwvqvgiznzhoxvzwfuz"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 80,
"string_length": 28,
"words": [
"udjxdgixnkojyjbrbiaxtatqlpy",
"lkrikxfiytorvrbzbfnisnswuev"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 81,
"string_length": 20,
"words": [
"jepkypzykynzsjrrsyd",
"fogcagmacaemtfddtap"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 82,
"string_length": 24,
"words": [
"zmbpzomsqmsciyfvwwkjzixt",
"yqfkyaqnbqncmzxitvgvymuj"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 83,
"string_length": 23,
"words": [
"budlttwrqhwiuzzqfpnwks",
"vumeaaszdxsturrdbfhsgi"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 84,
"string_length": 29,
"words": [
"tczqzhwrkljombqqabwrucwvocmp",
"ghwpwevozfbstyppqyvokhvdshtc"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 85,
"string_length": 20,
"words": [
"gislvchoykoibdlqdtlo",
"usqqtakiolisfxjwxbji"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 86,
"string_length": 23,
"words": [
"lqfwehnujsjlizaqyyalmu",
"eskcindfyvyebtgshhgepf"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 87,
"string_length": 29,
"words": [
"apoccifhgbeqfiejdbrpcgzcqjpet",
"rdhaavelyfeievjgufzdaysaigdjw"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 88,
"string_length": 28,
"words": [
"bhwscyyhaklmjfwqmyqdbohpbka",
"dgtahppgfuqsnjtrsprvdygxduf"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 89,
"string_length": 25,
"words": [
"aosjltnchqckdxgdvmsdjqew",
"ljgenmviuoiskprkxagkeocy"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 90,
"string_length": 26,
"words": [
"ppujsxvzontogvnbktblarfru",
"mmovqaujypnyhupksnkibezeo"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 91,
"string_length": 27,
"words": [
"ytyktdpuuvomrfjywzrgtiryer",
"ibinbdlqqswovjzimgvybcviuv"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 92,
"string_length": 27,
"words": [
"dddwsjiccbtxiuburwhdonhelda",
"zzzenwfvvidsfbtbceizulipazh"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 93,
"string_length": 30,
"words": [
"weuiusfweluegeepuseauedhrjczg",
"utigihautmityttoihtjitxwfsrny"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 94,
"string_length": 29,
"words": [
"pqvnzqpzpntvvtbtlqnjrkdpzhav",
"fbgedbfdfeyggylyabeqvsifdzwg"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 95,
"string_length": 21,
"words": [
"ycloyoafaaysshqzbqob",
"xwsvxvutuuxbbzmhomvo"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 96,
"string_length": 23,
"words": [
"nvezxyrkffyscfethwoano",
"qzpexjhrggjcagptyobkqb"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 97,
"string_length": 20,
"words": [
"tthhdsyljtbchqyaazyk",
"zzqbvurdczmtqyrsspro"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 98,
"string_length": 21,
"words": [
"sdhcanwuzthmupkoqnxk",
"zybsrtaiwgbeihvfqtpv"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 99,
"string_length": 28,
"words": [
"gqgnswshmelkzlgcdeqkqeqedmza",
"bmbtqcqkenildibvznmlmnmnaedy"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 100,
"string_length": 29,
"words": [
"wzulpuzgivkqiarrqjwbienbxbbco",
"twaroawnnbpgceiigutmckqmhmmvy"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 101,
"string_length": 22,
"words": [
"pccrmffjgmitowblzucyty",
"smmbzhhoxzyikvluwjmxig"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 102,
"string_length": 27,
"words": [
"rzrhqchfmxcacdphraltntmjxm",
"dkdgcwgpizwtwuxgdtayeyiszi"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 103,
"string_length": 26,
"words": [
"sshdhdqaiztnpeozdyatqpjpgp",
"ggjnjncrqpxmwzbpnsrdcwywlw"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 104,
"string_length": 22,
"words": [
"ybzulvubkfyrspfdjvxco",
"ilvoywolgxispdxumwnzr"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 105,
"string_length": 29,
"words": [
"otxzdmnxrbldwcpjxfruvzueqacgn",
"gtinqzomkheqwyirmxkfsnfucayjo"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 106,
"string_length": 26,
"words": [
"bhlezvweknmmtobnuesggzrcnm",
"yfjeivoemxccqnyxsewppdthxc"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 107,
"string_length": 21,
"words": [
"ofsgopuvfrrzoyxmwfas",
"eypleorhyggseivfcywp"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 108,
"string_length": 25,
"words": [
"vufmdydxpfqrqlsifgbnwxkgv",
"pwmlkfkavmhchoqbmgzrxaigh"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 109,
"string_length": 26,
"words": [
"ndllgxgriduglkfuzzypailubu",
"cxjjouozgxvojkfvwwhtdgzviv"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 110,
"string_length": 26,
"words": [
"obtiisjtzcduttutjjyyevhpri",
"xlsddgvsweajxsjsvvbbrczkyd"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 111,
"string_length": 27,
"words": [
"emgkmcahvbmhtwbvljpnhqzgzg",
"nucjuzabytubketyxowhbrqcqc"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 112,
"string_length": 23,
"words": [
"bqxsemwnnjajonxxteujpeh",
"kxuwgbdpphshnpuujgyhtor"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 113,
"string_length": 29,
"words": [
"ujkmewgazcjrtcydvagwvimbgiaiu",
"hfucxysrokfjnkaeqrsyqgcmsgrth"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 114,
"string_length": 27,
"words": [
"djfzdkofrfspoojsgibpwgfaze",
"pkrepugrvrhbggkhcwfbicrteq"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 115,
"string_length": 29,
"words": [
"zslyrcsimuimqjwdyjylgteulpka",
"skrmpekgwbgwlqnamqmrzoybrftj"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 116,
"string_length": 30,
"words": [
"cpgjxprseuprtevqcrokdzngjkiayk",
"ogadigenrpgersjhoewbkyladbcvtb"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 117,
"string_length": 26,
"words": [
"xatsqphcmyycswoqwprhzqkcv",
"pxrbtajhzwwhboutoadjltihn"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 118,
"string_length": 21,
"words": [
"ognqvqsippmaxuvudvsdt",
"mkuctcqoeexnvpmpdtqdb"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 119,
"string_length": 28,
"words": [
"zwqjdqdpnqttqnbsawhqvlxefpq",
"pvybzyzwiyffyiqecvgyxuntdwy"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 120,
"string_length": 20,
"words": [
"wamjuxwzmbwkxgwjefxb",
"xpznwssvzqxksjxnfusq"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 121,
"string_length": 28,
"words": [
"gqvvlftnypxgtaxzawbnrwlqxywc",
"mjffepyzuaknyhkthxlzvxejkuxo"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 122,
"string_length": 21,
"words": [
"eqorosvuwxnnrnylunpyk",
"gcotonmlrjkktkxslkxah"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 123,
"string_length": 20,
"words": [
"nrcmyqvhbtpawihnqtm",
"fwmihyrgkxetacgfyxi"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 124,
"string_length": 22,
"words": [
"mspdlhzqvizeqtszyevacx",
"fjzhqxsvdasuvnrscudlip"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 125,
"string_length": 23,
"words": [
"yyjddamjqprzupahzrsadmr",
"ffillsniqvusxvsckuaslnu"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 126,
"string_length": 21,
"words": [
"ocvkjtthimlyovkesvyhv",
"mupvzrrgcihymbvoqpygp"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 127,
"string_length": 24,
"words": [
"zaabjegrvsqcfbavupzgvoxq",
"zookcupbivsxjkoghtzpgqds"
]
} | 3 |
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": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 128,
"string_length": 25,
"words": [
"gyceibouqagcsxzgzheysjkdd",
"jlkhpsnbfejktwvjvyaltmqxx"
]
} | 3 |
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": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 129,
"string_length": 28,
"words": [
"mghoyzffkvzprobnqwagmngsdsc",
"otxapreeykrchasdflntodtvgvm"
]
} | 3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.