Datasets:

t2ance
/

bilevel-grpo-4b-step110-bestofn-qwen3_30b

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 step by step 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 statements are present ...	/tmp/merged	2026-04-27T14:51:17.248551	6.712078	0	[ { "actual_passed": false, "full_response": "I'll solve this step by step.\n\n## STEP 1 - ANALYZE THE PROBLEM\n\nCore Algorithm Needed:\nThis is a string matching problem with wildcards. Since there are exactly two '' characters, I can split the pattern into three parts:\n- Prefix before first ''\n- Mi...	[ 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 step by step 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 - No missing imports needed ###...	/tmp/merged	2026-04-27T14:51:17.263642	6.712078	1	[ { "actual_passed": false, "full_response": "I'll solve this step by step.\n\n## STEP 1 - ANALYZE THE PROBLEM\n\nCore Algorithm Needed:\nThis is a string matching problem with wildcards. Since there are exactly two '' characters, I can split the pattern into three parts:\n- Prefix before first ''\n- Mi...	[ 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 - Return statement is included ### STEP 2: ALGOR...	/tmp/merged	2026-04-27T14:51:17.253787	6.712078	2	[ { "actual_passed": false, "full_response": "I'll solve this step by step.\n\n## STEP 1 - ANALYZE THE PROBLEM\n\nCore Algorithm Needed:\nThis is a pattern matching problem with wildcards. Since there are exactly two '' characters, I can split the pattern into three parts:\n- Prefix before first ''\n- M...	[ 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 step by step using the evaluation protocol. ## Solution 1 Analysis ### STEP 1: SYNTAX & COMPLETENESS VERIFICATION - Syntax is valid - Code is complete with proper function signature - All variables are defined before use - No missing imports ### STEP 2: ALGORITHM CORREC...	/tmp/merged	2026-04-27T14:51:17.263407	6.712078	3	[ { "actual_passed": false, "full_response": "I'll solve this step by step.\n\n## STEP 1 - ANALYZE THE PROBLEM\n\nCore Algorithm Needed:\nThis is a string matching problem with wildcards. Since there are exactly two '' characters, I can split the pattern into three parts:\n- Prefix before first ''\n- Mi...	[ false, false ]	2	[]	false	2	false
3692	{"contest_date":"2025-02-15T06: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-27T14:51:17.263774	6.712078	4	[{"actual_passed":false,"full_response":"I'll solve this step by step.\n\n## STEP 1 - ANALYZE THE PR(...TRUNCATED)	[ false, false ]	2	[]	false	2	false
3692	{"contest_date":"2025-02-15T06: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 using the provided evaluation protocol.\n\n## So(...TRUNCATED)	/tmp/merged	2026-04-27T14:51:17.258925	6.712078	5	[{"actual_passed":false,"full_response":"I'll solve this step by step.\n\n## STEP 1 - ANALYZE THE PR(...TRUNCATED)	[ false, false ]	1	[]	false	2	false
3692	{"contest_date":"2025-02-15T06: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 evaluation protocol.\n\n#(...TRUNCATED)	/tmp/merged	2026-04-27T14:51:17.263251	6.712078	6	[{"actual_passed":false,"full_response":"I'll solve this step by step.\n\n## STEP 1 - ANALYZE THE PR(...TRUNCATED)	[ false, false ]	1	[]	false	2	false
3692	{"contest_date":"2025-02-15T06: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 using the provided evaluation protocol.\n\n## So(...TRUNCATED)	/tmp/merged	2026-04-27T14:51:17.266239	6.712078	7	[{"actual_passed":false,"full_response":"I'll solve this step by step.\n\n## STEP 1 - ANALYZE THE PR(...TRUNCATED)	[ false, false ]	1	[]	false	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-27T14:51:17.280368	6.712078	0	[{"actual_passed":false,"full_response":"I'll solve this step by step.\n\n## STEP 1 - ANALYZE THE PR(...TRUNCATED)	[ false, false ]	1	[]	false	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 using the provided evaluation protocol.\n\n## So(...TRUNCATED)	/tmp/merged	2026-04-27T14:51:17.269801	6.712078	1	[{"actual_passed":false,"full_response":"I'll solve this step by step.\n\n## STEP 1 - ANALYZE THE PR(...TRUNCATED)	[ false, false ]	1	[]	false	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
qwen3_30b	1,048

Total: 1,048 trajectories across 1 models

Usage

from datasets import load_dataset

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

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

License

Apache 2.0

Downloads last month: 23