leetcode-py-sdk 1.0.3__tar.gz → 1.0.5__tar.gz

leetcode_py_sdk-1.0.5/PKG-INFO

@@ -0,0 +1,137 @@
+Metadata-Version: 2.3
+Name: leetcode-py-sdk
+Version: 1.0.5
+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.5/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.3 → leetcode_py_sdk-1.0.5}/pyproject.toml

@@ -1,6 +1,6 @@
 [project]
 name = "leetcode-py-sdk"
-version = "1.0.3"
+version = "1.0.5"
 description = "Modern Python LeetCode practice environment with automated problem generation, beautiful data structure visualizations, and comprehensive testing"
 readme = "README.md"
 requires-python = ">=3.10"
@@ -71,7 +71,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]

{leetcode_py_sdk-1.0.3 → leetcode_py_sdk-1.0.5}/pyproject.toml.orig

@@ -1,6 +1,6 @@
 [project]
 name = "leetcode-py-sdk"
-version = "1.0.3" # use git tag instead
+version = "1.0.5" # 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"}
@@ -62,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]

leetcode_py_sdk-1.0.5/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.3 → leetcode_py_sdk-1.0.5}/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",

leetcode_py_sdk-1.0.5/src/leetcode_py/cli/resources/leetcode/json/problems/shortest_path_to_get_food.json

@@ -0,0 +1,100 @@
+{
+    "problem_name": "shortest_path_to_get_food",
+    "solution_class_name": "Solution",
+    "problem_number": "1730",
+    "problem_title": "Shortest Path to Get Food",
+    "difficulty": "Medium",
+    "topics": "Array, Breadth-First Search, Matrix",
+    "_tags": {
+        "list": ["grind"]
+    },
+    "readme_description": "You are starving and you want to eat food as quickly as possible. You want to find the shortest path to arrive at any food cell.\n\nYou are given an `m x n` character matrix, `grid`, of these different types of cells:\n\n- `'*'` is your location. There is exactly one `'*'` cell.\n- `'#'` is a food cell. There may be multiple food cells.\n- `'O'` is free space, and you can travel through these cells.\n- `'X'` is an obstacle, and you cannot travel through these cells.\n\nYou can travel to any adjacent cell north, east, south, or west of your current location if there is not an obstacle.\n\nReturn the length of the shortest path for you to reach any food cell. If there is no path for you to reach food, return `-1`.",
+    "_readme_examples": {
+        "list": [
+            {
+                "content": "```\nInput: grid = [[\"X\",\"X\",\"X\",\"X\",\"X\",\"X\"],[\"X\",\"*\",\"O\",\"O\",\"O\",\"X\"],[\"X\",\"O\",\"O\",\"#\",\"O\",\"X\"],[\"X\",\"X\",\"X\",\"X\",\"X\",\"X\"]]\nOutput: 3\nExplanation: It takes 3 steps to reach the food.\n```"
+            },
+            {
+                "content": "```\nInput: grid = [[\"X\",\"X\",\"X\",\"X\",\"X\"],[\"X\",\"*\",\"X\",\"O\",\"X\"],[\"X\",\"O\",\"X\",\"#\",\"X\"],[\"X\",\"X\",\"X\",\"X\",\"X\"]]\nOutput: -1\nExplanation: It is not possible to reach the food.\n```"
+            },
+            {
+                "content": "```\nInput: grid = [[\"X\",\"X\",\"X\",\"X\",\"X\",\"X\",\"X\",\"X\"],[\"X\",\"*\",\"O\",\"X\",\"O\",\"#\",\"O\",\"X\"],[\"X\",\"O\",\"O\",\"X\",\"O\",\"O\",\"X\",\"X\"],[\"X\",\"O\",\"O\",\"O\",\"O\",\"#\",\"O\",\"X\"],[\"X\",\"X\",\"X\",\"X\",\"X\",\"X\",\"X\",\"X\"]]\nOutput: 6\nExplanation: There can be multiple food cells. It only takes 6 steps to reach the bottom food.\n```"
+            },
+            {
+                "content": "```\nInput: grid = [[\"O\",\"*\"],[\"#\",\"O\"]]\nOutput: 2\n```"
+            }
+        ]
+    },
+    "readme_constraints": "- `m == grid.length`\n- `n == grid[i].length`\n- `1 <= m, n <= 200`\n- `grid[row][col]` is `'*'`, `'X'`, `'O'`, or `'#'`.\n- The `grid` contains exactly one `'*'`.",
+    "readme_additional": "",
+    "helpers_imports": "",
+    "helpers_content": "",
+    "helpers_run_name": "get_food",
+    "helpers_run_signature": "(solution_class: type, grid: list[list[str]])",
+    "helpers_run_body": "    import copy\n    grid_copy = copy.deepcopy(grid)\n    implementation = solution_class()\n    return implementation.get_food(grid_copy)",
+    "helpers_assert_name": "get_food",
+    "helpers_assert_signature": "(result: int, expected: int) -> 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_get_food, run_get_food\nfrom .solution import Solution",
+    "test_content": "",
+    "test_class_name": "ShortestPathToGetFood",
+    "test_class_content": "    def setup_method(self):\n        self.solution = Solution()",
+    "_solution_methods": {
+        "list": [
+            {
+                "name": "get_food",
+                "signature": "(self, grid: list[list[str]]) -> int",
+                "body": "        # TODO: Implement get_food\n        return 0"
+            }
+        ]
+    },
+    "_test_helper_methods": {
+        "list": [
+            {
+                "name": "setup_method",
+                "parameters": "",
+                "body": "self.solution = Solution()"
+            }
+        ]
+    },
+    "_test_methods": {
+        "list": [
+            {
+                "name": "test_get_food",
+                "signature": "(self, grid: list[list[str]], expected: int)",
+                "parametrize": "grid, expected",
+                "test_cases": {
+                    "list": [
+                        "([['X','X','X','X','X','X'],['X','*','O','O','O','X'],['X','O','O','#','O','X'],['X','X','X','X','X','X']], 3)",
+                        "([['X','X','X','X','X'],['X','*','X','O','X'],['X','O','X','#','X'],['X','X','X','X','X']], -1)",
+                        "([['X','X','X','X','X','X','X','X'],['X','*','O','X','O','#','O','X'],['X','O','O','X','O','O','X','X'],['X','O','O','O','O','#','O','X'],['X','X','X','X','X','X','X','X']], 6)",
+                        "([['O','*'],['#','O']], 2)",
+                        "([['X','*'],['#','X']], -1)",
+                        "([['*','#']], 1)",
+                        "([['#','*']], 1)",
+                        "([['*','O','#']], 2)",
+                        "([['*','X','#']], -1)",
+                        "([['*']], -1)",
+                        "([['*','O','O','O','O','O','O','#']], 7)",
+                        "([['*'],['O'],['O'],['#']], 3)",
+                        "([['O','O','*','O','O'],['O','X','X','X','O'],['O','O','#','O','O']], 6)",
+                        "([['O','*','O'],['O','X','O'],['#','O','#']], 3)",
+                        "([['*','O','O'],['X','X','O'],['O','O','#']], 4)",
+                        "([['#','X','*'],['O','X','O'],['O','O','#']], 2)",
+                        "([['X','*','X'],['X','O','X'],['X','#','X']], 2)",
+                        "([['*','O','O','O'],['O','X','X','O'],['O','X','#','O'],['O','O','O','O']], 6)",
+                        "([['*','O','O'],['X','X','O'],['O','O','O'],['O','X','#']], 5)"
+                    ]
+                },
+                "body": "        result = run_get_food(Solution, grid)\n        assert_get_food(result, expected)"
+            }
+        ]
+    },
+    "playground_imports": "from helpers import run_get_food, assert_get_food\nfrom solution import Solution",
+    "playground_setup": "# Example test case\ngrid = [['X','X','X','X','X','X'],['X','*','O','O','O','X'],['X','O','O','#','O','X'],['X','X','X','X','X','X']]\nexpected = 3",
+    "playground_run": "result = run_get_food(Solution, grid)\nresult",
+    "playground_assert": "assert_get_food(result, expected)"
+}

{leetcode_py_sdk-1.0.3 → leetcode_py_sdk-1.0.5}/src/leetcode_py/cli/resources/leetcode/json/problems/walls_and_gates.json

@@ -8,11 +8,11 @@
     "_tags": {
         "list": ["neetcode-150"]
     },
-    "readme_description": "You are given a `m × n` 2D grid initialized with these three possible values:\n\n- `-1` - A wall or obstacle that can not be traversed.\n- `0` - A gate.\n- `INF` - Infinity an empty room. We use the value `2^31 - 1 = 2147483647` to represent `INF`.\n\nFill each empty room with the distance to its nearest gate. If it is impossible to reach a gate, it should be filled with `INF`.\n\n**Follow up:** Can you solve it in-place and in O(m × n) time complexity?",
+    "readme_description": "You are given a `m \u00d7 n` 2D grid initialized with these three possible values:\n\n- `-1` - A wall or obstacle that can not be traversed.\n- `0` - A gate.\n- `INF` - Infinity an empty room. We use the value `2^31 - 1 = 2147483647` to represent `INF`.\n\nFill each empty room with the distance to its nearest gate. If it is impossible to reach a gate, it should be filled with `INF`.\n\n**Follow up:** Can you solve it in-place and in O(m \u00d7 n) time complexity?",
     "_readme_examples": {
         "list": [
             {
-                "content": "```\nInput: rooms = [[2147483647,-1,0,2147483647],[2147483647,2147483647,2147483647,-1],[2147483647,-1,2147483647,-1],[0,-1,2147483647,2147483647]]\nOutput: [[3,-1,0,1],[2,2,1,-1],[1,-1,2,-1],[0,-1,3,4]]\n**Explanation:** the 2D grid is:\n```\nINF  -1   0   INF\nINF  INF  INF  -1\nINF  -1   INF  -1\n  0  -1   INF  INF\n```\nthe result is:\n```\n 3  -1   0   1\n 2   2   1  -1\n 1  -1   2  -1\n 0  -1   3   4\n```\nexplanation: the gate is located at (0,2), (3,0), (3,3). the room at (0,0) is distance 3 from the nearest gate at (3,0).`"
+                "content": "```\nInput: rooms = [[2147483647,-1,0,2147483647],[2147483647,2147483647,2147483647,-1],[2147483647,-1,2147483647,-1],[0,-1,2147483647,2147483647]]\nOutput: [[3,-1,0,1],[2,2,1,-1],[1,-1,2,-1],[0,-1,3,4]]\n```\n\n**Explanation:** the 2D grid is:\n\n```\nINF  -1   0   INF\nINF  INF  INF  -1\nINF  -1   INF  -1\n  0  -1   INF  INF\n```\nthe result is:\n```\n 3  -1   0   1\n 2   2   1  -1\n 1  -1   2  -1\n 0  -1   3   4\n```\nexplanation: the gate is located at (0,2), (3,0), (3,3). the room at (0,0) is distance 3 from the nearest gate at (3,0)."
             },
             {
                 "content": "```\nInput: rooms = [[0,-1],[2147483647,2147483647]]\nOutput: [[0,-1],[1,2]]\n```"

leetcode_py_sdk-1.0.5/src/leetcode_py/cli/resources/leetcode/json/problems/zigzag_conversion.json

@@ -0,0 +1,98 @@
+{
+    "problem_name": "zigzag_conversion",
+    "solution_class_name": "Solution",
+    "problem_number": "6",
+    "problem_title": "Zigzag Conversion",
+    "difficulty": "Medium",
+    "topics": "String",
+    "_tags": {
+        "list": ["neetcode"]
+    },
+    "readme_description": "The string `\"PAYPALISHIRING\"` is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)\n\n```\nP   A   H   N\nA P L S I I G\nY   I   R\n```\n\nAnd then read line by line: `\"PAHNAPLSIIGYIR\"`\n\nWrite the code that will take a string and make this conversion given a number of rows:\n\n```\nstring convert(string s, int numRows);\n```",
+    "_readme_examples": {
+        "list": [
+            {
+                "content": "```\nInput: s = \"PAYPALISHIRING\", numRows = 3\nOutput: \"PAHNAPLSIIGYIR\"\n```"
+            },
+            {
+                "content": "```\nInput: s = \"PAYPALISHIRING\", numRows = 4\nOutput: \"PINALSIGYAHRPI\"\nExplanation:\n\nP     I    N\nA   L S  I G\nY A   H R\nP     I\n```"
+            },
+            {
+                "content": "```\nInput: s = \"A\", numRows = 1\nOutput: \"A\"\n```"
+            }
+        ]
+    },
+    "readme_constraints": "- `1 <= s.length <= 1000`\n- `s` consists of English letters (lower-case and upper-case), `','` and `'.'`.\n- `1 <= numRows <= 1000`",
+    "readme_additional": "",
+    "helpers_imports": "",
+    "helpers_content": "",
+    "helpers_run_name": "convert",
+    "helpers_run_signature": "(solution_class: type, s: str, num_rows: int)",
+    "helpers_run_body": "    implementation = solution_class()\n    return implementation.convert(s, num_rows)",
+    "helpers_assert_name": "convert",
+    "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_convert, run_convert\nfrom .solution import Solution",
+    "test_content": "",
+    "test_class_name": "ZigzagConversion",
+    "test_class_content": "    def setup_method(self):\n        self.solution = Solution()",
+    "_solution_methods": {
+        "list": [
+            {
+                "name": "convert",
+                "signature": "(self, s: str, num_rows: int) -> str",
+                "body": "        # TODO: Implement convert\n        return \"\""
+            }
+        ]
+    },
+    "_test_helper_methods": {
+        "list": [
+            {
+                "name": "setup_method",
+                "parameters": "",
+                "body": "self.solution = Solution()"
+            }
+        ]
+    },
+    "_test_methods": {
+        "list": [
+            {
+                "name": "test_convert",
+                "signature": "(self, s: str, num_rows: int, expected: str)",
+                "parametrize": "s, num_rows, expected",
+                "test_cases": {
+                    "list": [
+                        "('PAYPALISHIRING', 3, 'PAHNAPLSIIGYIR')",
+                        "('PAYPALISHIRING', 4, 'PINALSIGYAHRPI')",
+                        "('PAYPALISHIRING', 5, 'PHASIYIRPLIGAN')",
+                        "('A', 1, 'A')",
+                        "('AB', 1, 'AB')",
+                        "('ABCDEF', 1, 'ABCDEF')",
+                        "('ABC', 2, 'ACB')",
+                        "('ABCD', 2, 'ACBD')",
+                        "('ABCDE', 2, 'ACEBD')",
+                        "('ABAB', 2, 'AABB')",
+                        "('ABCD', 3, 'ABDC')",
+                        "('ABCDE', 3, 'AEBDC')",
+                        "('ABCD', 4, 'ABCD')",
+                        "('ABCDEF', 4, 'ABFCED')",
+                        "('AB', 2, 'AB')",
+                        "('ABC', 5, 'ABC')",
+                        "('Z', 1000, 'Z')",
+                        "('XY', 3, 'XY')",
+                        "('abcdefghijklmnop', 5, 'aibhjpcgkodflnem')",
+                        "('a,b.c', 2, 'abc,.')"
+                    ]
+                },
+                "body": "        result = run_convert(Solution, s, num_rows)\n        assert_convert(result, expected)"
+            }
+        ]
+    },
+    "playground_imports": "from helpers import run_convert, assert_convert\nfrom solution import Solution",
+    "playground_setup": "# Example test case\ns = 'PAYPALISHIRING'\nnum_rows = 3\nexpected = 'PAHNAPLSIIGYIR'",
+    "playground_run": "result = run_convert(Solution, s, num_rows)\nresult",
+    "playground_assert": "assert_convert(result, expected)"
+}