A Python package to generate professional LeetCode practice environments. Features automated problem generation from LeetCode URLs, beautiful data structure visualizations (TreeNode, ListNode, GraphNode), and comprehensive testing with 10+ test cases per problem. Built with professional development practices including CI/CD, type hints, and quality gates.
- What's Included
- Quick Start
- Problem Structure
- Key Features
- Usage Patterns
- Development Setup
- Helper Classes
- Commands
- Architecture
- Quality Metrics
What makes this different:
- π€ LLM-Assisted Workflow: Generate new problems instantly with AI assistance
- π¨ Visual Debugging: Interactive tree/graph rendering with Graphviz and anytree
- π§ͺ Production Testing: Comprehensive test suites with edge cases and reproducibility verification
- π Modern Python: PEP 585/604 type hints, Poetry, and professional tooling
- π Quality Assurance: 95%+ test coverage, security scanning, automated linting
- β‘ Powerful CLI: Generate problems anywhere with
lcpy
command
Current Problem Sets:
- grind-75 (75 problems) - Essential coding interview questions from Grind 75 β Complete
- grind (100+ problems) - Extended Grind collection including all Grind 75 plus additional problems π§ Partial
- blind-75 (75 problems) - Original Blind 75 curated list π§ Partial
- neetcode-150 (150+ problems) - Comprehensive NeetCode 150 problem set π§ Partial
- algo-master-75 (75 problems) - Curated algorithmic mastery problems π§ Partial
Coverage: 100+ unique problems across all major coding interview topics and difficulty levels.
Note: Some problem sets are partially covered. We're actively working to complete all collections. Contributions welcome!
- Python 3.10+ - Python runtime
- Graphviz - Graph visualization library (install guide)
# 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 gen -t neetcode-150 # Generate NeetCode 150 problems
lcpy list -t grind-75 # List 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
lcpy gen --problem-tag grind-75 --output leetcode # Generate all Grind 75 problems
lcpy gen --problem-tag neetcode-150 --output leetcode # Generate NeetCode 150 problems
lcpy gen --problem-tag blind-75 --output leetcode # Generate Blind 75 problems
Bulk generation output showing "Generated problem:" messages for all 75 Grind problems
Generated folder structure showing all 75 problem directories after command execution
Each problem follows a consistent, production-ready template:
leetcode/two_sum/
βββ README.md # Problem description with examples and constraints
βββ solution.py # Implementation with type hints and TODO placeholder
βββ test_solution.py # Comprehensive parametrized tests (10+ test cases)
βββ helpers.py # Test helper functions
βββ playground.py # Interactive debugging environment (converted from .ipynb)
βββ __init__.py # Package marker
README format that mirrors LeetCode's problem description layout
Solution boilerplate with type hints and TODO placeholder
Comprehensive parametrized tests with 10+ test cases - executable and debuggable in local development environment
Beautiful colorful test output with loguru integration for enhanced debugging and test result visualization
- Modern Python: PEP 585/604 type hints, snake_case conventions
- Comprehensive Linting: black, isort, ruff, mypy with nbqa for notebooks
- High Test Coverage: 10+ test cases per problem including edge cases
- Beautiful Logging: loguru integration for enhanced test debugging
- CI/CD Pipeline: Automated testing, security scanning, and quality gates
Professional-grade visualization for debugging complex data structures with dual rendering modes:
- TreeNode: Beautiful tree rendering with anytree and Graphviz integration
- ListNode: Clean arrow-based visualization with cycle detection
- GraphNode: Interactive graph rendering for adjacency list problems
- DictTree: Box-drawing character trees perfect for Trie implementations
Interactive tree visualization using Graphviz SVG rendering in Jupyter notebooks
Professional linked list visualization with Graphviz in Jupyter environment
Clean ASCII tree rendering using anytree for terminal debugging and logging
Simple arrow-based list representation for console output and test debugging
- Template Generation: Creates Jupyter notebooks (
.ipynb
) by default with rich data structure rendering - User Choice: Use
jupytext
to convert notebooks to Python files, or keep as.ipynb
for interactive exploration - Repository State: This repo converts them to Python files (
.py
) for better version control - Dual Rendering: Automatic HTML visualization in notebooks, clean string output in terminals
Interactive multi-cell playground with rich data structure visualization for each problem
Perfect for quick problem generation anywhere. See the π Complete CLI Usage Guide for detailed documentation with all options and examples.
For working within this repository to generate additional LeetCode problems using LLM assistance:
- Python 3.10+ - Modern Python runtime with latest type system features
- Poetry - Dependency management and packaging
- Make - Build automation (development workflows)
- Git - Version control system
- Graphviz - Graph visualization library (install guide)
# Clone repository for development
git clone https://github.com/wisarootl/leetcode-py.git
cd leetcode-py
poetry install
# Generate problems from JSON templates
make p-gen PROBLEM=problem_name
make p-test PROBLEM=problem_name
# Regenerate all existing problems
make gen-all-problems
To extend the problem collection beyond the current catalog, leverage an LLM assistant within your IDE (Cursor, GitHub Copilot Chat, Amazon Q, etc.).
π Complete LLM-Assisted Problem Creation Guide - Comprehensive guide with screenshots and detailed workflow.
Quick Start:
# Problem generation commands:
"Add problem 198. House Robber"
"Add problem 198. House Robber. tag: grind"
# Test enhancement commands:
"Enhance test cases for two_sum problem"
"Fix test reproducibility for binary_tree_inorder_traversal"
Required LLM Context: Include these rule files in your LLM context for automated problem generation and test enhancement:
.amazonq/rules/problem-creation.md
- Complete problem generation workflow.amazonq/rules/test-quality-assurance.md
- Test enhancement and reproducibility verification
Manual Check: Find problems needing more test cases:
poetry run python -m leetcode_py.tools.check_test_cases --threshold=10
-
TreeNode:
from leetcode_py import TreeNode
- Array β tree conversion:
TreeNode.from_list([1,2,3])
,tree.to_list()
- Beautiful anytree text rendering and Graphviz SVG for Jupyter
- Node search:
tree.find_node(value)
- Generic type support:
TreeNode[int]
,TreeNode[str]
- Array β tree conversion:
-
ListNode:
from leetcode_py import ListNode
- Array β list conversion:
ListNode.from_list([1,2,3])
,node.to_list()
- Cycle detection with Floyd's algorithm
- Graphviz visualization for Jupyter notebooks
- Generic type support:
ListNode[int]
,ListNode[str]
- Array β list conversion:
-
GraphNode:
from leetcode_py import GraphNode
- Adjacency list conversion:
GraphNode.from_adjacency_list([[2,4],[1,3],[2,4],[1,3]])
- Clone detection:
original.is_clone(cloned)
- Graphviz visualization for undirected graphs
- DFS traversal utilities
- Adjacency list conversion:
-
DictTree:
from leetcode_py.data_structures import DictTree
- Perfect for Trie implementations:
DictTree[str]()
- Beautiful tree rendering with box-drawing characters
- Graphviz visualization for Jupyter notebooks
- Generic key type support
- Perfect for Trie implementations:
π Complete CLI Usage Guide - Detailed documentation with all options and examples.
# Generate problems
lcpy gen -n 1 # Single problem by number
lcpy gen -s two-sum # Single problem by slug
lcpy gen -t grind-75 # Bulk generation by tag
lcpy gen -t neetcode-150 # Generate NeetCode 150 problems
lcpy gen -n 1 -n 2 -n 3 # Multiple problems
lcpy gen -t grind-75 -d Easy # Filter by difficulty
lcpy gen -n 1 -o my-problems # Custom output directory
# List problems
lcpy list # All available problems
lcpy list -t grind-75 # Filter by Grind 75 tag
lcpy list -t blind-75 # Filter by Blind 75 tag
lcpy list -t neetcode-150 # Filter by NeetCode 150 tag
lcpy list -d Medium # Filter by difficulty
# Scrape problem data
lcpy scrape -n 1 # Fetch by number
lcpy scrape -s two-sum # Fetch by slug
# Problem-specific operations
make p-test PROBLEM=problem_name # Test specific problem
make p-gen PROBLEM=problem_name # Generate problem from JSON template
make p-lint PROBLEM=problem_name # Lint specific problem
# Bulk operations
make test # Run all tests
make lint # Lint entire codebase
make gen-all-problems # Regenerate all problems (destructive)
- Template-Driven: JSON templates in
.templates/leetcode/json/
drive code generation - Cookiecutter Integration: Uses
.templates/leetcode/{{cookiecutter.problem_name}}/
template for consistent file structure - Automated Scraping: LLM-assisted problem data extraction from LeetCode
- Version Control Friendly: Python files by default, optional notebook support
- Test Coverage: 95%+ with comprehensive edge case testing (Codecov integration)
- Security: SonarCloud quality gates, Trivy dependency scanning, Gitleaks secret detection
- Code Quality: Automated linting with black, isort, ruff, mypy
- Test Reproducibility: Automated verification that problems can be regenerated consistently
- CI/CD: GitHub Actions for testing, security, pre-commit hooks, and release automation
Perfect for systematic coding interview preparation with professional development practices and enhanced debugging capabilities.
If you find this project helpful, please consider starring the repo β or sponsoring my work π. Your support helps me maintain and improve this project. Thank you!