leetcode-py-sdk 1.0.2__tar.gz → 1.0.4__tar.gz

leetcode_py_sdk-1.0.4/PKG-INFO

@@ -0,0 +1,137 @@
+Metadata-Version: 2.3
+Name: leetcode-py-sdk
+Version: 1.0.4
+Summary: Modern Python LeetCode practice environment with automated problem generation, beautiful data structure visualizations, and comprehensive testing
+Keywords: algorithms,coding-practice,data-structures,interview-prep,leetcode
+Author: Wisaroot Lertthaweedech
+Author-email: Wisaroot Lertthaweedech <l.wisaroot@gmail.com>
+License: Apache-2.0
+Classifier: Development Status :: 5 - Production/Stable
+Classifier: Intended Audience :: Developers
+Classifier: Intended Audience :: Education
+Classifier: License :: OSI Approved :: Apache Software License
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
+Classifier: Programming Language :: Python :: 3.14
+Classifier: Topic :: Education
+Classifier: Topic :: Software Development :: Libraries :: Python Modules
+Requires-Dist: anytree>=2.13.0
+Requires-Dist: chardet>=7.4.3
+Requires-Dist: cookiecutter>=2.6.0
+Requires-Dist: graphviz>=0.21
+Requires-Dist: json5>=0.13.0
+Requires-Dist: loguru>=0.7.3
+Requires-Dist: requests>=2.32.5
+Requires-Dist: rich>=14.1.0
+Requires-Dist: ruff>=0.14.0
+Requires-Dist: ty>=0.0.13
+Requires-Dist: typer>=0.21.0
+Requires-Python: >=3.10
+Project-URL: Changelog, https://github.com/wislertt/leetcode-py/releases
+Project-URL: Documentation, https://leetcode-py.wisl.dev
+Project-URL: Homepage, https://leetcode-py.wisl.dev
+Project-URL: Issues, https://github.com/wislertt/leetcode-py/issues
+Project-URL: Repository, https://github.com/wislertt/leetcode-py
+Description-Content-Type: text/markdown
+
+[![tests](https://img.shields.io/github/actions/workflow/status/wislertt/leetcode-py/cd.yml?branch=main&label=tests&logo=github)](https://github.com/wislertt/leetcode-py/actions/workflows/cd.yml)
+[![release](https://img.shields.io/github/actions/workflow/status/wislertt/leetcode-py/cd.yml?branch=main&label=release&logo=github)](https://github.com/wislertt/leetcode-py/actions/workflows/cd.yml)
+[![Quality Gate Status](https://sonarcloud.io/api/project_badges/measure?project=wislertt_leetcode-py&metric=alert_status)](https://sonarcloud.io/summary/new_code?id=wislertt_leetcode-py)
+[![Security Rating](https://sonarcloud.io/api/project_badges/measure?project=wislertt_leetcode-py&metric=security_rating)](https://sonarcloud.io/summary/new_code?id=wislertt_leetcode-py)
+[![Vulnerabilities](https://sonarcloud.io/api/project_badges/measure?project=wislertt_leetcode-py&metric=vulnerabilities)](https://sonarcloud.io/summary/new_code?id=wislertt_leetcode-py)
+[![codecov](https://codecov.io/gh/wislertt/leetcode-py/graph/badge.svg?token=TI97VUIA4Z)](https://codecov.io/gh/wislertt/leetcode-py)
+[![pypi](https://img.shields.io/pypi/v/leetcode-py-sdk.svg?color=blue)](https://pypi.python.org/pypi/leetcode-py-sdk)
+[![downloads](https://static.pepy.tech/personalized-badge/leetcode-py-sdk?period=total&units=international_system&left_color=grey&right_color=blue&left_text=pypi%20downloads)](https://pepy.tech/projects/leetcode-py-sdk)
+[![python](https://img.shields.io/badge/python-3.10%20%7C%203.11%20%7C%203.12%20%7C%203.13%20%7C%203.14-blue?logo=python)](https://github.com/wislertt/leetcode-py/)
+[![Star ⭐](https://img.shields.io/github/stars/wislertt/leetcode-py?style=flat&logo=github&color=ffcc00)](https://github.com/wislertt/leetcode-py)
+[![Sponsor 💖](https://img.shields.io/badge/Sponsor-💖-pink?style=flat)](https://github.com/sponsors/wislertt)
+
+<p align="center">
+  <picture>
+    <source media="(prefers-color-scheme: dark)" srcset="https://cdn.jsdelivr.net/gh/wislertt/leetcode-py@main/docs/img/brand/leetcode-py-lockup-dark.svg">
+    <img src="https://cdn.jsdelivr.net/gh/wislertt/leetcode-py@main/docs/img/brand/leetcode-py-lockup.svg" width="360" alt="leetcode-py logo">
+  </picture>
+</p>
+
+# leetcode-py
+
+A Python package to generate professional LeetCode practice environments: a problem README, a typed solution stub, a parametrized pytest suite with 10+ cases, helpers, and a playground notebook, all from JSON templates. Full documentation lives at [leetcode-py.wisl.dev](https://leetcode-py.wisl.dev).
+
+**What makes this different:**
+
+- 🤖 **[LLM-Assisted Workflow](https://leetcode-py.wisl.dev/contributing/problem-creation)**: Generate new problems instantly with AI assistance
+- 🎨 **[Visual Debugging](https://leetcode-py.wisl.dev/practice/visualizations)**: TreeNode, ListNode, and GraphNode render as Graphviz diagrams in Jupyter and clean ASCII in the terminal
+- 🧪 **[Production Testing](https://leetcode-py.wisl.dev/practice/testing)**: Comprehensive test suites with edge cases and reproducibility verification
+- 🚀 **Modern Python**: PEP 585/604 type hints, uv, and professional tooling
+- 📊 **Quality Assurance**: 95%+ test coverage, security scanning, automated linting
+- ⚡ **[Powerful CLI](https://leetcode-py.wisl.dev/cli/lcpy)**: Generate problems anywhere with `lcpy` command
+
+## 🚀 Quick Start
+
+Requires **Python 3.10+** and **Graphviz** for visualizations ([install guide](https://graphviz.org/download/)).
+
+```bash
+# Install the package
+pip install leetcode-py-sdk
+
+# Generate problems anywhere
+lcpy gen -n 1                    # Generate Two Sum
+lcpy gen -t grind-75             # Generate all Grind 75 problems
+lcpy list -t blind-75            # List Blind 75 problems
+
+# Start practicing
+cd leetcode/two_sum
+python -m pytest test_solution.py  # Run tests
+# Edit solution.py, then rerun tests
+```
+
+See the [Quickstart](https://leetcode-py.wisl.dev/getting-started/quickstart) for the full walkthrough and the [CLI guide](https://leetcode-py.wisl.dev/cli/lcpy) for every option.
+
+## 🗂️ Collections
+
+307 problems, ready to generate, across six complete collections. Browse them all in the [catalog](https://leetcode-py.wisl.dev/catalog):
+
+| Collection                                                           | What it is                                                  |
+| -------------------------------------------------------------------- | ----------------------------------------------------------- |
+| [Grind 75](https://leetcode-py.wisl.dev/catalog/grind-75)            | Essential coding interview questions, time-boxed study plan |
+| [Grind](https://leetcode-py.wisl.dev/catalog/grind)                  | 169 problems; Grind 75 plus the extended edition            |
+| [Blind 75](https://leetcode-py.wisl.dev/catalog/blind-75)            | The original curated list                                   |
+| [NeetCode 150](https://leetcode-py.wisl.dev/catalog/neetcode-150)    | Comprehensive coverage by topic                             |
+| [NeetCode 250](https://leetcode-py.wisl.dev/catalog/neetcode-250)    | NeetCode 150 plus 100 more                                  |
+| [AlgoMaster 75](https://leetcode-py.wisl.dev/catalog/algo-master-75) | Curated algorithmic mastery problems                        |
+
+## 🛠️ Development
+
+```bash
+git clone https://github.com/wislertt/leetcode-py.git
+cd leetcode-py
+uv sync
+bake test
+```
+
+Problems in `leetcode/` are generated from JSON templates. To add one, use the [LLM-assisted workflow](https://leetcode-py.wisl.dev/contributing/problem-creation); for repo tasks see the [bakefile guide](https://leetcode-py.wisl.dev/contributing/bakefile).
+
+## 📖 Documentation
+
+- [Why leetcode-py](https://leetcode-py.wisl.dev/getting-started/why-leetcode-py)
+- [Installation](https://leetcode-py.wisl.dev/getting-started/installation)
+- [Problem anatomy](https://leetcode-py.wisl.dev/practice/problem-anatomy)
+- [Testing pattern](https://leetcode-py.wisl.dev/practice/testing)
+- [Visualizations](https://leetcode-py.wisl.dev/practice/visualizations)
+- [Notebook workflow](https://leetcode-py.wisl.dev/practice/notebooks)
+- [CLI reference](https://leetcode-py.wisl.dev/cli/lcpy)
+- [Contributing](https://github.com/wislertt/leetcode-py/blob/main/CONTRIBUTING.md)
+
+## 💖 Support This Project
+
+If you find this project helpful, please consider **starring the repo ⭐** or **sponsoring my work 💖**.
+
+[![Star ⭐](https://img.shields.io/github/stars/wislertt/leetcode-py?style=flat&logo=github&color=ffcc00)](https://github.com/wislertt/leetcode-py)
+[![Sponsor 💖](https://img.shields.io/badge/Sponsor-💖-pink?style=flat)](https://github.com/sponsors/wislertt)
+
+## License
+
+Apache-2.0. See [LICENSE](LICENSE).

leetcode_py_sdk-1.0.4/README.md

@@ -0,0 +1,98 @@
+[![tests](https://img.shields.io/github/actions/workflow/status/wislertt/leetcode-py/cd.yml?branch=main&label=tests&logo=github)](https://github.com/wislertt/leetcode-py/actions/workflows/cd.yml)
+[![release](https://img.shields.io/github/actions/workflow/status/wislertt/leetcode-py/cd.yml?branch=main&label=release&logo=github)](https://github.com/wislertt/leetcode-py/actions/workflows/cd.yml)
+[![Quality Gate Status](https://sonarcloud.io/api/project_badges/measure?project=wislertt_leetcode-py&metric=alert_status)](https://sonarcloud.io/summary/new_code?id=wislertt_leetcode-py)
+[![Security Rating](https://sonarcloud.io/api/project_badges/measure?project=wislertt_leetcode-py&metric=security_rating)](https://sonarcloud.io/summary/new_code?id=wislertt_leetcode-py)
+[![Vulnerabilities](https://sonarcloud.io/api/project_badges/measure?project=wislertt_leetcode-py&metric=vulnerabilities)](https://sonarcloud.io/summary/new_code?id=wislertt_leetcode-py)
+[![codecov](https://codecov.io/gh/wislertt/leetcode-py/graph/badge.svg?token=TI97VUIA4Z)](https://codecov.io/gh/wislertt/leetcode-py)
+[![pypi](https://img.shields.io/pypi/v/leetcode-py-sdk.svg?color=blue)](https://pypi.python.org/pypi/leetcode-py-sdk)
+[![downloads](https://static.pepy.tech/personalized-badge/leetcode-py-sdk?period=total&units=international_system&left_color=grey&right_color=blue&left_text=pypi%20downloads)](https://pepy.tech/projects/leetcode-py-sdk)
+[![python](https://img.shields.io/badge/python-3.10%20%7C%203.11%20%7C%203.12%20%7C%203.13%20%7C%203.14-blue?logo=python)](https://github.com/wislertt/leetcode-py/)
+[![Star ⭐](https://img.shields.io/github/stars/wislertt/leetcode-py?style=flat&logo=github&color=ffcc00)](https://github.com/wislertt/leetcode-py)
+[![Sponsor 💖](https://img.shields.io/badge/Sponsor-💖-pink?style=flat)](https://github.com/sponsors/wislertt)
+
+<p align="center">
+  <picture>
+    <source media="(prefers-color-scheme: dark)" srcset="https://cdn.jsdelivr.net/gh/wislertt/leetcode-py@main/docs/img/brand/leetcode-py-lockup-dark.svg">
+    <img src="https://cdn.jsdelivr.net/gh/wislertt/leetcode-py@main/docs/img/brand/leetcode-py-lockup.svg" width="360" alt="leetcode-py logo">
+  </picture>
+</p>
+
+# leetcode-py
+
+A Python package to generate professional LeetCode practice environments: a problem README, a typed solution stub, a parametrized pytest suite with 10+ cases, helpers, and a playground notebook, all from JSON templates. Full documentation lives at [leetcode-py.wisl.dev](https://leetcode-py.wisl.dev).
+
+**What makes this different:**
+
+- 🤖 **[LLM-Assisted Workflow](https://leetcode-py.wisl.dev/contributing/problem-creation)**: Generate new problems instantly with AI assistance
+- 🎨 **[Visual Debugging](https://leetcode-py.wisl.dev/practice/visualizations)**: TreeNode, ListNode, and GraphNode render as Graphviz diagrams in Jupyter and clean ASCII in the terminal
+- 🧪 **[Production Testing](https://leetcode-py.wisl.dev/practice/testing)**: Comprehensive test suites with edge cases and reproducibility verification
+- 🚀 **Modern Python**: PEP 585/604 type hints, uv, and professional tooling
+- 📊 **Quality Assurance**: 95%+ test coverage, security scanning, automated linting
+- ⚡ **[Powerful CLI](https://leetcode-py.wisl.dev/cli/lcpy)**: Generate problems anywhere with `lcpy` command
+
+## 🚀 Quick Start
+
+Requires **Python 3.10+** and **Graphviz** for visualizations ([install guide](https://graphviz.org/download/)).
+
+```bash
+# Install the package
+pip install leetcode-py-sdk
+
+# Generate problems anywhere
+lcpy gen -n 1                    # Generate Two Sum
+lcpy gen -t grind-75             # Generate all Grind 75 problems
+lcpy list -t blind-75            # List Blind 75 problems
+
+# Start practicing
+cd leetcode/two_sum
+python -m pytest test_solution.py  # Run tests
+# Edit solution.py, then rerun tests
+```
+
+See the [Quickstart](https://leetcode-py.wisl.dev/getting-started/quickstart) for the full walkthrough and the [CLI guide](https://leetcode-py.wisl.dev/cli/lcpy) for every option.
+
+## 🗂️ Collections
+
+307 problems, ready to generate, across six complete collections. Browse them all in the [catalog](https://leetcode-py.wisl.dev/catalog):
+
+| Collection                                                           | What it is                                                  |
+| -------------------------------------------------------------------- | ----------------------------------------------------------- |
+| [Grind 75](https://leetcode-py.wisl.dev/catalog/grind-75)            | Essential coding interview questions, time-boxed study plan |
+| [Grind](https://leetcode-py.wisl.dev/catalog/grind)                  | 169 problems; Grind 75 plus the extended edition            |
+| [Blind 75](https://leetcode-py.wisl.dev/catalog/blind-75)            | The original curated list                                   |
+| [NeetCode 150](https://leetcode-py.wisl.dev/catalog/neetcode-150)    | Comprehensive coverage by topic                             |
+| [NeetCode 250](https://leetcode-py.wisl.dev/catalog/neetcode-250)    | NeetCode 150 plus 100 more                                  |
+| [AlgoMaster 75](https://leetcode-py.wisl.dev/catalog/algo-master-75) | Curated algorithmic mastery problems                        |
+
+## 🛠️ Development
+
+```bash
+git clone https://github.com/wislertt/leetcode-py.git
+cd leetcode-py
+uv sync
+bake test
+```
+
+Problems in `leetcode/` are generated from JSON templates. To add one, use the [LLM-assisted workflow](https://leetcode-py.wisl.dev/contributing/problem-creation); for repo tasks see the [bakefile guide](https://leetcode-py.wisl.dev/contributing/bakefile).
+
+## 📖 Documentation
+
+- [Why leetcode-py](https://leetcode-py.wisl.dev/getting-started/why-leetcode-py)
+- [Installation](https://leetcode-py.wisl.dev/getting-started/installation)
+- [Problem anatomy](https://leetcode-py.wisl.dev/practice/problem-anatomy)
+- [Testing pattern](https://leetcode-py.wisl.dev/practice/testing)
+- [Visualizations](https://leetcode-py.wisl.dev/practice/visualizations)
+- [Notebook workflow](https://leetcode-py.wisl.dev/practice/notebooks)
+- [CLI reference](https://leetcode-py.wisl.dev/cli/lcpy)
+- [Contributing](https://github.com/wislertt/leetcode-py/blob/main/CONTRIBUTING.md)
+
+## 💖 Support This Project
+
+If you find this project helpful, please consider **starring the repo ⭐** or **sponsoring my work 💖**.
+
+[![Star ⭐](https://img.shields.io/github/stars/wislertt/leetcode-py?style=flat&logo=github&color=ffcc00)](https://github.com/wislertt/leetcode-py)
+[![Sponsor 💖](https://img.shields.io/badge/Sponsor-💖-pink?style=flat)](https://github.com/sponsors/wislertt)
+
+## License
+
+Apache-2.0. See [LICENSE](LICENSE).

leetcode_py_sdk-1.0.4/pyproject.toml

@@ -0,0 +1,154 @@
+[project]
+name = "leetcode-py-sdk"
+version = "1.0.4"
+description = "Modern Python LeetCode practice environment with automated problem generation, beautiful data structure visualizations, and comprehensive testing"
+readme = "README.md"
+requires-python = ">=3.10"
+keywords = [
+    "algorithms",
+    "coding-practice",
+    "data-structures",
+    "interview-prep",
+    "leetcode",
+]
+classifiers = [
+    "Development Status :: 5 - Production/Stable",
+    "Intended Audience :: Developers",
+    "Intended Audience :: Education",
+    "License :: OSI Approved :: Apache Software License",
+    "Programming Language :: Python :: 3",
+    "Programming Language :: Python :: 3.10",
+    "Programming Language :: Python :: 3.11",
+    "Programming Language :: Python :: 3.12",
+    "Programming Language :: Python :: 3.13",
+    "Programming Language :: Python :: 3.14",
+    "Topic :: Education",
+    "Topic :: Software Development :: Libraries :: Python Modules",
+]
+dependencies = [
+    "anytree>=2.13.0",
+    "chardet>=7.4.3",
+    "cookiecutter>=2.6.0",
+    "graphviz>=0.21",
+    "json5>=0.13.0",
+    "loguru>=0.7.3",
+    "requests>=2.32.5",
+    "rich>=14.1.0",
+    "ruff>=0.14.0",
+    "ty>=0.0.13",
+    "typer>=0.21.0",
+]
+
+[[project.authors]]
+name = "Wisaroot Lertthaweedech"
+email = "l.wisaroot@gmail.com"
+
+[project.license]
+text = "Apache-2.0"
+
+[project.scripts]
+lcpy = "leetcode_py.cli.main:app"
+
+[project.urls]
+Changelog = "https://github.com/wislertt/leetcode-py/releases"
+Documentation = "https://leetcode-py.wisl.dev"
+Homepage = "https://leetcode-py.wisl.dev"
+Issues = "https://github.com/wislertt/leetcode-py/issues"
+Repository = "https://github.com/wislertt/leetcode-py"
+
+[dependency-groups]
+dev = [
+    "bakefile[lib]>=0.0.57a0",
+    "deptry>=0.24.0",
+    "ipykernel>=7.0.0",
+    "jupytext>=1.16.6",
+    "nbqa>=1.9.1",
+    "pre-commit>=4.3.0",
+    "pytest-cov>=7.0.0",
+    "pytest>=9.0.0",
+    "ruff>=0.14.0",
+    "toml-sort>=0.24.3",
+]
+
+[build-system]
+requires = ["uv_build>=0.12.0,<0.13.0"]
+build-backend = "uv_build"
+
+[tool.coverage.run]
+omit = ["src/leetcode_py/cli/resources/**"]
+
+[tool.deptry]
+known_first_party = ["leetcode_py"]
+extend_exclude = [
+    ".claude",
+    "bakefile.py",
+    "leetcode",
+    "scripts",
+    "src/leetcode_py/cli/resources",
+]
+
+[tool.deptry.per_rule_ignores]
+DEP002 = ["chardet"]
+
+[tool.pytest.ini_options]
+testpaths = [
+    "leetcode",
+    "tests",
+]
+norecursedirs = ["src/leetcode_py/cli/resources"]
+
+[tool.ruff]
+line-length = 100
+extend-exclude = ["src/leetcode_py/cli/resources"]
+
+[tool.ruff.lint]
+select = [
+    "ARG",
+    "B",
+    "C4",
+    "E",
+    "F",
+    "I",
+    "N",
+    "PGH",
+    "PIE",
+    "PYI",
+    "RUF",
+    "SIM",
+    "UP",
+]
+
+[tool.ruff.lint.per-file-ignores]
+"leetcode/*/playground.py" = ["B018"]
+"leetcode/*/solution.py" = ["ARG002"]
+
+[tool.ty.environment]
+root = [
+    ".",
+    "./.claude/.dev",
+]
+
+[[tool.ty.overrides]]
+include = [
+    "leetcode/*/playground.ipynb",
+    "leetcode/*/playground.py",
+]
+
+[tool.ty.overrides.rules]
+unresolved-import = "ignore"
+
+[tool.ty.src]
+exclude = [
+    "scripts/branding",
+    "src/leetcode_py/cli/resources",
+]
+
+[tool.uv.build-backend]
+module-name = ["leetcode_py"]
+module-root = "src"
+
+[[tool.uv.index]]
+name = "test-pypi"
+url = "https://test.pypi.org/simple/"
+publish-url = "https://test.pypi.org/legacy/"
+explicit = true

leetcode_py_sdk-1.0.2/pyproject.toml → leetcode_py_sdk-1.0.4/pyproject.toml.orig

@@ -1,6 +1,6 @@
 [project]
 name = "leetcode-py-sdk"
-version = "1.0.2" # use git tag instead
+version = "1.0.4" # use git tag instead
 description = "Modern Python LeetCode practice environment with automated problem generation, beautiful data structure visualizations, and comprehensive testing"
 authors = [
   {name = "Wisaroot Lertthaweedech", email = "l.wisaroot@gmail.com"}
@@ -41,7 +41,10 @@ dependencies = [
 lcpy = "leetcode_py.cli.main:app"
 
 [project.urls]
-Homepage = "https://github.com/wislertt/leetcode-py"
+Changelog = "https://github.com/wislertt/leetcode-py/releases"
+Documentation = "https://leetcode-py.wisl.dev"
+Homepage = "https://leetcode-py.wisl.dev"
+Issues = "https://github.com/wislertt/leetcode-py/issues"
 Repository = "https://github.com/wislertt/leetcode-py"
 
 [dependency-groups]
@@ -59,7 +62,7 @@ dev = [
 ]
 
 [build-system]
-requires = ["uv_build>=0.11.0,<0.12.0"]
+requires = ["uv_build>=0.12.0,<0.13.0"]
 build-backend = "uv_build"
 
 [tool.coverage.run]
@@ -73,6 +76,7 @@ extend_exclude = [
   ".claude",
   "bakefile.py",
   "leetcode",
+  "scripts",
   "src/leetcode_py/cli/resources"
 ]
 per_rule_ignores = {DEP002 = ["chardet"]}
@@ -122,6 +126,7 @@ unresolved-import = "ignore"
 
 [tool.ty.src]
 exclude = [
+  "scripts/branding",
   "src/leetcode_py/cli/resources"
 ]
 

{leetcode_py_sdk-1.0.2 → leetcode_py_sdk-1.0.4}/src/leetcode_py/cli/main.py

@@ -6,7 +6,19 @@ from .commands.gen import generate
 from .commands.list import list_problems
 from .commands.scrape import scrape
 
-app = typer.Typer(help="LeetCode problem generator - Generate and list LeetCode problems")
+DOCS_URL = "https://leetcode-py.wisl.dev"
+_INSTALL_SKILL_CMD = f"npx skills add {DOCS_URL}"
+AGENT_DOCS_EPILOG = f"""Docs: {DOCS_URL}
+Full docs in one file (for AI agents): {DOCS_URL}/llms-full.txt
+Docs index: {DOCS_URL}/llms.txt
+Agent skill: {DOCS_URL}/skill.md
+Install agent skill: `{_INSTALL_SKILL_CMD}`
+Docs search via MCP: {DOCS_URL}/mcp"""
+
+app = typer.Typer(
+    help="LeetCode problem generator - Generate and list LeetCode problems",
+    epilog=AGENT_DOCS_EPILOG,
+)
 
 
 def show_version():

{leetcode_py_sdk-1.0.2 → leetcode_py_sdk-1.0.4}/src/leetcode_py/cli/resources/leetcode/json/problems/implement_queue_using_stacks.json

@@ -22,9 +22,9 @@
     "helpers_content": "",
     "helpers_run_name": "my_queue",
     "helpers_run_signature": "(solution_class: type, operations: list[str], inputs: list[list[int]])",
-    "helpers_run_body": "    queue = None\n    results: list[int | None | bool] = []\n    for i, op in enumerate(operations):\n        if op == 'MyQueue':\n            queue = solution_class()\n            results.append(None)\n        elif op == 'push' and queue is not None:\n            queue.push(inputs[i][0])\n            results.append(None)\n        elif op == 'pop' and queue is not None:\n            results.append(queue.pop())\n        elif op == 'peek' and queue is not None:\n            results.append(queue.peek())\n        elif op == 'empty' and queue is not None:\n            results.append(queue.empty())\n    return results, queue",
+    "helpers_run_body": "    queue = None\n    results: list[int | bool | None] = []\n    for i, op in enumerate(operations):\n        if op == 'MyQueue':\n            queue = solution_class()\n            results.append(None)\n        elif op == 'push' and queue is not None:\n            queue.push(inputs[i][0])\n            results.append(None)\n        elif op == 'pop' and queue is not None:\n            results.append(queue.pop())\n        elif op == 'peek' and queue is not None:\n            results.append(queue.peek())\n        elif op == 'empty' and queue is not None:\n            results.append(queue.empty())\n    return results, queue",
     "helpers_assert_name": "my_queue",
-    "helpers_assert_signature": "(result: list[int | None | bool], expected: list[int | None | bool]) -> bool",
+    "helpers_assert_signature": "(result: list[int | bool | None], expected: list[int | bool | None]) -> bool",
     "helpers_assert_body": "    assert result == expected\n    return True",
     "solution_imports": "",
     "solution_contents": "",
@@ -69,7 +69,7 @@
         "list": [
             {
                 "name": "test_queue_operations",
-                "signature": "(self, operations: list[str], inputs: list[list[int]], expected: list[int | None | bool])",
+                "signature": "(self, operations: list[str], inputs: list[list[int]], expected: list[int | bool | None])",
                 "parametrize": "operations, inputs, expected",
                 "test_cases": {
                     "list": [

{leetcode_py_sdk-1.0.2 → leetcode_py_sdk-1.0.4}/src/leetcode_py/cli/resources/leetcode/json/problems/implement_stack_using_queues.json

@@ -20,9 +20,9 @@
     "helpers_content": "",
     "helpers_run_name": "my_stack",
     "helpers_run_signature": "(solution_class: type, operations: list[str], inputs: list[list[int]])",
-    "helpers_run_body": "    stack = None\n    results: list[int | None | bool] = []\n    for i, op in enumerate(operations):\n        if op == 'MyStack':\n            stack = solution_class()\n            results.append(None)\n        elif op == 'push' and stack is not None:\n            stack.push(inputs[i][0])\n            results.append(None)\n        elif op == 'pop' and stack is not None:\n            results.append(stack.pop())\n        elif op == 'top' and stack is not None:\n            results.append(stack.top())\n        elif op == 'empty' and stack is not None:\n            results.append(stack.empty())\n    return results, stack",
+    "helpers_run_body": "    stack = None\n    results: list[int | bool | None] = []\n    for i, op in enumerate(operations):\n        if op == 'MyStack':\n            stack = solution_class()\n            results.append(None)\n        elif op == 'push' and stack is not None:\n            stack.push(inputs[i][0])\n            results.append(None)\n        elif op == 'pop' and stack is not None:\n            results.append(stack.pop())\n        elif op == 'top' and stack is not None:\n            results.append(stack.top())\n        elif op == 'empty' and stack is not None:\n            results.append(stack.empty())\n    return results, stack",
     "helpers_assert_name": "my_stack",
-    "helpers_assert_signature": "(result: list[int | None | bool], expected: list[int | None | bool]) -> bool",
+    "helpers_assert_signature": "(result: list[int | bool | None], expected: list[int | bool | None]) -> bool",
     "helpers_assert_body": "    assert result == expected\n    return True",
     "solution_imports": "",
     "solution_contents": "",
@@ -67,7 +67,7 @@
         "list": [
             {
                 "name": "test_stack_operations",
-                "signature": "(self, operations: list[str], inputs: list[list[int]], expected: list[int | None | bool])",
+                "signature": "(self, operations: list[str], inputs: list[list[int]], expected: list[int | bool | None])",
                 "parametrize": "operations, inputs, expected",
                 "test_cases": {
                     "list": [

leetcode_py_sdk-1.0.4/src/leetcode_py/cli/resources/leetcode/json/problems/integer_to_roman.json

@@ -0,0 +1,98 @@
+{
+    "problem_name": "integer_to_roman",
+    "solution_class_name": "Solution",
+    "problem_number": "12",
+    "problem_title": "Integer to Roman",
+    "difficulty": "Medium",
+    "topics": "Hash Table, Math, String",
+    "_tags": {
+        "list": ["neetcode"]
+    },
+    "readme_description": "Seven different symbols represent Roman numerals with the following values:\n\n| Symbol | Value |\n| --- | --- |\n| I | 1 |\n| V | 5 |\n| X | 10 |\n| L | 50 |\n| C | 100 |\n| D | 500 |\n| M | 1000 |\n\nRoman numerals are formed by appending the conversions of decimal place values from highest to lowest. Converting a decimal place value into a Roman numeral has the following rules:\n\n- If the value does not start with 4 or 9, select the symbol of the maximal value that can be subtracted from the input, append that symbol to the result, subtract its value, and convert the remainder to a Roman numeral.\n- If the value starts with 4 or 9 use the **subtractive form** representing one symbol subtracted from the following symbol, for example, 4 is 1 (`I`) less than 5 (`V`): `IV` and 9 is 1 (`I`) less than 10 (`X`): `IX`. Only the following subtractive forms are used: 4 (`IV`), 9 (`IX`), 40 (`XL`), 90 (`XC`), 400 (`CD`) and 900 (`CM`).\n- Only powers of 10 (`I`, `X`, `C`, `M`) can be appended consecutively at most 3 times to represent multiples of 10. You cannot append 5 (`V`), 50 (`L`), or 500 (`D`) multiple times. If you need to append a symbol 4 times use the **subtractive form**.\n\nGiven an integer, convert it to a Roman numeral.",
+    "_readme_examples": {
+        "list": [
+            {
+                "content": "```\nInput: num = 3749\nOutput: \"MMMDCCXLIX\"\n\nExplanation:\n\n3000 = MMM as 1000 (M) + 1000 (M) + 1000 (M)\n 700 = DCC as 500 (D) + 100 (C) + 100 (C)\n  40 = XL as 10 (X) less of 50 (L)\n   9 = IX as 1 (I) less of 10 (X)\nNote: 49 is not 1 (I) less of 50 (L) because the conversion is based on decimal places\n```"
+            },
+            {
+                "content": "```\nInput: num = 58\nOutput: \"LVIII\"\n\nExplanation:\n\n50 = L\n 8 = VIII\n```"
+            },
+            {
+                "content": "```\nInput: num = 1994\nOutput: \"MCMXCIV\"\n\nExplanation:\n\n1000 = M\n 900 = CM\n  90 = XC\n   4 = IV\n```"
+            }
+        ]
+    },
+    "readme_constraints": "- `1 <= num <= 3999`",
+    "readme_additional": "",
+    "helpers_imports": "",
+    "helpers_content": "",
+    "helpers_run_name": "int_to_roman",
+    "helpers_run_signature": "(solution_class: type, num: int)",
+    "helpers_run_body": "    implementation = solution_class()\n    return implementation.int_to_roman(num)",
+    "helpers_assert_name": "int_to_roman",
+    "helpers_assert_signature": "(result: str, expected: str) -> bool",
+    "helpers_assert_body": "    assert result == expected\n    return True",
+    "solution_imports": "",
+    "solution_contents": "",
+    "solution_class_content": "",
+    "test_imports": "import pytest\nfrom leetcode_py import logged_test\nfrom .helpers import assert_int_to_roman, run_int_to_roman\nfrom .solution import Solution",
+    "test_content": "",
+    "test_class_name": "IntegerToRoman",
+    "test_class_content": "    def setup_method(self):\n        self.solution = Solution()",
+    "_solution_methods": {
+        "list": [
+            {
+                "name": "int_to_roman",
+                "signature": "(self, num: int) -> str",
+                "body": "        # TODO: Implement int_to_roman\n        return \"\""
+            }
+        ]
+    },
+    "_test_helper_methods": {
+        "list": [
+            {
+                "name": "setup_method",
+                "parameters": "",
+                "body": "self.solution = Solution()"
+            }
+        ]
+    },
+    "_test_methods": {
+        "list": [
+            {
+                "name": "test_int_to_roman",
+                "signature": "(self, num: int, expected: str)",
+                "parametrize": "num, expected",
+                "test_cases": {
+                    "list": [
+                        "(3749, 'MMMDCCXLIX')",
+                        "(58, 'LVIII')",
+                        "(1994, 'MCMXCIV')",
+                        "(1, 'I')",
+                        "(3999, 'MMMCMXCIX')",
+                        "(3, 'III')",
+                        "(4, 'IV')",
+                        "(8, 'VIII')",
+                        "(9, 'IX')",
+                        "(14, 'XIV')",
+                        "(40, 'XL')",
+                        "(90, 'XC')",
+                        "(400, 'CD')",
+                        "(900, 'CM')",
+                        "(1000, 'M')",
+                        "(444, 'CDXLIV')",
+                        "(999, 'CMXCIX')",
+                        "(1776, 'MDCCLXXVI')",
+                        "(2024, 'MMXXIV')",
+                        "(3549, 'MMMDXLIX')"
+                    ]
+                },
+                "body": "        result = run_int_to_roman(Solution, num)\n        assert_int_to_roman(result, expected)"
+            }
+        ]
+    },
+    "playground_imports": "from helpers import run_int_to_roman, assert_int_to_roman\nfrom solution import Solution",
+    "playground_setup": "# Example test case\nnum = 3749\nexpected = 'MMMDCCXLIX'",
+    "playground_run": "result = run_int_to_roman(Solution, num)\nresult",
+    "playground_assert": "assert_int_to_roman(result, expected)"
+}

{leetcode_py_sdk-1.0.2 → leetcode_py_sdk-1.0.4}/src/leetcode_py/cli/resources/leetcode/json/problems/shortest_path_in_binary_matrix.json

@@ -5,13 +5,21 @@
     "problem_title": "Shortest Path in Binary Matrix",
     "difficulty": "Medium",
     "topics": "Array, Breadth-First Search, Matrix",
-    "_tags": { "list": ["grind"] },
+    "_tags": {
+        "list": ["neetcode"]
+    },
     "readme_description": "Given an `n x n` binary matrix `grid`, return *the length of the shortest **clear path*** in the matrix. If there is no clear path, return `-1`.\n\nA **clear path** in a binary matrix is a path from the top-left cell (i.e., `(0, 0)`) to the bottom-right cell (i.e., `(n - 1, n - 1)`) such that:\n\n- All the visited cells of the path are `0`.\n- All the adjacent cells of the path are **8-directionally** connected (i.e., they are different and they share an edge or a corner).\n\nThe length of a clear path is the number of visited cells of this path.",
     "_readme_examples": {
         "list": [
-            { "content": "```\nInput: grid = [[0,1],[1,0]]\nOutput: 2\n```" },
-            { "content": "```\nInput: grid = [[0,0,0],[1,1,0],[1,1,0]]\nOutput: 4\n```" },
-            { "content": "```\nInput: grid = [[1,0,0],[1,1,0],[1,1,0]]\nOutput: -1\n```" }
+            {
+                "content": "```\nInput: grid = [[0,1],[1,0]]\nOutput: 2\n```"
+            },
+            {
+                "content": "```\nInput: grid = [[0,0,0],[1,1,0],[1,1,0]]\nOutput: 4\n```"
+            },
+            {
+                "content": "```\nInput: grid = [[1,0,0],[1,1,0],[1,1,0]]\nOutput: -1\n```"
+            }
         ]
     },
     "readme_constraints": "- `n == grid.length`\n- `n == grid[i].length`\n- `1 <= n <= 100`\n- `grid[i][j] is 0 or 1`",
@@ -41,7 +49,13 @@
         ]
     },
     "_test_helper_methods": {
-        "list": [{ "name": "setup_method", "parameters": "", "body": "self.solution = Solution()" }]
+        "list": [
+            {
+                "name": "setup_method",
+                "parameters": "",
+                "body": "self.solution = Solution()"
+            }
+        ]
     },
     "playground_imports": "from helpers import run_shortest_path_binary_matrix, assert_shortest_path_binary_matrix\nfrom solution import Solution",
     "playground_setup": "# Example test case\ngrid = [[0, 1], [1, 0]]\nexpected = 2",