Datasets:

t2ance
/

bilevel-grpo-4b-step110-bestofn-deepseek

task_id string	problem dict	judge_prompt list	judge_response string	judge_model string	timestamp string	inference_time float64	group_idx int64	solutions list	candidate_passes list	selected_position int64	correct_positions list	is_correct bool	num_candidates int64	extraction_error bool
3692	{ "contest_date": "2025-02-15T06:30:00", "difficulty": "hard", "platform": "leetcode", "public_test_cases": "[{\"input\": \"\\\"abaacbaecebce\\\"\\n\\\"bacce\\\"\", \"output\": \"8\", \"testtype\": \"functional\"}, {\"input\": \"\\\"baccbaadbc\\\"\\n\\\"ccbaaadb\\\"\", \"output\": \"-1\", \"testtype\": \"fu...	[ { "content": "You are an expert code evaluation system.", "role": "system" }, { "content": "=== PROGRAMMING PROBLEM ===\n\nTitle: shortest-matching-substring\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a string s and a pattern string p, where p contains exactly two '*'...	<think> </think> I'll analyze both solutions using the provided evaluation protocol. ## Solution 1 Analysis ### STEP 1: SYNTAX & COMPLETENESS VERIFICATION - Syntax is valid Python - Code is complete with proper function definition and return statements - All variables are properly defined before use - Imports (`bis...	/tmp/merged	2026-04-27T13:36:58.120032	5.869161	0	[ { "actual_passed": true, "full_response": "We split the pattern `p` by the two `'*'` characters into three parts: `A`, `B`, `C` (any of them may be empty). \nA substring `t` of `s` matches `p` iff we can write \n`t = A + X + B + Y + C` for arbitrary (possibly empty) strings `X, Y`. \nThus we need to find...	[ true, false ]	1	[ 1 ]	true	2	false
3692	{ "contest_date": "2025-02-15T06:30:00", "difficulty": "hard", "platform": "leetcode", "public_test_cases": "[{\"input\": \"\\\"abaacbaecebce\\\"\\n\\\"bacce\\\"\", \"output\": \"8\", \"testtype\": \"functional\"}, {\"input\": \"\\\"baccbaadbc\\\"\\n\\\"ccbaaadb\\\"\", \"output\": \"-1\", \"testtype\": \"fu...	[ { "content": "You are an expert code evaluation system.", "role": "system" }, { "content": "=== PROGRAMMING PROBLEM ===\n\nTitle: shortest-matching-substring\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a string s and a pattern string p, where p contains exactly two '*'...	<think> </think> I'll analyze both solutions using the provided evaluation protocol. ## Solution 1 Analysis ### STEP 1: SYNTAX & COMPLETENESS VERIFICATION - Syntax is valid - Code is complete with proper function signature - All variables are properly defined - Imports are present (`bisect` module used) - Return st...	/tmp/merged	2026-04-27T13:36:58.126028	5.869161	1	[ { "actual_passed": false, "full_response": "```python\nimport bisect\n\nclass Solution:\n def shortestMatchingSubstring(self, s: str, p: str) -> int:\n # split pattern into the three literal parts A, B, C\n parts = p.split('*')\n A, B, C = parts[0], parts[1], parts[2]\n a, b, ...	[ false, false ]	1	[]	false	2	false
3692	{ "contest_date": "2025-02-15T06:30:00", "difficulty": "hard", "platform": "leetcode", "public_test_cases": "[{\"input\": \"\\\"abaacbaecebce\\\"\\n\\\"bacce\\\"\", \"output\": \"8\", \"testtype\": \"functional\"}, {\"input\": \"\\\"baccbaadbc\\\"\\n\\\"ccbaaadb\\\"\", \"output\": \"-1\", \"testtype\": \"fu...	[ { "content": "You are an expert code evaluation system.", "role": "system" }, { "content": "=== PROGRAMMING PROBLEM ===\n\nTitle: shortest-matching-substring\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a string s and a pattern string p, where p contains exactly two '*'...	<think> </think> I'll analyze both solutions using the provided evaluation protocol. ## Solution 1 Analysis ### STEP 1: SYNTAX & COMPLETENESS VERIFICATION - Syntax is valid Python - Code is complete with proper function signature - All variables are properly defined before use - Imports are present (bisect, but it'...	/tmp/merged	2026-04-27T13:36:58.119655	5.869161	2	[ { "actual_passed": true, "full_response": "We split the pattern `p` by the two `'*'` characters into three parts: `A`, `B`, `C` (any of them may be empty). \nA substring `t` of `s` matches `p` iff we can write \n`t = A + X + B + Y + C` for arbitrary (possibly empty) strings `X, Y`. \nThus we need to find...	[ true, false ]	2	[ 1 ]	false	2	false
3692	{ "contest_date": "2025-02-15T06:30:00", "difficulty": "hard", "platform": "leetcode", "public_test_cases": "[{\"input\": \"\\\"abaacbaecebce\\\"\\n\\\"bacce\\\"\", \"output\": \"8\", \"testtype\": \"functional\"}, {\"input\": \"\\\"baccbaadbc\\\"\\n\\\"ccbaaadb\\\"\", \"output\": \"-1\", \"testtype\": \"fu...	[ { "content": "You are an expert code evaluation system.", "role": "system" }, { "content": "=== PROGRAMMING PROBLEM ===\n\nTitle: shortest-matching-substring\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a string s and a pattern string p, where p contains exactly two '*'...	<think> </think> I'll analyze both solutions using the provided evaluation protocol. ## Solution 1 Analysis ### STEP 1: SYNTAX & COMPLETENESS VERIFICATION - Syntax is valid - Code is complete with proper function signature - All variables are properly defined - Imports are present (bisect module) - Return statement...	/tmp/merged	2026-04-27T13:36:58.122138	5.869161	3	[ { "actual_passed": true, "full_response": "We split the pattern `p` by the two `'*'` characters into three parts: `A`, `B`, `C` (any of them may be empty). \nA substring `t` of `s` matches `p` iff we can write \n`t = A + X + B + Y + C` for arbitrary (possibly empty) strings `X, Y`. \nThus we need to find...	[ true, false ]	1	[ 1 ]	true	2	false
3692	{ "contest_date": "2025-02-15T06:30:00", "difficulty": "hard", "platform": "leetcode", "public_test_cases": "[{\"input\": \"\\\"abaacbaecebce\\\"\\n\\\"bacce\\\"\", \"output\": \"8\", \"testtype\": \"functional\"}, {\"input\": \"\\\"baccbaadbc\\\"\\n\\\"ccbaaadb\\\"\", \"output\": \"-1\", \"testtype\": \"fu...	[ { "content": "You are an expert code evaluation system.", "role": "system" }, { "content": "=== PROGRAMMING PROBLEM ===\n\nTitle: shortest-matching-substring\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a string s and a pattern string p, where p contains exactly two '*'...	<think> </think> I'll analyze both solutions using the provided evaluation protocol. ## Solution 1 Analysis ### STEP 1: SYNTAX & COMPLETENESS VERIFICATION - Syntax is valid - Code is incomplete - it's just a skeleton without implementation - No function body provided - No return statement ### STEP 2: ALGORITHM COR...	/tmp/merged	2026-04-27T13:36:58.139163	5.869161	4	[ { "actual_passed": false, "full_response": "", "solution_code": "", "solution_idx": 0 }, { "actual_passed": false, "full_response": "", "solution_code": "", "solution_idx": 2 } ]	[ false, false ]	2	[]	false	2	false
3692	{ "contest_date": "2025-02-15T06:30:00", "difficulty": "hard", "platform": "leetcode", "public_test_cases": "[{\"input\": \"\\\"abaacbaecebce\\\"\\n\\\"bacce\\\"\", \"output\": \"8\", \"testtype\": \"functional\"}, {\"input\": \"\\\"baccbaadbc\\\"\\n\\\"ccbaaadb\\\"\", \"output\": \"-1\", \"testtype\": \"fu...	[ { "content": "You are an expert code evaluation system.", "role": "system" }, { "content": "=== PROGRAMMING PROBLEM ===\n\nTitle: shortest-matching-substring\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a string s and a pattern string p, where p contains exactly two '*'...	<think> </think> I'll analyze both solutions using the provided evaluation protocol. ## Solution 1 Analysis ### STEP 1: SYNTAX & COMPLETENESS VERIFICATION - Syntax is invalid - the solution is incomplete with empty content - No function body exists - No imports or variable definitions - Function signature is missin...	/tmp/merged	2026-04-27T13:36:58.138468	5.869161	5	[ { "actual_passed": false, "full_response": "", "solution_code": "", "solution_idx": 2 }, { "actual_passed": false, "full_response": "```python\nimport bisect\n\nclass Solution:\n def shortestMatchingSubstring(self, s: str, p: str) -> int:\n # split pattern into the three litera...	[ false, false ]	2	[]	false	2	false
3696	{ "contest_date": "2025-02-08T18:30:00", "difficulty": "hard", "platform": "leetcode", "public_test_cases": "[{\"input\": \"\\\"12936\\\"\", \"output\": \"11\", \"testtype\": \"functional\"}, {\"input\": \"\\\"5701283\\\"\", \"output\": \"18\", \"testtype\": \"functional\"}, {\"input\": \"\\\"1010101010\\\"\", ...	[ { "content": "You are an expert code evaluation system.", "role": "system" }, { "content": "=== PROGRAMMING PROBLEM ===\n\nTitle: count-substrings-divisible-by-last-digit\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a string s consisting of digits.\nReturn the number of...	<think> </think> I'll analyze both solutions using the provided evaluation protocol. ## Solution 1 Analysis ### STEP 1: SYNTAX & COMPLETENESS VERIFICATION - Syntax is valid - Code is complete with proper function signature - All variables are properly defined before use - Return statement exists ### STEP 2: ALGORI...	/tmp/merged	2026-04-27T13:36:58.128373	5.869161	0	[ { "actual_passed": true, "full_response": "```python\nclass Solution:\n def countSubstrings(self, s: str) -> int:\n n = len(s)\n ans = 0\n\n # ----- modulo 3 and 9 (for digits 3,6,9) -----\n mod3_cnt = [0] * 3\n mod3_cnt[0] = 1 # empty prefix\n mod9_cnt ...	[ true, true ]	2	[ 1, 2 ]	true	2	false
3696	{ "contest_date": "2025-02-08T18:30:00", "difficulty": "hard", "platform": "leetcode", "public_test_cases": "[{\"input\": \"\\\"12936\\\"\", \"output\": \"11\", \"testtype\": \"functional\"}, {\"input\": \"\\\"5701283\\\"\", \"output\": \"18\", \"testtype\": \"functional\"}, {\"input\": \"\\\"1010101010\\\"\", ...	[ { "content": "You are an expert code evaluation system.", "role": "system" }, { "content": "=== PROGRAMMING PROBLEM ===\n\nTitle: count-substrings-divisible-by-last-digit\nPlatform: leetcode\nDifficulty: hard\n\nProblem Statement:\nYou are given a string s consisting of digits.\nReturn the number of...	<think> </think> I'll analyze both solutions using the provided evaluation protocol. ## Solution 1 Analysis ### STEP 1: SYNTAX & COMPLETENESS VERIFICATION - Syntax is valid - Code is complete with proper function definitions - All variables are properly defined before use - Function signatures are complete ### STE...	/tmp/merged	2026-04-27T13:36:58.131078	5.869161	1	[ { "actual_passed": true, "full_response": "```python\n\nclass Solution:\n def countSubstrings(self, s: str) -> int:\n n = len(s)\n total = 0\n\n # digits 1,2,5 : every substring ending with them is valid\n for i, ch in enumerate(s):\n if ch == '1' or ch == '2' or ch...	[ true, true ]	2	[ 1, 2 ]	true	2	false
3696	{"contest_date":"2025-02-08T18:30:00","difficulty":"hard","platform":"leetcode","public_test_cases":(...TRUNCATED)	[{"content":"You are an expert code evaluation system.","role":"system"},{"content":"=== PROGRAMMING(...TRUNCATED)	"<think>\n\n</think>\n\nI'll analyze both solutions step by step using the provided evaluation proto(...TRUNCATED)	/tmp/merged	2026-04-27T13:36:58.166305	5.869161	2	[{"actual_passed":true,"full_response":"```python\nclass Solution:\n def countSubstrings(self, s:(...TRUNCATED)	[ true, true ]	2	[ 1, 2 ]	true	2	false
3696	{"contest_date":"2025-02-08T18:30:00","difficulty":"hard","platform":"leetcode","public_test_cases":(...TRUNCATED)	[{"content":"You are an expert code evaluation system.","role":"system"},{"content":"=== PROGRAMMING(...TRUNCATED)	"<think>\n\n</think>\n\nI'll analyze both solutions step by step using the provided evaluation proto(...TRUNCATED)	/tmp/merged	2026-04-27T13:36:58.156910	5.869161	3	[{"actual_passed":true,"full_response":"We iterate over each possible non-zero last digit `d` (1 to (...TRUNCATED)	[ true, true ]	1	[ 1, 2 ]	true	2	false

End of preview. Expand in Data Studio

CodeRM LLM Judge Trajectories (Multi-Model)

Dataset Description

This dataset contains selection trajectories from multiple model solutions evaluated by an LLM judge.

Available Splits

Split	Trajectories
deepseek	786

Total: 786 trajectories across 1 models

Usage

from datasets import load_dataset

# Load all splits
ds = load_dataset("t2ance/bilevel-grpo-4b-step110-bestofn-deepseek")

# Load specific split
ds = load_dataset("t2ance/bilevel-grpo-4b-step110-bestofn-deepseek", split="deepseek")

License

Apache 2.0

Downloads last month: 51