Quickstart

lcpy gen -n 1   # Two Sum

lcpy gen -t grind-75      # all Grind 75 problems
lcpy gen -t neetcode-250  # the full NeetCode 250 roadmap

leetcode/two_sum/
├── README.md           # Problem description with examples and constraints
├── solution.py         # Implementation with type hints and TODO placeholder
├── test_solution.py    # Parametrized tests, 10+ cases
├── helpers.py          # Test helper functions
├── playground.py       # Interactive debugging environment
└── __init__.py         # Package marker

cd leetcode/two_sum
python -m pytest test_solution.py

class Solution:
    def two_sum(self, nums: list[int], target: int) -> list[int]:
        seen: dict[int, int] = {}
        for i, n in enumerate(nums):
            if target - n in seen:
                return [seen[target - n], i]
            seen[n] = i
        return []

python -m pytest test_solution.py

bake p-test -p two_sum   # test one problem
bake p-gen -p two_sum    # regenerate one problem from its JSON template
bake test                # run the whole suite