data_source stringclasses 1
value | prompt listlengths 2 2 | ability stringclasses 1
value | reward_model dict | extra_info dict |
|---|---|---|---|---|
mbpp | [
{
"content": "Please reason step by step inside a <think> </think> block, then put your final solution in a single ```python code block.",
"role": "system"
},
{
"content": "Write a python function to toggle only first and last bits of a given number.\n\nYour implementation should pass tests like the... | code | {
"ground_truth": "{\"assert_case\": [\"assert toggle_F_and_L_bits(10) == 3\", \"assert toggle_F_and_L_bits(15) == 6\", \"assert toggle_F_and_L_bits(20) == 5\"]}",
"style": "rule"
} | {
"index": "545",
"mbpp_split": "validation",
"n_tests": "3",
"task_id": "545"
} |
mbpp | [
{
"content": "Please reason step by step inside a <think> </think> block, then put your final solution in a single ```python code block.",
"role": "system"
},
{
"content": "Write a function to find the last occurrence of a character in a string.\n\nYour implementation should pass tests like the foll... | code | {
"ground_truth": "{\"assert_case\": [\"assert last_occurence_char(\\\"hello world\\\",'l')==10\", \"assert last_occurence_char(\\\"language\\\",'g')==7\", \"assert last_occurence_char(\\\"little\\\",'y')==None\"]}",
"style": "rule"
} | {
"index": "546",
"mbpp_split": "validation",
"n_tests": "3",
"task_id": "546"
} |
mbpp | [
{
"content": "Please reason step by step inside a <think> </think> block, then put your final solution in a single ```python code block.",
"role": "system"
},
{
"content": "Write a python function to find the sum of hamming distances of all consecutive numbers from o to n.\n\nYour implementation sho... | code | {
"ground_truth": "{\"assert_case\": [\"assert Total_Hamming_Distance(4) == 7\", \"assert Total_Hamming_Distance(2) == 3\", \"assert Total_Hamming_Distance(5) == 8\"]}",
"style": "rule"
} | {
"index": "547",
"mbpp_split": "validation",
"n_tests": "3",
"task_id": "547"
} |
mbpp | [
{
"content": "Please reason step by step inside a <think> </think> block, then put your final solution in a single ```python code block.",
"role": "system"
},
{
"content": "Write a function to find the length of the longest increasing subsequence of the given sequence.\n\nYour implementation should ... | code | {
"ground_truth": "{\"assert_case\": [\"assert longest_increasing_subsequence([10, 22, 9, 33, 21, 50, 41, 60]) == 5\", \"assert longest_increasing_subsequence([3, 10, 2, 1, 20]) == 3\", \"assert longest_increasing_subsequence([50, 3, 10, 7, 40, 80]) == 4 \"]}",
"style": "rule"
} | {
"index": "548",
"mbpp_split": "validation",
"n_tests": "3",
"task_id": "548"
} |
mbpp | [
{
"content": "Please reason step by step inside a <think> </think> block, then put your final solution in a single ```python code block.",
"role": "system"
},
{
"content": "Write a python function to find the sum of fifth power of first n odd natural numbers.\n\nYour implementation should pass tests... | code | {
"ground_truth": "{\"assert_case\": [\"assert odd_Num_Sum(1) == 1\", \"assert odd_Num_Sum(2) == 244\", \"assert odd_Num_Sum(3) == 3369\"]}",
"style": "rule"
} | {
"index": "549",
"mbpp_split": "validation",
"n_tests": "3",
"task_id": "549"
} |
mbpp | [
{
"content": "Please reason step by step inside a <think> </think> block, then put your final solution in a single ```python code block.",
"role": "system"
},
{
"content": "Write a python function to find the maximum element in a sorted and rotated array.\n\nYour implementation should pass tests lik... | code | {
"ground_truth": "{\"assert_case\": [\"assert find_Max([2,3,5,6,9],0,4) == 9\", \"assert find_Max([3,4,5,2,1],0,4) == 5\", \"assert find_Max([1,2,3],0,2) == 3\"]}",
"style": "rule"
} | {
"index": "550",
"mbpp_split": "validation",
"n_tests": "3",
"task_id": "550"
} |
mbpp | [
{
"content": "Please reason step by step inside a <think> </think> block, then put your final solution in a single ```python code block.",
"role": "system"
},
{
"content": "Write a function to extract a specified column from a given nested list.\n\nYour implementation should pass tests like the foll... | code | {
"ground_truth": "{\"assert_case\": [\"assert extract_column([[1, 2, 3], [2, 4, 5], [1, 1, 1]],0)==[1, 2, 1]\", \"assert extract_column([[1, 2, 3], [-2, 4, -5], [1, -1, 1]],2)==[3, -5, 1]\", \"assert extract_column([[1, 3], [5, 7], [1, 3], [13, 15, 17], [5, 7], [9, 11]],0)==[1, 5, 1, 13, 5, 9]\"]}",
"style": "rule... | {
"index": "551",
"mbpp_split": "validation",
"n_tests": "3",
"task_id": "551"
} |
mbpp | [
{
"content": "Please reason step by step inside a <think> </think> block, then put your final solution in a single ```python code block.",
"role": "system"
},
{
"content": "Write a python function to check whether a given sequence is linear or not.\n\nYour implementation should pass tests like the f... | code | {
"ground_truth": "{\"assert_case\": [\"assert Seq_Linear([0,2,4,6,8,10]) == \\\"Linear Sequence\\\"\", \"assert Seq_Linear([1,2,3]) == \\\"Linear Sequence\\\"\", \"assert Seq_Linear([1,5,2]) == \\\"Non Linear Sequence\\\"\"]}",
"style": "rule"
} | {
"index": "552",
"mbpp_split": "validation",
"n_tests": "3",
"task_id": "552"
} |
mbpp | [
{
"content": "Please reason step by step inside a <think> </think> block, then put your final solution in a single ```python code block.",
"role": "system"
},
{
"content": "Write a function to convert the given tuple to a floating-point number.\n\nYour implementation should pass tests like the follo... | code | {
"ground_truth": "{\"assert_case\": [\"assert tuple_to_float((4, 56)) == 4.56\", \"assert tuple_to_float((7, 256)) == 7.256\", \"assert tuple_to_float((8, 123)) == 8.123\"]}",
"style": "rule"
} | {
"index": "553",
"mbpp_split": "validation",
"n_tests": "3",
"task_id": "553"
} |
mbpp | [
{
"content": "Please reason step by step inside a <think> </think> block, then put your final solution in a single ```python code block.",
"role": "system"
},
{
"content": "Write a function to assign with each element, its pair elements from other similar pairs in the given tuple.\n\nYour implementa... | code | {
"ground_truth": "{\"assert_case\": [\"assert assign_elements([(5, 3), (7, 5), (2, 7), (3, 8), (8, 4)] ) == {3: [8], 5: [3], 7: [5], 2: [7], 8: [4], 4: []}\", \"assert assign_elements([(6, 4), (9, 4), (3, 8), (4, 9), (9, 5)] ) == {4: [9], 6: [4], 9: [4, 5], 8: [], 3: [8], 5: []}\", \"assert assign_elements([(6, 2), ... | {
"index": "561",
"mbpp_split": "validation",
"n_tests": "3",
"task_id": "561"
} |
mbpp | [
{
"content": "Please reason step by step inside a <think> </think> block, then put your final solution in a single ```python code block.",
"role": "system"
},
{
"content": "Write a function to remove words from a given list of strings containing a character or string.\n\nYour implementation should p... | code | {
"ground_truth": "{\"assert_case\": [\"assert remove_words(['Red color', 'Orange#', 'Green', 'Orange @', \\\"White\\\"],['#', 'color', '@'])==['Red', '', 'Green', 'Orange', 'White']\", \"assert remove_words(['Red &', 'Orange+', 'Green', 'Orange @', 'White'],['&', '+', '@'])==['Red', '', 'Green', 'Orange', 'White']\"... | {
"index": "570",
"mbpp_split": "validation",
"n_tests": "3",
"task_id": "570"
} |
mbpp | [
{
"content": "Please reason step by step inside a <think> </think> block, then put your final solution in a single ```python code block.",
"role": "system"
},
{
"content": "Write a function to find maximum possible sum of disjoint pairs for the given array of integers and a number k.\n\nYour impleme... | code | {
"ground_truth": "{\"assert_case\": [\"assert max_sum_pair_diff_lessthan_K([3, 5, 10, 15, 17, 12, 9], 7, 4) == 62\", \"assert max_sum_pair_diff_lessthan_K([5, 15, 10, 300], 4, 12) == 25\", \"assert max_sum_pair_diff_lessthan_K([1, 2, 3, 4, 5, 6], 6, 6) == 21\"]}",
"style": "rule"
} | {
"index": "571",
"mbpp_split": "validation",
"n_tests": "3",
"task_id": "571"
} |
mbpp | [
{
"content": "Please reason step by step inside a <think> </think> block, then put your final solution in a single ```python code block.",
"role": "system"
},
{
"content": "Write a function to find the surface area of a cylinder.\n\nYour implementation should pass tests like the following (more test... | code | {
"ground_truth": "{\"assert_case\": [\"assert surfacearea_cylinder(10,5)==942.45\", \"assert surfacearea_cylinder(4,5)==226.18800000000002\", \"assert surfacearea_cylinder(4,10)==351.848\"]}",
"style": "rule"
} | {
"index": "574",
"mbpp_split": "validation",
"n_tests": "3",
"task_id": "574"
} |
mbpp | [
{
"content": "Please reason step by step inside a <think> </think> block, then put your final solution in a single ```python code block.",
"role": "system"
},
{
"content": "Write a python function to find nth number in a sequence which is not a multiple of a given number.\n\nYour implementation shou... | code | {
"ground_truth": "{\"assert_case\": [\"assert count_no(2,3,1,10) == 5\", \"assert count_no(3,6,4,20) == 11\", \"assert count_no(5,10,4,20) == 16\"]}",
"style": "rule"
} | {
"index": "575",
"mbpp_split": "validation",
"n_tests": "3",
"task_id": "575"
} |
mbpp | [
{
"content": "Please reason step by step inside a <think> </think> block, then put your final solution in a single ```python code block.",
"role": "system"
},
{
"content": "Write a function to check if a dictionary is empty\n\nYour implementation should pass tests like the following (more tests will... | code | {
"ground_truth": "{\"assert_case\": [\"assert my_dict({10})==False\", \"assert my_dict({11})==False\", \"assert my_dict({})==True\"]}",
"style": "rule"
} | {
"index": "582",
"mbpp_split": "validation",
"n_tests": "3",
"task_id": "582"
} |
mbpp | [
{
"content": "Please reason step by step inside a <think> </think> block, then put your final solution in a single ```python code block.",
"role": "system"
},
{
"content": "Write a function to find the first adverb ending with ly and its positions in a given string.\n\nYour implementation should pas... | code | {
"ground_truth": "{\"assert_case\": [\"assert find_adverbs(\\\"Clearly, he has no excuse for such behavior.\\\") == '0-7: Clearly'\", \"assert find_adverbs(\\\"Please handle the situation carefuly\\\") == '28-36: carefuly'\", \"assert find_adverbs(\\\"Complete the task quickly\\\") == '18-25: quickly'\"]}",
"style... | {
"index": "584",
"mbpp_split": "validation",
"n_tests": "3",
"task_id": "584"
} |
mbpp | [
{
"content": "Please reason step by step inside a <think> </think> block, then put your final solution in a single ```python code block.",
"role": "system"
},
{
"content": "Write a python function to count minimum number of swaps required to convert one binary number represented as a string to anoth... | code | {
"ground_truth": "{\"assert_case\": [\"assert min_Swaps(\\\"1101\\\",\\\"1110\\\") == 1\", \"assert min_Swaps(\\\"111\\\",\\\"000\\\") == \\\"Not Possible\\\"\", \"assert min_Swaps(\\\"111\\\",\\\"110\\\") == \\\"Not Possible\\\"\"]}",
"style": "rule"
} | {
"index": "595",
"mbpp_split": "validation",
"n_tests": "3",
"task_id": "595"
} |
mbpp | [
{
"content": "Please reason step by step inside a <think> </think> block, then put your final solution in a single ```python code block.",
"role": "system"
},
{
"content": "Write a function to find the minimum cost path to reach (m, n) from (0, 0) for the given cost matrix cost[][] and a position (m... | code | {
"ground_truth": "{\"assert_case\": [\"assert min_cost([[1, 2, 3], [4, 8, 2], [1, 5, 3]], 2, 2) == 8\", \"assert min_cost([[2, 3, 4], [5, 9, 3], [2, 6, 4]], 2, 2) == 12\", \"assert min_cost([[3, 4, 5], [6, 10, 4], [3, 7, 5]], 2, 2) == 16\"]}",
"style": "rule"
} | {
"index": "1",
"mbpp_split": "prompt",
"n_tests": "3",
"task_id": "1"
} |
mbpp | [
{
"content": "Please reason step by step inside a <think> </think> block, then put your final solution in a single ```python code block.",
"role": "system"
},
{
"content": "Write a function to find the number of ways to fill it with 2 x 1 dominoes for the given 3 x n board.\n\nYour implementation sh... | code | {
"ground_truth": "{\"assert_case\": [\"assert count_ways(2) == 3\", \"assert count_ways(8) == 153\", \"assert count_ways(12) == 2131\"]}",
"style": "rule"
} | {
"index": "5",
"mbpp_split": "prompt",
"n_tests": "3",
"task_id": "5"
} |
mbpp | [
{
"content": "Please reason step by step inside a <think> </think> block, then put your final solution in a single ```python code block.",
"role": "system"
},
{
"content": "Write a function to get the n smallest items from a dataset.\n\nYour implementation should pass tests like the following (more ... | code | {
"ground_truth": "{\"assert_case\": [\"assert small_nnum([10, 20, 50, 70, 90, 20, 50, 40, 60, 80, 100],2)==[10,20]\", \"assert small_nnum([10, 20, 50, 70, 90, 20, 50, 40, 60, 80, 100],5)==[10,20,20,40,50]\", \"assert small_nnum([10, 20, 50, 70, 90, 20, 50, 40, 60, 80, 100],3)==[10,20,20]\"]}",
"style": "rule"
} | {
"index": "10",
"mbpp_split": "prompt",
"n_tests": "3",
"task_id": "10"
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.