API Response (JSON)
{
"problem": {
"name": "Almost Equal",
"description": {
"content": "You are given $N$ strings $S_1,S_2,\\dots,S_N$, each of length $M$, consisting of lowercase English letter. Here, $S_i$ are pairwise distinct. Determine if one can rearrange these strings to obtain a n",
"description_type": "Markdown"
},
"platform": "AtCoder",
"limit": {
"time_limit": 2000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "abc302_c"
},
"statements": [
{
"statement_type": "Markdown",
"content": "You are given $N$ strings $S_1,S_2,\\dots,S_N$, each of length $M$, consisting of lowercase English letter. Here, $S_i$ are pairwise distinct.\nDetermine if one can rearrange these strings to obtain a n...",
"is_translate": false,
"language": "English"
}
]
}