Metadata-Version: 2.1
Name: leetcode-runner
Version: 0.0.1
Summary: LeetCode solutions runner
Home-page: https://pypi.org/project/leetcode_runner
License: MIT
Keywords: leetcode,runner
Author: fbjorn
Author-email: denis@fbjorn.cc
Requires-Python: >=3.9,<4.0
Classifier: Development Status :: 1 - Planning
Classifier: License :: OSI Approved :: MIT License
Classifier: Natural Language :: English
Classifier: Operating System :: OS Independent
Classifier: Programming Language :: Python
Classifier: Programming Language :: Python :: 3
Classifier: Programming Language :: Python :: 3.9
Requires-Dist: click (>=7.0,<8.0)
Requires-Dist: minilog (>=2.0,<3.0)
Project-URL: Documentation, https://github.com/fbjorn/leetcode-runner
Project-URL: Repository, https://github.com/fbjorn/leetcode-runner
Description-Content-Type: text/markdown

# Overview

⚠️ Work in progress

LeetCode solutions runner

This project was generated with [cookiecutter](https://github.com/audreyr/cookiecutter) using [jacebrowning/template-python](https://github.com/jacebrowning/template-python).

[![Coverage Status](https://img.shields.io/codecov/c/gh/fbjorn/leetcode-runner)](https://codecov.io/gh/fbjorn/leetcode-runner)
[![Scrutinizer Code Quality](https://img.shields.io/scrutinizer/g/fbjorn/leetcode-runner.svg)](https://scrutinizer-ci.com/g/fbjorn/leetcode-runner)
[![PyPI Version](https://img.shields.io/pypi/v/leetcode_runner.svg)](https://pypi.org/project/leetcode_runner)
[![PyPI License](https://img.shields.io/pypi/l/leetcode_runner.svg)](https://pypi.org/project/leetcode_runner)

# Setup

## Requirements

* Python 3.9+

## Installation

Install it directly into an activated virtual environment:

```text
$ pip install leetcode_runner
```

or add it to your [Poetry](https://poetry.eustace.io/) project:

```text
$ poetry add leetcode_runner
```

# Usage

After installation, the package can imported:

```py
from leetcode_runner import LeetCode 
from typing import *

# Copied as is from the LeetCode
problem = """
Example 1:

Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Output: Because nums[0] + nums[1] == 9, we return [0, 1].
Example 2:

Input: nums = [3,2,4], target = 6
Output: [1,2]
Example 3:

Input: nums = [3,3], target = 6
Output: [0,1]
"""

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        return []

LeetCode(problem, Solution).check()
```

Will print:

```text
----------
[ FAILED ]
nums = [2,7,11,15], target = 9
Expected: [0, 1]
Actual  : []
----------
[ FAILED ]
nums = [3,2,4], target = 6
Expected: [1, 2]
Actual  : []
----------
[ FAILED ]
nums = [3,3], target = 6
Expected: [0, 1]
Actual  : []

```

