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:
gjtncfdevm ypzotsqfde
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 0,
"string_length": 11,
"words": [
"gjtncfdevm",
"ypzotsqfde"
]
}
| 2
|
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:
xznbzuudf puxzukkot
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 1,
"string_length": 10,
"words": [
"xznbzuudf",
"puxzukkot"
]
}
| 2
|
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:
kqjdpdpqxkxwixkn zjeqtqtjozcmiozw
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 2,
"string_length": 16,
"words": [
"kqjdpdpqxkxwixkn",
"zjeqtqtjozcmiozw"
]
}
| 2
|
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:
gwdlpbwtuybty cizdjvipqevpe
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 3,
"string_length": 14,
"words": [
"gwdlpbwtuybty",
"cizdjvipqevpe"
]
}
| 2
|
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:
ijvimdbady krpkszjczx
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 4,
"string_length": 11,
"words": [
"ijvimdbady",
"krpkszjczx"
]
}
| 2
|
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:
mighubnpgbldif gekjsfdckfbieq
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 5,
"string_length": 15,
"words": [
"mighubnpgbldif",
"gekjsfdckfbieq"
]
}
| 2
|
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:
mmwexqblexvvyedfy ttnxjpzwxjkkaxcfa
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 6,
"string_length": 18,
"words": [
"mmwexqblexvvyedfy",
"ttnxjpzwxjkkaxcfa"
]
}
| 2
|
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:
pxvnxtytsv eksckiwits
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 7,
"string_length": 11,
"words": [
"pxvnxtytsv",
"eksckiwits"
]
}
| 2
|
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:
rjlconcypojeouuac ohekyrkvmyhcyeazk
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 8,
"string_length": 17,
"words": [
"rjlconcypojeouuac",
"ohekyrkvmyhcyeazk"
]
}
| 2
|
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:
mmjmgmzmvonhh zlqlglblhrvoo
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 9,
"string_length": 13,
"words": [
"mmjmgmzmvonhh",
"zlqlglblhrvoo"
]
}
| 2
|
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:
tlfybqzshdcql nisvfgdxjmkgi
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 10,
"string_length": 14,
"words": [
"tlfybqzshdcql",
"nisvfgdxjmkgi"
]
}
| 2
|
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:
evlvrtsrtytsqrjeljy ghxhadvadodvcajgijo
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 11,
"string_length": 19,
"words": [
"evlvrtsrtytsqrjeljy",
"ghxhadvadodvcajgijo"
]
}
| 2
|
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:
wljotesbzmv aunrjvixcem
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 12,
"string_length": 12,
"words": [
"wljotesbzmv",
"aunrjvixcem"
]
}
| 2
|
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:
etcqcrlhvoo pebibxolvrb
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 13,
"string_length": 11,
"words": [
"etcqcrlhvoo",
"pebibxolvrb"
]
}
| 2
|
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:
awmkpuoidshyjpuee nbjyucrwvfdqpucoo
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 14,
"string_length": 18,
"words": [
"awmkpuoidshyjpuee",
"nbjyucrwvfdqpucoo"
]
}
| 2
|
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:
ujowadvrh dfngjvbmp
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 15,
"string_length": 10,
"words": [
"ujowadvrh",
"dfngjvbmp"
]
}
| 2
|
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:
teezrbzbuwpllxzmns ossjemjmfxdyypjgkc
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 16,
"string_length": 19,
"words": [
"teezrbzbuwpllxzmns",
"ossjemjmfxdyypjgkc"
]
}
| 2
|
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:
adwdndllbwxt gpxprpjjoxeb
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 17,
"string_length": 13,
"words": [
"adwdndllbwxt",
"gpxprpjjoxeb"
]
}
| 2
|
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:
yjzsnyhjafywv qnicvqsndwqyp
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 18,
"string_length": 14,
"words": [
"yjzsnyhjafywv",
"qnicvqsndwqyp"
]
}
| 2
|
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:
eoobdrczqavaqodf bmmhnugrfdcdfmnv
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 19,
"string_length": 17,
"words": [
"eoobdrczqavaqodf",
"bmmhnugrfdcdfmnv"
]
}
| 2
|
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:
jwrvqgqplvdikkcmid gtlvdbdsavwyqqkiyw
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 20,
"string_length": 19,
"words": [
"jwrvqgqplvdikkcmid",
"gtlvdbdsavwyqqkiyw"
]
}
| 2
|
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:
gnhcnecatsnyjusu acbzcizuxgcmkdgd
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 21,
"string_length": 17,
"words": [
"gnhcnecatsnyjusu",
"acbzcizuxgcmkdgd"
]
}
| 2
|
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:
umdgbbxkcztchcqi utvbhhyqmndmzmcs
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 22,
"string_length": 17,
"words": [
"umdgbbxkcztchcqi",
"utvbhhyqmndmzmcs"
]
}
| 2
|
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:
vzvzmajmzgalkgp yayainciaqnbsqv
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 23,
"string_length": 16,
"words": [
"vzvzmajmzgalkgp",
"yayainciaqnbsqv"
]
}
| 2
|
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:
jzgpqvbktf bmknapchyt
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 24,
"string_length": 11,
"words": [
"jzgpqvbktf",
"bmknapchyt"
]
}
| 2
|
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:
ffgflgesqs ggogrohbmb
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 25,
"string_length": 11,
"words": [
"ffgflgesqs",
"ggogrohbmb"
]
}
| 2
|
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:
tpifgomqaspostcee noyfbaztphoahfkjj
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 26,
"string_length": 17,
"words": [
"tpifgomqaspostcee",
"noyfbaztphoahfkjj"
]
}
| 2
|
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:
quoffivmb cuwnnfitm
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 27,
"string_length": 10,
"words": [
"quoffivmb",
"cuwnnfitm"
]
}
| 2
|
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:
zypnukbjav gepxyfmicu
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 28,
"string_length": 11,
"words": [
"zypnukbjav",
"gepxyfmicu"
]
}
| 2
|
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:
bgxgcvauvdrxyas dlqlmcdickaqrng
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 29,
"string_length": 15,
"words": [
"bgxgcvauvdrxyas",
"dlqlmcdickaqrng"
]
}
| 2
|
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:
wtrmrwnyjya glhohbrivid
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 30,
"string_length": 11,
"words": [
"wtrmrwnyjya",
"glhohbrivid"
]
}
| 2
|
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:
lqwchvzdffrlm kgonwvpfddakh
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 31,
"string_length": 14,
"words": [
"lqwchvzdffrlm",
"kgonwvpfddakh"
]
}
| 2
|
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:
jppbqrzvzqovuksjyfg jeemvzkukvwudxlhrnt
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 32,
"string_length": 19,
"words": [
"jppbqrzvzqovuksjyfg",
"jeemvzkukvwudxlhrnt"
]
}
| 2
|
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:
ztvnhnnkpcgtnrgfh sbtnvnnuiwmbnamdh
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 33,
"string_length": 17,
"words": [
"ztvnhnnkpcgtnrgfh",
"sbtnvnnuiwmbnamdh"
]
}
| 2
|
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:
hwfwwxlcwjbsni vsmssfegszxdjr
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 34,
"string_length": 15,
"words": [
"hwfwwxlcwjbsni",
"vsmssfegszxdjr"
]
}
| 2
|
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:
jpluyaddlqvqo vewqrohhwgugt
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 35,
"string_length": 14,
"words": [
"jpluyaddlqvqo",
"vewqrohhwgugt"
]
}
| 2
|
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:
ngfaahehmjro hxsllbfbdjrt
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 36,
"string_length": 13,
"words": [
"ngfaahehmjro",
"hxsllbfbdjrt"
]
}
| 2
|
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:
ujtlcdpkqlk lqxpgmafrpf
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 37,
"string_length": 12,
"words": [
"ujtlcdpkqlk",
"lqxpgmafrpf"
]
}
| 2
|
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:
krmrdxjsjqiyu jigioaxlxkdtf
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 38,
"string_length": 14,
"words": [
"krmrdxjsjqiyu",
"jigioaxlxkdtf"
]
}
| 2
|
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:
omlqzexdwjnuexwiqx fudlbehrvwycihvolh
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 39,
"string_length": 18,
"words": [
"omlqzexdwjnuexwiqx",
"fudlbehrvwycihvolh"
]
}
| 2
|
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:
vbbqgbxfiemp mllhvrswyfkx
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 40,
"string_length": 12,
"words": [
"vbbqgbxfiemp",
"mllhvrswyfkx"
]
}
| 2
|
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:
zysaewwsfrmlzqbdz cjsqyjpsovteczdxc
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 41,
"string_length": 17,
"words": [
"zysaewwsfrmlzqbdz",
"cjsqyjpsovteczdxc"
]
}
| 2
|
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:
sdnelxummvhujn afenruyostwype
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 42,
"string_length": 14,
"words": [
"sdnelxummvhujn",
"afenruyostwype"
]
}
| 2
|
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:
pezinmjuzjufd eyjqntxbjabzc
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 43,
"string_length": 13,
"words": [
"pezinmjuzjufd",
"eyjqntxbjabzc"
]
}
| 2
|
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:
odcwvwppfd hbtbouffmb
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 44,
"string_length": 10,
"words": [
"odcwvwppfd",
"hbtbouffmb"
]
}
| 2
|
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:
mgkomkkpdhlu zbqrziijmckp
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 45,
"string_length": 12,
"words": [
"mgkomkkpdhlu",
"zbqrziijmckp"
]
}
| 2
|
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:
oavdynypuzonfwpz ldxusfmqjrlfnyqr
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 46,
"string_length": 16,
"words": [
"oavdynypuzonfwpz",
"ldxusfmqjrlfnyqr"
]
}
| 2
|
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:
kycfekncifz qupjiqapgpd
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 47,
"string_length": 11,
"words": [
"kycfekncifz",
"qupjiqapgpd"
]
}
| 2
|
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:
liwriwggrctsc rktgktnngoyvg
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 48,
"string_length": 13,
"words": [
"liwriwggrctsc",
"rktgktnngoyvg"
]
}
| 2
|
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:
nqqzzzzgere rjubbbbytft
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 49,
"string_length": 11,
"words": [
"nqqzzzzgere",
"rjubbbbytft"
]
}
| 2
|
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:
mbgxiqlcnsdiqtlt fwhzkbvxrstkqeve
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 50,
"string_length": 16,
"words": [
"mbgxiqlcnsdiqtlt",
"fwhzkbvxrstkqeve"
]
}
| 2
|
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:
tprqpbiupanhaxxjl iclacystcmzvfeejn
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 51,
"string_length": 17,
"words": [
"tprqpbiupanhaxxjl",
"iclacystcmzvfeejn"
]
}
| 2
|
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:
gfnrfumfdrzbntfza mdfidesduilkfcdlt
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 52,
"string_length": 18,
"words": [
"gfnrfumfdrzbntfza",
"mdfidesduilkfcdlt"
]
}
| 2
|
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:
tblyueabeiueaapgrq fpdsliupytlyuurgkn
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 53,
"string_length": 18,
"words": [
"tblyueabeiueaapgrq",
"fpdsliupytlyuurgkn"
]
}
| 2
|
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:
neokqacorybimz uzsdfgrshxcbeq
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 54,
"string_length": 15,
"words": [
"neokqacorybimz",
"uzsdfgrshxcbeq"
]
}
| 2
|
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:
rsdxdtrdczno bkfsfmbfxiyt
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 55,
"string_length": 13,
"words": [
"rsdxdtrdczno",
"bkfsfmbfxiyt"
]
}
| 2
|
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:
sfltmbesadxwxws isexzwvildjxjoi
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 56,
"string_length": 15,
"words": [
"sfltmbesadxwxws",
"isexzwvildjxjoi"
]
}
| 2
|
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:
ujygvkclfbhyzqi lqcabrxgniycuhk
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 57,
"string_length": 16,
"words": [
"ujygvkclfbhyzqi",
"lqcabrxgniycuhk"
]
}
| 2
|
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:
xktfbmcgnow ljuwzpaskmq
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 58,
"string_length": 12,
"words": [
"xktfbmcgnow",
"ljuwzpaskmq"
]
}
| 2
|
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:
mznejloceqzxeelbjah iskteymrtcsjtcyoehq
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 59,
"string_length": 19,
"words": [
"mznejloceqzxeelbjah",
"iskteymrtcsjtcyoehq"
]
}
| 2
|
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:
rmniqwfitmuq lhoajtrskhxj
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 60,
"string_length": 12,
"words": [
"rmniqwfitmuq",
"lhoajtrskhxj"
]
}
| 2
|
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:
kectaznlyispynuwt htwzjipcqdeaqxovz
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 61,
"string_length": 17,
"words": [
"kectaznlyispynuwt",
"htwzjipcqdeaqxovz"
]
}
| 2
|
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:
tjokkbqycr xudlwsvqhc
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 62,
"string_length": 10,
"words": [
"tjokkbqycr",
"xudlwsvqhc"
]
}
| 2
|
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:
bdvoqqxprfznkuvgou zeoigglmqrxycvodiv
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 63,
"string_length": 19,
"words": [
"bdvoqqxprfznkuvgou",
"zeoigglmqrxycvodiv"
]
}
| 2
|
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:
vsberzwtgaqrlcro aqcknbwmtfinvlnz
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 64,
"string_length": 17,
"words": [
"vsberzwtgaqrlcro",
"aqcknbwmtfinvlnz"
]
}
| 2
|
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:
xynlymgukoqyt hijmazisoykav
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 65,
"string_length": 13,
"words": [
"xynlymgukoqyt",
"hijmazisoykav"
]
}
| 2
|
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:
chgewhqkepcm rxucyfqzcwrj
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 66,
"string_length": 12,
"words": [
"chgewhqkepcm",
"rxucyfqzcwrj"
]
}
| 2
|
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:
zsjliczvfwvov fzkeoqfrjbrcr
|
True
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 67,
"string_length": 14,
"words": [
"zsjliczvfwvov",
"fzkeoqfrjbrcr"
]
}
| 2
|
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:
ufkakcfdvtpcyadf ynmomrnrustraobn
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 68,
"string_length": 16,
"words": [
"ufkakcfdvtpcyadf",
"ynmomrnrustraobn"
]
}
| 2
|
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:
oefbaqkmqfhhj aurlysfgnrmmo
|
False
|
{
"difficulty": {
"string_length": [
10,
19
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 69,
"string_length": 13,
"words": [
"oefbaqkmqfhhj",
"aurlysfgnrmmo"
]
}
| 2
|
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:
tjyptmiscjvmejzbdbqfgexpchrub qybhqcndoyzcgywfaftmlgihoprkf
|
True
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 0,
"string_length": 30,
"words": [
"tjyptmiscjvmejzbdbqfgexpchrub",
"qybhqcndoyzcgywfaftmlgihoprkf"
]
}
| 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 following two strings are isomorphic, or False otherwise:
xznbzuudfrxfhspyqlx puxzukkotnptvfgsilp
|
True
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 1,
"string_length": 20,
"words": [
"xznbzuudfrxfhspyqlx",
"puxzukkotnptvfgsilp"
]
}
| 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 following two strings are isomorphic, or False otherwise:
kqjdpdpqxkwikxknroupvipgpa zjeqtqtjozmiuozwcuptsitytn
|
False
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 2,
"string_length": 26,
"words": [
"kqjdpdpqxkwikxknroupvipgpa",
"zjeqtqtjozmiuozwcuptsitytn"
]
}
| 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 following two strings are isomorphic, or False otherwise:
gwdlpbwtuybtyecyksoropf cizdjvipqevpeahesywbwjn
|
True
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 3,
"string_length": 24,
"words": [
"gwdlpbwtuybtyecyksoropf",
"cizdjvipqevpeahesywbwjn"
]
}
| 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 following two strings are isomorphic, or False otherwise:
ijvimdbadywohrlctmuf krpkszjczxhvbnwifslq
|
True
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 4,
"string_length": 21,
"words": [
"ijvimdbadywohrlctmuf",
"krpkszjczxhvbnwifslq"
]
}
| 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 following two strings are isomorphic, or False otherwise:
mighubnpgbldifjvzsruoixj gekjsfdckfbieqwyvomshetw
|
True
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 5,
"string_length": 25,
"words": [
"mighubnpgbldifjvzsruoixj",
"gekjsfdckfbieqwyvomshetw"
]
}
| 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 following two strings are isomorphic, or False otherwise:
mmwexqblexvvyedfylnysmwoopg ttnxjpzwxjkkaxcfawlagtnhhym
|
True
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 6,
"string_length": 28,
"words": [
"mmwexqblexvvyedfylnysmwoopg",
"ttnxjpzwxjkkaxcfawlagtnhhym"
]
}
| 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 following two strings are isomorphic, or False otherwise:
pxvnxtytsvjihjtypfor eksckiwitshrdhiweafy
|
True
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 7,
"string_length": 21,
"words": [
"pxvnxtytsvjihjtypfor",
"eksckiwitshrdhiweafy"
]
}
| 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 following two strings are isomorphic, or False otherwise:
rjlconcycpojeouackobafjogkp ohekyrkvgmyhcyazkjyfzdhyujm
|
False
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 8,
"string_length": 27,
"words": [
"rjlconcycpojeouackobafjogkp",
"ohekyrkvgmyhcyazkjyfzdhyujm"
]
}
| 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 following two strings are isomorphic, or False otherwise:
zmjmgmzmvonhhkpmgsnqurb xlqlglblhrvoodzlgxvkywa
|
False
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 9,
"string_length": 23,
"words": [
"zmjmgmzmvonhhkpmgsnqurb",
"xlqlglblhrvoodzlgxvkywa"
]
}
| 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 following two strings are isomorphic, or False otherwise:
tlfybqzshdcqljgxfpucinm nisvfgdxjmkgioewszukrql
|
True
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 10,
"string_length": 24,
"words": [
"tlfybqzshdcqljgxfpucinm",
"nisvfgdxjmkgioewszukrql"
]
}
| 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 following two strings are isomorphic, or False otherwise:
evlvrtsrtytsqnrjejyyrvxvnsoyc ghxhadvadodvcfajgjooahwhrvnof
|
False
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 11,
"string_length": 29,
"words": [
"evlvrtsrtytsqnrjejyyrvxvnsoyc",
"ghxhadvadodvcfajgjooahwhrvnof"
]
}
| 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 following two strings are isomorphic, or False otherwise:
wljotesbzmvfmyagihrdt aunrjvixcemfesyodzwqj
|
True
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 12,
"string_length": 22,
"words": [
"wljotesbzmvfmyagihrdt",
"aunrjvixcemfesyodzwqj"
]
}
| 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 following two strings are isomorphic, or False otherwise:
etcqcrlhvomasovkijhjc pebibxolvrsmfovdwzlzb
|
False
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 13,
"string_length": 21,
"words": [
"etcqcrlhvomasovkijhjc",
"pebibxolvrsmfovdwzlzb"
]
}
| 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 following two strings are isomorphic, or False otherwise:
awmkpuoidshyjpueezkhynxveqm nbjyucrwvfdqpucoolydqsmtoej
|
True
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 14,
"string_length": 28,
"words": [
"awmkpuoidshyjpueezkhynxveqm",
"nbjyucrwvfdqpucoolydqsmtoej"
]
}
| 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 following two strings are isomorphic, or False otherwise:
ujowadvrhatmauyyyhm dfngjvbmpjhejdiiipe
|
True
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 15,
"string_length": 20,
"words": [
"ujowadvrhatmauyyyhm",
"dfngjvbmpjhejdiiipe"
]
}
| 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 following two strings are isomorphic, or False otherwise:
teezrbzbuwpllxzmnsbnxysqwquu ossjemjmfxdyypjgkcmkptcqxqff
|
True
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 16,
"string_length": 29,
"words": [
"teezrbzbuwpllxzmnsbnxysqwquu",
"ossjemjmfxdyypjgkcmkptcqxqff"
]
}
| 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 following two strings are isomorphic, or False otherwise:
adwdndllbwxtovpasowcec gpxprpjjoxeblzigalxdtd
|
True
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 17,
"string_length": 23,
"words": [
"adwdndllbwxtovpasowcec",
"gpxprpjjoxeblzigalxdtd"
]
}
| 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 following two strings are isomorphic, or False otherwise:
yjzsnyhjafywvuwydjwbmcy qnicvqsndwqypkyqjnytemq
|
True
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 18,
"string_length": 24,
"words": [
"yjzsnyhjafywvuwydjwbmcy",
"qnicvqsndwqypkyqjnytemq"
]
}
| 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 following two strings are isomorphic, or False otherwise:
eoobdrczqavaqodfyhwozouxaq bmmhnugrfdcdfmnvoyamrmqxdf
|
True
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 19,
"string_length": 27,
"words": [
"eoobdrczqavaqodfyhwozouxaq",
"bmmhnugrfdcdfmnvoyamrmqxdf"
]
}
| 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 following two strings are isomorphic, or False otherwise:
jwrvqgqplvdikkcmiduwozwwufku gtlvdbdsavwyqqkiywetmzttenqe
|
True
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 20,
"string_length": 29,
"words": [
"jwrvqgqplvdikkcmiduwozwwufku",
"gtlvdbdsavwyqqkiywetmzttenqe"
]
}
| 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 following two strings are isomorphic, or False otherwise:
gnhcnecatsnyjusukjxmfrkeps acbzcizuxgcmkdgdfkoqtwfisg
|
True
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 21,
"string_length": 27,
"words": [
"gnhcnecatsnyjusukjxmfrkeps",
"acbzcizuxgcmkdgdfkoqtwfisg"
]
}
| 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 following two strings are isomorphic, or False otherwise:
umdgbbxkcztchcqiigjedxzhew utvbhhyqmndmzmcssbjlvynzle
|
True
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 22,
"string_length": 27,
"words": [
"umdgbbxkcztchcqiigjedxzhew",
"utvbhhyqmndmzmcssbjlvynzle"
]
}
| 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 following two strings are isomorphic, or False otherwise:
vzvzmajmzgalkgpvtbyriruaj yayainciaqnbsqvylfgeteknc
|
True
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 23,
"string_length": 26,
"words": [
"vzvzmajmzgalkgpvtbyriruaj",
"yayainciaqnbsqvylfgeteknc"
]
}
| 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 following two strings are isomorphic, or False otherwise:
jzgpqvbktfavphrdezun bmknapchytdpnlzfxmeu
|
True
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 24,
"string_length": 21,
"words": [
"jzgpqvbktfavphrdezun",
"bmknapchytdpnlzfxmeu"
]
}
| 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 following two strings are isomorphic, or False otherwise:
ffgflgesqsqzplwhhayv ggogrohbmbmqpryddnkz
|
True
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 25,
"string_length": 21,
"words": [
"ffgflgesqsqzplwhhayv",
"ggogrohbmbmqpryddnkz"
]
}
| 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 following two strings are isomorphic, or False otherwise:
tpifgomqasposceedfzhymdiaey noyfbaztphoahkjjwfiuxzwyppx
|
False
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 26,
"string_length": 27,
"words": [
"tpifgomqasposceedfzhymdiaey",
"noyfbaztphoahkjjwfiuxzwyppx"
]
}
| 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 following two strings are isomorphic, or False otherwise:
bcrbbmzivmmbzyhfyewkxvephugrs loillankraalnvcwvfptxrfsczbiy
|
True
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 27,
"string_length": 30,
"words": [
"bcrbbmzivmmbzyhfyewkxvephugrs",
"loillankraalnvcwvfptxrfsczbiy"
]
}
| 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 following two strings are isomorphic, or False otherwise:
zypnukbjavxhzpclwdzx gepxyfmicuqagpdklwgq
|
True
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": true,
"solvable": true,
"source_dataset": "isomorphic_strings",
"source_index": 28,
"string_length": 21,
"words": [
"zypnukbjavxhzpclwdzx",
"gepxyfmicuqagpdklwgq"
]
}
| 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 following two strings are isomorphic, or False otherwise:
bgxgcvuvdrxyasudhiyoznjvy dlqlmcickaqrngikjfrwszbqr
|
False
|
{
"difficulty": {
"string_length": [
20,
30
]
},
"solution": false,
"solvable": false,
"source_dataset": "isomorphic_strings",
"source_index": 29,
"string_length": 25,
"words": [
"bgxgcvuvdrxyasudhiyoznjvy",
"dlqlmcickaqrngikjfrwszbqr"
]
}
| 3
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.