Datasets:

t2ance
/

OnlineGRPO-Selection-Domain-1.7B

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> Okay, let's tackle this problem. So, the task is to find the shortest substring in s that matches the pattern p, which has exactly two '' characters. The '' matches any sequence of zero or more characters. And if there's no such substring, return -1. First, I need to understand the problem thoroughly. Let's...	Qwen/Qwen3-1.7B	2026-09-25T06:12:53.193111	2.959118	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> Okay, let's tackle this problem. The task is to find the shortest substring in s that matches the pattern p, which has exactly two '' characters. The '' matches any sequence of zero or more characters. So, the pattern is like ABC, where A, B, C are parts of the string, and the * acts as a wildcard. First, ...	Qwen/Qwen3-1.7B	2026-09-25T06:12:53.205619	2.959118	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> Okay, let's tackle this problem. So, the task is to find the shortest substring in s that matches the pattern p, which has exactly two '' characters. The '' matches any number of characters, including none. The challenge is to handle all the cases correctly, especially considering the different ways the patte...	Qwen/Qwen3-1.7B	2026-09-25T06:12:53.198869	2.959118	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 ]	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> Okay, let's tackle this problem. So, the task is to find the shortest substring in s that matches the pattern p, which has exactly two '' characters. The '' matches any sequence of zero or more characters. And if there's no such substring, return -1. First, I need to understand the problem thoroughly. Let's...	Qwen/Qwen3-1.7B	2026-09-25T06:12:53.226078	2.959118	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":(...TRUNCATED)	[{"content":"You are an expert code evaluation system.","role":"system"},{"content":"=== PROGRAMMING(...TRUNCATED)	"<think>\nOkay, let's tackle this problem. The task is to find the shortest substring in s that matc(...TRUNCATED)	Qwen/Qwen3-1.7B	2026-09-25T06:12:53.225411	2.959118	4	[{"actual_passed":false,"full_response":"","solution_code":"","solution_idx":0},{"actual_passed":fal(...TRUNCATED)	[ false, false ]	1	[]	false	2	true
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>\nOkay, let's tackle this problem. The task is to find the shortest substring in s that matc(...TRUNCATED)	Qwen/Qwen3-1.7B	2026-09-25T06:12:53.224878	2.959118	5	[{"actual_passed":false,"full_response":"","solution_code":"","solution_idx":2},{"actual_passed":fal(...TRUNCATED)	[ false, false ]	1	[]	false	2	true
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>\nOkay, let's tackle this problem. So, the task is to count the number of substrings in a gi(...TRUNCATED)	Qwen/Qwen3-1.7B	2026-09-25T06:12:53.219052	2.959118	0	[{"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>\nOkay, let's tackle this problem. So, the task is to count the number of substrings in a gi(...TRUNCATED)	Qwen/Qwen3-1.7B	2026-09-25T06:12:53.224201	2.959118	1	[{"actual_passed":true,"full_response":"```python\n\nclass Solution:\n def countSubstrings(self, (...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>\nOkay, let's tackle this problem. So, the task is to count the number of substrings in a gi(...TRUNCATED)	Qwen/Qwen3-1.7B	2026-09-25T06:12:53.258438	2.959118	2	[{"actual_passed":true,"full_response":"```python\nclass Solution:\n def countSubstrings(self, s:(...TRUNCATED)	[ true, true ]	1	[ 1, 2 ]	true	2	true
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>\nOkay, let's tackle this problem. So, the task is to count the number of substrings in a gi(...TRUNCATED)	Qwen/Qwen3-1.7B	2026-09-25T06:12:53.237911	2.959118	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/OnlineGRPO-Selection-Domain-1.7B")

# Load specific split
ds = load_dataset("t2ance/OnlineGRPO-Selection-Domain-1.7B", split="deepseek")

License

Apache 2.0

Downloads last month: 71