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 following two strings are isomorphic, or False otherwise:
sswxdzeqhkuhiekbmubrvcycwgbyatjzyeii llzwmikxjaojukasdosthfefzrsecqpiekuu
|
True
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 90,
"string_length": 37,
"words": [
"sswxdzeqhkuhiekbmubrvcycwgbyatjzyeii",
"llzwmikxjaojukasdosthfefzrsecqpiekuu"
]
}
| 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 following two strings are isomorphic, or False otherwise:
ouomutswwehfcyxoaqciupcogccvlqgphllkh xbxtbhcmmdanwzqxoywlbiwxjwwrkyjiakkva
|
True
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 91,
"string_length": 38,
"words": [
"ouomutswwehfcyxoaqciupcogccvlqgphllkh",
"xbxtbhcmmdanwzqxoywlbiwxjwwrkyjiakkva"
]
}
| 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 following two strings are isomorphic, or False otherwise:
tttadxppjjuzpwbwcanthkngrtvkuwtwvochjj fffptnhjwwkdjxexipbfgybacfuykxfxuzigww
|
False
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 92,
"string_length": 38,
"words": [
"tttadxppjjuzpwbwcanthkngrtvkuwtwvochjj",
"fffptnhjwwkdjxexipbfgybacfuykxfxuzigww"
]
}
| 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 following two strings are isomorphic, or False otherwise:
ilkzdyarwiggswdygvwgtrncxjkbipklafbw qezutaolkqmmnktsmskmxlyfcvzgqdzeohgk
|
False
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 93,
"string_length": 36,
"words": [
"ilkzdyarwiggswdygvwgtrncxjkbipklafbw",
"qezutaolkqmmnktsmskmxlyfcvzgqdzeohgk"
]
}
| 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 following two strings are isomorphic, or False otherwise:
slekqlsqskueeuburlkxcmtsqnvegfnxtaickmb jbgphbjhjpsggsfsibpdezajhqkgmlqdautepzf
|
True
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 94,
"string_length": 40,
"words": [
"slekqlsqskueeuburlkxcmtsqnvegfnxtaickmb",
"jbgphbjhjpsggsfsibpdezajhqkgmlqdautepzf"
]
}
| 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 following two strings are isomorphic, or False otherwise:
ojrhohvyvvoddnlqblhbookkhocrkvp vndwvwkakkvbbqormowmvvzzwvtdzkf
|
True
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 95,
"string_length": 32,
"words": [
"ojrhohvyvvoddnlqblhbookkhocrkvp",
"vndwvwkakkvbbqormowmvvzzwvtdzkf"
]
}
| 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 following two strings are isomorphic, or False otherwise:
kegqzocmyyodjygunahvkhvdisxdnvlsp mfypvencwwejswyilqxzmxzjgbdjlztbh
|
True
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 96,
"string_length": 34,
"words": [
"kegqzocmyyodjygunahvkhvdisxdnvlsp",
"mfypvencwwejswyilqxzmxzjgbdjlztbh"
]
}
| 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 following two strings are isomorphic, or False otherwise:
uuntdorxubjnltovvqomcpgddmzxmsi ffmwkqhyfrimpkqddxqtbjgkktvytls
|
False
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 97,
"string_length": 31,
"words": [
"uuntdorxubjnltovvqomcpgddmzxmsi",
"ffmwkqhyfrimpkqddxqtbjgkktvytls"
]
}
| 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 following two strings are isomorphic, or False otherwise:
dtnjvkawqunfwsmhlkzmyqnhtbnmnbb fsbdqavpembhpoiyzaxikebyslbibll
|
True
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 98,
"string_length": 32,
"words": [
"dtnjvkawqunfwsmhlkzmyqnhtbnmnbb",
"fsbdqavpembhpoiyzaxikebyslbibll"
]
}
| 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 following two strings are isomorphic, or False otherwise:
ilikdadnfgrmqrijtglmlglgfqvbxnulmaiqzpw blbamomujktfitbeqklflklkjizvduhlfobwscp
|
False
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 99,
"string_length": 39,
"words": [
"ilikdadnfgrmqrijtglmlglgfqvbxnulmaiqzpw",
"blbamomujktfitbeqklflklkjizvduhlfobwscp"
]
}
| 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 following two strings are isomorphic, or False otherwise:
aqwrswqiemlpvcclxabipgkbzbbjhwnkrdtvqoos aniqzintbskuoxxkhafmupdfwffeliydqcmonjjz
|
False
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 100,
"string_length": 40,
"words": [
"aqwrswqiemlpvcclxabipgkbzbbjhwnkrdtvqoos",
"aniqzintbskuoxxkhafmupdfwffeliydqcmonjjz"
]
}
| 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 following two strings are isomorphic, or False otherwise:
sjjcfyyxifpuhabrqwjuomekgvxxeixrg dllbfrrzofwaniyemclaktqswjzzqozeu
|
False
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 101,
"string_length": 33,
"words": [
"sjjcfyyxifpuhabrqwjuomekgvxxeixrg",
"dllbfrrzofwaniyemclaktqswjzzqozeu"
]
}
| 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 following two strings are isomorphic, or False otherwise:
cqcnljnyfzjvjtsncvrukufxzftueuhygtzhn huhgongysqnmneaghmplflszqselvliyceqig
|
True
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 102,
"string_length": 38,
"words": [
"cqcnljnyfzjvjtsncvrukufxzftueuhygtzhn",
"huhgongysqnmneaghmplflszqselvliyceqig"
]
}
| 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 following two strings are isomorphic, or False otherwise:
ddntntlvpquksgshqtovlsxsiszftmntfrndy ggetetoqmslakwjbstdqokpknkhjtietjfegy
|
False
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 103,
"string_length": 37,
"words": [
"ddntntlvpquksgshqtovlsxsiszftmntfrndy",
"ggetetoqmslakwjbstdqokpknkhjtietjfegy"
]
}
| 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 following two strings are isomorphic, or False otherwise:
obqwrewbmyocdsytxezjhozzllionjqd xcwzsnzcmfxpagfirnjebxjjqqvxlewa
|
True
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 104,
"string_length": 33,
"words": [
"obqwrewbmyocdsytxezjhozzllionjqd",
"xcwzsnzcmfxpagfirnjebxjjqqvxlewa"
]
}
| 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 following two strings are isomorphic, or False otherwise:
huqtfkzcbrtajsxzycweqwglvjilketceywuwcih gatmfzhiuwmypjbhoildtlrkspeizdmidolalieg
|
False
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 105,
"string_length": 40,
"words": [
"huqtfkzcbrtajsxzycweqwglvjilketceywuwcih",
"gatmfzhiuwmypjbhoildtlrkspeizdmidolalieg"
]
}
| 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 following two strings are isomorphic, or False otherwise:
bnrgeagmknffuhbkwgdiiqcjkfaazhvmokfil sjepwzpxfrttdosfcpqaarkuftzznogxlftay
|
False
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 106,
"string_length": 37,
"words": [
"bnrgeagmknffuhbkwgdiiqcjkfaazhvmokfil",
"sjepwzpxfrttdosfcpqaarkuftzznogxlftay"
]
}
| 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 following two strings are isomorphic, or False otherwise:
hydihsweyccqhozfayvdrlreyrtgqyn psycpzqnsiifpxutosmyhkhnshadfsj
|
True
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 107,
"string_length": 32,
"words": [
"hydihsweyccqhozfayvdrlreyrtgqyn",
"psycpzqnsiifpxutosmyhkhnshadfsj"
]
}
| 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 following two strings are isomorphic, or False otherwise:
ecwyftotzsylclrdpyibkazmidaxqsxwzexm yznlcujuvelowofdxlkqhgvbkdgaseanvyab
|
False
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 108,
"string_length": 36,
"words": [
"ecwyftotzsylclrdpyibkazmidaxqsxwzexm",
"yznlcujuvelowofdxlkqhgvbkdgaseanvyab"
]
}
| 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 following two strings are isomorphic, or False otherwise:
ktrrizicptwirmywqqosvpwbwjqvkvinjpoxi oveezkzfmvqzepnqttiwjmqbqrtjojzgcmixz
|
False
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 109,
"string_length": 37,
"words": [
"ktrrizicptwirmywqqosvpwbwjqvkvinjpoxi",
"oveezkzfmvqzepnqttiwjmqbqrtjojzgcmixz"
]
}
| 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 following two strings are isomorphic, or False otherwise:
hbuppdxuqjtwuwuxxoogenscpxcqhofrevjbe vcdhhgwdarpsdsdwwxxbimlnhwnavhzjikrci
|
False
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 110,
"string_length": 37,
"words": [
"hbuppdxuqjtwuwuxxoogenscpxcqhofrevjbe",
"vcdhhgwdarpsdsdwwxxbimlnhwnavhzjikrci"
]
}
| 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 following two strings are isomorphic, or False otherwise:
gfimfjvnebfnuaberxsknlqiqiqafzqehowrm tkoekfibgnkbcmngjlywbxdododmkzdgvrhje
|
True
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 111,
"string_length": 38,
"words": [
"gfimfjvnebfnuaberxsknlqiqiqafzqehowrm",
"tkoekfibgnkbcmngjlywbxdododmkzdgvrhje"
]
}
| 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 following two strings are isomorphic, or False otherwise:
blzdgfakkxvxhkzzugwxsnwpmqvgdxjsim uvkngbtssjzjaskkcgfjmxfhidzgujymqi
|
False
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 112,
"string_length": 34,
"words": [
"blzdgfakkxvxhkzzugwxsnwpmqvgdxjsim",
"uvkngbtssjzjaskkcgfjmxfhidzgujymqi"
]
}
| 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 following two strings are isomorphic, or False otherwise:
wxmfgaivqjxcujboteviaepfbipvwmalsulbsqyv rjkovsdynfjcufupizydsztogdtyrksxluxglnhy
|
False
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 113,
"string_length": 40,
"words": [
"wxmfgaivqjxcujboteviaepfbipvwmalsulbsqyv",
"rjkovsdynfjcufupizydsztogdtyrksxluxglnhy"
]
}
| 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 following two strings are isomorphic, or False otherwise:
txyqtmhycydshhxdipbsaiyvqgsjcybxzwrup yuqpykgqjqabgguaielbxiqmpdbsjqluvfthe
|
True
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 114,
"string_length": 38,
"words": [
"txyqtmhycydshhxdipbsaiyvqgsjcybxzwrup",
"yuqpykgqjqabgguaielbxiqmpdbsjqluvfthe"
]
}
| 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 following two strings are isomorphic, or False otherwise:
qdrocjdpfwpflxatoxoriugwrsmvnnknxxkkoym duqlypumibmivzgclzlqekfbqntsrrxrzzxxljt
|
True
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 115,
"string_length": 40,
"words": [
"qdrocjdpfwpflxatoxoriugwrsmvnnknxxkkoym",
"duqlypumibmivzgclzlqekfbqntsrrxrzzxxljt"
]
}
| 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 following two strings are isomorphic, or False otherwise:
pfxxaaspdwiscgelchmtqkipkrwomnjgkw swiinnzstchzxpfexqhlvkaskbcrhmupkc
|
False
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 116,
"string_length": 34,
"words": [
"pfxxaaspdwiscgelchmtqkipkrwomnjgkw",
"swiinnzstchzxpfexqhlvkaskbcrhmupkc"
]
}
| 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 following two strings are isomorphic, or False otherwise:
zvudlsnjfoojdahlascnqlmjejqmgudccqfm yvqbaiznweenbkuakihzmaxngnmxlqbhhmwx
|
True
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 117,
"string_length": 37,
"words": [
"zvudlsnjfoojdahlascnqlmjejqmgudccqfm",
"yvqbaiznweenbkuakihzmaxngnmxlqbhhmwx"
]
}
| 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 following two strings are isomorphic, or False otherwise:
hikleldpssfvzwwtedhtuwqttneyfzwk lukoaomrjjgwqhhtamjtxhyttsacgqhk
|
False
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 118,
"string_length": 32,
"words": [
"hikleldpssfvzwwtedhtuwqttneyfzwk",
"lukoaomrjjgwqhhtamjtxhyttsacgqhk"
]
}
| 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 following two strings are isomorphic, or False otherwise:
qalxtltskluulkbdvanlerzgyslqjgxmsdgmlu ywsbfsfncsqqscdiuwmsahjrgnsyorbtnirtsq
|
True
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 119,
"string_length": 39,
"words": [
"qalxtltskluulkbdvanlerzgyslqjgxmsdgmlu",
"ywsbfsfncsqqscdiuwmsahjrgnsyorbtnirtsq"
]
}
| 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 following two strings are isomorphic, or False otherwise:
avfxwzqfbamzmiaxgyzbsdatvduzvgj vyftndqfzvpdysvtkudzbevmyeldykh
|
False
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 120,
"string_length": 31,
"words": [
"avfxwzqfbamzmiaxgyzbsdatvduzvgj",
"vyftndqfzvpdysvtkudzbevmyeldykh"
]
}
| 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 following two strings are isomorphic, or False otherwise:
ioleeryukoszuvzqvabkcarlzoajiudvptjqypj ltejjpysqocfsuftuanqwapefoavlsrubdvtybv
|
False
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 121,
"string_length": 39,
"words": [
"ioleeryukoszuvzqvabkcarlzoajiudvptjqypj",
"ltejjpysqocfsuftuanqwapefoavlsrubdvtybv"
]
}
| 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 following two strings are isomorphic, or False otherwise:
glhachdewazkkckrwksomxzcpegceasn gozjaztlfpcvvavsfvjnuqcadlgalpjh
|
False
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 122,
"string_length": 32,
"words": [
"glhachdewazkkckrwksomxzcpegceasn",
"gozjaztlfpcvvavsfvjnuqcadlgalpjh"
]
}
| 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 following two strings are isomorphic, or False otherwise:
kcjfolenbusvapnklufgygeqmchykh jnlxrspivgaqfwijsgxtotpkyncojc
|
True
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 123,
"string_length": 31,
"words": [
"kcjfolenbusvapnklufgygeqmchykh",
"jnlxrspivgaqfwijsgxtotpkyncojc"
]
}
| 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 following two strings are isomorphic, or False otherwise:
cfdstrnqlepqgluqogevjzsgzgbkudixc wjefrmvdyozdtyidwtopbaftatlqiecun
|
False
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 124,
"string_length": 33,
"words": [
"cfdstrnqlepqgluqogevjzsgzgbkudixc",
"wjefrmvdyozdtyidwtopbaftatlqiecun"
]
}
| 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 following two strings are isomorphic, or False otherwise:
ooxttvfxlscwsvnqlcdvtfcaraoynrdzat jjxccdtxmqgoqdephgsdctgzizjkeisfzc
|
False
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 125,
"string_length": 34,
"words": [
"ooxttvfxlscwsvnqlcdvtfcaraoynrdzat",
"jjxccdtxmqgoqdephgsdctgzizjkeisfzc"
]
}
| 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 following two strings are isomorphic, or False otherwise:
hyjemxuunpfrohmgdeoneyfzdbowynfn lckywfqqmpxrvlwidyvmybxgduvobmxm
|
False
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 126,
"string_length": 32,
"words": [
"hyjemxuunpfrohmgdeoneyfzdbowynfn",
"lckywfqqmpxrvlwidyvmybxgduvobmxm"
]
}
| 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 following two strings are isomorphic, or False otherwise:
qvvbxgicdljybvewsqiehzlrffurapscwtw fzzuokybqsacuzmrwfymdtsennveliwbrgq
|
False
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 127,
"string_length": 35,
"words": [
"qvvbxgicdljybvewsqiehzlrffurapscwtw",
"fzzuokybqsacuzmrwfymdtsennveliwbrgq"
]
}
| 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 following two strings are isomorphic, or False otherwise:
iojgpbhwlvijdzqiqnodxjmttmiprjvxdohr ecurydkbfoeuntwewpcnjxzaazeysuojncks
|
False
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 128,
"string_length": 36,
"words": [
"iojgpbhwlvijdzqiqnodxjmttmiprjvxdohr",
"ecurydkbfoeuntwewpcnjxzaazeysuojncks"
]
}
| 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 following two strings are isomorphic, or False otherwise:
finhoqyymeqschbklavifkidtdjlarvbewmnfv zaviyqwwopqrjishlntazhagkgflndtspcovzt
|
True
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 129,
"string_length": 39,
"words": [
"finhoqyymeqschbklavifkidtdjlarvbewmnfv",
"zaviyqwwopqrjishlntazhagkgflndtspcovzt"
]
}
| 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 following two strings are isomorphic, or False otherwise:
wthmetkzifvjgojbkslizamowddhatfzudf isnftscrqdyxmpxuchoqrgfpijjngsdrajd
|
True
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 130,
"string_length": 36,
"words": [
"wthmetkzifvjgojbkslizamowddhatfzudf",
"isnftscrqdyxmpxuchoqrgfpijjngsdrajd"
]
}
| 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 following two strings are isomorphic, or False otherwise:
xtujtkryyzteizyophwghiduqlyeznngfvr bnigndsmmonpzomjavfwvztirlmpoqqwyes
|
True
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 131,
"string_length": 36,
"words": [
"xtujtkryyzteizyophwghiduqlyeznngfvr",
"bnigndsmmonpzomjavfwvztirlmpoqqwyes"
]
}
| 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 following two strings are isomorphic, or False otherwise:
drjpfrnckunzmakszlsgnzsobsjnqz acquxctfhwtdlihydkyetdynzyqtvd
|
True
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 132,
"string_length": 31,
"words": [
"drjpfrnckunzmakszlsgnzsobsjnqz",
"acquxctfhwtdlihydkyetdynzyqtvd"
]
}
| 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 following two strings are isomorphic, or False otherwise:
tkvgcvlxgxtumqmzxrerurlpisjnrtvbhgozc khvrnvasrskeixifsumueuaodqzyukvtgrjfn
|
True
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 133,
"string_length": 38,
"words": [
"tkvgcvlxgxtumqmzxrerurlpisjnrtvbhgozc",
"khvrnvasrskeixifsumueuaodqzyukvtgrjfn"
]
}
| 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 following two strings are isomorphic, or False otherwise:
jpaaaipdwrlgmltqjakdshtomofshg xueeefudhzrigrsmxeqdyoskgkwyoi
|
True
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 134,
"string_length": 31,
"words": [
"jpaaaipdwrlgmltqjakdshtomofshg",
"xueeefudhzrigrsmxeqdyoskgkwyoi"
]
}
| 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 following two strings are isomorphic, or False otherwise:
iksattgpmfmztcixxtwkfbeyyxfrrodmz vjateecylulrepvffezjusxwwfuiidnlr
|
True
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 135,
"string_length": 34,
"words": [
"iksattgpmfmztcixxtwkfbeyyxfrrodmz",
"vjateecylulrepvffezjusxwwfuiidnlr"
]
}
| 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 following two strings are isomorphic, or False otherwise:
zjolqzxmgjxqvhpntpgghaddifgirdqe obxmcoqwabqctjpzgpaajsrtiuaifrcl
|
False
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 136,
"string_length": 32,
"words": [
"zjolqzxmgjxqvhpntpgghaddifgirdqe",
"obxmcoqwabqctjpzgpaajsrtiuaifrcl"
]
}
| 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 following two strings are isomorphic, or False otherwise:
cvzijjwmtouqewdslkmkimnlcpbxvigoj secittgajvqnzgxbpdadiafpshlyeimvt
|
True
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 137,
"string_length": 34,
"words": [
"cvzijjwmtouqewdslkmkimnlcpbxvigoj",
"secittgajvqnzgxbpdadiafpshlyeimvt"
]
}
| 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 following two strings are isomorphic, or False otherwise:
dgizuydayeqvaaxgobshgtmhfucrjrsb wzfqslwdlegxddvzckpaztbausnhmhpk
|
True
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 138,
"string_length": 33,
"words": [
"dgizuydayeqvaaxgobshgtmhfucrjrsb",
"wzfqslwdlegxddvzckpaztbausnhmhpk"
]
}
| 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 following two strings are isomorphic, or False otherwise:
soxxojzcdxwggurageszmthngjxeaynytkbjpihc eviivfqmsiluugabuheqnxzoefihbjojxdrfytzm
|
False
|
{
"difficulty": {
"string_length": [
31,
40
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 139,
"string_length": 40,
"words": [
"soxxojzcdxwggurageszmthngjxeaynytkbjpihc",
"eviivfqmsiluugabuheqnxzoefihbjojxdrfytzm"
]
}
| 5
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.