problem stringlengths 79 311 | solution stringlengths 2 13 | win_rate float64 0 1 | completions listlengths 8 8 | rewards listlengths 8 8 | num_completions int64 8 8 |
|---|---|---|---|---|---|
Given two strings A = "VaXnrIhKOVJrdDyw" and B = "qvpohKOVJrdCyU", find the longest common substring present in both A and B. Return that substring exactly. | hKOVJrd | 0 | [
"<think>\nOkay, let's see. I need to find the longest common substring between the two strings A and B. Both strings are given here. Let me write them down again to make sure I have them right.\n\nA is \"VaXnrIhKOVJrdDyw\" and B is \"qvpohKOVJrdCyU\". Hmm, so I need to find the longest substring that exists in both... | [
0,
0,
0,
0,
0,
0,
0,
0
] | 8 |
Given two strings A = niFLRdkmOC and B = GvXLRdkjF, find the longest common substring (case-sensitive). Return only the substring. | LRdk | 0 | [
"<think>\nOkay, let's see. I need to find the longest common substring between the two strings A and B. The strings given are A = \"niFLRdkmOC\" and B = \"GvXLRdkjF\". First, I should make sure I understand what a substring is. A substring is a sequence of characters that appear consecutively in the string. And sin... | [
0,
0,
0,
0,
0,
0,
0,
0
] | 8 |
"Given two strings A and B, find the longest common substring that appears in both. A: VCBpjcgVaeNLa(...TRUNCATED) | eNLaBqFJn | 0 | ["<think>\nOkay, so I need to find the longest common substring between the two strings A and B. Let(...TRUNCATED) | [
0,
0,
0,
0,
0,
0,
0,
0
] | 8 |
"Given two strings A and B: A = \"UAwpcrfwh\" and B = \"KWipcrXtX\". Find the longest common substri(...TRUNCATED) | pcr | 0.125 | ["<think>\nOkay, let's see. I need to find the longest common substring between the two strings A an(...TRUNCATED) | [
0,
0,
0,
1,
0,
0,
0,
0
] | 8 |
"Given two strings A and B, find their longest common substring. A = uCrwIVczObxmJbkIRcvGT, B = bCpE(...TRUNCATED) | ObxmJbkI | 0 | ["<think>\nOkay, let's try to find the longest common substring between the two strings A and B. The(...TRUNCATED) | [
0,
0,
0,
0,
0,
0,
0,
0
] | 8 |
"Given two strings A and B, find the longest common substring (a contiguous sequence of characters t(...TRUNCATED) | NILsJVOl | 0.125 | ["<think>\nOkay, let's see. I need to find the longest common substring between the two strings A an(...TRUNCATED) | [
0,
1,
0,
0,
0,
0,
0,
0
] | 8 |
"Given two strings A and B, find the longest common substring that appears in both. A = \"ThCrPenVeS(...TRUNCATED) | MZZHdOOitU | 0 | ["<think>\nOkay, let's see. I need to find the longest common substring between the two strings A an(...TRUNCATED) | [
0,
0,
0,
0,
0,
0,
0,
0
] | 8 |
"Given two strings A and B: A = \"IfddTKlE\", B = \"sXMddTVy\". Find the longest common substring be(...TRUNCATED) | ddT | 0.125 | ["<think>\nOkay, so I need to find the longest common substring between the two strings A and B. Let(...TRUNCATED) | [
1,
0,
0,
0,
0,
0,
0,
0
] | 8 |
Given two strings A and B, find the longest common substring. A = yZFdbjuAiYpek B = IgdbjuAHKr | dbjuA | 0 | ["<think>\nOkay, let's see. I need to find the longest common substring between the two strings A an(...TRUNCATED) | [
0,
0,
0,
0,
0,
0,
0,
0
] | 8 |
"Given two strings A and B, find the longest common substring (a contiguous sequence of characters t(...TRUNCATED) | cXk | 0.375 | ["<think>\nOkay, so I need to find the longest common substring between the two strings A and B. Let(...TRUNCATED) | [
0,
0,
0,
0,
1,
1,
0,
1
] | 8 |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 14