Datasets:

t2ance
/

bilevel-grpo-4b-step110-bestofn-qwen2_5_32b

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 Python - Code is complete with proper function signature - All variables are properly defined before use - Return statement exists...	/tmp/merged	2026-04-27T14:40:04.166979	5.955647	0	[ { "actual_passed": false, "full_response": "To solve this problem efficiently, we need to handle the pattern `p` which contains exactly two wildcard characters ``. The goal is to find the shortest substring in `s` that matches `p`.\n\n### Approach:\n\n1. Split the Pattern*: Split the pattern `p` into th...	[ 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 valid - Code is complete with proper function definitions - All variables are properly defined before use - Function signature includes all required ...	/tmp/merged	2026-04-27T14:40:04.168154	5.955647	1	[ { "actual_passed": false, "full_response": "To solve this problem efficiently, we need to find the shortest substring in `s` that matches the pattern `p` which contains exactly two '' characters. Each '' can match any sequence of zero or more characters.\n\n### Approach:\n\n1. Pattern Parsing:\n - S...	[ 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 valid Python - Code is complete with proper function definitions - All variables are properly defined before use - Function signatures are complete ...	/tmp/merged	2026-04-27T14:40:04.171802	5.955647	2	[ { "actual_passed": false, "full_response": "To solve this problem efficiently, we need to leverage the fact that the pattern `p` contains exactly two wildcard characters ``. We can break down the problem into the following steps:\n\n1. Split the Pattern*: Split the pattern `p` into three parts using the...	[ 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 step by step using the provided evaluation protocol. ## Solution 1 Analysis ### STEP 1: SYNTAX & COMPLETENESS VERIFICATION - Syntax is valid Python - Code is complete with proper function definition - All variables are properly defined before use - Function signature inc...	/tmp/merged	2026-04-27T14:40:04.177887	5.955647	3	[ { "actual_passed": false, "full_response": "To solve this problem efficiently, we need to handle the pattern `p` which contains exactly two wildcard characters ``. The goal is to find the shortest substring in `s` that matches `p`.\n\n### Approach:\n\n1. Split the Pattern*: Split the pattern `p` into th...	[ 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 valid Python - Code is complete with proper function signature - All variables are properly defined before use - No missing imports - Return statemen...	/tmp/merged	2026-04-27T14:40:04.176767	5.955647	4	[ { "actual_passed": false, "full_response": "To solve this problem efficiently, we need to leverage the properties of the pattern string `p` which contains exactly two wildcard characters ``. The goal is to find the shortest substring in `s` that matches `p`.\n\n### Approach:\n\n1. Pattern Splitting*: Si...	[ 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 - Code is complete with proper function signature - All variables are defined before use - Return statement handles all cases properly ### STE...	/tmp/merged	2026-04-27T14:40:04.179735	5.955647	5	[ { "actual_passed": false, "full_response": "To solve this problem efficiently, we need to handle the pattern matching with two wildcard characters (`*`). The key idea is to use a two-pointer technique to find the shortest substring in `s` that matches the pattern `p`.\n\nHere's the step-by-step approach:\n\...	[ 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:40:04.199546	5.955647	6	[{"actual_passed":false,"full_response":"To solve this problem efficiently, we need to handle the tw(...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 step by step using the provided evaluation proto(...TRUNCATED)	/tmp/merged	2026-04-27T14:40:04.181927	5.955647	7	[{"actual_passed":false,"full_response":"To solve this problem efficiently, we need to handle the tw(...TRUNCATED)	[ false, false ]	2	[]	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:40:04.207029	5.955647	0	[{"actual_passed":false,"full_response":"To solve this problem efficiently, we need to count the num(...TRUNCATED)	[ false, false ]	2	[]	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:40:04.202591	5.955647	1	[{"actual_passed":false,"full_response":"To solve this problem efficiently, we need to count the num(...TRUNCATED)	[ false, false ]	2	[]	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
qwen2_5_32b	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-qwen2_5_32b")

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

License

Apache 2.0

Downloads last month: 25