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: TiNWqIoJFeiZf, MLeNWqIoJSfd
Output:
| [
"NWqIoJ"
] | task600-664ca9bac4214c50b906cf74a2a94d73 |
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: RusMOjSNznHpiBtJOtwyGyS, jVdMOjSNznHpilzrgHXF
Output:
| [
"MOjSNznHpi"
] | task600-a0b3f3fc42694518932bd493eddaefcb |
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: zMUNxzvav, jQUNxzzVTG
Output:
| [
"UNxz"
] | task600-c922dfb80cdf4c0f8ee600e2671fa923 |
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: ewedRnAUqlvKJHpf, FaatrPNrxWRnAUqlvKJHCfxPARK
Output:
| [
"RnAUqlvKJH"
] | task600-780114045ba2492f8b5d55c14c71ab12 |
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: BSukJrvSqo, OhlJrvSDP
Output:
| [
"JrvS"
] | task600-394def1bc90f4be4bca2cc93545e6515 |
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: jYwtILMCFYkCfGMoxdil, WrGZwhYkCfGMoxdUeC
Output:
| [
"YkCfGMoxd"
] | task600-16a72690516a4373bae8097ad459e0f9 |
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: dlzequypR, Puequqv
Output:
| [
"equ"
] | task600-5e1c591fd35d4a798b333dba99a57ce7 |
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: FCcmzF, URcmdo
Output:
| [
"cm"
] | task600-3818d8ce5f1142b885c4c6b987258f26 |
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: RuBbMorwcEDtAioRwbpZk, jdorwcEDtAibOukt
Output:
| [
"orwcEDtAi"
] | task600-c96f45e0a8e1478ca47ac5b4d6486f2c |
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: cAqrJgAmLCgF, zCzJgAmLChJJ
Output:
| [
"JgAmLC"
] | task600-95438bdcbbe4451482f098691b57f0f2 |
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: fRdmMumy, XKmmMuQv
Output:
| [
"mMu"
] | task600-280a9051dab44984b31c9f1fe59f97f9 |
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: wNiHcaiUPHnjp, aSTmjcaiUPHFzOu
Output:
| [
"caiUPH"
] | task600-d9559792ae47462f8f6a9f33b2c20de6 |
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: KTAFonizDqCVvucpJWrItdw, rfFonizDqCVvYbGhb
Output:
| [
"FonizDqCVv"
] | task600-7a66a0010f164fa792e6b27d8c90df8f |
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: vceqKmzD, hpqKmTL
Output:
| [
"qKm"
] | task600-10f10946fb7146999d6cb4b1ffc03725 |
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: AlreZAYDhEQGLeeo, FxPEyeZAYDhEQuPezVK
Output:
| [
"eZAYDhEQ"
] | task600-56182a226a524b34a3058fa2582945a7 |
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: CUCatjSmlIPtkPRhab, lnFPatjSmlIPCKNR
Output:
| [
"atjSmlIP"
] | task600-4f2ff433b2f645a5807a7ac09d1cf71d |
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: kJtyNQQTLwdRvRD, zuVgCQQTLwIBZVW
Output:
| [
"QQTLw"
] | task600-ab7d127f89cf4b30ad1e09d1e8dae51e |
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: EpTbBxx, AVDTbBbMU
Output:
| [
"TbB"
] | task600-e44fdb3703db4b9897a8dcebc3798215 |
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: eKLYbMdovyCWAGBytq, UErWNxvHvyCWAGBycf
Output:
| [
"vyCWAGBy"
] | task600-ff9d7c71a6ae46f99c0caf38d48d2124 |
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: cCDTMXjGMNikONun, jpcMXjGMNizBEWQzT
Output:
| [
"MXjGMNi"
] | task600-f0d56d1be0c94454a3b82072d69ed25e |
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: YxoeVbehdmOLkIjOJWBH, zbeSdmOLkIjOJiWNTxc
Output:
| [
"dmOLkIjOJ"
] | task600-a368bba9d5c64f17a8ebfab189f2d534 |
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: ZvRxZxUOyjaalK, YyqHqHRxZxUOyiTHa
Output:
| [
"RxZxUOy"
] | task600-f587c70185d046f49fe4715707a43b76 |
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: VkwZdwzmJvPjxUfTqxkEmipjVbawg, ONhULPqPjxUfTqxkEcgznM
Output:
| [
"PjxUfTqxkE"
] | task600-1f46e705354446929e8db929a0ecd0ee |
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: WAIjytb, VinIjyieI
Output:
| [
"Ijy"
] | task600-165930bcb02644b2bdd12dc0b5038b37 |
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: zGsfDAQZXxRtsCfftF, bERHNDcKAQZXxRtsCBsUvo
Output:
| [
"AQZXxRtsC"
] | task600-af8c66ece783489d965594b61df9d213 |
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: qRQGhcP, agkQGhEb
Output:
| [
"QGh"
] | task600-242ed5189002464b9e91b8caaf26ef4c |
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: GaJozvDHULRlhNJIcKZSpuV, FJFqULRlhNJIcgE
Output:
| [
"ULRlhNJIc"
] | task600-fde056c4c4814714bdfa435a39fb98c4 |
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: NMBdDNTSoFTvyvCqjkXq, vEsBdDNTSoFTKrN
Output:
| [
"BdDNTSoFT"
] | task600-4b63196f66cb46e1a6ad96b5a04ffd38 |
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: fFuCaSTwKyveGb, dmsLaSTwKyvxhckuT
Output:
| [
"aSTwKyv"
] | task600-16bf1596673b41098a244d9f76550f14 |
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: JMLwPZvMixTFeTtwZZ, AcwPwPZvMixTdouHLK
Output:
| [
"wPZvMixT"
] | task600-73758d52e9614f5f9e25e88e802511fa |
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: SEUuKAnUHtyZwnScx, cpWAnUHtyZyWiaH
Output:
| [
"AnUHtyZ"
] | task600-29329804391d4502b6f61958fa326fe9 |
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: nREMfHuYsSMvAq, AtgMfHuYsFNu
Output:
| [
"MfHuYs"
] | task600-0e48e0d6f4644c248b22459efeca7ce2 |
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: BaKwTnJGBGszlmoTuI, bfsHJGBGszlMJm
Output:
| [
"JGBGszl"
] | task600-ebd97bfa04ef436fbd08a82804588cb4 |
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: cvmkZSJtUVzHRmQEv, QnEKSJtUVzdsE
Output:
| [
"SJtUVz"
] | task600-4575b37fd2de42afb788d88be6f1bd33 |
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: UFXYhmztGbkapq, ZDbrHhmztGbkaFFqvp
Output:
| [
"hmztGbka"
] | task600-66cf169b6a7a4d6da7016a8d806f500d |
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: spGRUmIYuGl, qkqRUmItqU
Output:
| [
"RUmI"
] | task600-131b6ff360be402d9e228d59d0bb33a6 |
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: aYlWyuceX, GfFWOlWyucTByng
Output:
| [
"lWyuc"
] | task600-822cf945bc394f88ac7f861c8ebdd670 |
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: NLSgPe, NCSgiC
Output:
| [
"Sg"
] | task600-1a4fa608780a4716ae84f4b860430dc9 |
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: lvoXZsaUHeA, iXOrZsaUHhicSQ
Output:
| [
"ZsaUH"
] | task600-03eccdd1ae9d4d93a58e489a50f3d8b6 |
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: PAJwhpzXajwvhGGyqJKq, kiCxbjrJwhpzXajwxpomUot
Output:
| [
"JwhpzXajw"
] | task600-f01cacb668984b7a8e8149bc8249b10e |
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: aBIhVTphEKvSukceVnI, jGeBJlphEKvSuyau
Output:
| [
"phEKvSu"
] | task600-8a9c0ac30f544acd97bda91a23c6719a |
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: VjcupMGaIZmvBXANj, XWJSqmcupMGaIZmymkKWOdfh
Output:
| [
"cupMGaIZm"
] | task600-f6134f6783ff4480b58742fe5a9675f1 |
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: gXzvUhEeJKcrHdlBUFL, zzhjjRveJKcrHdQiyqQ
Output:
| [
"eJKcrHd"
] | task600-bb85f65f621c40e89aff58db1c58ca6a |
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: KgzodQSzCtlPFjPAbtwpGb, PIRkeLaSzCtlPFjqC
Output:
| [
"SzCtlPFj"
] | task600-ef2e6b5dff634d338a7ac5cbd35f7080 |
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: hnONrzSeF, uYNrzSpoId
Output:
| [
"NrzS"
] | task600-c5fb5f5422854bcdba6fc8d6f775e0e5 |
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: leHhSMF, fTHhSoN
Output:
| [
"HhS"
] | task600-becddaaa7c7943c6b7cf1c28739f679a |
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: HfAnojaUOipAmMEheXQA, JraUOipAmMxEpn
Output:
| [
"aUOipAmM"
] | task600-ad74d1dd4d36497396fab12f42565d24 |
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: ZxouxhkRoiziZsNk, NlRdowFefKuxhkRoiziZAlTM
Output:
| [
"uxhkRoiziZ"
] | task600-930cb939c34f44a28394273dab5a584c |
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: HYeeSLzMkIZ, ItceSLzxPBx
Output:
| [
"eSLz"
] | task600-112824d5083d44c08fecd11c3afa3d42 |
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: LpriunJxngYhkdiHz, mokOaiunJxngYiU
Output:
| [
"iunJxngY"
] | task600-12a0c7428b814cdb8c4e73298be6351e |
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: sdldNf, uvldla
Output:
| [
"ld"
] | task600-e0a9a62c5474441a81774bb61deed472 |
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: UbsxnWgazAWa, IgsdlnWgazioaEq
Output:
| [
"nWgaz"
] | task600-ee179f7eb478440cbbbf8a62f29a0da6 |
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: mrdahEAton, bvEhEAtjFI
Output:
| [
"hEAt"
] | task600-efa0a9255d02443294d59a07ca9b1d3c |
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: KULgSG, pGLgLf
Output:
| [
"Lg"
] | task600-1423ad6a034d4f6c9bac6b99a90793e4 |
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: xGJHomhM, bMJHoKAJ
Output:
| [
"JHo"
] | task600-dddf7aa10ced454497b0fc61d442302c |
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: bNrItRSJYlbKBslNhApOhI, rLWtbtRSJYlbKBsnWUCOK
Output:
| [
"tRSJYlbKBs"
] | task600-41d74acf67ae496fb2ccc0e3488db30d |
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: QnGizMfdbnonWrFPxGX, EwmXkbnonWrFPxWBvxXtDuF
Output:
| [
"bnonWrFPx"
] | task600-5789d70db71541759b28b5ef9197d436 |
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: fgWHZBavxrBGLrbstMHRQd, kXSZFsRVvxrBGLrbsXhKke
Output:
| [
"vxrBGLrbs"
] | task600-3d86d2c6472e46c5a05f963725478ed4 |
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: wHnQDYtpOQ, xOinQDYtyBl
Output:
| [
"nQDYt"
] | task600-bd33e09d17cb4187882839571900b29e |
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: IQGvZorspoCObtdYRgoqml, CJIcspoCObtdYDuu
Output:
| [
"spoCObtdY"
] | task600-628d7e0d0e3240ed9519aec0e81df0f5 |
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: zLdcdOIToNnzYgY, GlVwTOIToNBUp
Output:
| [
"OIToN"
] | task600-b860ba17ad3c4bfc9fc0114babcae1af |
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: NLgxIfPaSn, VdaIfPadkZF
Output:
| [
"IfPa"
] | task600-24ab8ce65a3141d087cd7940b3457b56 |
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: vZFURFIiDNUFAfSIgFTG, RCDoGwAIiDNUFATv
Output:
| [
"IiDNUFA"
] | task600-08814142c3224ec2991d75a0c3177376 |
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: tsQXNTqBMyctpdl, IDhNNTqBMyckbtD
Output:
| [
"NTqBMyc"
] | task600-e3174206467b400c85a82c17478def36 |
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: FssbkkWbYRbrCrEqeCOtyHm, PCTCcAaPVWbYRbrCrENT
Output:
| [
"WbYRbrCrE"
] | task600-cc4175784e7f4fbc926bc9aaf8b5dbb2 |
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: aIZIsqL, wxSZIsEnO
Output:
| [
"ZIs"
] | task600-f349542ce9d3472a8e322926ca365ecb |
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: wbWnxqwCasPIEMzHjL, qsJnxqwCasPILKlQEzLe
Output:
| [
"nxqwCasPI"
] | task600-27eeb288a6d34e188f698b6ed02c057f |
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: hKqttOKfiw, gXqmttOKhTY
Output:
| [
"ttOK"
] | task600-bd1266121dfa4cbbae7dbb1c4baf352d |
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: wShkkdBxJkjWqu, haIoFRqhkkdBxJPXGqnd
Output:
| [
"hkkdBxJ"
] | task600-757eaf16be2a4f98878e12c08a1cbfa3 |
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: zIhaSKGFL, dWMjaSKGeE
Output:
| [
"aSKG"
] | task600-50f507bdf2e14c0d9462c8beca364203 |
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: CiTNsbepy, DFNsbeZl
Output:
| [
"Nsbe"
] | task600-1539cd08e7ba4b0bb9c345859b7c9411 |
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: jhcBaxuxFgfqXrywbiOATsKCppA, wpcgfqXrywbiOMXHuHaiKV
Output:
| [
"gfqXrywbiO"
] | task600-0497395eb98249929ea2e24bec85cc4b |
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: dNAJFV, vhAJjS
Output:
| [
"AJ"
] | task600-b420849a543a4fcc8bb6235679c8774d |
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: UphtIvaCftPxkMmiB, DnytIvaCftDR
Output:
| [
"tIvaCft"
] | task600-c381e08bb40045a99d525f2504538fa5 |
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: bMFkBRSX, adFkBRxbAH
Output:
| [
"FkBR"
] | task600-115c7fa2cb614f599e2e287e06290997 |
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: icmSTOMicOogfjpwo, BXUicOogfjplA
Output:
| [
"icOogfjp"
] | task600-7bbba7bfe27c42a3a95cf39a0e9e148b |
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: CAkMbH, CYkMvN
Output:
| [
"kM"
] | task600-4efb4e7f7ee246b19b6cc364db0d881f |
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: QCeKdd, RKeKIP
Output:
| [
"eK"
] | task600-3ab86f9fc104401097fb0fa50d58b569 |
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: qGtntTpd, AFdtntZrW
Output:
| [
"tnt"
] | task600-3e9c0ef051844b2a8f57087eb5fd3d32 |
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: cxGLpJjdekmBqERKhht, dzBdnJjdekmBqZZT
Output:
| [
"JjdekmBq"
] | task600-a28e6a59f6434762ab5cd0e2375816ff |
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: LkVrlH, lsVruR
Output:
| [
"Vr"
] | task600-49aaefd3dcda4f42a4e9ffdd341b1f0c |
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: wdzkBHsiDxqcYmq, pXFLUAokBHsiDxqcsSy
Output:
| [
"kBHsiDxqc"
] | task600-24b15344e0b9416aa3960bdf38fe3dbd |
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: NnCmCAFfYhNQZkrGJjkepJzd, WKColPSCAFfYhNQZkOL
Output:
| [
"CAFfYhNQZk"
] | task600-e0b8f2e14446441ba9de0e8c8b3ad3c2 |
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: fCEMaFSPKYZfoGMtvoFquo, PlMsAZfoGMtvoFqmYx
Output:
| [
"ZfoGMtvoFq"
] | task600-55698df393fd42d691652c0daf7fdb0b |
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: WPVhwndOpQPUEkil, YFGhwndOpQDxA
Output:
| [
"hwndOpQ"
] | task600-1b25e4a9f21041ef97cef46ab4ee5f20 |
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: MpwSpnhXQqIBcVdciH, dNhXQqIBUEob
Output:
| [
"hXQqIB"
] | task600-eb618e3ee9384d95935075dd0d130432 |
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: GbAFDwckfRAhg, ANswckfRYCd
Output:
| [
"wckfR"
] | task600-174d2210aa704bbcb97cb91556121401 |
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: lfELWaFtUWyPgCUOObFvWmySBGHTv, hqsXkyPgCUOObFvCHJIwZaX
Output:
| [
"yPgCUOObFv"
] | task600-deb9b749083f4989a8832c3bca61a1df |
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: doMHSFwGpdOucHxRK, ngFqGpdOucHZHuOE
Output:
| [
"GpdOucH"
] | task600-1322b9bf1621436cb77d5da14d622718 |
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: oCtWZYdkvZ, pkktWZYdEHMW
Output:
| [
"tWZYd"
] | task600-5cd3890179224c0fa048562090973f1d |
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: IKCKzvlKkQgLOJXClwNY, ToxlKkQgLOLxczocU
Output:
| [
"lKkQgLO"
] | task600-fc69c3bc60fe4582a9f83280c76607d3 |
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: AkYuNemHGBEDF, uluNemHGAycbWX
Output:
| [
"uNemHG"
] | task600-54389c44f28d46298478ae8670cc1e86 |
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: yRhGVkSKiutUZKgMfsH, DyTwSKiutUZKgTFPApvL
Output:
| [
"SKiutUZKg"
] | task600-99a0b4f3df9c48a69fc10e84caf8d93e |
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: RzYodr, FyYoeO
Output:
| [
"Yo"
] | task600-6750eed95b7b474a808889801f9003d5 |
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: LzYJIlSPzljE, urqIfaOJIlSPzlRr
Output:
| [
"JIlSPzl"
] | task600-c6edfb33bf374569bb71644b6aee14ea |
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: EbaKfRdeRHWE, QmDRKfRdeRHhi
Output:
| [
"KfRdeRH"
] | task600-759385a70bad427caeedae249aa80bb0 |
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: SAQELIOMhuAkBvGaxyq, XojHHzOMhuAkBTRgTOg
Output:
| [
"OMhuAkB"
] | task600-eec20050903346c1bcb46c3b9705a691 |
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: QmzCwkyuudyygzVhXFK, pwHiiWMkudyygzVhXPFpxNZ
Output:
| [
"udyygzVhX"
] | task600-71090293144f44c2ac5d62efaf559b72 |
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: FjohtyBUApMcKlZpoj, yQBBUApMcKgMXUt
Output:
| [
"BUApMcK"
] | task600-1c862c9100904786a23b42d66ccd4be3 |
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: FbwhRHmobWpxlTHf, uZpYKHmobWpxlTBECQrnT
Output:
| [
"HmobWpxlT"
] | task600-226930b3f36e48639a5665be3910f2e0 |
End of preview. Expand
in Dataset Viewer.
Dataset Card for Natural Instructions (https://github.com/allenai/natural-instructions) Task: task600_find_the_longest_common_substring_in_two_strings
Additional Information
Citation Information
The following paper introduces the corpus in detail. If you use the corpus in published work, please cite it:
@misc{wang2022supernaturalinstructionsgeneralizationdeclarativeinstructions,
title={Super-NaturalInstructions: Generalization via Declarative Instructions on 1600+ NLP Tasks},
author={Yizhong Wang and Swaroop Mishra and Pegah Alipoormolabashi and Yeganeh Kordi and Amirreza Mirzaei and Anjana Arunkumar and Arjun Ashok and Arut Selvan Dhanasekaran and Atharva Naik and David Stap and Eshaan Pathak and Giannis Karamanolakis and Haizhi Gary Lai and Ishan Purohit and Ishani Mondal and Jacob Anderson and Kirby Kuznia and Krima Doshi and Maitreya Patel and Kuntal Kumar Pal and Mehrad Moradshahi and Mihir Parmar and Mirali Purohit and Neeraj Varshney and Phani Rohitha Kaza and Pulkit Verma and Ravsehaj Singh Puri and Rushang Karia and Shailaja Keyur Sampat and Savan Doshi and Siddhartha Mishra and Sujan Reddy and Sumanta Patro and Tanay Dixit and Xudong Shen and Chitta Baral and Yejin Choi and Noah A. Smith and Hannaneh Hajishirzi and Daniel Khashabi},
year={2022},
eprint={2204.07705},
archivePrefix={arXiv},
primaryClass={cs.CL},
url={https://arxiv.org/abs/2204.07705},
}
More details can also be found in the following paper:
@misc{brüelgabrielsson2024compressserveservingthousands,
title={Compress then Serve: Serving Thousands of LoRA Adapters with Little Overhead},
author={Rickard Brüel-Gabrielsson and Jiacheng Zhu and Onkar Bhardwaj and Leshem Choshen and Kristjan Greenewald and Mikhail Yurochkin and Justin Solomon},
year={2024},
eprint={2407.00066},
archivePrefix={arXiv},
primaryClass={cs.DC},
url={https://arxiv.org/abs/2407.00066},
}
Contact Information
For any comments or questions, please email Rickard Brüel Gabrielsson
- Downloads last month
- 0