Upload README.md with huggingface_hub

README.md

@@ -4,23 +4,72 @@ task_categories:
 - text-generation
 language:
 - en
+pretty_name: LeetCode Code-Gen (Python)
+size_categories:
+- 1K<n<10K
 tags:
 - code
 - python
 - leetcode
 - algorithms
+- code-generation
+- competitive-programming
+- instruction-tuning
+- sft
 ---
 
 # LeetCode Code-Gen Dataset — Python
 
-Problem statement + examples + required algorithm/technique -> Python solution.
-2522 rows. Sourced from doocs/leetcode.
+2522 rows. Given a problem statement, its input/output examples, and a
+required algorithm/technique, generate a correct Python solution.
 
-Every row execution-verified against the problem's own examples.
+Part of a 4-language collection built from the same source: see the sibling
+[Python](https://huggingface.co/datasets/AmareshHebbar/leetcode-codegen-python),
+[Java](https://huggingface.co/datasets/AmareshHebbar/leetcode-codegen-java),
+[C++](https://huggingface.co/datasets/AmareshHebbar/leetcode-codegen-cpp), and
+[JavaScript](https://huggingface.co/datasets/AmareshHebbar/leetcode-codegen-javascript)
+datasets.
+
+## Verification
+
+Every row was extracted, then executed in a sandboxed subprocess against the problem's own stated examples. Only rows that passed all examples are included -- this is not just scraped code, it's checked code.
+
+## Source
+
+Extracted from [doocs/leetcode](https://github.com/doocs/leetcode), which
+documents multiple named solution approaches per problem (e.g. "Dynamic
+Programming", "Two Pointers", "Divide and Conquer") -- this is what makes
+per-row algorithm labeling possible, since the same problem can appear
+multiple times with a different technique and different code each time.
 
 ## Fields
-- `slug`: LeetCode problem slug
-- `solution_id`: unique id, problem + approach index + language
-- `primary_algorithm`: normalized algorithm/technique label
-- `verified`: true/false for Python (execution-checked), null for other languages
-- `messages`: chat-format (system/user/assistant), ready for SFT
+
+| field | description |
+|---|---|
+| `slug` | LeetCode problem slug |
+| `solution_id` | unique id: problem + approach index + language |
+| `primary_algorithm` | normalized algorithm/technique label |
+| `verified` | `true`/`false` for Python (execution-checked), `null` for other languages |
+| `messages` | chat-format (system/user/assistant), ready for SFT |
+
+## Example row
+
+```json
+{
+  "slug": "house-robber",
+  "primary_algorithm": "Dynamic Programming",
+  "messages": [
+    {"role": "system", "content": "You are a competitive programming assistant..."},
+    {"role": "user", "content": "### Problem\n...\n### Algorithm\nDynamic Programming"},
+    {"role": "assistant", "content": "```python\n...\n```"}
+  ]
+}
+```
+
+## Known gaps
+
+- SQL/database problems excluded (wrong problem type for a code-execution harness)
+- Design/class problems (LRU Cache, iterators) excluded -- they need a
+  sequence of method calls to test, not a single input -> output check
+- Some `Brute Force` labels are a fallback where the source didn't name a
+  specific technique for that approach