input
stringlengths 482
527
| output
sequencelengths 1
1
| id
stringlengths 40
40
|
|---|---|---|
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: hkrNjfriLXIPEyAkfbJgqsrAA, UnriLXIPEyAkWbvK
Output:
| [
"riLXIPEyAk"
] | task600-2f68afc9e713440dba22262cf7b5d8a1 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: ArfFgWwXmV, OrPZgWwXTvQq
Output:
| [
"gWwX"
] | task600-d08bd22da8e64883b7072be787b0a5e9 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: tAzhwxnsWAoQqgiv, XOSbRhwxnsWAqPrNJmC
Output:
| [
"hwxnsWA"
] | task600-9ced5240505248c0bab8951b2164a922 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: gxLvqt, siLvWk
Output:
| [
"Lv"
] | task600-d10bb709cb974904882b82a6d4311b19 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: psblwfTGoxjZP, lWQxlwfTGowRJ
Output:
| [
"lwfTGo"
] | task600-f6c76b912a5d494e8e83fa187b3856e9 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: BCLnQYNQiYrdW, WfYNQiYrnQxGnV
Output:
| [
"YNQiYr"
] | task600-439ed677f0ed4873aa050a82d68ad728 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: ijeRagTgttviIF, TUaeRagTgtIdbnmA
Output:
| [
"eRagTgt"
] | task600-eb5b897afaee4c2ead4492885f676acf |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: jnRbieLywfeIqtWvoBRVxxVwDB, vPIYfeIqtWvoBRQtEzpRi
Output:
| [
"feIqtWvoBR"
] | task600-df945e1e7b5044939e3acb6c04c2d194 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: kQSPVPxoCJozSm, fXcCHPxoCJrWIyQ
Output:
| [
"PxoCJ"
] | task600-6daf1b72b1e24a219222cc1c9e30e616 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: deSNWomhPTRNC, lDUVQueNWomhPTKOb
Output:
| [
"NWomhPT"
] | task600-f6911c004da248e884198a9a98f4a5de |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: aIdXhuhk, syMdXhOw
Output:
| [
"dXh"
] | task600-742de891b91e4f4581ae9240e5e23f9a |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: iZARjpoHdZMpvW, NMtJsOdARjpoHdZDgwhxA
Output:
| [
"ARjpoHdZ"
] | task600-33f5d1b7ec2f4db1833a174a0c283b1d |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: umXfmRnUgALpFAqBaKfNfo, aOAXWnUgALpFAqBmNpTCdj
Output:
| [
"nUgALpFAqB"
] | task600-4a9d4b925e2a4cfc98148f4083a900c1 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: PSFLZWbbdURhRRkoHJJu, TjucPzbdURhRRkzYEJ
Output:
| [
"bdURhRRk"
] | task600-1786e8a585564863bf08a1fe5bc06cd1 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: BMUqWsYximHhIVe, mWYximHhMb
Output:
| [
"YximHh"
] | task600-b3cc2e6086f04307a0b5ba1cec5b596a |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: mmDhYqPJC, qThYqxW
Output:
| [
"hYq"
] | task600-3c12b199f2a94b9f8941afca87b86d12 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: ZXHUbyjViqlaeFecvBIKmP, kdBlaeFecvBIKdWzoyzzdt
Output:
| [
"laeFecvBIK"
] | task600-fa8faaa6c15a4dd98ffae653d56b54c4 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: cfYzuJKUUuIYvjYznBj, eAjPKUUuIYvjjW
Output:
| [
"KUUuIYvj"
] | task600-4cd1b6d893f441fc80f7615d4660a872 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: VYcKNJPrmWlGDfaJuIS, jGxZcnVKNJPrmWlwTPWyfsD
Output:
| [
"KNJPrmWl"
] | task600-0a4bfb30922a40c7a69f572af215455d |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: cAfqpDnrFmAOcFrQRtfUyo, huJnrFmAOcFCLRSQbha
Output:
| [
"nrFmAOcF"
] | task600-829033718d60414b9c7a3317b33323f9 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: YSAbcyuk, MLnAbcLn
Output:
| [
"Abc"
] | task600-c11bfdc5577c4b1a9ed541c0bd6e9017 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: uyQwjU, tnQwHY
Output:
| [
"Qw"
] | task600-e65cf3d346994cff836dce96fc3a9f64 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: CTIGOMbKoJ, SibyGOMbqJ
Output:
| [
"GOMb"
] | task600-076b013e68154f7a8fbe49166406a6c6 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: epGFYw, MVGFRI
Output:
| [
"GF"
] | task600-875611bc684940e5a455b5fab53498c0 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: vvTNxP, OLTNkr
Output:
| [
"TN"
] | task600-9591081a000c4a9abd0a2b502610413d |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: uAiUbMfdctQBJx, PsyAlwJtUbMfdctQHPOOtnB
Output:
| [
"UbMfdctQ"
] | task600-2dc4c731cb0344b9a935e6adb531e9a1 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: QEEVsnbQIgrxaZmflaZ, dPSbljkdQIgrxaZmgVzMT
Output:
| [
"QIgrxaZm"
] | task600-9e4e8609e73140a2a5058e13cbcfd868 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: ivlIHjonItj, uyOIHjoezE
Output:
| [
"IHjo"
] | task600-24565b8a190a465a85b28c0833a3a9f5 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: RcXLokQVmlSC, pALokQVmHs
Output:
| [
"LokQVm"
] | task600-e66681c6cc6c4531a716f5bacad72a74 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: LBVBwnaqIq, iWHhBwnaUO
Output:
| [
"Bwna"
] | task600-eb7bd743d3914e4b9f36024e1a5d43e1 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: IFHqitRXfNbSKsej, qVJWXuitRXfNbSKXmT
Output:
| [
"itRXfNbSK"
] | task600-e7b3a2a6201c45a79496e76614050aea |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: DacHCEHbEjnhZUb, sJJocQlIQDcHCEHbEjnhUdB
Output:
| [
"cHCEHbEjnh"
] | task600-674022fbc18b41889fdec9c08e06ccf0 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: hwyUjxhgwdp, FVmqjxhgDp
Output:
| [
"jxhg"
] | task600-9aa8047f6d7a427c94045b4dc0ea7100 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: iYuUgULgqcAgd, kRNUgULgqFv
Output:
| [
"UgULgq"
] | task600-2dba9e475cff4564981bb95edfea7579 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: KpCIXT, KSCIlg
Output:
| [
"CI"
] | task600-dd98821233ca4315a2a05eacbc449124 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: XjKWrUMuJAsSDwGpxanvUglwm, GUnCMuJAsSDwGpiH
Output:
| [
"MuJAsSDwGp"
] | task600-fc27e4d149b54f1fa1149fda5637c11a |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: lWbFazUuVDU, anHFazUWgAx
Output:
| [
"FazU"
] | task600-6a12a84d0ac942688362e257a05cca4b |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: kBCyTXCoL, FgAZCyTXTsQ
Output:
| [
"CyTX"
] | task600-321b839cb51f496a80c1ef80da0f9b64 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: JJIGPF, JPIGLs
Output:
| [
"IG"
] | task600-1e99d77d61b34038b7302190d547d3b1 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: BoYCgSmVJXD, VZAjYCgSmKY
Output:
| [
"YCgSm"
] | task600-436d452b007b4fe1b01eccfd1ac71d78 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: uSiOvFEWmFauOHj, yzQZdOvFEWmXHB
Output:
| [
"OvFEWm"
] | task600-6634faf7d5f84d07a59abc3335962489 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: OaGhiynEDazUKivzvu, QZaUjUIIfGhiynEDazIXBEeML
Output:
| [
"GhiynEDaz"
] | task600-4925dd4e3a1f4da19441f340afc34586 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: LiiFMMLGfNHVnnga, beXMMLGfNHVsjdfdN
Output:
| [
"MMLGfNHV"
] | task600-d8940ac604374d1d83c8eb4c7db607f4 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: JZAiQSvahKE, eqsbXQSvahHRoG
Output:
| [
"QSvah"
] | task600-09f13440314942a9ade64ab8e699ef3b |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: JzOIMEEwAirONX, GNfCMEEwAiXzkVpg
Output:
| [
"MEEwAi"
] | task600-734aa0f0fb5d413c83511628e41a6d3f |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: dALxfuP, usLxfUuA
Output:
| [
"Lxf"
] | task600-3aa1c8eb805a43bea817777475158dc4 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: EuqnboptnqTZFToFFKlEWo, LonCptnqTZFTdl
Output:
| [
"ptnqTZFT"
] | task600-4e60ae09e4314d5cb59438951f935885 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: zGlyACfxZstAvIcezoOsKV, bxscXfxZstAvIcvZrmNai
Output:
| [
"fxZstAvIc"
] | task600-9b601a7270a94134a64c91dd7c327fb0 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: RinootTGLjbRGYznmBdH, oRMtTGLjbRGYzwEVHsjW
Output:
| [
"tTGLjbRGYz"
] | task600-1ca9965c975c4176b2b854b6ceb2259e |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: ufzpSysWeADYYb, ZaSysWeSbd
Output:
| [
"SysWe"
] | task600-61e16760b1dc42199751314c7de7ea6a |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: DYysQsvpYFLBQQIxsVdn, MPwQsvpYFLBQQNGMRlld
Output:
| [
"QsvpYFLBQQ"
] | task600-e5c9880b3b3b4b18841d6ec6e2825b31 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: LphdgdwOtHjHQ, saAIgdwOtkGq
Output:
| [
"gdwOt"
] | task600-cccd37ba6a0a4d908ee390635495278f |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: XfHxgBDwIHzWVgfirqeIJ, KGdYwIHzWVgfJGQWuCp
Output:
| [
"wIHzWVgf"
] | task600-21d0a2bdc2a24cd0a13ed775a7c54dcf |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: ZotCQacKk, hdgCQafi
Output:
| [
"CQa"
] | task600-ec9dff32d4194707915588952be79df4 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: mhCaDafGpuNUwIinnligqn, qyrTXaDafGpuNUwcUChsfaqbZ
Output:
| [
"aDafGpuNUw"
] | task600-9bb400be11a141f19f44906824047e14 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: rPygCfzmQsq, aKdXgCfzIEED
Output:
| [
"gCfz"
] | task600-d3155b2ec03a44ed8b138ce753caa9e7 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: xYLZxjqzOCqErhuhnwHOlGmuUO, NIKfbzLWqzOCqErhuhkaYoqygD
Output:
| [
"qzOCqErhuh"
] | task600-a117efbf64d44fbaad94aca19a445ff3 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: jMKWESgGtTvCxpetDCobhYt, nFrwGtTvCxpetDKzQUBV
Output:
| [
"GtTvCxpetD"
] | task600-38397665e5914688bdd8ed99da0127dc |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: ezhoqdFko, fcVcshoqdFwS
Output:
| [
"hoqdF"
] | task600-b17ef948a3ae4fa6b2c846393080b1be |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: PbfzQBJiYDVyAFn, rhfOhoQBJiYDyTeZt
Output:
| [
"QBJiYD"
] | task600-413cf19c1bce4b1d91d0273004f852ff |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: elwtGi, pJwtnR
Output:
| [
"wt"
] | task600-279165785767475aba61b6f019ce55fe |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: WMzPjbrRVG, bbqsjbrRKO
Output:
| [
"jbrR"
] | task600-7d48e86ce31647d99a4de19d96b89217 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: RmnskN, qDnsuu
Output:
| [
"ns"
] | task600-2c981d4acf3c4114adb670b09781758a |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: uDIzXBwmahKYyoMc, OLSBHIzXBwmaXMbgb
Output:
| [
"IzXBwma"
] | task600-169711386e7d400dbf85876194160525 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: UHiqqEIxVOS, luPDJpiqqEIxNOzwWe
Output:
| [
"iqqEIx"
] | task600-372f185b9e544d8d9f0b276761dc34c7 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: mmPTqaeNmrZcCZgRwTKxgGw, wZgDGpDKmrZcCZgRdwSo
Output:
| [
"mrZcCZgR"
] | task600-2f6f60f0862a4fbfa1988dacc657de6c |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: uDaqoOpUtLDdTGTO, ncIgBjDPqoOpUtLDdTNtiEyarDO
Output:
| [
"qoOpUtLDdT"
] | task600-5a243f2f705943fcbbecc2313259a87b |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: hDnqBfzJMLCmnaqkXBPHqYp, gOTqBDAbMLCmnaqkXrzeR
Output:
| [
"MLCmnaqkX"
] | task600-7990232196644f3990da2ee7d5a96178 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: gnhXIgIqgzVi, YITIgIqkEZ
Output:
| [
"IgIq"
] | task600-5867bdc8a95a4b02a4acb3238614df11 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: WuKpvvsQgdIWYoDfz, bWWFKpvvsQgdknPGoi
Output:
| [
"KpvvsQgd"
] | task600-20415d2802f14cb3b3540217c0590bba |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: PqUuVdCMkQnNtJYbpSGxu, thZeKgkMkQnNtJYIN
Output:
| [
"MkQnNtJY"
] | task600-66e053661cf9401fb688d39c2ab30f9b |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: qTwxSZvzhHZwJGlcmcUAM, YidzRsKvzhHZwJGlFMSmpqFbR
Output:
| [
"vzhHZwJGl"
] | task600-aa3f76bf4b2546d3a13ecc7d9a918fd5 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: DCIhXJkbYeGSgC, LnOXJkbYbGyUw
Output:
| [
"XJkbY"
] | task600-a9aaa522f8214fc0b6e66983038539ff |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: rbjaGECmvaxewuTWhzbnLI, OqKTzHcBpvaxewuTWhBgD
Output:
| [
"vaxewuTWh"
] | task600-c4e29a5de3c94aa6851c860aa217c22d |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: wEdtbdJLXctBi, NMaPLdtbdJLXctCJwyi
Output:
| [
"dtbdJLXct"
] | task600-270cc2aea7ea4801bf7fec02644de79f |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: xczxnHODxupVcxr, EPnHODxuAvxcZ
Output:
| [
"nHODxu"
] | task600-2a49dccfa28c4d32ae7f2dcc98f3212d |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: dHujgCLgmyumKVSFHiSDKbm, OfgmyumKVSuIouOFE
Output:
| [
"gmyumKVS"
] | task600-30627e0c231541c097d6662d368102cb |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: kdxAekzTkuVC, usGekzTCKI
Output:
| [
"ekzT"
] | task600-00119409a64c463cbc584a8400bc04bc |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: FFLQeJfdNjwhNUAt, ORPNenLQeJfdNjwRbFQbhBf
Output:
| [
"LQeJfdNjw"
] | task600-f51485d6321f49e2b2fdfa7268ea207e |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: AFPaOOktYZuGYP, jGFTPaOOktLEwc
Output:
| [
"PaOOkt"
] | task600-b39cfb4c79f54f0b9e03f061f0fd04a1 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: uegIKgHNbjyLQFpbJAPneF, EfQGxHNbjyLQFfQX
Output:
| [
"HNbjyLQF"
] | task600-fd45b51a4e10410a9bad4f1aeaea6b1e |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: hKfFpmS, ODwfFpxia
Output:
| [
"fFp"
] | task600-6575a975b7f44f9898d1b48b58c52915 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: puLsDgpIoplY, aFIDgpIkb
Output:
| [
"DgpI"
] | task600-7e4b256eef584581821108e1449cd19c |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: KVUizqVpuiaBrVe, VGXqVpuiaBpF
Output:
| [
"qVpuiaB"
] | task600-3955e70cf50a4a8e97399a385266d74f |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: lBmHvWQf, HPmHvnvz
Output:
| [
"mHv"
] | task600-f92eb069bb6542dfb74b12e3c1d9b90e |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: lVVcozLYaXMgUKUmg, zZYMELYaXMgAYBJNa
Output:
| [
"LYaXMg"
] | task600-8086eb012e534e8384cab91c1ef29fe0 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: YqChtrOThFEO, szTrOThFKaIM
Output:
| [
"rOThF"
] | task600-03667c12268c4952a2a8131922af4f12 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: WiwSimGjmwweSETJsEH, SFqmGjmwwewRDC
Output:
| [
"mGjmwwe"
] | task600-0495bdd231694456a3c7e61482ec76b0 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: IoOSEMPSqRD, eqSEMPSqYVSpg
Output:
| [
"SEMPSq"
] | task600-0f82fda16d0f49c4b477d9b345791ce3 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: fIOurDFyqqOO, tQEgurDFyCZ
Output:
| [
"urDFy"
] | task600-d89747d1094a49b5875844e259df9d85 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: ZPaoVL, Yoaoeo
Output:
| [
"ao"
] | task600-1c9ce19466fc4bb7b98ef38987073f76 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: OYTGuLStHtNkKjS, xchrLkGuLStHZySq
Output:
| [
"GuLStH"
] | task600-e0c7a2dd8dca428ca57985e21168c8cb |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: ZFExHRiisswAfzTUxahgy, ZqsgUSRiisswAfzTENg
Output:
| [
"RiisswAfzT"
] | task600-9d298b015a58481fa2d0e88972d9d1ec |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: ixTVfG, TbTVte
Output:
| [
"TV"
] | task600-f4fb78ba25774c4d998ea34522eb8a69 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: tAhWdyRqV, DNuWdylIE
Output:
| [
"Wdy"
] | task600-242fadbc041d47fa974391565e6068f2 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: QDwJKM, lkwJSl
Output:
| [
"wJ"
] | task600-deab47a6596348338ec9086972d36183 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: EPUxsZtt, KgxsZuXM
Output:
| [
"xsZ"
] | task600-9835fba885f34cc6b6413671c1530d58 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: kVIepSxMNnCBmwYGIc, sNnIepSxMNnCUaf
Output:
| [
"IepSxMNnC"
] | task600-f09d5176c50f46228a2449bd03bd3dd8 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: VjDXiT, XsDXcy
Output:
| [
"DX"
] | task600-baa323cd874647428413995ac3cbdbc8 |
Definition: In this task, you are given two strings A, B. Find the longest common substring in the strings A and B.
Positive Example 1 -
Input: PPdQTlHHTJEe, DydQTlHHVnmlLu
Output: dQTlHH
Positive Example 2 -
Input: cjnxmKkFdEcg, iHHnxmKkFeIjOoM
Output: nxmKkF
Negative Example 1 -
Input: bueLCZaiEBNGJlkwMBZ, gFmuwsEBNGJlkwpdySJVR
Output: EBNG
Negative Example 2 -
Input: bYubMFxyTqR, AcDbMFxSnI
Output: MF
Now complete the following example -
Input: mRVieYomZqJXaTDsShCyfPW, ifOAlnptmZqJXaTDsVMqY
Output:
| [
"mZqJXaTDs"
] | task600-18709fb6aa2c49b68d5c0ea222f2c4f9 |