From 4079793461735e6bd8b42d504fbac1d916d36ad4 Mon Sep 17 00:00:00 2001 From: Wisaroot <66859294+wisarootl@users.noreply.github.com> Date: Sat, 13 Sep 2025 00:07:29 +0700 Subject: [PATCH 01/57] feat: add two_sum (#36) --- .github/workflows/ci-test-reproducibility.yml | 46 ++++++++++ .templates/check_test_cases.py | 6 +- .templates/leetcode/json/two_sum.json | 63 +++++++++++++ Makefile | 2 +- leetcode/two_sum/README.md | 49 ++++++++++ leetcode/two_sum/__init__.py | 0 leetcode/two_sum/helpers.py | 8 ++ leetcode/two_sum/playground.ipynb | 92 +++++++++++++++++++ leetcode/two_sum/solution.py | 12 +++ leetcode/two_sum/test_solution.py | 39 ++++++++ 10 files changed, 315 insertions(+), 2 deletions(-) create mode 100644 .templates/leetcode/json/two_sum.json create mode 100644 leetcode/two_sum/README.md create mode 100644 leetcode/two_sum/__init__.py create mode 100644 leetcode/two_sum/helpers.py create mode 100644 leetcode/two_sum/playground.ipynb create mode 100644 leetcode/two_sum/solution.py create mode 100644 leetcode/two_sum/test_solution.py diff --git a/.github/workflows/ci-test-reproducibility.yml b/.github/workflows/ci-test-reproducibility.yml index 42c71c2..1be9cab 100644 --- a/.github/workflows/ci-test-reproducibility.yml +++ b/.github/workflows/ci-test-reproducibility.yml @@ -35,6 +35,40 @@ jobs: - name: Install dependencies run: poetry install --no-interaction --no-ansi + - name: Cache Graphviz installation + id: cache-graphviz + uses: actions/cache@0400d5f644dc74513175e3cd8d07132dd4860809 # v4.2.4 + with: + path: ~/graphviz-cache + key: graphviz-installed-${{ runner.os }} + + - name: Install Graphviz + run: | + if [ "${{ steps.cache-graphviz.outputs.cache-hit }}" = "true" ]; then + sudo cp ~/graphviz-cache/bin/* /usr/bin/ 2>/dev/null || true + sudo cp ~/graphviz-cache/lib/* /usr/lib/x86_64-linux-gnu/ 2>/dev/null || true + sudo cp -r ~/graphviz-cache/share/graphviz /usr/share/ 2>/dev/null || true + sudo cp -r ~/graphviz-cache/lib/graphviz /usr/lib/x86_64-linux-gnu/ 2>/dev/null || true + sudo ldconfig + sudo dot -c + else + sudo apt-get update + sudo apt-get install -y graphviz + mkdir -p ~/graphviz-cache/{bin,lib,share} + cp /usr/bin/{dot,neato,twopi,circo,fdp,sfdp,patchwork,osage} ~/graphviz-cache/bin/ 2>/dev/null || true + cp /usr/lib/x86_64-linux-gnu/lib{gvc,cgraph,cdt,pathplan,gvpr,lab-gamut,ann,gts}* ~/graphviz-cache/lib/ 2>/dev/null || true + cp -r /usr/lib/x86_64-linux-gnu/graphviz ~/graphviz-cache/lib/ 2>/dev/null || true + cp -r /usr/share/graphviz ~/graphviz-cache/share/ 2>/dev/null || true + fi + + - name: Check test case count + run: poetry run python .templates/check_test_cases.py --threshold=10 --max=100 + + - name: Backup existing problems + run: | + mkdir -p .cache + cp -r leetcode .cache/ + - name: Delete existing problems run: rm -rf leetcode/*/ @@ -46,3 +80,15 @@ jobs: - name: Run linting to verify reproducibility run: make lint + + - name: Copy solution files from backup + run: | + for problem in .cache/leetcode/*/; do + problem_name=$(basename "$problem") + if [ -f "$problem/solution.py" ] && [ -d "leetcode/$problem_name" ]; then + cp "$problem/solution.py" "leetcode/$problem_name/solution.py" + fi + done + + - name: Run tests + run: make test diff --git a/.templates/check_test_cases.py b/.templates/check_test_cases.py index 4c36ffe..a99a310 100644 --- a/.templates/check_test_cases.py +++ b/.templates/check_test_cases.py @@ -82,10 +82,14 @@ def main( typer.echo(f"Invalid max_results value: {max_results}", err=True) raise typer.Exit(1) - typer.echo(f"Files with ≤{threshold} test cases ({len(filtered_files)} total):") + typer.echo(f"Problems with ≤{threshold} test cases ({len(filtered_files)} total):") for filename, count in filtered_files: typer.echo(f"{filename}: {count} test cases") + # Exit with non-zero code if any files found + if filtered_files: + raise typer.Exit(1) + if __name__ == "__main__": typer.run(main) diff --git a/.templates/leetcode/json/two_sum.json b/.templates/leetcode/json/two_sum.json new file mode 100644 index 0000000..a1c69c3 --- /dev/null +++ b/.templates/leetcode/json/two_sum.json @@ -0,0 +1,63 @@ +{ + "problem_name": "two_sum", + "solution_class_name": "Solution", + "problem_number": "1", + "problem_title": "Two Sum", + "difficulty": "Easy", + "topics": "Array, Hash Table", + "_tags": { "list": ["grind-75"] }, + "readme_description": "Given an array of integers `nums` and an integer `target`, return indices of the two numbers such that they add up to `target`.\n\nYou may assume that each input would have exactly one solution, and you may not use the same element twice.\n\nYou can return the answer in any order.", + "_readme_examples": { + "list": [ + { + "content": "```\nInput: nums = [2,7,11,15], target = 9\nOutput: [0,1]\n```\n**Explanation:** Because nums[0] + nums[1] == 9, we return [0, 1]." + }, + { "content": "```\nInput: nums = [3,2,4], target = 6\nOutput: [1,2]\n```" }, + { "content": "```\nInput: nums = [3,3], target = 6\nOutput: [0,1]\n```" } + ] + }, + "readme_constraints": "- 2 <= nums.length <= 10^4\n- -10^9 <= nums[i] <= 10^9\n- -10^9 <= target <= 10^9\n- Only one valid answer exists.", + "readme_additional": "**Follow-up:** Can you come up with an algorithm that is less than O(n^2) time complexity?", + "helpers_imports": "", + "helpers_content": "", + "helpers_run_name": "two_sum", + "helpers_run_signature": "(solution_class: type, nums: list[int], target: int)", + "helpers_run_body": " implementation = solution_class()\n return implementation.two_sum(nums, target)", + "helpers_assert_name": "two_sum", + "helpers_assert_signature": "(result: list[int], expected: list[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.test_utils import logged_test\nfrom .helpers import assert_two_sum, run_two_sum\nfrom .solution import Solution", + "test_content": "", + "test_class_name": "TwoSum", + "test_class_content": " def setup_method(self):\n self.solution = Solution()", + "_solution_methods": { + "list": [ + { + "name": "two_sum", + "signature": "(self, nums: list[int], target: int) -> list[int]", + "body": " # TODO: Implement two_sum\n return []" + } + ] + }, + "_test_helper_methods": { + "list": [{ "name": "setup_method", "parameters": "", "body": "self.solution = Solution()" }] + }, + "_test_methods": { + "list": [ + { + "name": "test_two_sum", + "signature": "(self, nums: list[int], target: int, expected: list[int])", + "parametrize": "nums, target, expected", + "test_cases": "[([2, 7, 11, 15], 9, [0, 1]), ([3, 2, 4], 6, [1, 2]), ([3, 3], 6, [0, 1]), ([2, 5, 5, 11], 10, [1, 2]), ([1, 2, 3, 4, 5], 8, [2, 4]), ([0, 4, 3, 0], 0, [0, 3]), ([-1, -2, -3, -4, -5], -8, [2, 4]), ([1, 3, 4, 2], 6, [2, 3]), ([5, 75, 25], 100, [1, 2]), ([-3, 4, 3, 90], 0, [0, 2]), ([1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 2], 6, [5, 11]), ([2, 1, 9, 4, 4, 56, 90, 3], 8, [3, 4]), ([89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99], 185, [3, 4]), ([-1000000000, 1000000000], 0, [0, 1]), ([0, 1], 1, [0, 1]), ([1, 2], 5, []), ([3, 5, 7], 1, []), ([10, 20, 30], 15, [])]", + "body": " result = run_two_sum(Solution, nums, target)\n assert_two_sum(result, expected)" + } + ] + }, + "playground_imports": "from helpers import run_two_sum, assert_two_sum\nfrom solution import Solution", + "playground_setup": "# Example test case\nnums = [2, 7, 11, 15]\ntarget = 9\nexpected = [0, 1]", + "playground_run": "result = run_two_sum(Solution, nums, target)\nresult", + "playground_assert": "assert_two_sum(result, expected)" +} diff --git a/Makefile b/Makefile index 3bdc248..0f97dae 100644 --- a/Makefile +++ b/Makefile @@ -1,5 +1,5 @@ PYTHON_VERSION = 3.13 -PROBLEM ?= min_stack +PROBLEM ?= two_sum FORCE ?= 0 COMMA := , diff --git a/leetcode/two_sum/README.md b/leetcode/two_sum/README.md new file mode 100644 index 0000000..7f8a41d --- /dev/null +++ b/leetcode/two_sum/README.md @@ -0,0 +1,49 @@ +# Two Sum + +**Difficulty:** Easy +**Topics:** Array, Hash Table +**Tags:** grind-75 + +**LeetCode:** [Problem 1](https://leetcode.com/problems/two-sum/description/) + +## Problem Description + +Given an array of integers `nums` and an integer `target`, return indices of the two numbers such that they add up to `target`. + +You may assume that each input would have exactly one solution, and you may not use the same element twice. + +You can return the answer in any order. + +## Examples + +### Example 1: + +``` +Input: nums = [2,7,11,15], target = 9 +Output: [0,1] +``` + +**Explanation:** 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] +``` + +## Constraints + +- 2 <= nums.length <= 10^4 +- -10^9 <= nums[i] <= 10^9 +- -10^9 <= target <= 10^9 +- Only one valid answer exists. + +**Follow-up:** Can you come up with an algorithm that is less than O(n^2) time complexity? diff --git a/leetcode/two_sum/__init__.py b/leetcode/two_sum/__init__.py new file mode 100644 index 0000000..e69de29 diff --git a/leetcode/two_sum/helpers.py b/leetcode/two_sum/helpers.py new file mode 100644 index 0000000..00f7b73 --- /dev/null +++ b/leetcode/two_sum/helpers.py @@ -0,0 +1,8 @@ +def run_two_sum(solution_class: type, nums: list[int], target: int): + implementation = solution_class() + return implementation.two_sum(nums, target) + + +def assert_two_sum(result: list[int], expected: list[int]) -> bool: + assert result == expected + return True diff --git a/leetcode/two_sum/playground.ipynb b/leetcode/two_sum/playground.ipynb new file mode 100644 index 0000000..1a6ec8b --- /dev/null +++ b/leetcode/two_sum/playground.ipynb @@ -0,0 +1,92 @@ +{ + "cells": [ + { + "cell_type": "code", + "execution_count": 1, + "id": "imports", + "metadata": {}, + "outputs": [], + "source": [ + "from helpers import assert_two_sum, run_two_sum\n", + "from solution import Solution" + ] + }, + { + "cell_type": "code", + "execution_count": 2, + "id": "setup", + "metadata": {}, + "outputs": [], + "source": [ + "# Example test case\n", + "nums = [2, 7, 11, 15]\n", + "target = 9\n", + "expected = [0, 1]" + ] + }, + { + "cell_type": "code", + "execution_count": 3, + "id": "run", + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "[0, 1]" + ] + }, + "execution_count": 3, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "result = run_two_sum(Solution, nums, target)\n", + "result" + ] + }, + { + "cell_type": "code", + "execution_count": 4, + "id": "assert", + "metadata": {}, + "outputs": [ + { + "data": { + "text/plain": [ + "True" + ] + }, + "execution_count": 4, + "metadata": {}, + "output_type": "execute_result" + } + ], + "source": [ + "assert_two_sum(result, expected)" + ] + } + ], + "metadata": { + "kernelspec": { + "display_name": "leetcode-py-py3.13", + "language": "python", + "name": "python3" + }, + "language_info": { + "codemirror_mode": { + "name": "ipython", + "version": 3 + }, + "file_extension": ".py", + "mimetype": "text/x-python", + "name": "python", + "nbconvert_exporter": "python", + "pygments_lexer": "ipython3", + "version": "3.13.7" + } + }, + "nbformat": 4, + "nbformat_minor": 5 +} diff --git a/leetcode/two_sum/solution.py b/leetcode/two_sum/solution.py new file mode 100644 index 0000000..ea4c593 --- /dev/null +++ b/leetcode/two_sum/solution.py @@ -0,0 +1,12 @@ +class Solution: + + # Time: O(n) + # Space: O(n) + def two_sum(self, nums: list[int], target: int) -> list[int]: + seen: dict[int, int] = {} + for i, num in enumerate(nums): + complement = target - num + if complement in seen: + return [seen[complement], i] + seen[num] = i + return [] diff --git a/leetcode/two_sum/test_solution.py b/leetcode/two_sum/test_solution.py new file mode 100644 index 0000000..75cb3f3 --- /dev/null +++ b/leetcode/two_sum/test_solution.py @@ -0,0 +1,39 @@ +import pytest + +from leetcode_py.test_utils import logged_test + +from .helpers import assert_two_sum, run_two_sum +from .solution import Solution + + +class TestTwoSum: + def setup_method(self): + self.solution = Solution() + + @logged_test + @pytest.mark.parametrize( + "nums, target, expected", + [ + ([2, 7, 11, 15], 9, [0, 1]), + ([3, 2, 4], 6, [1, 2]), + ([3, 3], 6, [0, 1]), + ([2, 5, 5, 11], 10, [1, 2]), + ([1, 2, 3, 4, 5], 8, [2, 4]), + ([0, 4, 3, 0], 0, [0, 3]), + ([-1, -2, -3, -4, -5], -8, [2, 4]), + ([1, 3, 4, 2], 6, [2, 3]), + ([5, 75, 25], 100, [1, 2]), + ([-3, 4, 3, 90], 0, [0, 2]), + ([1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 2], 6, [5, 11]), + ([2, 1, 9, 4, 4, 56, 90, 3], 8, [3, 4]), + ([89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99], 185, [3, 4]), + ([-1000000000, 1000000000], 0, [0, 1]), + ([0, 1], 1, [0, 1]), + ([1, 2], 5, []), + ([3, 5, 7], 1, []), + ([10, 20, 30], 15, []), + ], + ) + def test_two_sum(self, nums: list[int], target: int, expected: list[int]): + result = run_two_sum(Solution, nums, target) + assert_two_sum(result, expected) From 9f2c846652153909a578b1c5730a985f2a892493 Mon Sep 17 00:00:00 2001 From: Wisaroot <66859294+wisarootl@users.noreply.github.com> Date: Sat, 13 Sep 2025 01:09:34 +0700 Subject: [PATCH 02/57] feat: convert .ipynb to .py (#37) --- .codecov.yml | 2 + .github/workflows/ci-pre-commit.yml | 4 + .pre-commit-config.yaml | 11 + Makefile | 7 + leetcode/accounts_merge/playground.ipynb | 102 ------ leetcode/accounts_merge/playground.py | 38 ++ leetcode/add_binary/playground.ipynb | 69 ---- leetcode/add_binary/playground.py | 30 ++ .../balanced_binary_tree/playground.ipynb | 183 ---------- leetcode/balanced_binary_tree/playground.py | 35 ++ leetcode/basic_calculator/playground.ipynb | 91 ----- leetcode/basic_calculator/playground.py | 30 ++ .../playground.ipynb | 91 ----- .../playground.py | 30 ++ leetcode/binary_search/playground.ipynb | 69 ---- leetcode/binary_search/playground.py | 31 ++ .../playground.ipynb | 70 ---- .../playground.py | 30 ++ .../playground.ipynb | 183 ---------- .../binary_tree_right_side_view/playground.py | 36 ++ .../test_solution.py | 9 +- leetcode/climbing_stairs/playground.ipynb | 68 ---- leetcode/climbing_stairs/playground.py | 30 ++ leetcode/clone_graph/playground.ipynb | 69 ---- leetcode/clone_graph/playground.py | 29 ++ leetcode/coin_change/playground.ipynb | 69 ---- leetcode/coin_change/playground.py | 31 ++ leetcode/combination_sum/playground.ipynb | 69 ---- leetcode/combination_sum/playground.py | 31 ++ .../playground.ipynb | 68 ---- .../container_with_most_water/playground.py | 30 ++ leetcode/contains_duplicate/playground.ipynb | 91 ----- leetcode/contains_duplicate/playground.py | 30 ++ leetcode/course_schedule/playground.ipynb | 69 ---- leetcode/course_schedule/playground.py | 31 ++ .../diameter_of_binary_tree/playground.ipynb | 70 ---- .../diameter_of_binary_tree/playground.py | 30 ++ .../playground.ipynb | 68 ---- .../playground.py | 30 ++ .../playground.ipynb | 70 ---- .../playground.py | 32 ++ leetcode/first_bad_version/playground.ipynb | 69 ---- leetcode/first_bad_version/playground.py | 31 ++ leetcode/flood_fill/playground.ipynb | 71 ---- leetcode/flood_fill/playground.py | 33 ++ .../playground.ipynb | 70 ---- .../playground.py | 32 ++ .../playground.ipynb | 204 ----------- .../implement_trie_prefix_tree/playground.py | 32 ++ leetcode/insert_interval/playground.ipynb | 69 ---- leetcode/insert_interval/playground.py | 31 ++ leetcode/invert_binary_tree/playground.ipynb | 185 ---------- leetcode/invert_binary_tree/playground.py | 30 ++ leetcode/invert_binary_tree/test_solution.py | 9 +- .../playground.ipynb | 69 ---- .../k_closest_points_to_origin/playground.py | 31 ++ .../playground.ipynb | 71 ---- .../playground.py | 31 ++ .../playground.ipynb | 68 ---- .../playground.py | 30 ++ leetcode/linked_list_cycle/playground.ipynb | 177 ---------- leetcode/linked_list_cycle/playground.py | 35 ++ leetcode/longest_palindrome/playground.ipynb | 68 ---- leetcode/longest_palindrome/playground.py | 30 ++ .../playground.ipynb | 68 ---- .../playground.py | 30 ++ .../test_solution.py | 7 +- .../playground.ipynb | 68 ---- .../playground.py | 30 ++ .../playground.ipynb | 72 ---- .../playground.py | 32 ++ .../playground.ipynb | 72 ---- .../playground.py | 32 ++ leetcode/lru_cache/playground.ipynb | 100 ------ leetcode/lru_cache/playground.py | 32 ++ leetcode/lru_cache/test_solution.py | 13 +- leetcode/majority_element/playground.ipynb | 68 ---- leetcode/majority_element/playground.py | 30 ++ .../playground.ipynb | 70 ---- .../playground.py | 30 ++ .../playground.ipynb | 70 ---- .../playground.py | 32 ++ leetcode/maximum_subarray/playground.ipynb | 68 ---- leetcode/maximum_subarray/playground.py | 30 ++ leetcode/merge_intervals/playground.ipynb | 68 ---- leetcode/merge_intervals/playground.py | 30 ++ .../merge_k_sorted_lists/playground.ipynb | 70 ---- leetcode/merge_k_sorted_lists/playground.py | 32 ++ .../merge_two_sorted_lists/playground.ipynb | 71 ---- leetcode/merge_two_sorted_lists/playground.py | 33 ++ .../playground.ipynb | 70 ---- .../middle_of_the_linked_list/playground.py | 32 ++ leetcode/min_stack/playground.ipynb | 69 ---- leetcode/min_stack/playground.py | 31 ++ .../minimum_height_trees/playground.ipynb | 69 ---- leetcode/minimum_height_trees/playground.py | 31 ++ .../minimum_window_substring/playground.ipynb | 69 ---- .../minimum_window_substring/playground.py | 31 ++ leetcode/number_of_islands/playground.ipynb | 73 ---- leetcode/number_of_islands/playground.py | 35 ++ .../playground.ipynb | 68 ---- .../partition_equal_subset_sum/playground.py | 30 ++ .../test_solution.py | 7 +- leetcode/permutations/playground.ipynb | 68 ---- leetcode/permutations/playground.py | 30 ++ .../playground.ipynb | 68 ---- .../playground.py | 30 ++ leetcode/ransom_note/playground.ipynb | 69 ---- leetcode/ransom_note/playground.py | 31 ++ leetcode/reverse_linked_list/playground.ipynb | 70 ---- leetcode/reverse_linked_list/playground.py | 30 ++ .../reverse_linked_list_ii/playground.ipynb | 71 ---- leetcode/reverse_linked_list_ii/playground.py | 31 ++ leetcode/rotting_oranges/playground.ipynb | 68 ---- leetcode/rotting_oranges/playground.py | 30 ++ .../playground.ipynb | 69 ---- .../playground.py | 31 ++ .../playground.ipynb | 69 ---- .../playground.py | 29 ++ leetcode/sort_colors/playground.ipynb | 68 ---- leetcode/sort_colors/playground.py | 30 ++ leetcode/spiral_matrix/playground.ipynb | 68 ---- leetcode/spiral_matrix/playground.py | 30 ++ .../string_to_integer_atoi/playground.ipynb | 68 ---- leetcode/string_to_integer_atoi/playground.py | 30 ++ leetcode/task_scheduler/playground.ipynb | 69 ---- leetcode/task_scheduler/playground.py | 31 ++ leetcode/three_sum/playground.ipynb | 68 ---- leetcode/three_sum/playground.py | 30 ++ .../playground.ipynb | 69 ---- .../time_based_key_value_store/playground.py | 31 ++ leetcode/trapping_rain_water/playground.ipynb | 91 ----- leetcode/trapping_rain_water/playground.py | 30 ++ leetcode/two_sum/playground.ipynb | 92 ----- leetcode/two_sum/playground.py | 31 ++ leetcode/valid_anagram/playground.ipynb | 92 ----- leetcode/valid_anagram/playground.py | 31 ++ leetcode/valid_palindrome/playground.ipynb | 68 ---- leetcode/valid_palindrome/playground.py | 30 ++ leetcode/valid_parentheses/playground.ipynb | 68 ---- leetcode/valid_parentheses/playground.py | 30 ++ .../playground.ipynb | 70 ---- .../validate_binary_search_tree/playground.py | 30 ++ .../test_solution.py | 7 +- leetcode/word_break/playground.ipynb | 69 ---- leetcode/word_break/playground.py | 31 ++ leetcode/word_ladder/playground.ipynb | 70 ---- leetcode/word_ladder/playground.py | 32 ++ leetcode/zero_one_matrix/playground.ipynb | 91 ----- leetcode/zero_one_matrix/playground.py | 30 ++ poetry.lock | 326 +++++++++++++++++- pyproject.toml | 1 + scripts/shared | 2 +- sonar-project.properties | 2 +- 154 files changed, 2558 insertions(+), 5667 deletions(-) delete mode 100644 leetcode/accounts_merge/playground.ipynb create mode 100644 leetcode/accounts_merge/playground.py delete mode 100644 leetcode/add_binary/playground.ipynb create mode 100644 leetcode/add_binary/playground.py delete mode 100644 leetcode/balanced_binary_tree/playground.ipynb create mode 100644 leetcode/balanced_binary_tree/playground.py delete mode 100644 leetcode/basic_calculator/playground.ipynb create mode 100644 leetcode/basic_calculator/playground.py delete mode 100644 leetcode/best_time_to_buy_and_sell_stock/playground.ipynb create mode 100644 leetcode/best_time_to_buy_and_sell_stock/playground.py delete mode 100644 leetcode/binary_search/playground.ipynb create mode 100644 leetcode/binary_search/playground.py delete mode 100644 leetcode/binary_tree_level_order_traversal/playground.ipynb create mode 100644 leetcode/binary_tree_level_order_traversal/playground.py delete mode 100644 leetcode/binary_tree_right_side_view/playground.ipynb create mode 100644 leetcode/binary_tree_right_side_view/playground.py delete mode 100644 leetcode/climbing_stairs/playground.ipynb create mode 100644 leetcode/climbing_stairs/playground.py delete mode 100644 leetcode/clone_graph/playground.ipynb create mode 100644 leetcode/clone_graph/playground.py delete mode 100644 leetcode/coin_change/playground.ipynb create mode 100644 leetcode/coin_change/playground.py delete mode 100644 leetcode/combination_sum/playground.ipynb create mode 100644 leetcode/combination_sum/playground.py delete mode 100644 leetcode/container_with_most_water/playground.ipynb create mode 100644 leetcode/container_with_most_water/playground.py delete mode 100644 leetcode/contains_duplicate/playground.ipynb create mode 100644 leetcode/contains_duplicate/playground.py delete mode 100644 leetcode/course_schedule/playground.ipynb create mode 100644 leetcode/course_schedule/playground.py delete mode 100644 leetcode/diameter_of_binary_tree/playground.ipynb create mode 100644 leetcode/diameter_of_binary_tree/playground.py delete mode 100644 leetcode/evaluate_reverse_polish_notation/playground.ipynb create mode 100644 leetcode/evaluate_reverse_polish_notation/playground.py delete mode 100644 leetcode/find_median_from_data_stream/playground.ipynb create mode 100644 leetcode/find_median_from_data_stream/playground.py delete mode 100644 leetcode/first_bad_version/playground.ipynb create mode 100644 leetcode/first_bad_version/playground.py delete mode 100644 leetcode/flood_fill/playground.ipynb create mode 100644 leetcode/flood_fill/playground.py delete mode 100644 leetcode/implement_queue_using_stacks/playground.ipynb create mode 100644 leetcode/implement_queue_using_stacks/playground.py delete mode 100644 leetcode/implement_trie_prefix_tree/playground.ipynb create mode 100644 leetcode/implement_trie_prefix_tree/playground.py delete mode 100644 leetcode/insert_interval/playground.ipynb create mode 100644 leetcode/insert_interval/playground.py delete mode 100644 leetcode/invert_binary_tree/playground.ipynb create mode 100644 leetcode/invert_binary_tree/playground.py delete mode 100644 leetcode/k_closest_points_to_origin/playground.ipynb create mode 100644 leetcode/k_closest_points_to_origin/playground.py delete mode 100644 leetcode/kth_smallest_element_in_a_bst/playground.ipynb create mode 100644 leetcode/kth_smallest_element_in_a_bst/playground.py delete mode 100644 leetcode/largest_rectangle_in_histogram/playground.ipynb create mode 100644 leetcode/largest_rectangle_in_histogram/playground.py delete mode 100644 leetcode/linked_list_cycle/playground.ipynb create mode 100644 leetcode/linked_list_cycle/playground.py delete mode 100644 leetcode/longest_palindrome/playground.ipynb create mode 100644 leetcode/longest_palindrome/playground.py delete mode 100644 leetcode/longest_palindromic_substring/playground.ipynb create mode 100644 leetcode/longest_palindromic_substring/playground.py delete mode 100644 leetcode/longest_substring_without_repeating_characters/playground.ipynb create mode 100644 leetcode/longest_substring_without_repeating_characters/playground.py delete mode 100644 leetcode/lowest_common_ancestor_of_a_binary_search_tree/playground.ipynb create mode 100644 leetcode/lowest_common_ancestor_of_a_binary_search_tree/playground.py delete mode 100644 leetcode/lowest_common_ancestor_of_a_binary_tree/playground.ipynb create mode 100644 leetcode/lowest_common_ancestor_of_a_binary_tree/playground.py delete mode 100644 leetcode/lru_cache/playground.ipynb create mode 100644 leetcode/lru_cache/playground.py delete mode 100644 leetcode/majority_element/playground.ipynb create mode 100644 leetcode/majority_element/playground.py delete mode 100644 leetcode/maximum_depth_of_binary_tree/playground.ipynb create mode 100644 leetcode/maximum_depth_of_binary_tree/playground.py delete mode 100644 leetcode/maximum_profit_in_job_scheduling/playground.ipynb create mode 100644 leetcode/maximum_profit_in_job_scheduling/playground.py delete mode 100644 leetcode/maximum_subarray/playground.ipynb create mode 100644 leetcode/maximum_subarray/playground.py delete mode 100644 leetcode/merge_intervals/playground.ipynb create mode 100644 leetcode/merge_intervals/playground.py delete mode 100644 leetcode/merge_k_sorted_lists/playground.ipynb create mode 100644 leetcode/merge_k_sorted_lists/playground.py delete mode 100644 leetcode/merge_two_sorted_lists/playground.ipynb create mode 100644 leetcode/merge_two_sorted_lists/playground.py delete mode 100644 leetcode/middle_of_the_linked_list/playground.ipynb create mode 100644 leetcode/middle_of_the_linked_list/playground.py delete mode 100644 leetcode/min_stack/playground.ipynb create mode 100644 leetcode/min_stack/playground.py delete mode 100644 leetcode/minimum_height_trees/playground.ipynb create mode 100644 leetcode/minimum_height_trees/playground.py delete mode 100644 leetcode/minimum_window_substring/playground.ipynb create mode 100644 leetcode/minimum_window_substring/playground.py delete mode 100644 leetcode/number_of_islands/playground.ipynb create mode 100644 leetcode/number_of_islands/playground.py delete mode 100644 leetcode/partition_equal_subset_sum/playground.ipynb create mode 100644 leetcode/partition_equal_subset_sum/playground.py delete mode 100644 leetcode/permutations/playground.ipynb create mode 100644 leetcode/permutations/playground.py delete mode 100644 leetcode/product_of_array_except_self/playground.ipynb create mode 100644 leetcode/product_of_array_except_self/playground.py delete mode 100644 leetcode/ransom_note/playground.ipynb create mode 100644 leetcode/ransom_note/playground.py delete mode 100644 leetcode/reverse_linked_list/playground.ipynb create mode 100644 leetcode/reverse_linked_list/playground.py delete mode 100644 leetcode/reverse_linked_list_ii/playground.ipynb create mode 100644 leetcode/reverse_linked_list_ii/playground.py delete mode 100644 leetcode/rotting_oranges/playground.ipynb create mode 100644 leetcode/rotting_oranges/playground.py delete mode 100644 leetcode/search_in_rotated_sorted_array/playground.ipynb create mode 100644 leetcode/search_in_rotated_sorted_array/playground.py delete mode 100644 leetcode/serialize_and_deserialize_binary_tree/playground.ipynb create mode 100644 leetcode/serialize_and_deserialize_binary_tree/playground.py delete mode 100644 leetcode/sort_colors/playground.ipynb create mode 100644 leetcode/sort_colors/playground.py delete mode 100644 leetcode/spiral_matrix/playground.ipynb create mode 100644 leetcode/spiral_matrix/playground.py delete mode 100644 leetcode/string_to_integer_atoi/playground.ipynb create mode 100644 leetcode/string_to_integer_atoi/playground.py delete mode 100644 leetcode/task_scheduler/playground.ipynb create mode 100644 leetcode/task_scheduler/playground.py delete mode 100644 leetcode/three_sum/playground.ipynb create mode 100644 leetcode/three_sum/playground.py delete mode 100644 leetcode/time_based_key_value_store/playground.ipynb create mode 100644 leetcode/time_based_key_value_store/playground.py delete mode 100644 leetcode/trapping_rain_water/playground.ipynb create mode 100644 leetcode/trapping_rain_water/playground.py delete mode 100644 leetcode/two_sum/playground.ipynb create mode 100644 leetcode/two_sum/playground.py delete mode 100644 leetcode/valid_anagram/playground.ipynb create mode 100644 leetcode/valid_anagram/playground.py delete mode 100644 leetcode/valid_palindrome/playground.ipynb create mode 100644 leetcode/valid_palindrome/playground.py delete mode 100644 leetcode/valid_parentheses/playground.ipynb create mode 100644 leetcode/valid_parentheses/playground.py delete mode 100644 leetcode/validate_binary_search_tree/playground.ipynb create mode 100644 leetcode/validate_binary_search_tree/playground.py delete mode 100644 leetcode/word_break/playground.ipynb create mode 100644 leetcode/word_break/playground.py delete mode 100644 leetcode/word_ladder/playground.ipynb create mode 100644 leetcode/word_ladder/playground.py delete mode 100644 leetcode/zero_one_matrix/playground.ipynb create mode 100644 leetcode/zero_one_matrix/playground.py diff --git a/.codecov.yml b/.codecov.yml index 7c00c0a..c11c152 100644 --- a/.codecov.yml +++ b/.codecov.yml @@ -1,4 +1,6 @@ coverage: + ignore: + - "**/playground.py" status: project: default: diff --git a/.github/workflows/ci-pre-commit.yml b/.github/workflows/ci-pre-commit.yml index 2e8ee70..2ff49f4 100644 --- a/.github/workflows/ci-pre-commit.yml +++ b/.github/workflows/ci-pre-commit.yml @@ -9,6 +9,10 @@ jobs: runs-on: ubuntu-latest steps: - uses: actions/checkout@08c6903cd8c0fde910a37f88322edcfb5dd907a8 # v5.0.0 + with: + fetch-depth: 0 + submodules: recursive + token: ${{ secrets.GITHUB_TOKEN }} - uses: actions/setup-python@e797f83bcb11b83ae66e0230d6156d7c80228e7c # v6.0.0 with: diff --git a/.pre-commit-config.yaml b/.pre-commit-config.yaml index 5123e0d..23a8453 100644 --- a/.pre-commit-config.yaml +++ b/.pre-commit-config.yaml @@ -22,6 +22,17 @@ repos: id: gitleaks - repo: local hooks: + - id: sync-submodules + name: Sync git submodules + entry: bash -c 'output=$(git submodule update --init --recursive --remote 2>&1); [ -z "$output" ]' + language: system + always_run: true + pass_filenames: false + - id: nb-to-py + name: convert notebooks to python + entry: make nb-to-py + language: system + pass_filenames: false - id: lint name: lint entry: make lint diff --git a/Makefile b/Makefile index 0f97dae..377ff6d 100644 --- a/Makefile +++ b/Makefile @@ -77,6 +77,13 @@ p-gen: p-del: rm -rf leetcode/$(PROBLEM) +# Convert all notebooks to .py files and delete .ipynb for better version control +nb-to-py: + @echo "Converting all .ipynb files in leetcode/ to .py files..." + @find leetcode -name "*.ipynb" -exec poetry run jupytext --to py:percent {} \; + @find leetcode -name "*.ipynb" -delete + @echo "Conversion complete. All .ipynb files converted to .py and deleted." + # Generate All Problems - useful for people who fork this repo gen-all-problems: @echo "This will DELETE all existing problems and regenerate from JSON templates." diff --git a/leetcode/accounts_merge/playground.ipynb b/leetcode/accounts_merge/playground.ipynb deleted file mode 100644 index f0dcd43..0000000 --- a/leetcode/accounts_merge/playground.ipynb +++ /dev/null @@ -1,102 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": 1, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_accounts_merge, run_accounts_merge\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": 2, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "accounts = [\n", - " [\"John\", \"johnsmith@mail.com\", \"john_newyork@mail.com\"],\n", - " [\"John\", \"johnsmith@mail.com\", \"john00@mail.com\"],\n", - " [\"Mary\", \"mary@mail.com\"],\n", - " [\"John\", \"johnnybravo@mail.com\"],\n", - "]\n", - "expected = [\n", - " [\"John\", \"john00@mail.com\", \"john_newyork@mail.com\", \"johnsmith@mail.com\"],\n", - " [\"Mary\", \"mary@mail.com\"],\n", - " [\"John\", \"johnnybravo@mail.com\"],\n", - "]" - ] - }, - { - "cell_type": "code", - "execution_count": 3, - "id": "run", - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "[['John', 'john00@mail.com', 'john_newyork@mail.com', 'johnsmith@mail.com'],\n", - " ['Mary', 'mary@mail.com'],\n", - " ['John', 'johnnybravo@mail.com']]" - ] - }, - "execution_count": 3, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "result = run_accounts_merge(Solution, accounts)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": 4, - "id": "assert", - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "True" - ] - }, - "execution_count": 4, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "assert_accounts_merge(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/accounts_merge/playground.py b/leetcode/accounts_merge/playground.py new file mode 100644 index 0000000..d2ee36c --- /dev/null +++ b/leetcode/accounts_merge/playground.py @@ -0,0 +1,38 @@ +# --- +# jupyter: +# jupytext: +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_accounts_merge, run_accounts_merge +from solution import Solution + +# %% +# Example test case +accounts = [ + ["John", "johnsmith@mail.com", "john_newyork@mail.com"], + ["John", "johnsmith@mail.com", "john00@mail.com"], + ["Mary", "mary@mail.com"], + ["John", "johnnybravo@mail.com"], +] +expected = [ + ["John", "john00@mail.com", "john_newyork@mail.com", "johnsmith@mail.com"], + ["Mary", "mary@mail.com"], + ["John", "johnnybravo@mail.com"], +] + +# %% +result = run_accounts_merge(Solution, accounts) +result + +# %% +assert_accounts_merge(result, expected) diff --git a/leetcode/add_binary/playground.ipynb b/leetcode/add_binary/playground.ipynb deleted file mode 100644 index 0b2a93d..0000000 --- a/leetcode/add_binary/playground.ipynb +++ /dev/null @@ -1,69 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_add_binary, run_add_binary\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "a = \"11\"\n", - "b = \"1\"\n", - "expected = \"100\"" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_add_binary(Solution, a, b)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_add_binary(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/add_binary/playground.py b/leetcode/add_binary/playground.py new file mode 100644 index 0000000..41e3fdd --- /dev/null +++ b/leetcode/add_binary/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_add_binary, run_add_binary +from solution import Solution + +# %% +# Example test case +a = "11" +b = "1" +expected = "100" + +# %% +result = run_add_binary(Solution, a, b) +result + +# %% +assert_add_binary(result, expected) diff --git a/leetcode/balanced_binary_tree/playground.ipynb b/leetcode/balanced_binary_tree/playground.ipynb deleted file mode 100644 index e115cdb..0000000 --- a/leetcode/balanced_binary_tree/playground.ipynb +++ /dev/null @@ -1,183 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": 1, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_is_balanced, run_is_balanced\n", - "from solution import Solution\n", - "\n", - "from leetcode_py import TreeNode" - ] - }, - { - "cell_type": "code", - "execution_count": 2, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "root_list: list[int | None] = [3, 9, 20, None, None, 15, 7]\n", - "expected = True" - ] - }, - { - "cell_type": "code", - "execution_count": 3, - "id": "run", - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "True" - ] - }, - "execution_count": 3, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "result = run_is_balanced(Solution, root_list)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": 5, - "id": "c01db53b", - "metadata": {}, - "outputs": [ - { - "data": { - "text/html": [ - "\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "0\n", - "\n", - "3\n", - "\n", - "\n", - "\n", - "1\n", - "\n", - "9\n", - "\n", - "\n", - "\n", - "0->1\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "2\n", - "\n", - "20\n", - "\n", - "\n", - "\n", - "0->2\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "3\n", - "\n", - "15\n", - "\n", - "\n", - "\n", - "2->3\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "4\n", - "\n", - "7\n", - "\n", - "\n", - "\n", - "2->4\n", - "\n", - "\n", - "\n", - "\n", - "\n" - ], - "text/plain": [ - "TreeNode([3, 9, 20, None, None, 15, 7])" - ] - }, - "execution_count": 5, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "root = TreeNode.from_list(root_list)\n", - "root" - ] - }, - { - "cell_type": "code", - "execution_count": 4, - "id": "assert", - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "True" - ] - }, - "execution_count": 4, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "assert_is_balanced(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/balanced_binary_tree/playground.py b/leetcode/balanced_binary_tree/playground.py new file mode 100644 index 0000000..900c979 --- /dev/null +++ b/leetcode/balanced_binary_tree/playground.py @@ -0,0 +1,35 @@ +# --- +# jupyter: +# jupytext: +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_is_balanced, run_is_balanced +from solution import Solution + +from leetcode_py import TreeNode + +# %% +# Example test case +root_list: list[int | None] = [3, 9, 20, None, None, 15, 7] +expected = True + +# %% +result = run_is_balanced(Solution, root_list) +result + +# %% +root = TreeNode.from_list(root_list) +root + +# %% +assert_is_balanced(result, expected) diff --git a/leetcode/basic_calculator/playground.ipynb b/leetcode/basic_calculator/playground.ipynb deleted file mode 100644 index d7681b7..0000000 --- a/leetcode/basic_calculator/playground.ipynb +++ /dev/null @@ -1,91 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": 1, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_calculate, run_calculate\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": 2, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "s = \"(1+(4+5+2)-3)+(6+8)\"\n", - "expected = 23" - ] - }, - { - "cell_type": "code", - "execution_count": 3, - "id": "run", - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "23" - ] - }, - "execution_count": 3, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "result = run_calculate(Solution, s)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": 4, - "id": "assert", - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "True" - ] - }, - "execution_count": 4, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "assert_calculate(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/basic_calculator/playground.py b/leetcode/basic_calculator/playground.py new file mode 100644 index 0000000..261975f --- /dev/null +++ b/leetcode/basic_calculator/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_calculate, run_calculate +from solution import Solution + +# %% +# Example test case +s = "(1+(4+5+2)-3)+(6+8)" +expected = 23 + +# %% +result = run_calculate(Solution, s) +result + +# %% +assert_calculate(result, expected) diff --git a/leetcode/best_time_to_buy_and_sell_stock/playground.ipynb b/leetcode/best_time_to_buy_and_sell_stock/playground.ipynb deleted file mode 100644 index 81034bf..0000000 --- a/leetcode/best_time_to_buy_and_sell_stock/playground.ipynb +++ /dev/null @@ -1,91 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": 1, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_max_profit, run_max_profit\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": 2, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "prices = [7, 1, 5, 3, 6, 4]\n", - "expected = 5" - ] - }, - { - "cell_type": "code", - "execution_count": 3, - "id": "run", - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "5" - ] - }, - "execution_count": 3, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "result = run_max_profit(Solution, prices)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": 4, - "id": "assert", - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "True" - ] - }, - "execution_count": 4, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "assert_max_profit(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/best_time_to_buy_and_sell_stock/playground.py b/leetcode/best_time_to_buy_and_sell_stock/playground.py new file mode 100644 index 0000000..e643984 --- /dev/null +++ b/leetcode/best_time_to_buy_and_sell_stock/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_max_profit, run_max_profit +from solution import Solution + +# %% +# Example test case +prices = [7, 1, 5, 3, 6, 4] +expected = 5 + +# %% +result = run_max_profit(Solution, prices) +result + +# %% +assert_max_profit(result, expected) diff --git a/leetcode/binary_search/playground.ipynb b/leetcode/binary_search/playground.ipynb deleted file mode 100644 index 9c1a608..0000000 --- a/leetcode/binary_search/playground.ipynb +++ /dev/null @@ -1,69 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_search, run_search\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "nums = [-1, 0, 3, 5, 9, 12]\n", - "target = 9\n", - "expected = 4" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_search(Solution, nums, target)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_search(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/binary_search/playground.py b/leetcode/binary_search/playground.py new file mode 100644 index 0000000..02af2a1 --- /dev/null +++ b/leetcode/binary_search/playground.py @@ -0,0 +1,31 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_search, run_search +from solution import Solution + +# %% +# Example test case +nums = [-1, 0, 3, 5, 9, 12] +target = 9 +expected = 4 + +# %% +result = run_search(Solution, nums, target) +result + +# %% +assert_search(result, expected) diff --git a/leetcode/binary_tree_level_order_traversal/playground.ipynb b/leetcode/binary_tree_level_order_traversal/playground.ipynb deleted file mode 100644 index 9c98b39..0000000 --- a/leetcode/binary_tree_level_order_traversal/playground.ipynb +++ /dev/null @@ -1,70 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_level_order, run_level_order\n", - "from solution import Solution\n", - "\n", - "from leetcode_py import TreeNode" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "root_list: list[int | None] = [3, 9, 20, None, None, 15, 7]\n", - "expected = [[3], [9, 20], [15, 7]]" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_level_order(Solution, root_list)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_level_order(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/binary_tree_level_order_traversal/playground.py b/leetcode/binary_tree_level_order_traversal/playground.py new file mode 100644 index 0000000..42a84cd --- /dev/null +++ b/leetcode/binary_tree_level_order_traversal/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_level_order, run_level_order +from solution import Solution + +# %% +# Example test case +root_list: list[int | None] = [3, 9, 20, None, None, 15, 7] +expected = [[3], [9, 20], [15, 7]] + +# %% +result = run_level_order(Solution, root_list) +result + +# %% +assert_level_order(result, expected) diff --git a/leetcode/binary_tree_right_side_view/playground.ipynb b/leetcode/binary_tree_right_side_view/playground.ipynb deleted file mode 100644 index 9187c4f..0000000 --- a/leetcode/binary_tree_right_side_view/playground.ipynb +++ /dev/null @@ -1,183 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": 1, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_right_side_view, run_right_side_view\n", - "from solution import Solution\n", - "\n", - "from leetcode_py import TreeNode" - ] - }, - { - "cell_type": "code", - "execution_count": 2, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "root_list: list[int | None] = [1, 2, 3, None, 5, None, 4]\n", - "expected = [1, 3, 4]" - ] - }, - { - "cell_type": "code", - "execution_count": 3, - "id": "6ba11550", - "metadata": {}, - "outputs": [ - { - "data": { - "text/html": [ - "\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "0\n", - "\n", - "1\n", - "\n", - "\n", - "\n", - "1\n", - "\n", - "2\n", - "\n", - "\n", - "\n", - "0->1\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "3\n", - "\n", - "3\n", - "\n", - "\n", - "\n", - "0->3\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "2\n", - "\n", - "5\n", - "\n", - "\n", - "\n", - "1->2\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "4\n", - "\n", - "4\n", - "\n", - "\n", - "\n", - "3->4\n", - "\n", - "\n", - "\n", - "\n", - "\n" - ], - "text/plain": [ - "TreeNode([1, 2, 3, None, 5, None, 4])" - ] - }, - "execution_count": 3, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "root = TreeNode.from_list(root_list)\n", - "root" - ] - }, - { - "cell_type": "code", - "execution_count": 4, - "id": "run", - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "[1, 3, 4]" - ] - }, - "execution_count": 4, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "result = run_right_side_view(Solution, root_list)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": 5, - "id": "assert", - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "True" - ] - }, - "execution_count": 5, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "assert_right_side_view(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/binary_tree_right_side_view/playground.py b/leetcode/binary_tree_right_side_view/playground.py new file mode 100644 index 0000000..bbef9b5 --- /dev/null +++ b/leetcode/binary_tree_right_side_view/playground.py @@ -0,0 +1,36 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_right_side_view, run_right_side_view +from solution import Solution + +from leetcode_py import TreeNode + +# %% +# Example test case +root_list: list[int | None] = [1, 2, 3, None, 5, None, 4] +expected = [1, 3, 4] + +# %% +root = TreeNode.from_list(root_list) +root + +# %% +result = run_right_side_view(Solution, root_list) +result + +# %% +assert_right_side_view(result, expected) diff --git a/leetcode/binary_tree_right_side_view/test_solution.py b/leetcode/binary_tree_right_side_view/test_solution.py index 2a1ca50..871ecef 100644 --- a/leetcode/binary_tree_right_side_view/test_solution.py +++ b/leetcode/binary_tree_right_side_view/test_solution.py @@ -3,7 +3,7 @@ from leetcode_py.test_utils import logged_test from .helpers import assert_right_side_view, run_right_side_view -from .solution import Solution +from .solution import Solution, SolutionBFS, SolutionDFS class TestBinaryTreeRightSideView: @@ -11,6 +11,7 @@ def setup_method(self): self.solution = Solution() @logged_test + @pytest.mark.parametrize("solution_class", [Solution, SolutionDFS, SolutionBFS]) @pytest.mark.parametrize( "root_list, expected", [ @@ -30,6 +31,8 @@ def setup_method(self): ([10, 5, 15, None, 6, 12, 20], [10, 15, 20]), ], ) - def test_right_side_view(self, root_list: list[int | None], expected: list[int]): - result = run_right_side_view(Solution, root_list) + def test_right_side_view( + self, solution_class: type, root_list: list[int | None], expected: list[int] + ): + result = run_right_side_view(solution_class, root_list) assert_right_side_view(result, expected) diff --git a/leetcode/climbing_stairs/playground.ipynb b/leetcode/climbing_stairs/playground.ipynb deleted file mode 100644 index 6fd5d25..0000000 --- a/leetcode/climbing_stairs/playground.ipynb +++ /dev/null @@ -1,68 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_climb_stairs, run_climb_stairs\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "n = 3\n", - "expected = 3" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_climb_stairs(Solution, n)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_climb_stairs(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/climbing_stairs/playground.py b/leetcode/climbing_stairs/playground.py new file mode 100644 index 0000000..51601a5 --- /dev/null +++ b/leetcode/climbing_stairs/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_climb_stairs, run_climb_stairs +from solution import Solution + +# %% +# Example test case +n = 3 +expected = 3 + +# %% +result = run_climb_stairs(Solution, n) +result + +# %% +assert_climb_stairs(result, expected) diff --git a/leetcode/clone_graph/playground.ipynb b/leetcode/clone_graph/playground.ipynb deleted file mode 100644 index bb2a422..0000000 --- a/leetcode/clone_graph/playground.ipynb +++ /dev/null @@ -1,69 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_clone_graph, run_clone_graph\n", - "from solution import Solution\n", - "\n", - "from leetcode_py import GraphNode" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "adj_list = [[2, 4], [1, 3], [2, 4], [1, 3]]" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_clone_graph(Solution, adj_list)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_clone_graph(result, adj_list)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/clone_graph/playground.py b/leetcode/clone_graph/playground.py new file mode 100644 index 0000000..509f051 --- /dev/null +++ b/leetcode/clone_graph/playground.py @@ -0,0 +1,29 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_clone_graph, run_clone_graph +from solution import Solution + +# %% +# Example test case +adj_list = [[2, 4], [1, 3], [2, 4], [1, 3]] + +# %% +result = run_clone_graph(Solution, adj_list) +result + +# %% +assert_clone_graph(result, adj_list) diff --git a/leetcode/coin_change/playground.ipynb b/leetcode/coin_change/playground.ipynb deleted file mode 100644 index 580d39c..0000000 --- a/leetcode/coin_change/playground.ipynb +++ /dev/null @@ -1,69 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_coin_change, run_coin_change\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "coins = [1, 2, 5]\n", - "amount = 11\n", - "expected = 3" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_coin_change(Solution, coins, amount)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_coin_change(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/coin_change/playground.py b/leetcode/coin_change/playground.py new file mode 100644 index 0000000..99c925d --- /dev/null +++ b/leetcode/coin_change/playground.py @@ -0,0 +1,31 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_coin_change, run_coin_change +from solution import Solution + +# %% +# Example test case +coins = [1, 2, 5] +amount = 11 +expected = 3 + +# %% +result = run_coin_change(Solution, coins, amount) +result + +# %% +assert_coin_change(result, expected) diff --git a/leetcode/combination_sum/playground.ipynb b/leetcode/combination_sum/playground.ipynb deleted file mode 100644 index ac0711f..0000000 --- a/leetcode/combination_sum/playground.ipynb +++ /dev/null @@ -1,69 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_combination_sum, run_combination_sum\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "candidates = [2, 3, 6, 7]\n", - "target = 7\n", - "expected = [[2, 2, 3], [7]]" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_combination_sum(Solution, candidates, target)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_combination_sum(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/combination_sum/playground.py b/leetcode/combination_sum/playground.py new file mode 100644 index 0000000..c971550 --- /dev/null +++ b/leetcode/combination_sum/playground.py @@ -0,0 +1,31 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_combination_sum, run_combination_sum +from solution import Solution + +# %% +# Example test case +candidates = [2, 3, 6, 7] +target = 7 +expected = [[2, 2, 3], [7]] + +# %% +result = run_combination_sum(Solution, candidates, target) +result + +# %% +assert_combination_sum(result, expected) diff --git a/leetcode/container_with_most_water/playground.ipynb b/leetcode/container_with_most_water/playground.ipynb deleted file mode 100644 index a95df0a..0000000 --- a/leetcode/container_with_most_water/playground.ipynb +++ /dev/null @@ -1,68 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_max_area, run_max_area\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "height = [1, 8, 6, 2, 5, 4, 8, 3, 7]\n", - "expected = 49" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_max_area(Solution, height)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_max_area(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/container_with_most_water/playground.py b/leetcode/container_with_most_water/playground.py new file mode 100644 index 0000000..6d9f266 --- /dev/null +++ b/leetcode/container_with_most_water/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_max_area, run_max_area +from solution import Solution + +# %% +# Example test case +height = [1, 8, 6, 2, 5, 4, 8, 3, 7] +expected = 49 + +# %% +result = run_max_area(Solution, height) +result + +# %% +assert_max_area(result, expected) diff --git a/leetcode/contains_duplicate/playground.ipynb b/leetcode/contains_duplicate/playground.ipynb deleted file mode 100644 index f43d0de..0000000 --- a/leetcode/contains_duplicate/playground.ipynb +++ /dev/null @@ -1,91 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": 1, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_contains_duplicate, run_contains_duplicate\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": 2, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "nums = [1, 2, 3, 1]\n", - "expected = True" - ] - }, - { - "cell_type": "code", - "execution_count": 3, - "id": "run", - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "True" - ] - }, - "execution_count": 3, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "result = run_contains_duplicate(Solution, nums)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": 4, - "id": "assert", - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "True" - ] - }, - "execution_count": 4, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "assert_contains_duplicate(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/contains_duplicate/playground.py b/leetcode/contains_duplicate/playground.py new file mode 100644 index 0000000..84b6064 --- /dev/null +++ b/leetcode/contains_duplicate/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_contains_duplicate, run_contains_duplicate +from solution import Solution + +# %% +# Example test case +nums = [1, 2, 3, 1] +expected = True + +# %% +result = run_contains_duplicate(Solution, nums) +result + +# %% +assert_contains_duplicate(result, expected) diff --git a/leetcode/course_schedule/playground.ipynb b/leetcode/course_schedule/playground.ipynb deleted file mode 100644 index 2dfeb00..0000000 --- a/leetcode/course_schedule/playground.ipynb +++ /dev/null @@ -1,69 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_can_finish, run_can_finish\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "num_courses = 2\n", - "prerequisites = [[1, 0]]\n", - "expected = True" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_can_finish(Solution, num_courses, prerequisites)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_can_finish(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/course_schedule/playground.py b/leetcode/course_schedule/playground.py new file mode 100644 index 0000000..f1e4aef --- /dev/null +++ b/leetcode/course_schedule/playground.py @@ -0,0 +1,31 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_can_finish, run_can_finish +from solution import Solution + +# %% +# Example test case +num_courses = 2 +prerequisites = [[1, 0]] +expected = True + +# %% +result = run_can_finish(Solution, num_courses, prerequisites) +result + +# %% +assert_can_finish(result, expected) diff --git a/leetcode/diameter_of_binary_tree/playground.ipynb b/leetcode/diameter_of_binary_tree/playground.ipynb deleted file mode 100644 index d401bcf..0000000 --- a/leetcode/diameter_of_binary_tree/playground.ipynb +++ /dev/null @@ -1,70 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_diameter_of_binary_tree, run_diameter_of_binary_tree\n", - "from solution import Solution\n", - "\n", - "from leetcode_py import TreeNode" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "root_list: list[int | None] = [1, 2, 3, 4, 5]\n", - "expected = 3" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_diameter_of_binary_tree(Solution, root_list)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_diameter_of_binary_tree(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/diameter_of_binary_tree/playground.py b/leetcode/diameter_of_binary_tree/playground.py new file mode 100644 index 0000000..afd819a --- /dev/null +++ b/leetcode/diameter_of_binary_tree/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_diameter_of_binary_tree, run_diameter_of_binary_tree +from solution import Solution + +# %% +# Example test case +root_list: list[int | None] = [1, 2, 3, 4, 5] +expected = 3 + +# %% +result = run_diameter_of_binary_tree(Solution, root_list) +result + +# %% +assert_diameter_of_binary_tree(result, expected) diff --git a/leetcode/evaluate_reverse_polish_notation/playground.ipynb b/leetcode/evaluate_reverse_polish_notation/playground.ipynb deleted file mode 100644 index 01fd8b8..0000000 --- a/leetcode/evaluate_reverse_polish_notation/playground.ipynb +++ /dev/null @@ -1,68 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_eval_rpn, run_eval_rpn\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "tokens = [\"2\", \"1\", \"+\", \"3\", \"*\"]\n", - "expected = 9" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_eval_rpn(Solution, tokens)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_eval_rpn(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/evaluate_reverse_polish_notation/playground.py b/leetcode/evaluate_reverse_polish_notation/playground.py new file mode 100644 index 0000000..8ecfa9f --- /dev/null +++ b/leetcode/evaluate_reverse_polish_notation/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_eval_rpn, run_eval_rpn +from solution import Solution + +# %% +# Example test case +tokens = ["2", "1", "+", "3", "*"] +expected = 9 + +# %% +result = run_eval_rpn(Solution, tokens) +result + +# %% +assert_eval_rpn(result, expected) diff --git a/leetcode/find_median_from_data_stream/playground.ipynb b/leetcode/find_median_from_data_stream/playground.ipynb deleted file mode 100644 index 3a72e85..0000000 --- a/leetcode/find_median_from_data_stream/playground.ipynb +++ /dev/null @@ -1,70 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_median_finder, run_median_finder\n", - "from solution import MedianFinder" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "operations = [\"MedianFinder\", \"addNum\", \"addNum\", \"findMedian\", \"addNum\", \"findMedian\"]\n", - "inputs = [[], [1], [2], [], [3], []]\n", - "expected = [None, None, None, 1.5, None, 2.0]" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result, mf = run_median_finder(MedianFinder, operations, inputs)\n", - "print(result)\n", - "mf" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_median_finder(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/find_median_from_data_stream/playground.py b/leetcode/find_median_from_data_stream/playground.py new file mode 100644 index 0000000..351a75a --- /dev/null +++ b/leetcode/find_median_from_data_stream/playground.py @@ -0,0 +1,32 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_median_finder, run_median_finder +from solution import MedianFinder + +# %% +# Example test case +operations = ["MedianFinder", "addNum", "addNum", "findMedian", "addNum", "findMedian"] +inputs = [[], [1], [2], [], [3], []] +expected = [None, None, None, 1.5, None, 2.0] + +# %% +result, mf = run_median_finder(MedianFinder, operations, inputs) +print(result) +mf + +# %% +assert_median_finder(result, expected) diff --git a/leetcode/first_bad_version/playground.ipynb b/leetcode/first_bad_version/playground.ipynb deleted file mode 100644 index eff1efe..0000000 --- a/leetcode/first_bad_version/playground.ipynb +++ /dev/null @@ -1,69 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_first_bad_version, run_first_bad_version\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "n = 5\n", - "bad = 4\n", - "expected = 4" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_first_bad_version(Solution, n, bad)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_first_bad_version(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/first_bad_version/playground.py b/leetcode/first_bad_version/playground.py new file mode 100644 index 0000000..34af8a1 --- /dev/null +++ b/leetcode/first_bad_version/playground.py @@ -0,0 +1,31 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_first_bad_version, run_first_bad_version +from solution import Solution + +# %% +# Example test case +n = 5 +bad = 4 +expected = 4 + +# %% +result = run_first_bad_version(Solution, n, bad) +result + +# %% +assert_first_bad_version(result, expected) diff --git a/leetcode/flood_fill/playground.ipynb b/leetcode/flood_fill/playground.ipynb deleted file mode 100644 index 583f7a1..0000000 --- a/leetcode/flood_fill/playground.ipynb +++ /dev/null @@ -1,71 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_flood_fill, run_flood_fill\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "image = [[1, 1, 1], [1, 1, 0], [1, 0, 1]]\n", - "sr = 1\n", - "sc = 1\n", - "color = 2\n", - "expected = [[2, 2, 2], [2, 2, 0], [2, 0, 1]]" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_flood_fill(Solution, image, sr, sc, color)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_flood_fill(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/flood_fill/playground.py b/leetcode/flood_fill/playground.py new file mode 100644 index 0000000..674fb9c --- /dev/null +++ b/leetcode/flood_fill/playground.py @@ -0,0 +1,33 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_flood_fill, run_flood_fill +from solution import Solution + +# %% +# Example test case +image = [[1, 1, 1], [1, 1, 0], [1, 0, 1]] +sr = 1 +sc = 1 +color = 2 +expected = [[2, 2, 2], [2, 2, 0], [2, 0, 1]] + +# %% +result = run_flood_fill(Solution, image, sr, sc, color) +result + +# %% +assert_flood_fill(result, expected) diff --git a/leetcode/implement_queue_using_stacks/playground.ipynb b/leetcode/implement_queue_using_stacks/playground.ipynb deleted file mode 100644 index 735a590..0000000 --- a/leetcode/implement_queue_using_stacks/playground.ipynb +++ /dev/null @@ -1,70 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_my_queue, run_my_queue\n", - "from solution import MyQueue" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "operations = [\"MyQueue\", \"push\", \"push\", \"peek\", \"pop\", \"empty\"]\n", - "inputs = [[], [1], [2], [], [], []]\n", - "expected = [None, None, None, 1, 1, False]" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result, queue = run_my_queue(MyQueue, operations, inputs)\n", - "print(result)\n", - "queue" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_my_queue(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/implement_queue_using_stacks/playground.py b/leetcode/implement_queue_using_stacks/playground.py new file mode 100644 index 0000000..834b6b8 --- /dev/null +++ b/leetcode/implement_queue_using_stacks/playground.py @@ -0,0 +1,32 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_my_queue, run_my_queue +from solution import MyQueue + +# %% +# Example test case +operations = ["MyQueue", "push", "push", "peek", "pop", "empty"] +inputs = [[], [1], [2], [], [], []] +expected = [None, None, None, 1, 1, False] + +# %% +result, queue = run_my_queue(MyQueue, operations, inputs) +print(result) +queue + +# %% +assert_my_queue(result, expected) diff --git a/leetcode/implement_trie_prefix_tree/playground.ipynb b/leetcode/implement_trie_prefix_tree/playground.ipynb deleted file mode 100644 index c509af4..0000000 --- a/leetcode/implement_trie_prefix_tree/playground.ipynb +++ /dev/null @@ -1,204 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": 1, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_trie_operations, run_trie_operations\n", - "from solution import Trie" - ] - }, - { - "cell_type": "code", - "execution_count": 2, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "operations = [\"Trie\", \"insert\", \"search\", \"search\", \"starts_with\", \"insert\", \"search\"]\n", - "inputs = [[], [\"apple\"], [\"apple\"], [\"app\"], [\"app\"], [\"app\"], [\"app\"]]\n", - "expected = [None, None, True, False, True, None, True]" - ] - }, - { - "cell_type": "code", - "execution_count": 3, - "id": "run", - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[None, None, True, False, True, None, True]\n" - ] - }, - { - "data": { - "text/html": [ - "\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "root\n", - "\n", - "root\n", - "\n", - "\n", - "\n", - "root_0\n", - "\n", - "a\n", - "\n", - "\n", - "\n", - "root->root_0\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "root_0_0\n", - "\n", - "p\n", - "\n", - "\n", - "\n", - "root_0->root_0_0\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "root_0_0_0\n", - "\n", - "p\n", - "\n", - "\n", - "\n", - "root_0_0->root_0_0_0\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "root_0_0_0_0\n", - "\n", - "l\n", - "\n", - "\n", - "\n", - "root_0_0_0->root_0_0_0_0\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "root_0_0_0_leaf_1\n", - "\n", - "#: True\n", - "\n", - "\n", - "\n", - "root_0_0_0->root_0_0_0_leaf_1\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "root_0_0_0_0_0\n", - "\n", - "e\n", - "\n", - "\n", - "\n", - "root_0_0_0_0->root_0_0_0_0_0\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "root_0_0_0_0_0_leaf_0\n", - "\n", - "#: True\n", - "\n", - "\n", - "\n", - "root_0_0_0_0_0->root_0_0_0_0_0_leaf_0\n", - "\n", - "\n", - "\n", - "\n", - "\n" - ], - "text/plain": [ - "" - ] - }, - "execution_count": 3, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "result, trie = run_trie_operations(Trie, operations, inputs)\n", - "print(result)\n", - "trie" - ] - }, - { - "cell_type": "code", - "execution_count": 4, - "id": "assert", - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "True" - ] - }, - "execution_count": 4, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "assert_trie_operations(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/implement_trie_prefix_tree/playground.py b/leetcode/implement_trie_prefix_tree/playground.py new file mode 100644 index 0000000..815d6f6 --- /dev/null +++ b/leetcode/implement_trie_prefix_tree/playground.py @@ -0,0 +1,32 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_trie_operations, run_trie_operations +from solution import Trie + +# %% +# Example test case +operations = ["Trie", "insert", "search", "search", "starts_with", "insert", "search"] +inputs = [[], ["apple"], ["apple"], ["app"], ["app"], ["app"], ["app"]] +expected = [None, None, True, False, True, None, True] + +# %% +result, trie = run_trie_operations(Trie, operations, inputs) +print(result) +trie + +# %% +assert_trie_operations(result, expected) diff --git a/leetcode/insert_interval/playground.ipynb b/leetcode/insert_interval/playground.ipynb deleted file mode 100644 index 0e8d78f..0000000 --- a/leetcode/insert_interval/playground.ipynb +++ /dev/null @@ -1,69 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_insert, run_insert\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "intervals = [[1, 3], [6, 9]]\n", - "new_interval = [2, 5]\n", - "expected = [[1, 5], [6, 9]]" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_insert(Solution, intervals, new_interval)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_insert(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/insert_interval/playground.py b/leetcode/insert_interval/playground.py new file mode 100644 index 0000000..d895d17 --- /dev/null +++ b/leetcode/insert_interval/playground.py @@ -0,0 +1,31 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_insert, run_insert +from solution import Solution + +# %% +# Example test case +intervals = [[1, 3], [6, 9]] +new_interval = [2, 5] +expected = [[1, 5], [6, 9]] + +# %% +result = run_insert(Solution, intervals, new_interval) +result + +# %% +assert_insert(result, expected) diff --git a/leetcode/invert_binary_tree/playground.ipynb b/leetcode/invert_binary_tree/playground.ipynb deleted file mode 100644 index ba35a6c..0000000 --- a/leetcode/invert_binary_tree/playground.ipynb +++ /dev/null @@ -1,185 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": 5, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_invert_tree, run_invert_tree\n", - "from solution import Solution\n", - "\n", - "from leetcode_py import TreeNode" - ] - }, - { - "cell_type": "code", - "execution_count": 6, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "root_list: list[int | None] = [4, 2, 7, 1, 3, 6, 9]\n", - "expected_list: list[int | None] = [4, 7, 2, 9, 6, 3, 1]" - ] - }, - { - "cell_type": "code", - "execution_count": 7, - "id": "run", - "metadata": {}, - "outputs": [ - { - "data": { - "text/html": [ - "\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "0\n", - "\n", - "4\n", - "\n", - "\n", - "\n", - "1\n", - "\n", - "7\n", - "\n", - "\n", - "\n", - "0->1\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "4\n", - "\n", - "2\n", - "\n", - "\n", - "\n", - "0->4\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "2\n", - "\n", - "9\n", - "\n", - "\n", - "\n", - "1->2\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "3\n", - "\n", - "6\n", - "\n", - "\n", - "\n", - "1->3\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "5\n", - "\n", - "3\n", - "\n", - "\n", - "\n", - "4->5\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "6\n", - "\n", - "1\n", - "\n", - "\n", - "\n", - "4->6\n", - "\n", - "\n", - "\n", - "\n", - "\n" - ], - "text/plain": [ - "TreeNode([4, 7, 2, 9, 6, 3, 1])" - ] - }, - "execution_count": 7, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "result = run_invert_tree(Solution, root_list)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": 4, - "id": "assert", - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "True" - ] - }, - "execution_count": 4, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "assert_invert_tree(result, expected_list)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/invert_binary_tree/playground.py b/leetcode/invert_binary_tree/playground.py new file mode 100644 index 0000000..2805ae6 --- /dev/null +++ b/leetcode/invert_binary_tree/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_invert_tree, run_invert_tree +from solution import Solution + +# %% +# Example test case +root_list: list[int | None] = [4, 2, 7, 1, 3, 6, 9] +expected_list: list[int | None] = [4, 7, 2, 9, 6, 3, 1] + +# %% +result = run_invert_tree(Solution, root_list) +result + +# %% +assert_invert_tree(result, expected_list) diff --git a/leetcode/invert_binary_tree/test_solution.py b/leetcode/invert_binary_tree/test_solution.py index f20e784..9e40afb 100644 --- a/leetcode/invert_binary_tree/test_solution.py +++ b/leetcode/invert_binary_tree/test_solution.py @@ -3,7 +3,7 @@ from leetcode_py.test_utils import logged_test from .helpers import assert_invert_tree, run_invert_tree -from .solution import Solution +from .solution import Solution, SolutionBFS, SolutionDFS class TestInvertBinaryTree: @@ -11,6 +11,7 @@ def setup_method(self): self.solution = Solution() @logged_test + @pytest.mark.parametrize("solution_class", [Solution, SolutionDFS, SolutionBFS]) @pytest.mark.parametrize( "root_list, expected_list", [ @@ -31,6 +32,8 @@ def setup_method(self): ([1, 2, 3, None, 4, None, 5], [1, 3, 2, 5, None, 4]), ], ) - def test_invert_tree(self, root_list: list[int | None], expected_list: list[int | None]): - result = run_invert_tree(Solution, root_list) + def test_invert_tree( + self, solution_class: type, root_list: list[int | None], expected_list: list[int | None] + ): + result = run_invert_tree(solution_class, root_list) assert_invert_tree(result, expected_list) diff --git a/leetcode/k_closest_points_to_origin/playground.ipynb b/leetcode/k_closest_points_to_origin/playground.ipynb deleted file mode 100644 index fce66ec..0000000 --- a/leetcode/k_closest_points_to_origin/playground.ipynb +++ /dev/null @@ -1,69 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_k_closest, run_k_closest\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "points = [[1, 3], [-2, 2]]\n", - "k = 1\n", - "expected = [[-2, 2]]" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_k_closest(Solution, points, k)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_k_closest(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/k_closest_points_to_origin/playground.py b/leetcode/k_closest_points_to_origin/playground.py new file mode 100644 index 0000000..5efc6f0 --- /dev/null +++ b/leetcode/k_closest_points_to_origin/playground.py @@ -0,0 +1,31 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_k_closest, run_k_closest +from solution import Solution + +# %% +# Example test case +points = [[1, 3], [-2, 2]] +k = 1 +expected = [[-2, 2]] + +# %% +result = run_k_closest(Solution, points, k) +result + +# %% +assert_k_closest(result, expected) diff --git a/leetcode/kth_smallest_element_in_a_bst/playground.ipynb b/leetcode/kth_smallest_element_in_a_bst/playground.ipynb deleted file mode 100644 index b65acaf..0000000 --- a/leetcode/kth_smallest_element_in_a_bst/playground.ipynb +++ /dev/null @@ -1,71 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_kth_smallest, run_kth_smallest\n", - "from solution import Solution\n", - "\n", - "from leetcode_py import TreeNode" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "root_list = [3, 1, 4, None, 2]\n", - "k = 1\n", - "expected = 1" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_kth_smallest(Solution, root_list, k)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_kth_smallest(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/kth_smallest_element_in_a_bst/playground.py b/leetcode/kth_smallest_element_in_a_bst/playground.py new file mode 100644 index 0000000..6cff3f7 --- /dev/null +++ b/leetcode/kth_smallest_element_in_a_bst/playground.py @@ -0,0 +1,31 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_kth_smallest, run_kth_smallest +from solution import Solution + +# %% +# Example test case +root_list = [3, 1, 4, None, 2] +k = 1 +expected = 1 + +# %% +result = run_kth_smallest(Solution, root_list, k) +result + +# %% +assert_kth_smallest(result, expected) diff --git a/leetcode/largest_rectangle_in_histogram/playground.ipynb b/leetcode/largest_rectangle_in_histogram/playground.ipynb deleted file mode 100644 index 8470983..0000000 --- a/leetcode/largest_rectangle_in_histogram/playground.ipynb +++ /dev/null @@ -1,68 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_largest_rectangle_area, run_largest_rectangle_area\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "heights = [2, 1, 5, 6, 2, 3]\n", - "expected = 10" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_largest_rectangle_area(Solution, heights)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_largest_rectangle_area(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/largest_rectangle_in_histogram/playground.py b/leetcode/largest_rectangle_in_histogram/playground.py new file mode 100644 index 0000000..16761db --- /dev/null +++ b/leetcode/largest_rectangle_in_histogram/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_largest_rectangle_area, run_largest_rectangle_area +from solution import Solution + +# %% +# Example test case +heights = [2, 1, 5, 6, 2, 3] +expected = 10 + +# %% +result = run_largest_rectangle_area(Solution, heights) +result + +# %% +assert_largest_rectangle_area(result, expected) diff --git a/leetcode/linked_list_cycle/playground.ipynb b/leetcode/linked_list_cycle/playground.ipynb deleted file mode 100644 index f4adc95..0000000 --- a/leetcode/linked_list_cycle/playground.ipynb +++ /dev/null @@ -1,177 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": 1, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_has_cycle, create_cycle_list, run_has_cycle\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": 2, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "values = [3, 2, 0, -4]\n", - "pos = 1\n", - "expected = True" - ] - }, - { - "cell_type": "code", - "execution_count": 5, - "id": "66f97343", - "metadata": {}, - "outputs": [ - { - "data": { - "text/html": [ - "\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "node_0\n", - "\n", - "3\n", - "\n", - "\n", - "\n", - "node_1\n", - "\n", - "2\n", - "\n", - "\n", - "\n", - "node_0->node_1\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "node_2\n", - "\n", - "0\n", - "\n", - "\n", - "\n", - "node_1->node_2\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "node_3\n", - "\n", - "-4\n", - "\n", - "\n", - "\n", - "node_2->node_3\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "node_3->node_1\n", - "\n", - "\n", - "cycle\n", - "\n", - "\n", - "\n" - ], - "text/plain": [ - "ListNode([3, 2, 0, -4])" - ] - }, - "execution_count": 5, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "head = create_cycle_list(values, pos)\n", - "head" - ] - }, - { - "cell_type": "code", - "execution_count": 3, - "id": "run", - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "True" - ] - }, - "execution_count": 3, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "result = run_has_cycle(Solution, values, pos)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": 4, - "id": "assert", - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "True" - ] - }, - "execution_count": 4, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "assert_has_cycle(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/linked_list_cycle/playground.py b/leetcode/linked_list_cycle/playground.py new file mode 100644 index 0000000..b19e7f6 --- /dev/null +++ b/leetcode/linked_list_cycle/playground.py @@ -0,0 +1,35 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_has_cycle, create_cycle_list, run_has_cycle +from solution import Solution + +# %% +# Example test case +values = [3, 2, 0, -4] +pos = 1 +expected = True + +# %% +head = create_cycle_list(values, pos) +head + +# %% +result = run_has_cycle(Solution, values, pos) +result + +# %% +assert_has_cycle(result, expected) diff --git a/leetcode/longest_palindrome/playground.ipynb b/leetcode/longest_palindrome/playground.ipynb deleted file mode 100644 index 31ff59e..0000000 --- a/leetcode/longest_palindrome/playground.ipynb +++ /dev/null @@ -1,68 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_longest_palindrome, run_longest_palindrome\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "s = \"abccccdd\"\n", - "expected = 7" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_longest_palindrome(Solution, s)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_longest_palindrome(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/longest_palindrome/playground.py b/leetcode/longest_palindrome/playground.py new file mode 100644 index 0000000..d84ed13 --- /dev/null +++ b/leetcode/longest_palindrome/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_longest_palindrome, run_longest_palindrome +from solution import Solution + +# %% +# Example test case +s = "abccccdd" +expected = 7 + +# %% +result = run_longest_palindrome(Solution, s) +result + +# %% +assert_longest_palindrome(result, expected) diff --git a/leetcode/longest_palindromic_substring/playground.ipynb b/leetcode/longest_palindromic_substring/playground.ipynb deleted file mode 100644 index be01046..0000000 --- a/leetcode/longest_palindromic_substring/playground.ipynb +++ /dev/null @@ -1,68 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_longest_palindrome, run_longest_palindrome\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "s = \"babad\"\n", - "expected = {\"bab\", \"aba\"}" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_longest_palindrome(Solution, s)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_longest_palindrome(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/longest_palindromic_substring/playground.py b/leetcode/longest_palindromic_substring/playground.py new file mode 100644 index 0000000..ee1069b --- /dev/null +++ b/leetcode/longest_palindromic_substring/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_longest_palindrome, run_longest_palindrome +from solution import Solution + +# %% +# Example test case +s = "babad" +expected = {"bab", "aba"} + +# %% +result = run_longest_palindrome(Solution, s) +result + +# %% +assert_longest_palindrome(result, expected) diff --git a/leetcode/longest_palindromic_substring/test_solution.py b/leetcode/longest_palindromic_substring/test_solution.py index 832e8fa..0cd1994 100644 --- a/leetcode/longest_palindromic_substring/test_solution.py +++ b/leetcode/longest_palindromic_substring/test_solution.py @@ -3,7 +3,7 @@ from leetcode_py.test_utils import logged_test from .helpers import assert_longest_palindrome, run_longest_palindrome -from .solution import Solution +from .solution import Solution, SolutionManacher class TestLongestPalindromicSubstring: @@ -11,6 +11,7 @@ def setup_method(self): self.solution = Solution() @logged_test + @pytest.mark.parametrize("solution_class", [Solution, SolutionManacher]) @pytest.mark.parametrize( "s, expected", [ @@ -28,6 +29,6 @@ def setup_method(self): ("abcba", {"abcba"}), ], ) - def test_longest_palindrome(self, s: str, expected: set[str]): - result = run_longest_palindrome(Solution, s) + def test_longest_palindrome(self, solution_class: type, s: str, expected: set[str]): + result = run_longest_palindrome(solution_class, s) assert_longest_palindrome(result, expected) diff --git a/leetcode/longest_substring_without_repeating_characters/playground.ipynb b/leetcode/longest_substring_without_repeating_characters/playground.ipynb deleted file mode 100644 index 0c23372..0000000 --- a/leetcode/longest_substring_without_repeating_characters/playground.ipynb +++ /dev/null @@ -1,68 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_length_of_longest_substring, run_length_of_longest_substring\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "s = \"abcabcbb\"\n", - "expected = 3" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_length_of_longest_substring(Solution, s)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_length_of_longest_substring(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/longest_substring_without_repeating_characters/playground.py b/leetcode/longest_substring_without_repeating_characters/playground.py new file mode 100644 index 0000000..e2b9bf4 --- /dev/null +++ b/leetcode/longest_substring_without_repeating_characters/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_length_of_longest_substring, run_length_of_longest_substring +from solution import Solution + +# %% +# Example test case +s = "abcabcbb" +expected = 3 + +# %% +result = run_length_of_longest_substring(Solution, s) +result + +# %% +assert_length_of_longest_substring(result, expected) diff --git a/leetcode/lowest_common_ancestor_of_a_binary_search_tree/playground.ipynb b/leetcode/lowest_common_ancestor_of_a_binary_search_tree/playground.ipynb deleted file mode 100644 index 6f5c85e..0000000 --- a/leetcode/lowest_common_ancestor_of_a_binary_search_tree/playground.ipynb +++ /dev/null @@ -1,72 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_lowest_common_ancestor, run_lowest_common_ancestor\n", - "from solution import Solution\n", - "\n", - "from leetcode_py import TreeNode" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "root_list = [6, 2, 8, 0, 4, 7, 9, None, None, 3, 5]\n", - "p_val = 2\n", - "q_val = 8\n", - "expected_val = 6" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_lowest_common_ancestor(Solution, root_list, p_val, q_val)\n", - "result.val if result else None" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_lowest_common_ancestor(result, expected_val)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/lowest_common_ancestor_of_a_binary_search_tree/playground.py b/leetcode/lowest_common_ancestor_of_a_binary_search_tree/playground.py new file mode 100644 index 0000000..1e7eb79 --- /dev/null +++ b/leetcode/lowest_common_ancestor_of_a_binary_search_tree/playground.py @@ -0,0 +1,32 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_lowest_common_ancestor, run_lowest_common_ancestor +from solution import Solution + +# %% +# Example test case +root_list = [6, 2, 8, 0, 4, 7, 9, None, None, 3, 5] +p_val = 2 +q_val = 8 +expected_val = 6 + +# %% +result = run_lowest_common_ancestor(Solution, root_list, p_val, q_val) +result.val if result else None + +# %% +assert_lowest_common_ancestor(result, expected_val) diff --git a/leetcode/lowest_common_ancestor_of_a_binary_tree/playground.ipynb b/leetcode/lowest_common_ancestor_of_a_binary_tree/playground.ipynb deleted file mode 100644 index 0251030..0000000 --- a/leetcode/lowest_common_ancestor_of_a_binary_tree/playground.ipynb +++ /dev/null @@ -1,72 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_lowest_common_ancestor, run_lowest_common_ancestor\n", - "from solution import Solution\n", - "\n", - "from leetcode_py import TreeNode" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "root_list = [3, 5, 1, 6, 2, 0, 8, None, None, 7, 4]\n", - "p_val = 5\n", - "q_val = 1\n", - "expected_val = 3" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_lowest_common_ancestor(Solution, root_list, p_val, q_val)\n", - "result.val" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_lowest_common_ancestor(result, expected_val)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/lowest_common_ancestor_of_a_binary_tree/playground.py b/leetcode/lowest_common_ancestor_of_a_binary_tree/playground.py new file mode 100644 index 0000000..39884fc --- /dev/null +++ b/leetcode/lowest_common_ancestor_of_a_binary_tree/playground.py @@ -0,0 +1,32 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_lowest_common_ancestor, run_lowest_common_ancestor +from solution import Solution + +# %% +# Example test case +root_list = [3, 5, 1, 6, 2, 0, 8, None, None, 7, 4] +p_val = 5 +q_val = 1 +expected_val = 3 + +# %% +result = run_lowest_common_ancestor(Solution, root_list, p_val, q_val) +result.val + +# %% +assert_lowest_common_ancestor(result, expected_val) diff --git a/leetcode/lru_cache/playground.ipynb b/leetcode/lru_cache/playground.ipynb deleted file mode 100644 index 687c6f1..0000000 --- a/leetcode/lru_cache/playground.ipynb +++ /dev/null @@ -1,100 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": 1, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_lru_cache, run_lru_cache\n", - "from solution import LRUCache" - ] - }, - { - "cell_type": "code", - "execution_count": 2, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "operations = [\"LRUCache\", \"put\", \"put\", \"get\", \"put\", \"get\", \"put\", \"get\", \"get\", \"get\"]\n", - "inputs = [[2], [1, 1], [2, 2], [1], [3, 3], [2], [4, 4], [1], [3], [4]]\n", - "expected = [None, None, None, 1, None, -1, None, -1, 3, 4]" - ] - }, - { - "cell_type": "code", - "execution_count": 5, - "id": "run", - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "[None, None, None, 1, None, -1, None, -1, 3, 4]\n" - ] - }, - { - "data": { - "text/plain": [ - "OrderedDict([(3, 3), (4, 4)])" - ] - }, - "execution_count": 5, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "result, cache = run_lru_cache(LRUCache, operations, inputs)\n", - "print(result)\n", - "cache.cache" - ] - }, - { - "cell_type": "code", - "execution_count": 4, - "id": "assert", - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "True" - ] - }, - "execution_count": 4, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "assert_lru_cache(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/lru_cache/playground.py b/leetcode/lru_cache/playground.py new file mode 100644 index 0000000..6269d30 --- /dev/null +++ b/leetcode/lru_cache/playground.py @@ -0,0 +1,32 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_lru_cache, run_lru_cache +from solution import LRUCache + +# %% +# Example test case +operations = ["LRUCache", "put", "put", "get", "put", "get", "put", "get", "get", "get"] +inputs = [[2], [1, 1], [2, 2], [1], [3, 3], [2], [4, 4], [1], [3], [4]] +expected = [None, None, None, 1, None, -1, None, -1, 3, 4] + +# %% +result, cache = run_lru_cache(LRUCache, operations, inputs) +print(result) +cache.cache + +# %% +assert_lru_cache(result, expected) diff --git a/leetcode/lru_cache/test_solution.py b/leetcode/lru_cache/test_solution.py index 0fcaa3d..db70723 100644 --- a/leetcode/lru_cache/test_solution.py +++ b/leetcode/lru_cache/test_solution.py @@ -3,12 +3,13 @@ from leetcode_py.test_utils import logged_test from .helpers import assert_lru_cache, run_lru_cache -from .solution import LRUCache +from .solution import LRUCache, LRUCacheWithDoublyList class TestLRUCache: @logged_test + @pytest.mark.parametrize("solution_class", [LRUCache, LRUCacheWithDoublyList]) @pytest.mark.parametrize( "operations, inputs, expected", [ @@ -66,6 +67,12 @@ class TestLRUCache: ), ], ) - def test_lru_cache(self, operations: list[str], inputs: list[list[int]], expected: list[int | None]): - result, _ = run_lru_cache(LRUCache, operations, inputs) + def test_lru_cache( + self, + solution_class: type, + operations: list[str], + inputs: list[list[int]], + expected: list[int | None], + ): + result, _ = run_lru_cache(solution_class, operations, inputs) assert_lru_cache(result, expected) diff --git a/leetcode/majority_element/playground.ipynb b/leetcode/majority_element/playground.ipynb deleted file mode 100644 index 969279e..0000000 --- a/leetcode/majority_element/playground.ipynb +++ /dev/null @@ -1,68 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_majority_element, run_majority_element\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "nums = [3, 2, 3]\n", - "expected = 3" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_majority_element(Solution, nums)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_majority_element(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/majority_element/playground.py b/leetcode/majority_element/playground.py new file mode 100644 index 0000000..ac2bcd3 --- /dev/null +++ b/leetcode/majority_element/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_majority_element, run_majority_element +from solution import Solution + +# %% +# Example test case +nums = [3, 2, 3] +expected = 3 + +# %% +result = run_majority_element(Solution, nums) +result + +# %% +assert_majority_element(result, expected) diff --git a/leetcode/maximum_depth_of_binary_tree/playground.ipynb b/leetcode/maximum_depth_of_binary_tree/playground.ipynb deleted file mode 100644 index 53406b7..0000000 --- a/leetcode/maximum_depth_of_binary_tree/playground.ipynb +++ /dev/null @@ -1,70 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_max_depth, run_max_depth\n", - "from solution import Solution\n", - "\n", - "from leetcode_py import TreeNode" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "root_list = [3, 9, 20, None, None, 15, 7]\n", - "expected = 3" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_max_depth(Solution, root_list)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_max_depth(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/maximum_depth_of_binary_tree/playground.py b/leetcode/maximum_depth_of_binary_tree/playground.py new file mode 100644 index 0000000..e2f6ebf --- /dev/null +++ b/leetcode/maximum_depth_of_binary_tree/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_max_depth, run_max_depth +from solution import Solution + +# %% +# Example test case +root_list = [3, 9, 20, None, None, 15, 7] +expected = 3 + +# %% +result = run_max_depth(Solution, root_list) +result + +# %% +assert_max_depth(result, expected) diff --git a/leetcode/maximum_profit_in_job_scheduling/playground.ipynb b/leetcode/maximum_profit_in_job_scheduling/playground.ipynb deleted file mode 100644 index cf2e659..0000000 --- a/leetcode/maximum_profit_in_job_scheduling/playground.ipynb +++ /dev/null @@ -1,70 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_job_scheduling, run_job_scheduling\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "start_time = [1, 2, 3, 3]\n", - "end_time = [3, 4, 5, 6]\n", - "profit = [50, 10, 40, 70]\n", - "expected = 120" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_job_scheduling(Solution, start_time, end_time, profit)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_job_scheduling(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/maximum_profit_in_job_scheduling/playground.py b/leetcode/maximum_profit_in_job_scheduling/playground.py new file mode 100644 index 0000000..777d927 --- /dev/null +++ b/leetcode/maximum_profit_in_job_scheduling/playground.py @@ -0,0 +1,32 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_job_scheduling, run_job_scheduling +from solution import Solution + +# %% +# Example test case +start_time = [1, 2, 3, 3] +end_time = [3, 4, 5, 6] +profit = [50, 10, 40, 70] +expected = 120 + +# %% +result = run_job_scheduling(Solution, start_time, end_time, profit) +result + +# %% +assert_job_scheduling(result, expected) diff --git a/leetcode/maximum_subarray/playground.ipynb b/leetcode/maximum_subarray/playground.ipynb deleted file mode 100644 index bd4f64e..0000000 --- a/leetcode/maximum_subarray/playground.ipynb +++ /dev/null @@ -1,68 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_max_sub_array, run_max_sub_array\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "nums = [-2, 1, -3, 4, -1, 2, 1, -5, 4]\n", - "expected = 6" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_max_sub_array(Solution, nums)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_max_sub_array(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/maximum_subarray/playground.py b/leetcode/maximum_subarray/playground.py new file mode 100644 index 0000000..4c514a9 --- /dev/null +++ b/leetcode/maximum_subarray/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_max_sub_array, run_max_sub_array +from solution import Solution + +# %% +# Example test case +nums = [-2, 1, -3, 4, -1, 2, 1, -5, 4] +expected = 6 + +# %% +result = run_max_sub_array(Solution, nums) +result + +# %% +assert_max_sub_array(result, expected) diff --git a/leetcode/merge_intervals/playground.ipynb b/leetcode/merge_intervals/playground.ipynb deleted file mode 100644 index f5c7c1e..0000000 --- a/leetcode/merge_intervals/playground.ipynb +++ /dev/null @@ -1,68 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_merge, run_merge\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "intervals = [[1, 3], [2, 6], [8, 10], [15, 18]]\n", - "expected = [[1, 6], [8, 10], [15, 18]]" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_merge(Solution, intervals)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_merge(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/merge_intervals/playground.py b/leetcode/merge_intervals/playground.py new file mode 100644 index 0000000..0c3c6b0 --- /dev/null +++ b/leetcode/merge_intervals/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_merge, run_merge +from solution import Solution + +# %% +# Example test case +intervals = [[1, 3], [2, 6], [8, 10], [15, 18]] +expected = [[1, 6], [8, 10], [15, 18]] + +# %% +result = run_merge(Solution, intervals) +result + +# %% +assert_merge(result, expected) diff --git a/leetcode/merge_k_sorted_lists/playground.ipynb b/leetcode/merge_k_sorted_lists/playground.ipynb deleted file mode 100644 index 44dff96..0000000 --- a/leetcode/merge_k_sorted_lists/playground.ipynb +++ /dev/null @@ -1,70 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_merge_k_lists, run_merge_k_lists\n", - "from solution import Solution\n", - "\n", - "from leetcode_py import ListNode" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "lists_data = [[1, 4, 5], [1, 3, 4], [2, 6]]\n", - "expected_data = [1, 1, 2, 3, 4, 4, 5, 6]" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_merge_k_lists(Solution, lists_data)\n", - "ListNode[int].to_list(result) if result else []" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_merge_k_lists(result, expected_data)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/merge_k_sorted_lists/playground.py b/leetcode/merge_k_sorted_lists/playground.py new file mode 100644 index 0000000..f30a2ad --- /dev/null +++ b/leetcode/merge_k_sorted_lists/playground.py @@ -0,0 +1,32 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_merge_k_lists, run_merge_k_lists +from solution import Solution + +from leetcode_py import ListNode + +# %% +# Example test case +lists_data = [[1, 4, 5], [1, 3, 4], [2, 6]] +expected_data = [1, 1, 2, 3, 4, 4, 5, 6] + +# %% +result = run_merge_k_lists(Solution, lists_data) +ListNode[int].to_list(result) if result else [] + +# %% +assert_merge_k_lists(result, expected_data) diff --git a/leetcode/merge_two_sorted_lists/playground.ipynb b/leetcode/merge_two_sorted_lists/playground.ipynb deleted file mode 100644 index 0ec2f71..0000000 --- a/leetcode/merge_two_sorted_lists/playground.ipynb +++ /dev/null @@ -1,71 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_merge_two_lists, run_merge_two_lists\n", - "from solution import Solution\n", - "\n", - "from leetcode_py import ListNode" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "list1_vals = [1, 2, 4]\n", - "list2_vals = [1, 3, 4]\n", - "expected_vals = [1, 1, 2, 3, 4, 4]" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_merge_two_lists(Solution, list1_vals, list2_vals)\n", - "ListNode[int].to_list(result) if result else []" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_merge_two_lists(result, expected_vals)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/merge_two_sorted_lists/playground.py b/leetcode/merge_two_sorted_lists/playground.py new file mode 100644 index 0000000..2d47603 --- /dev/null +++ b/leetcode/merge_two_sorted_lists/playground.py @@ -0,0 +1,33 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_merge_two_lists, run_merge_two_lists +from solution import Solution + +from leetcode_py import ListNode + +# %% +# Example test case +list1_vals = [1, 2, 4] +list2_vals = [1, 3, 4] +expected_vals = [1, 1, 2, 3, 4, 4] + +# %% +result = run_merge_two_lists(Solution, list1_vals, list2_vals) +ListNode[int].to_list(result) if result else [] + +# %% +assert_merge_two_lists(result, expected_vals) diff --git a/leetcode/middle_of_the_linked_list/playground.ipynb b/leetcode/middle_of_the_linked_list/playground.ipynb deleted file mode 100644 index d078f51..0000000 --- a/leetcode/middle_of_the_linked_list/playground.ipynb +++ /dev/null @@ -1,70 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_middle_node, run_middle_node\n", - "from solution import Solution\n", - "\n", - "from leetcode_py import ListNode" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "head_list = [1, 2, 3, 4, 5]\n", - "expected_list = [3, 4, 5]" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_middle_node(Solution, head_list)\n", - "ListNode[int].to_list(result) if result else []" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_middle_node(result, expected_list)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/middle_of_the_linked_list/playground.py b/leetcode/middle_of_the_linked_list/playground.py new file mode 100644 index 0000000..a81e5a1 --- /dev/null +++ b/leetcode/middle_of_the_linked_list/playground.py @@ -0,0 +1,32 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_middle_node, run_middle_node +from solution import Solution + +from leetcode_py import ListNode + +# %% +# Example test case +head_list = [1, 2, 3, 4, 5] +expected_list = [3, 4, 5] + +# %% +result = run_middle_node(Solution, head_list) +ListNode[int].to_list(result) if result else [] + +# %% +assert_middle_node(result, expected_list) diff --git a/leetcode/min_stack/playground.ipynb b/leetcode/min_stack/playground.ipynb deleted file mode 100644 index 0d24cc7..0000000 --- a/leetcode/min_stack/playground.ipynb +++ /dev/null @@ -1,69 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_min_stack_operations, run_min_stack_operations\n", - "from solution import MinStack" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "operations = [\"MinStack\", \"push\", \"push\", \"push\", \"getMin\", \"pop\", \"top\", \"getMin\"]\n", - "inputs = [[], [-2], [0], [-3], [], [], [], []]\n", - "expected = [None, None, None, None, -3, None, 0, -2]" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_min_stack_operations(MinStack, operations, inputs)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_min_stack_operations(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/min_stack/playground.py b/leetcode/min_stack/playground.py new file mode 100644 index 0000000..a331ae1 --- /dev/null +++ b/leetcode/min_stack/playground.py @@ -0,0 +1,31 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_min_stack_operations, run_min_stack_operations +from solution import MinStack + +# %% +# Example test case +operations = ["MinStack", "push", "push", "push", "getMin", "pop", "top", "getMin"] +inputs = [[], [-2], [0], [-3], [], [], [], []] +expected = [None, None, None, None, -3, None, 0, -2] + +# %% +result = run_min_stack_operations(MinStack, operations, inputs) +result + +# %% +assert_min_stack_operations(result, expected) diff --git a/leetcode/minimum_height_trees/playground.ipynb b/leetcode/minimum_height_trees/playground.ipynb deleted file mode 100644 index 8cf7734..0000000 --- a/leetcode/minimum_height_trees/playground.ipynb +++ /dev/null @@ -1,69 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_find_min_height_trees, run_find_min_height_trees\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "n = 4\n", - "edges = [[1, 0], [1, 2], [1, 3]]\n", - "expected = [1]" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_find_min_height_trees(Solution, n, edges)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_find_min_height_trees(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/minimum_height_trees/playground.py b/leetcode/minimum_height_trees/playground.py new file mode 100644 index 0000000..32fdfbd --- /dev/null +++ b/leetcode/minimum_height_trees/playground.py @@ -0,0 +1,31 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_find_min_height_trees, run_find_min_height_trees +from solution import Solution + +# %% +# Example test case +n = 4 +edges = [[1, 0], [1, 2], [1, 3]] +expected = [1] + +# %% +result = run_find_min_height_trees(Solution, n, edges) +result + +# %% +assert_find_min_height_trees(result, expected) diff --git a/leetcode/minimum_window_substring/playground.ipynb b/leetcode/minimum_window_substring/playground.ipynb deleted file mode 100644 index c35e737..0000000 --- a/leetcode/minimum_window_substring/playground.ipynb +++ /dev/null @@ -1,69 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_min_window, run_min_window\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "s = \"ADOBECODEBANC\"\n", - "t = \"ABC\"\n", - "expected = \"BANC\"" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_min_window(Solution, s, t)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_min_window(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/minimum_window_substring/playground.py b/leetcode/minimum_window_substring/playground.py new file mode 100644 index 0000000..89b19b0 --- /dev/null +++ b/leetcode/minimum_window_substring/playground.py @@ -0,0 +1,31 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_min_window, run_min_window +from solution import Solution + +# %% +# Example test case +s = "ADOBECODEBANC" +t = "ABC" +expected = "BANC" + +# %% +result = run_min_window(Solution, s, t) +result + +# %% +assert_min_window(result, expected) diff --git a/leetcode/number_of_islands/playground.ipynb b/leetcode/number_of_islands/playground.ipynb deleted file mode 100644 index 57ebc3f..0000000 --- a/leetcode/number_of_islands/playground.ipynb +++ /dev/null @@ -1,73 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_num_islands, run_num_islands\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "grid = [\n", - " [\"1\", \"1\", \"1\", \"1\", \"0\"],\n", - " [\"1\", \"1\", \"0\", \"1\", \"0\"],\n", - " [\"1\", \"1\", \"0\", \"0\", \"0\"],\n", - " [\"0\", \"0\", \"0\", \"0\", \"0\"],\n", - "]\n", - "expected = 1" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_num_islands(Solution, grid)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_num_islands(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/number_of_islands/playground.py b/leetcode/number_of_islands/playground.py new file mode 100644 index 0000000..8f12ebb --- /dev/null +++ b/leetcode/number_of_islands/playground.py @@ -0,0 +1,35 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_num_islands, run_num_islands +from solution import Solution + +# %% +# Example test case +grid = [ + ["1", "1", "1", "1", "0"], + ["1", "1", "0", "1", "0"], + ["1", "1", "0", "0", "0"], + ["0", "0", "0", "0", "0"], +] +expected = 1 + +# %% +result = run_num_islands(Solution, grid) +result + +# %% +assert_num_islands(result, expected) diff --git a/leetcode/partition_equal_subset_sum/playground.ipynb b/leetcode/partition_equal_subset_sum/playground.ipynb deleted file mode 100644 index 5597f66..0000000 --- a/leetcode/partition_equal_subset_sum/playground.ipynb +++ /dev/null @@ -1,68 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_can_partition, run_can_partition\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "nums = [1, 5, 11, 5]\n", - "expected = True" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_can_partition(Solution, nums)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_can_partition(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/partition_equal_subset_sum/playground.py b/leetcode/partition_equal_subset_sum/playground.py new file mode 100644 index 0000000..9bf8361 --- /dev/null +++ b/leetcode/partition_equal_subset_sum/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_can_partition, run_can_partition +from solution import Solution + +# %% +# Example test case +nums = [1, 5, 11, 5] +expected = True + +# %% +result = run_can_partition(Solution, nums) +result + +# %% +assert_can_partition(result, expected) diff --git a/leetcode/partition_equal_subset_sum/test_solution.py b/leetcode/partition_equal_subset_sum/test_solution.py index e826127..a480df5 100644 --- a/leetcode/partition_equal_subset_sum/test_solution.py +++ b/leetcode/partition_equal_subset_sum/test_solution.py @@ -3,7 +3,7 @@ from leetcode_py.test_utils import logged_test from .helpers import assert_can_partition, run_can_partition -from .solution import Solution +from .solution import Solution, SolutionBitset class TestPartitionEqualSubsetSum: @@ -11,6 +11,7 @@ def setup_method(self): self.solution = Solution() @logged_test + @pytest.mark.parametrize("solution_class", [Solution, SolutionBitset]) @pytest.mark.parametrize( "nums, expected", [ @@ -31,6 +32,6 @@ def setup_method(self): ([4, 4, 4, 4, 4, 4], True), ], ) - def test_can_partition(self, nums: list[int], expected: bool): - result = run_can_partition(Solution, nums) + def test_can_partition(self, solution_class: type, nums: list[int], expected: bool): + result = run_can_partition(solution_class, nums) assert_can_partition(result, expected) diff --git a/leetcode/permutations/playground.ipynb b/leetcode/permutations/playground.ipynb deleted file mode 100644 index 3df2f29..0000000 --- a/leetcode/permutations/playground.ipynb +++ /dev/null @@ -1,68 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_permute, run_permute\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "nums = [1, 2, 3]\n", - "expected = [[1, 2, 3], [1, 3, 2], [2, 1, 3], [2, 3, 1], [3, 1, 2], [3, 2, 1]]" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_permute(Solution, nums)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_permute(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/permutations/playground.py b/leetcode/permutations/playground.py new file mode 100644 index 0000000..07de7dd --- /dev/null +++ b/leetcode/permutations/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_permute, run_permute +from solution import Solution + +# %% +# Example test case +nums = [1, 2, 3] +expected = [[1, 2, 3], [1, 3, 2], [2, 1, 3], [2, 3, 1], [3, 1, 2], [3, 2, 1]] + +# %% +result = run_permute(Solution, nums) +result + +# %% +assert_permute(result, expected) diff --git a/leetcode/product_of_array_except_self/playground.ipynb b/leetcode/product_of_array_except_self/playground.ipynb deleted file mode 100644 index c96f1f3..0000000 --- a/leetcode/product_of_array_except_self/playground.ipynb +++ /dev/null @@ -1,68 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_product_except_self, run_product_except_self\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "nums = [1, 2, 3, 4]\n", - "expected = [24, 12, 8, 6]" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_product_except_self(Solution, nums)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_product_except_self(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/product_of_array_except_self/playground.py b/leetcode/product_of_array_except_self/playground.py new file mode 100644 index 0000000..f8a43ad --- /dev/null +++ b/leetcode/product_of_array_except_self/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_product_except_self, run_product_except_self +from solution import Solution + +# %% +# Example test case +nums = [1, 2, 3, 4] +expected = [24, 12, 8, 6] + +# %% +result = run_product_except_self(Solution, nums) +result + +# %% +assert_product_except_self(result, expected) diff --git a/leetcode/ransom_note/playground.ipynb b/leetcode/ransom_note/playground.ipynb deleted file mode 100644 index 5982636..0000000 --- a/leetcode/ransom_note/playground.ipynb +++ /dev/null @@ -1,69 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_can_construct, run_can_construct\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "ransom_note = \"aa\"\n", - "magazine = \"aab\"\n", - "expected = True" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_can_construct(Solution, ransom_note, magazine)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_can_construct(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/ransom_note/playground.py b/leetcode/ransom_note/playground.py new file mode 100644 index 0000000..86cbb15 --- /dev/null +++ b/leetcode/ransom_note/playground.py @@ -0,0 +1,31 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_can_construct, run_can_construct +from solution import Solution + +# %% +# Example test case +ransom_note = "aa" +magazine = "aab" +expected = True + +# %% +result = run_can_construct(Solution, ransom_note, magazine) +result + +# %% +assert_can_construct(result, expected) diff --git a/leetcode/reverse_linked_list/playground.ipynb b/leetcode/reverse_linked_list/playground.ipynb deleted file mode 100644 index b6a4171..0000000 --- a/leetcode/reverse_linked_list/playground.ipynb +++ /dev/null @@ -1,70 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_reverse_list, run_reverse_list\n", - "from solution import Solution\n", - "\n", - "from leetcode_py import ListNode" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "head_list = [1, 2, 3, 4, 5]\n", - "expected_list = [5, 4, 3, 2, 1]" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_reverse_list(Solution, head_list)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_reverse_list(result, expected_list)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/reverse_linked_list/playground.py b/leetcode/reverse_linked_list/playground.py new file mode 100644 index 0000000..375048c --- /dev/null +++ b/leetcode/reverse_linked_list/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_reverse_list, run_reverse_list +from solution import Solution + +# %% +# Example test case +head_list = [1, 2, 3, 4, 5] +expected_list = [5, 4, 3, 2, 1] + +# %% +result = run_reverse_list(Solution, head_list) +result + +# %% +assert_reverse_list(result, expected_list) diff --git a/leetcode/reverse_linked_list_ii/playground.ipynb b/leetcode/reverse_linked_list_ii/playground.ipynb deleted file mode 100644 index 0cd88a4..0000000 --- a/leetcode/reverse_linked_list_ii/playground.ipynb +++ /dev/null @@ -1,71 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_reverse_between, run_reverse_between\n", - "from solution import Solution\n", - "\n", - "from leetcode_py import ListNode" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "head_list = [1, 2, 3, 4, 5]\n", - "left, right = 2, 4\n", - "expected_list = [1, 4, 3, 2, 5]" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_reverse_between(Solution, head_list, left, right)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_reverse_between(result, expected_list)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/reverse_linked_list_ii/playground.py b/leetcode/reverse_linked_list_ii/playground.py new file mode 100644 index 0000000..0ee9f36 --- /dev/null +++ b/leetcode/reverse_linked_list_ii/playground.py @@ -0,0 +1,31 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_reverse_between, run_reverse_between +from solution import Solution + +# %% +# Example test case +head_list = [1, 2, 3, 4, 5] +left, right = 2, 4 +expected_list = [1, 4, 3, 2, 5] + +# %% +result = run_reverse_between(Solution, head_list, left, right) +result + +# %% +assert_reverse_between(result, expected_list) diff --git a/leetcode/rotting_oranges/playground.ipynb b/leetcode/rotting_oranges/playground.ipynb deleted file mode 100644 index fde0cf1..0000000 --- a/leetcode/rotting_oranges/playground.ipynb +++ /dev/null @@ -1,68 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_oranges_rotting, run_oranges_rotting\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "grid = [[2, 1, 1], [1, 1, 0], [0, 1, 1]]\n", - "expected = 4" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_oranges_rotting(Solution, grid)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_oranges_rotting(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/rotting_oranges/playground.py b/leetcode/rotting_oranges/playground.py new file mode 100644 index 0000000..7f1f44e --- /dev/null +++ b/leetcode/rotting_oranges/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_oranges_rotting, run_oranges_rotting +from solution import Solution + +# %% +# Example test case +grid = [[2, 1, 1], [1, 1, 0], [0, 1, 1]] +expected = 4 + +# %% +result = run_oranges_rotting(Solution, grid) +result + +# %% +assert_oranges_rotting(result, expected) diff --git a/leetcode/search_in_rotated_sorted_array/playground.ipynb b/leetcode/search_in_rotated_sorted_array/playground.ipynb deleted file mode 100644 index 6dadf29..0000000 --- a/leetcode/search_in_rotated_sorted_array/playground.ipynb +++ /dev/null @@ -1,69 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_search, run_search\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "nums = [4, 5, 6, 7, 0, 1, 2]\n", - "target = 0\n", - "expected = 4" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_search(Solution, nums, target)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_search(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/search_in_rotated_sorted_array/playground.py b/leetcode/search_in_rotated_sorted_array/playground.py new file mode 100644 index 0000000..1c72b5a --- /dev/null +++ b/leetcode/search_in_rotated_sorted_array/playground.py @@ -0,0 +1,31 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_search, run_search +from solution import Solution + +# %% +# Example test case +nums = [4, 5, 6, 7, 0, 1, 2] +target = 0 +expected = 4 + +# %% +result = run_search(Solution, nums, target) +result + +# %% +assert_search(result, expected) diff --git a/leetcode/serialize_and_deserialize_binary_tree/playground.ipynb b/leetcode/serialize_and_deserialize_binary_tree/playground.ipynb deleted file mode 100644 index a1b0bf6..0000000 --- a/leetcode/serialize_and_deserialize_binary_tree/playground.ipynb +++ /dev/null @@ -1,69 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_serialize_deserialize, run_serialize_deserialize\n", - "from solution import Codec\n", - "\n", - "from leetcode_py import TreeNode" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "root_list = [1, 2, 3, None, None, 4, 5]" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_serialize_deserialize(Codec, root_list)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_serialize_deserialize(result, root_list)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/serialize_and_deserialize_binary_tree/playground.py b/leetcode/serialize_and_deserialize_binary_tree/playground.py new file mode 100644 index 0000000..06cf1af --- /dev/null +++ b/leetcode/serialize_and_deserialize_binary_tree/playground.py @@ -0,0 +1,29 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_serialize_deserialize, run_serialize_deserialize +from solution import Codec + +# %% +# Example test case +root_list = [1, 2, 3, None, None, 4, 5] + +# %% +result = run_serialize_deserialize(Codec, root_list) +result + +# %% +assert_serialize_deserialize(result, root_list) diff --git a/leetcode/sort_colors/playground.ipynb b/leetcode/sort_colors/playground.ipynb deleted file mode 100644 index b2f099f..0000000 --- a/leetcode/sort_colors/playground.ipynb +++ /dev/null @@ -1,68 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_sort_colors, run_sort_colors\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "nums = [2, 0, 2, 1, 1, 0]\n", - "expected = [0, 0, 1, 1, 2, 2]" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_sort_colors(Solution, nums)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_sort_colors(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/sort_colors/playground.py b/leetcode/sort_colors/playground.py new file mode 100644 index 0000000..9b2c154 --- /dev/null +++ b/leetcode/sort_colors/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_sort_colors, run_sort_colors +from solution import Solution + +# %% +# Example test case +nums = [2, 0, 2, 1, 1, 0] +expected = [0, 0, 1, 1, 2, 2] + +# %% +result = run_sort_colors(Solution, nums) +result + +# %% +assert_sort_colors(result, expected) diff --git a/leetcode/spiral_matrix/playground.ipynb b/leetcode/spiral_matrix/playground.ipynb deleted file mode 100644 index 0668a7e..0000000 --- a/leetcode/spiral_matrix/playground.ipynb +++ /dev/null @@ -1,68 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_spiral_order, run_spiral_order\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "matrix = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]\n", - "expected = [1, 2, 3, 6, 9, 8, 7, 4, 5]" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_spiral_order(Solution, matrix)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_spiral_order(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/spiral_matrix/playground.py b/leetcode/spiral_matrix/playground.py new file mode 100644 index 0000000..07f54ab --- /dev/null +++ b/leetcode/spiral_matrix/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_spiral_order, run_spiral_order +from solution import Solution + +# %% +# Example test case +matrix = [[1, 2, 3], [4, 5, 6], [7, 8, 9]] +expected = [1, 2, 3, 6, 9, 8, 7, 4, 5] + +# %% +result = run_spiral_order(Solution, matrix) +result + +# %% +assert_spiral_order(result, expected) diff --git a/leetcode/string_to_integer_atoi/playground.ipynb b/leetcode/string_to_integer_atoi/playground.ipynb deleted file mode 100644 index 82ecfb7..0000000 --- a/leetcode/string_to_integer_atoi/playground.ipynb +++ /dev/null @@ -1,68 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_my_atoi, run_my_atoi\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "s = \"42\"\n", - "expected = 42" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_my_atoi(Solution, s)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_my_atoi(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/string_to_integer_atoi/playground.py b/leetcode/string_to_integer_atoi/playground.py new file mode 100644 index 0000000..c0656aa --- /dev/null +++ b/leetcode/string_to_integer_atoi/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_my_atoi, run_my_atoi +from solution import Solution + +# %% +# Example test case +s = "42" +expected = 42 + +# %% +result = run_my_atoi(Solution, s) +result + +# %% +assert_my_atoi(result, expected) diff --git a/leetcode/task_scheduler/playground.ipynb b/leetcode/task_scheduler/playground.ipynb deleted file mode 100644 index 3ad7d83..0000000 --- a/leetcode/task_scheduler/playground.ipynb +++ /dev/null @@ -1,69 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_least_interval, run_least_interval\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "tasks = [\"A\", \"A\", \"A\", \"B\", \"B\", \"B\"]\n", - "n = 2\n", - "expected = 8" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_least_interval(Solution, tasks, n)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_least_interval(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/task_scheduler/playground.py b/leetcode/task_scheduler/playground.py new file mode 100644 index 0000000..e0bcc11 --- /dev/null +++ b/leetcode/task_scheduler/playground.py @@ -0,0 +1,31 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_least_interval, run_least_interval +from solution import Solution + +# %% +# Example test case +tasks = ["A", "A", "A", "B", "B", "B"] +n = 2 +expected = 8 + +# %% +result = run_least_interval(Solution, tasks, n) +result + +# %% +assert_least_interval(result, expected) diff --git a/leetcode/three_sum/playground.ipynb b/leetcode/three_sum/playground.ipynb deleted file mode 100644 index ddbc41b..0000000 --- a/leetcode/three_sum/playground.ipynb +++ /dev/null @@ -1,68 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_three_sum, run_three_sum\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "nums = [-1, 0, 1, 2, -1, -4]\n", - "expected = [[-1, -1, 2], [-1, 0, 1]]" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_three_sum(Solution, nums)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_three_sum(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/three_sum/playground.py b/leetcode/three_sum/playground.py new file mode 100644 index 0000000..818263e --- /dev/null +++ b/leetcode/three_sum/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_three_sum, run_three_sum +from solution import Solution + +# %% +# Example test case +nums = [-1, 0, 1, 2, -1, -4] +expected = [[-1, -1, 2], [-1, 0, 1]] + +# %% +result = run_three_sum(Solution, nums) +result + +# %% +assert_three_sum(result, expected) diff --git a/leetcode/time_based_key_value_store/playground.ipynb b/leetcode/time_based_key_value_store/playground.ipynb deleted file mode 100644 index 28f407a..0000000 --- a/leetcode/time_based_key_value_store/playground.ipynb +++ /dev/null @@ -1,69 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_time_map_operations, run_time_map_operations\n", - "from solution import TimeMap" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "operations = [\"TimeMap\", \"set\", \"get\", \"get\", \"set\", \"get\", \"get\"]\n", - "inputs = [[], [\"foo\", \"bar\", 1], [\"foo\", 1], [\"foo\", 3], [\"foo\", \"bar2\", 4], [\"foo\", 4], [\"foo\", 5]]\n", - "expected = [None, None, \"bar\", \"bar\", None, \"bar2\", \"bar2\"]" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_time_map_operations(TimeMap, operations, inputs)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_time_map_operations(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/time_based_key_value_store/playground.py b/leetcode/time_based_key_value_store/playground.py new file mode 100644 index 0000000..ead5892 --- /dev/null +++ b/leetcode/time_based_key_value_store/playground.py @@ -0,0 +1,31 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_time_map_operations, run_time_map_operations +from solution import TimeMap + +# %% +# Example test case +operations = ["TimeMap", "set", "get", "get", "set", "get", "get"] +inputs = [[], ["foo", "bar", 1], ["foo", 1], ["foo", 3], ["foo", "bar2", 4], ["foo", 4], ["foo", 5]] +expected = [None, None, "bar", "bar", None, "bar2", "bar2"] + +# %% +result = run_time_map_operations(TimeMap, operations, inputs) +result + +# %% +assert_time_map_operations(result, expected) diff --git a/leetcode/trapping_rain_water/playground.ipynb b/leetcode/trapping_rain_water/playground.ipynb deleted file mode 100644 index b4db37d..0000000 --- a/leetcode/trapping_rain_water/playground.ipynb +++ /dev/null @@ -1,91 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": 1, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_trap, run_trap\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": 2, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "height = [0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1]\n", - "expected = 6" - ] - }, - { - "cell_type": "code", - "execution_count": 3, - "id": "run", - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "6" - ] - }, - "execution_count": 3, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "result = run_trap(Solution, height)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": 4, - "id": "assert", - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "True" - ] - }, - "execution_count": 4, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "assert_trap(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/trapping_rain_water/playground.py b/leetcode/trapping_rain_water/playground.py new file mode 100644 index 0000000..749b303 --- /dev/null +++ b/leetcode/trapping_rain_water/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_trap, run_trap +from solution import Solution + +# %% +# Example test case +height = [0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1] +expected = 6 + +# %% +result = run_trap(Solution, height) +result + +# %% +assert_trap(result, expected) diff --git a/leetcode/two_sum/playground.ipynb b/leetcode/two_sum/playground.ipynb deleted file mode 100644 index 1a6ec8b..0000000 --- a/leetcode/two_sum/playground.ipynb +++ /dev/null @@ -1,92 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": 1, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_two_sum, run_two_sum\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": 2, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "nums = [2, 7, 11, 15]\n", - "target = 9\n", - "expected = [0, 1]" - ] - }, - { - "cell_type": "code", - "execution_count": 3, - "id": "run", - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "[0, 1]" - ] - }, - "execution_count": 3, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "result = run_two_sum(Solution, nums, target)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": 4, - "id": "assert", - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "True" - ] - }, - "execution_count": 4, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "assert_two_sum(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/two_sum/playground.py b/leetcode/two_sum/playground.py new file mode 100644 index 0000000..79ef5d4 --- /dev/null +++ b/leetcode/two_sum/playground.py @@ -0,0 +1,31 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_two_sum, run_two_sum +from solution import Solution + +# %% +# Example test case +nums = [2, 7, 11, 15] +target = 9 +expected = [0, 1] + +# %% +result = run_two_sum(Solution, nums, target) +result + +# %% +assert_two_sum(result, expected) diff --git a/leetcode/valid_anagram/playground.ipynb b/leetcode/valid_anagram/playground.ipynb deleted file mode 100644 index c178ebe..0000000 --- a/leetcode/valid_anagram/playground.ipynb +++ /dev/null @@ -1,92 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": 1, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_is_anagram, run_is_anagram\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": 2, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "s = \"anagram\"\n", - "t = \"nagaram\"\n", - "expected = True" - ] - }, - { - "cell_type": "code", - "execution_count": 3, - "id": "run", - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "True" - ] - }, - "execution_count": 3, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "result = run_is_anagram(Solution, s, t)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": 4, - "id": "assert", - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "True" - ] - }, - "execution_count": 4, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "assert_is_anagram(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/valid_anagram/playground.py b/leetcode/valid_anagram/playground.py new file mode 100644 index 0000000..46bfe1d --- /dev/null +++ b/leetcode/valid_anagram/playground.py @@ -0,0 +1,31 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_is_anagram, run_is_anagram +from solution import Solution + +# %% +# Example test case +s = "anagram" +t = "nagaram" +expected = True + +# %% +result = run_is_anagram(Solution, s, t) +result + +# %% +assert_is_anagram(result, expected) diff --git a/leetcode/valid_palindrome/playground.ipynb b/leetcode/valid_palindrome/playground.ipynb deleted file mode 100644 index c4c6bbc..0000000 --- a/leetcode/valid_palindrome/playground.ipynb +++ /dev/null @@ -1,68 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_is_palindrome, run_is_palindrome\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "s = \"A man, a plan, a canal: Panama\"\n", - "expected = True" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_is_palindrome(Solution, s)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_is_palindrome(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/valid_palindrome/playground.py b/leetcode/valid_palindrome/playground.py new file mode 100644 index 0000000..64924c5 --- /dev/null +++ b/leetcode/valid_palindrome/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_is_palindrome, run_is_palindrome +from solution import Solution + +# %% +# Example test case +s = "A man, a plan, a canal: Panama" +expected = True + +# %% +result = run_is_palindrome(Solution, s) +result + +# %% +assert_is_palindrome(result, expected) diff --git a/leetcode/valid_parentheses/playground.ipynb b/leetcode/valid_parentheses/playground.ipynb deleted file mode 100644 index e5324f0..0000000 --- a/leetcode/valid_parentheses/playground.ipynb +++ /dev/null @@ -1,68 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_is_valid, run_is_valid\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "s = \"()\"\n", - "expected = True" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_is_valid(Solution, s)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_is_valid(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/valid_parentheses/playground.py b/leetcode/valid_parentheses/playground.py new file mode 100644 index 0000000..7c64862 --- /dev/null +++ b/leetcode/valid_parentheses/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_is_valid, run_is_valid +from solution import Solution + +# %% +# Example test case +s = "()" +expected = True + +# %% +result = run_is_valid(Solution, s) +result + +# %% +assert_is_valid(result, expected) diff --git a/leetcode/validate_binary_search_tree/playground.ipynb b/leetcode/validate_binary_search_tree/playground.ipynb deleted file mode 100644 index a53e0f9..0000000 --- a/leetcode/validate_binary_search_tree/playground.ipynb +++ /dev/null @@ -1,70 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_is_valid_bst, run_is_valid_bst\n", - "from solution import Solution\n", - "\n", - "from leetcode_py import TreeNode" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "root_list = [2, 1, 3]\n", - "expected = True" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_is_valid_bst(Solution, root_list)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_is_valid_bst(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/validate_binary_search_tree/playground.py b/leetcode/validate_binary_search_tree/playground.py new file mode 100644 index 0000000..bd7fd3c --- /dev/null +++ b/leetcode/validate_binary_search_tree/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_is_valid_bst, run_is_valid_bst +from solution import Solution + +# %% +# Example test case +root_list = [2, 1, 3] +expected = True + +# %% +result = run_is_valid_bst(Solution, root_list) +result + +# %% +assert_is_valid_bst(result, expected) diff --git a/leetcode/validate_binary_search_tree/test_solution.py b/leetcode/validate_binary_search_tree/test_solution.py index 8e5eca0..2491911 100644 --- a/leetcode/validate_binary_search_tree/test_solution.py +++ b/leetcode/validate_binary_search_tree/test_solution.py @@ -3,7 +3,7 @@ from leetcode_py.test_utils import logged_test from .helpers import assert_is_valid_bst, run_is_valid_bst -from .solution import Solution +from .solution import Solution, SolutionBFS, SolutionDFS class TestValidateBinarySearchTree: @@ -11,6 +11,7 @@ def setup_method(self): self.solution = Solution() @logged_test + @pytest.mark.parametrize("solution_class", [Solution, SolutionDFS, SolutionBFS]) @pytest.mark.parametrize( "root_list, expected", [ @@ -28,6 +29,6 @@ def setup_method(self): ([3, 1, 5, 0, 2, 4, 6], True), ], ) - def test_is_valid_bst(self, root_list: list[int | None], expected: bool): - result = run_is_valid_bst(Solution, root_list) + def test_is_valid_bst(self, solution_class: type, root_list: list[int | None], expected: bool): + result = run_is_valid_bst(solution_class, root_list) assert_is_valid_bst(result, expected) diff --git a/leetcode/word_break/playground.ipynb b/leetcode/word_break/playground.ipynb deleted file mode 100644 index b606647..0000000 --- a/leetcode/word_break/playground.ipynb +++ /dev/null @@ -1,69 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_word_break, run_word_break\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "s = \"leetcode\"\n", - "word_dict = [\"leet\", \"code\"]\n", - "expected = True" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_word_break(Solution, s, word_dict)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_word_break(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/word_break/playground.py b/leetcode/word_break/playground.py new file mode 100644 index 0000000..4ee7af7 --- /dev/null +++ b/leetcode/word_break/playground.py @@ -0,0 +1,31 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_word_break, run_word_break +from solution import Solution + +# %% +# Example test case +s = "leetcode" +word_dict = ["leet", "code"] +expected = True + +# %% +result = run_word_break(Solution, s, word_dict) +result + +# %% +assert_word_break(result, expected) diff --git a/leetcode/word_ladder/playground.ipynb b/leetcode/word_ladder/playground.ipynb deleted file mode 100644 index 863eedf..0000000 --- a/leetcode/word_ladder/playground.ipynb +++ /dev/null @@ -1,70 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": null, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_ladder_length, run_ladder_length\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "begin_word = \"hit\"\n", - "end_word = \"cog\"\n", - "word_list = [\"hot\", \"dot\", \"dog\", \"lot\", \"log\", \"cog\"]\n", - "expected = 5" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "run", - "metadata": {}, - "outputs": [], - "source": [ - "result = run_ladder_length(Solution, begin_word, end_word, word_list)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "id": "assert", - "metadata": {}, - "outputs": [], - "source": [ - "assert_ladder_length(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/word_ladder/playground.py b/leetcode/word_ladder/playground.py new file mode 100644 index 0000000..a1dabdc --- /dev/null +++ b/leetcode/word_ladder/playground.py @@ -0,0 +1,32 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_ladder_length, run_ladder_length +from solution import Solution + +# %% +# Example test case +begin_word = "hit" +end_word = "cog" +word_list = ["hot", "dot", "dog", "lot", "log", "cog"] +expected = 5 + +# %% +result = run_ladder_length(Solution, begin_word, end_word, word_list) +result + +# %% +assert_ladder_length(result, expected) diff --git a/leetcode/zero_one_matrix/playground.ipynb b/leetcode/zero_one_matrix/playground.ipynb deleted file mode 100644 index 6b3b709..0000000 --- a/leetcode/zero_one_matrix/playground.ipynb +++ /dev/null @@ -1,91 +0,0 @@ -{ - "cells": [ - { - "cell_type": "code", - "execution_count": 1, - "id": "imports", - "metadata": {}, - "outputs": [], - "source": [ - "from helpers import assert_update_matrix, run_update_matrix\n", - "from solution import Solution" - ] - }, - { - "cell_type": "code", - "execution_count": 2, - "id": "setup", - "metadata": {}, - "outputs": [], - "source": [ - "# Example test case\n", - "mat = [[0, 0, 0], [0, 1, 0], [1, 1, 1]]\n", - "expected = [[0, 0, 0], [0, 1, 0], [1, 2, 1]]" - ] - }, - { - "cell_type": "code", - "execution_count": 3, - "id": "run", - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "[[0, 0, 0], [0, 1, 0], [1, 2, 1]]" - ] - }, - "execution_count": 3, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "result = run_update_matrix(Solution, mat)\n", - "result" - ] - }, - { - "cell_type": "code", - "execution_count": 4, - "id": "assert", - "metadata": {}, - "outputs": [ - { - "data": { - "text/plain": [ - "True" - ] - }, - "execution_count": 4, - "metadata": {}, - "output_type": "execute_result" - } - ], - "source": [ - "assert_update_matrix(result, expected)" - ] - } - ], - "metadata": { - "kernelspec": { - "display_name": "leetcode-py-py3.13", - "language": "python", - "name": "python3" - }, - "language_info": { - "codemirror_mode": { - "name": "ipython", - "version": 3 - }, - "file_extension": ".py", - "mimetype": "text/x-python", - "name": "python", - "nbconvert_exporter": "python", - "pygments_lexer": "ipython3", - "version": "3.13.7" - } - }, - "nbformat": 4, - "nbformat_minor": 5 -} diff --git a/leetcode/zero_one_matrix/playground.py b/leetcode/zero_one_matrix/playground.py new file mode 100644 index 0000000..a727bed --- /dev/null +++ b/leetcode/zero_one_matrix/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# formats: ipynb,py:percent +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_update_matrix, run_update_matrix +from solution import Solution + +# %% +# Example test case +mat = [[0, 0, 0], [0, 1, 0], [1, 1, 1]] +expected = [[0, 0, 0], [0, 1, 0], [1, 2, 1]] + +# %% +result = run_update_matrix(Solution, mat) +result + +# %% +assert_update_matrix(result, expected) diff --git a/poetry.lock b/poetry.lock index 54bb124..9f49b72 100644 --- a/poetry.lock +++ b/poetry.lock @@ -61,6 +61,26 @@ files = [ astroid = ["astroid (>=2,<4)"] test = ["astroid (>=2,<4)", "pytest", "pytest-cov", "pytest-xdist"] +[[package]] +name = "attrs" +version = "25.3.0" +description = "Classes Without Boilerplate" +optional = false +python-versions = ">=3.8" +groups = ["dev"] +files = [ + {file = "attrs-25.3.0-py3-none-any.whl", hash = "sha256:427318ce031701fea540783410126f03899a97ffc6f61596ad581ac2e40e3bc3"}, + {file = "attrs-25.3.0.tar.gz", hash = "sha256:75d7cefc7fb576747b2c81b4442d4d4a1ce0900973527c011d1030fd3bf4af1b"}, +] + +[package.extras] +benchmark = ["cloudpickle ; platform_python_implementation == \"CPython\"", "hypothesis", "mypy (>=1.11.1) ; platform_python_implementation == \"CPython\" and python_version >= \"3.10\"", "pympler", "pytest (>=4.3.0)", "pytest-codspeed", "pytest-mypy-plugins ; platform_python_implementation == \"CPython\" and python_version >= \"3.10\"", "pytest-xdist[psutil]"] +cov = ["cloudpickle ; platform_python_implementation == \"CPython\"", "coverage[toml] (>=5.3)", "hypothesis", "mypy (>=1.11.1) ; platform_python_implementation == \"CPython\" and python_version >= \"3.10\"", "pympler", "pytest (>=4.3.0)", "pytest-mypy-plugins ; platform_python_implementation == \"CPython\" and python_version >= \"3.10\"", "pytest-xdist[psutil]"] +dev = ["cloudpickle ; platform_python_implementation == \"CPython\"", "hypothesis", "mypy (>=1.11.1) ; platform_python_implementation == \"CPython\" and python_version >= \"3.10\"", "pre-commit-uv", "pympler", "pytest (>=4.3.0)", "pytest-mypy-plugins ; platform_python_implementation == \"CPython\" and python_version >= \"3.10\"", "pytest-xdist[psutil]"] +docs = ["cogapp", "furo", "myst-parser", "sphinx", "sphinx-notfound-page", "sphinxcontrib-towncrier", "towncrier"] +tests = ["cloudpickle ; platform_python_implementation == \"CPython\"", "hypothesis", "mypy (>=1.11.1) ; platform_python_implementation == \"CPython\" and python_version >= \"3.10\"", "pympler", "pytest (>=4.3.0)", "pytest-mypy-plugins ; platform_python_implementation == \"CPython\" and python_version >= \"3.10\"", "pytest-xdist[psutil]"] +tests-mypy = ["mypy (>=1.11.1) ; platform_python_implementation == \"CPython\" and python_version >= \"3.10\"", "pytest-mypy-plugins ; platform_python_implementation == \"CPython\" and python_version >= \"3.10\""] + [[package]] name = "autopep8" version = "2.3.2" @@ -600,6 +620,21 @@ files = [ [package.extras] tests = ["asttokens (>=2.1.0)", "coverage", "coverage-enable-subprocess", "ipython", "littleutils", "pytest", "rich ; python_version >= \"3.11\""] +[[package]] +name = "fastjsonschema" +version = "2.21.2" +description = "Fastest Python implementation of JSON schema" +optional = false +python-versions = "*" +groups = ["dev"] +files = [ + {file = "fastjsonschema-2.21.2-py3-none-any.whl", hash = "sha256:1c797122d0a86c5cace2e54bf4e819c36223b552017172f32c5c024a6b77e463"}, + {file = "fastjsonschema-2.21.2.tar.gz", hash = "sha256:b1eb43748041c880796cd077f1a07c3d94e93ae84bba5ed36800a33554ae05de"}, +] + +[package.extras] +devel = ["colorama", "json-spec", "jsonschema", "pylint", "pytest", "pytest-benchmark", "pytest-cache", "validictory"] + [[package]] name = "filelock" version = "3.19.1" @@ -806,6 +841,43 @@ MarkupSafe = ">=2.0" [package.extras] i18n = ["Babel (>=2.7)"] +[[package]] +name = "jsonschema" +version = "4.25.1" +description = "An implementation of JSON Schema validation for Python" +optional = false +python-versions = ">=3.9" +groups = ["dev"] +files = [ + {file = "jsonschema-4.25.1-py3-none-any.whl", hash = "sha256:3fba0169e345c7175110351d456342c364814cfcf3b964ba4587f22915230a63"}, + {file = "jsonschema-4.25.1.tar.gz", hash = "sha256:e4a9655ce0da0c0b67a085847e00a3a51449e1157f4f75e9fb5aa545e122eb85"}, +] + +[package.dependencies] +attrs = ">=22.2.0" +jsonschema-specifications = ">=2023.03.6" +referencing = ">=0.28.4" +rpds-py = ">=0.7.1" + +[package.extras] +format = ["fqdn", "idna", "isoduration", "jsonpointer (>1.13)", "rfc3339-validator", "rfc3987", "uri-template", "webcolors (>=1.11)"] +format-nongpl = ["fqdn", "idna", "isoduration", "jsonpointer (>1.13)", "rfc3339-validator", "rfc3986-validator (>0.1.0)", "rfc3987-syntax (>=1.1.0)", "uri-template", "webcolors (>=24.6.0)"] + +[[package]] +name = "jsonschema-specifications" +version = "2025.9.1" +description = "The JSON Schema meta-schemas and vocabularies, exposed as a Registry" +optional = false +python-versions = ">=3.9" +groups = ["dev"] +files = [ + {file = "jsonschema_specifications-2025.9.1-py3-none-any.whl", hash = "sha256:98802fee3a11ee76ecaca44429fda8a41bff98b00a0f2838151b113f210cc6fe"}, + {file = "jsonschema_specifications-2025.9.1.tar.gz", hash = "sha256:b540987f239e745613c7a9176f3edb72b832a4ac465cf02712288397832b5e8d"}, +] + +[package.dependencies] +referencing = ">=0.31.0" + [[package]] name = "jupyter-client" version = "8.6.3" @@ -850,6 +922,35 @@ traitlets = ">=5.3" docs = ["intersphinx-registry", "myst-parser", "pydata-sphinx-theme", "sphinx-autodoc-typehints", "sphinxcontrib-spelling", "traitlets"] test = ["ipykernel", "pre-commit", "pytest (<9)", "pytest-cov", "pytest-timeout"] +[[package]] +name = "jupytext" +version = "1.17.3" +description = "Jupyter notebooks as Markdown documents, Julia, Python or R scripts" +optional = false +python-versions = ">=3.9" +groups = ["dev"] +files = [ + {file = "jupytext-1.17.3-py3-none-any.whl", hash = "sha256:09b0a94cd904416e823a5ba9f41bd181031215b6fc682d2b5c18e68354feb17c"}, + {file = "jupytext-1.17.3.tar.gz", hash = "sha256:8b6dae76d63c95cad47b493c38f0d9c74491fb621dcd0980abfcac4c8f168679"}, +] + +[package.dependencies] +markdown-it-py = ">=1.0" +mdit-py-plugins = "*" +nbformat = "*" +packaging = "*" +pyyaml = "*" + +[package.extras] +dev = ["autopep8", "black", "flake8", "gitpython", "ipykernel", "isort", "jupyter-fs[fs] (>=1.0)", "jupyter-server (!=2.11)", "nbconvert", "pre-commit", "pytest", "pytest-asyncio", "pytest-cov (>=2.6.1)", "pytest-randomly", "pytest-xdist", "sphinx", "sphinx-gallery (>=0.8)"] +docs = ["myst-parser", "sphinx", "sphinx-copybutton", "sphinx-rtd-theme"] +test = ["pytest", "pytest-asyncio", "pytest-randomly", "pytest-xdist"] +test-cov = ["black", "ipykernel", "jupyter-server (!=2.11)", "nbconvert", "pytest", "pytest-asyncio", "pytest-cov (>=2.6.1)", "pytest-randomly", "pytest-xdist"] +test-external = ["autopep8", "black", "flake8", "gitpython", "ipykernel", "isort", "jupyter-fs[fs] (>=1.0)", "jupyter-server (!=2.11)", "nbconvert", "pre-commit", "pytest", "pytest-asyncio", "pytest-randomly", "pytest-xdist", "sphinx", "sphinx-gallery (>=0.8)"] +test-functional = ["black", "pytest", "pytest-asyncio", "pytest-randomly", "pytest-xdist"] +test-integration = ["black", "ipykernel", "jupyter-server (!=2.11)", "nbconvert", "pytest", "pytest-asyncio", "pytest-randomly", "pytest-xdist"] +test-ui = ["bash-kernel"] + [[package]] name = "loguru" version = "0.7.3" @@ -979,6 +1080,26 @@ files = [ [package.dependencies] traitlets = "*" +[[package]] +name = "mdit-py-plugins" +version = "0.5.0" +description = "Collection of plugins for markdown-it-py" +optional = false +python-versions = ">=3.10" +groups = ["dev"] +files = [ + {file = "mdit_py_plugins-0.5.0-py3-none-any.whl", hash = "sha256:07a08422fc1936a5d26d146759e9155ea466e842f5ab2f7d2266dd084c8dab1f"}, + {file = "mdit_py_plugins-0.5.0.tar.gz", hash = "sha256:f4918cb50119f50446560513a8e311d574ff6aaed72606ddae6d35716fe809c6"}, +] + +[package.dependencies] +markdown-it-py = ">=2.0.0,<5.0.0" + +[package.extras] +code-style = ["pre-commit"] +rtd = ["myst-parser", "sphinx-book-theme"] +testing = ["coverage", "pytest", "pytest-cov", "pytest-regressions"] + [[package]] name = "mdurl" version = "0.1.2" @@ -1063,6 +1184,28 @@ files = [ {file = "mypy_extensions-1.1.0.tar.gz", hash = "sha256:52e68efc3284861e772bbcd66823fde5ae21fd2fdb51c62a211403730b916558"}, ] +[[package]] +name = "nbformat" +version = "5.10.4" +description = "The Jupyter Notebook format" +optional = false +python-versions = ">=3.8" +groups = ["dev"] +files = [ + {file = "nbformat-5.10.4-py3-none-any.whl", hash = "sha256:3b48d6c8fbca4b299bf3982ea7db1af21580e4fec269ad087b9e81588891200b"}, + {file = "nbformat-5.10.4.tar.gz", hash = "sha256:322168b14f937a5d11362988ecac2a4952d3d8e3a2cbeb2319584631226d5b3a"}, +] + +[package.dependencies] +fastjsonschema = ">=2.15" +jsonschema = ">=2.6" +jupyter-core = ">=4.12,<5.0.dev0 || >=5.1.dev0" +traitlets = ">=5.1" + +[package.extras] +docs = ["myst-parser", "pydata-sphinx-theme", "sphinx", "sphinxcontrib-github-alt", "sphinxcontrib-spelling"] +test = ["pep440", "pre-commit", "pytest", "testpath"] + [[package]] name = "nbqa" version = "1.9.1" @@ -1597,6 +1740,22 @@ files = [ [package.dependencies] cffi = {version = "*", markers = "implementation_name == \"pypy\""} +[[package]] +name = "referencing" +version = "0.36.2" +description = "JSON Referencing + Python" +optional = false +python-versions = ">=3.9" +groups = ["dev"] +files = [ + {file = "referencing-0.36.2-py3-none-any.whl", hash = "sha256:e8699adbbf8b5c7de96d8ffa0eb5c158b3beafce084968e2ea8bb08c6794dcd0"}, + {file = "referencing-0.36.2.tar.gz", hash = "sha256:df2e89862cd09deabbdba16944cc3f10feb6b3e6f18e902f7cc25609a34775aa"}, +] + +[package.dependencies] +attrs = ">=22.2.0" +rpds-py = ">=0.7.0" + [[package]] name = "requests" version = "2.32.5" @@ -1638,6 +1797,171 @@ pygments = ">=2.13.0,<3.0.0" [package.extras] jupyter = ["ipywidgets (>=7.5.1,<9)"] +[[package]] +name = "rpds-py" +version = "0.27.1" +description = "Python bindings to Rust's persistent data structures (rpds)" +optional = false +python-versions = ">=3.9" +groups = ["dev"] +files = [ + {file = "rpds_py-0.27.1-cp310-cp310-macosx_10_12_x86_64.whl", hash = "sha256:68afeec26d42ab3b47e541b272166a0b4400313946871cba3ed3a4fc0cab1cef"}, + {file = "rpds_py-0.27.1-cp310-cp310-macosx_11_0_arm64.whl", hash = "sha256:74e5b2f7bb6fa38b1b10546d27acbacf2a022a8b5543efb06cfebc72a59c85be"}, + {file = "rpds_py-0.27.1-cp310-cp310-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:9024de74731df54546fab0bfbcdb49fae19159ecaecfc8f37c18d2c7e2c0bd61"}, + {file = "rpds_py-0.27.1-cp310-cp310-manylinux_2_17_armv7l.manylinux2014_armv7l.whl", hash = "sha256:31d3ebadefcd73b73928ed0b2fd696f7fefda8629229f81929ac9c1854d0cffb"}, + {file = "rpds_py-0.27.1-cp310-cp310-manylinux_2_17_ppc64le.manylinux2014_ppc64le.whl", hash = "sha256:b2e7f8f169d775dd9092a1743768d771f1d1300453ddfe6325ae3ab5332b4657"}, + {file = "rpds_py-0.27.1-cp310-cp310-manylinux_2_17_s390x.manylinux2014_s390x.whl", hash = "sha256:3d905d16f77eb6ab2e324e09bfa277b4c8e5e6b8a78a3e7ff8f3cdf773b4c013"}, + {file = "rpds_py-0.27.1-cp310-cp310-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:50c946f048209e6362e22576baea09193809f87687a95a8db24e5fbdb307b93a"}, + {file = "rpds_py-0.27.1-cp310-cp310-manylinux_2_31_riscv64.whl", hash = "sha256:3deab27804d65cd8289eb814c2c0e807c4b9d9916c9225e363cb0cf875eb67c1"}, + {file = "rpds_py-0.27.1-cp310-cp310-manylinux_2_5_i686.manylinux1_i686.whl", hash = "sha256:8b61097f7488de4be8244c89915da8ed212832ccf1e7c7753a25a394bf9b1f10"}, + {file = "rpds_py-0.27.1-cp310-cp310-musllinux_1_2_aarch64.whl", hash = "sha256:8a3f29aba6e2d7d90528d3c792555a93497fe6538aa65eb675b44505be747808"}, + {file = "rpds_py-0.27.1-cp310-cp310-musllinux_1_2_i686.whl", hash = "sha256:dd6cd0485b7d347304067153a6dc1d73f7d4fd995a396ef32a24d24b8ac63ac8"}, + {file = "rpds_py-0.27.1-cp310-cp310-musllinux_1_2_x86_64.whl", hash = "sha256:6f4461bf931108c9fa226ffb0e257c1b18dc2d44cd72b125bec50ee0ab1248a9"}, + {file = "rpds_py-0.27.1-cp310-cp310-win32.whl", hash = "sha256:ee5422d7fb21f6a00c1901bf6559c49fee13a5159d0288320737bbf6585bd3e4"}, + {file = "rpds_py-0.27.1-cp310-cp310-win_amd64.whl", hash = "sha256:3e039aabf6d5f83c745d5f9a0a381d031e9ed871967c0a5c38d201aca41f3ba1"}, + {file = "rpds_py-0.27.1-cp311-cp311-macosx_10_12_x86_64.whl", hash = "sha256:be898f271f851f68b318872ce6ebebbc62f303b654e43bf72683dbdc25b7c881"}, + {file = "rpds_py-0.27.1-cp311-cp311-macosx_11_0_arm64.whl", hash = "sha256:62ac3d4e3e07b58ee0ddecd71d6ce3b1637de2d373501412df395a0ec5f9beb5"}, + {file = "rpds_py-0.27.1-cp311-cp311-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:4708c5c0ceb2d034f9991623631d3d23cb16e65c83736ea020cdbe28d57c0a0e"}, + {file = "rpds_py-0.27.1-cp311-cp311-manylinux_2_17_armv7l.manylinux2014_armv7l.whl", hash = "sha256:abfa1171a9952d2e0002aba2ad3780820b00cc3d9c98c6630f2e93271501f66c"}, + {file = "rpds_py-0.27.1-cp311-cp311-manylinux_2_17_ppc64le.manylinux2014_ppc64le.whl", hash = "sha256:4b507d19f817ebaca79574b16eb2ae412e5c0835542c93fe9983f1e432aca195"}, + {file = "rpds_py-0.27.1-cp311-cp311-manylinux_2_17_s390x.manylinux2014_s390x.whl", hash = "sha256:168b025f8fd8d8d10957405f3fdcef3dc20f5982d398f90851f4abc58c566c52"}, + {file = "rpds_py-0.27.1-cp311-cp311-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:cb56c6210ef77caa58e16e8c17d35c63fe3f5b60fd9ba9d424470c3400bcf9ed"}, + {file = "rpds_py-0.27.1-cp311-cp311-manylinux_2_31_riscv64.whl", hash = "sha256:d252f2d8ca0195faa707f8eb9368955760880b2b42a8ee16d382bf5dd807f89a"}, + {file = "rpds_py-0.27.1-cp311-cp311-manylinux_2_5_i686.manylinux1_i686.whl", hash = "sha256:6e5e54da1e74b91dbc7996b56640f79b195d5925c2b78efaa8c5d53e1d88edde"}, + {file = "rpds_py-0.27.1-cp311-cp311-musllinux_1_2_aarch64.whl", hash = "sha256:ffce0481cc6e95e5b3f0a47ee17ffbd234399e6d532f394c8dce320c3b089c21"}, + {file = "rpds_py-0.27.1-cp311-cp311-musllinux_1_2_i686.whl", hash = "sha256:a205fdfe55c90c2cd8e540ca9ceba65cbe6629b443bc05db1f590a3db8189ff9"}, + {file = "rpds_py-0.27.1-cp311-cp311-musllinux_1_2_x86_64.whl", hash = "sha256:689fb5200a749db0415b092972e8eba85847c23885c8543a8b0f5c009b1a5948"}, + {file = "rpds_py-0.27.1-cp311-cp311-win32.whl", hash = "sha256:3182af66048c00a075010bc7f4860f33913528a4b6fc09094a6e7598e462fe39"}, + {file = "rpds_py-0.27.1-cp311-cp311-win_amd64.whl", hash = "sha256:b4938466c6b257b2f5c4ff98acd8128ec36b5059e5c8f8372d79316b1c36bb15"}, + {file = "rpds_py-0.27.1-cp311-cp311-win_arm64.whl", hash = "sha256:2f57af9b4d0793e53266ee4325535a31ba48e2f875da81a9177c9926dfa60746"}, + {file = "rpds_py-0.27.1-cp312-cp312-macosx_10_12_x86_64.whl", hash = "sha256:ae2775c1973e3c30316892737b91f9283f9908e3cc7625b9331271eaaed7dc90"}, + {file = "rpds_py-0.27.1-cp312-cp312-macosx_11_0_arm64.whl", hash = "sha256:2643400120f55c8a96f7c9d858f7be0c88d383cd4653ae2cf0d0c88f668073e5"}, + {file = "rpds_py-0.27.1-cp312-cp312-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:16323f674c089b0360674a4abd28d5042947d54ba620f72514d69be4ff64845e"}, + {file = "rpds_py-0.27.1-cp312-cp312-manylinux_2_17_armv7l.manylinux2014_armv7l.whl", hash = "sha256:9a1f4814b65eacac94a00fc9a526e3fdafd78e439469644032032d0d63de4881"}, + {file = "rpds_py-0.27.1-cp312-cp312-manylinux_2_17_ppc64le.manylinux2014_ppc64le.whl", hash = "sha256:7ba32c16b064267b22f1850a34051121d423b6f7338a12b9459550eb2096e7ec"}, + {file = "rpds_py-0.27.1-cp312-cp312-manylinux_2_17_s390x.manylinux2014_s390x.whl", hash = "sha256:e5c20f33fd10485b80f65e800bbe5f6785af510b9f4056c5a3c612ebc83ba6cb"}, + {file = "rpds_py-0.27.1-cp312-cp312-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:466bfe65bd932da36ff279ddd92de56b042f2266d752719beb97b08526268ec5"}, + {file = "rpds_py-0.27.1-cp312-cp312-manylinux_2_31_riscv64.whl", hash = "sha256:41e532bbdcb57c92ba3be62c42e9f096431b4cf478da9bc3bc6ce5c38ab7ba7a"}, + {file = "rpds_py-0.27.1-cp312-cp312-manylinux_2_5_i686.manylinux1_i686.whl", hash = "sha256:f149826d742b406579466283769a8ea448eed82a789af0ed17b0cd5770433444"}, + {file = "rpds_py-0.27.1-cp312-cp312-musllinux_1_2_aarch64.whl", hash = "sha256:80c60cfb5310677bd67cb1e85a1e8eb52e12529545441b43e6f14d90b878775a"}, + {file = "rpds_py-0.27.1-cp312-cp312-musllinux_1_2_i686.whl", hash = "sha256:7ee6521b9baf06085f62ba9c7a3e5becffbc32480d2f1b351559c001c38ce4c1"}, + {file = "rpds_py-0.27.1-cp312-cp312-musllinux_1_2_x86_64.whl", hash = "sha256:a512c8263249a9d68cac08b05dd59d2b3f2061d99b322813cbcc14c3c7421998"}, + {file = "rpds_py-0.27.1-cp312-cp312-win32.whl", hash = "sha256:819064fa048ba01b6dadc5116f3ac48610435ac9a0058bbde98e569f9e785c39"}, + {file = "rpds_py-0.27.1-cp312-cp312-win_amd64.whl", hash = "sha256:d9199717881f13c32c4046a15f024971a3b78ad4ea029e8da6b86e5aa9cf4594"}, + {file = "rpds_py-0.27.1-cp312-cp312-win_arm64.whl", hash = "sha256:33aa65b97826a0e885ef6e278fbd934e98cdcfed80b63946025f01e2f5b29502"}, + {file = "rpds_py-0.27.1-cp313-cp313-macosx_10_12_x86_64.whl", hash = "sha256:e4b9fcfbc021633863a37e92571d6f91851fa656f0180246e84cbd8b3f6b329b"}, + {file = "rpds_py-0.27.1-cp313-cp313-macosx_11_0_arm64.whl", hash = "sha256:1441811a96eadca93c517d08df75de45e5ffe68aa3089924f963c782c4b898cf"}, + {file = "rpds_py-0.27.1-cp313-cp313-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:55266dafa22e672f5a4f65019015f90336ed31c6383bd53f5e7826d21a0e0b83"}, + {file = "rpds_py-0.27.1-cp313-cp313-manylinux_2_17_armv7l.manylinux2014_armv7l.whl", hash = "sha256:d78827d7ac08627ea2c8e02c9e5b41180ea5ea1f747e9db0915e3adf36b62dcf"}, + {file = "rpds_py-0.27.1-cp313-cp313-manylinux_2_17_ppc64le.manylinux2014_ppc64le.whl", hash = "sha256:ae92443798a40a92dc5f0b01d8a7c93adde0c4dc965310a29ae7c64d72b9fad2"}, + {file = "rpds_py-0.27.1-cp313-cp313-manylinux_2_17_s390x.manylinux2014_s390x.whl", hash = "sha256:c46c9dd2403b66a2a3b9720ec4b74d4ab49d4fabf9f03dfdce2d42af913fe8d0"}, + {file = "rpds_py-0.27.1-cp313-cp313-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:2efe4eb1d01b7f5f1939f4ef30ecea6c6b3521eec451fb93191bf84b2a522418"}, + {file = "rpds_py-0.27.1-cp313-cp313-manylinux_2_31_riscv64.whl", hash = "sha256:15d3b4d83582d10c601f481eca29c3f138d44c92187d197aff663a269197c02d"}, + {file = "rpds_py-0.27.1-cp313-cp313-manylinux_2_5_i686.manylinux1_i686.whl", hash = "sha256:4ed2e16abbc982a169d30d1a420274a709949e2cbdef119fe2ec9d870b42f274"}, + {file = "rpds_py-0.27.1-cp313-cp313-musllinux_1_2_aarch64.whl", hash = "sha256:a75f305c9b013289121ec0f1181931975df78738cdf650093e6b86d74aa7d8dd"}, + {file = "rpds_py-0.27.1-cp313-cp313-musllinux_1_2_i686.whl", hash = "sha256:67ce7620704745881a3d4b0ada80ab4d99df390838839921f99e63c474f82cf2"}, + {file = "rpds_py-0.27.1-cp313-cp313-musllinux_1_2_x86_64.whl", hash = "sha256:9d992ac10eb86d9b6f369647b6a3f412fc0075cfd5d799530e84d335e440a002"}, + {file = "rpds_py-0.27.1-cp313-cp313-win32.whl", hash = "sha256:4f75e4bd8ab8db624e02c8e2fc4063021b58becdbe6df793a8111d9343aec1e3"}, + {file = "rpds_py-0.27.1-cp313-cp313-win_amd64.whl", hash = "sha256:f9025faafc62ed0b75a53e541895ca272815bec18abe2249ff6501c8f2e12b83"}, + {file = "rpds_py-0.27.1-cp313-cp313-win_arm64.whl", hash = "sha256:ed10dc32829e7d222b7d3b93136d25a406ba9788f6a7ebf6809092da1f4d279d"}, + {file = "rpds_py-0.27.1-cp313-cp313t-macosx_10_12_x86_64.whl", hash = "sha256:92022bbbad0d4426e616815b16bc4127f83c9a74940e1ccf3cfe0b387aba0228"}, + {file = "rpds_py-0.27.1-cp313-cp313t-macosx_11_0_arm64.whl", hash = "sha256:47162fdab9407ec3f160805ac3e154df042e577dd53341745fc7fb3f625e6d92"}, + {file = "rpds_py-0.27.1-cp313-cp313t-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:fb89bec23fddc489e5d78b550a7b773557c9ab58b7946154a10a6f7a214a48b2"}, + {file = "rpds_py-0.27.1-cp313-cp313t-manylinux_2_17_armv7l.manylinux2014_armv7l.whl", hash = "sha256:e48af21883ded2b3e9eb48cb7880ad8598b31ab752ff3be6457001d78f416723"}, + {file = "rpds_py-0.27.1-cp313-cp313t-manylinux_2_17_ppc64le.manylinux2014_ppc64le.whl", hash = "sha256:6f5b7bd8e219ed50299e58551a410b64daafb5017d54bbe822e003856f06a802"}, + {file = "rpds_py-0.27.1-cp313-cp313t-manylinux_2_17_s390x.manylinux2014_s390x.whl", hash = "sha256:08f1e20bccf73b08d12d804d6e1c22ca5530e71659e6673bce31a6bb71c1e73f"}, + {file = "rpds_py-0.27.1-cp313-cp313t-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:0dc5dceeaefcc96dc192e3a80bbe1d6c410c469e97bdd47494a7d930987f18b2"}, + {file = "rpds_py-0.27.1-cp313-cp313t-manylinux_2_31_riscv64.whl", hash = "sha256:d76f9cc8665acdc0c9177043746775aa7babbf479b5520b78ae4002d889f5c21"}, + {file = "rpds_py-0.27.1-cp313-cp313t-manylinux_2_5_i686.manylinux1_i686.whl", hash = "sha256:134fae0e36022edad8290a6661edf40c023562964efea0cc0ec7f5d392d2aaef"}, + {file = "rpds_py-0.27.1-cp313-cp313t-musllinux_1_2_aarch64.whl", hash = "sha256:eb11a4f1b2b63337cfd3b4d110af778a59aae51c81d195768e353d8b52f88081"}, + {file = "rpds_py-0.27.1-cp313-cp313t-musllinux_1_2_i686.whl", hash = "sha256:13e608ac9f50a0ed4faec0e90ece76ae33b34c0e8656e3dceb9a7db994c692cd"}, + {file = "rpds_py-0.27.1-cp313-cp313t-musllinux_1_2_x86_64.whl", hash = "sha256:dd2135527aa40f061350c3f8f89da2644de26cd73e4de458e79606384f4f68e7"}, + {file = "rpds_py-0.27.1-cp313-cp313t-win32.whl", hash = "sha256:3020724ade63fe320a972e2ffd93b5623227e684315adce194941167fee02688"}, + {file = "rpds_py-0.27.1-cp313-cp313t-win_amd64.whl", hash = "sha256:8ee50c3e41739886606388ba3ab3ee2aae9f35fb23f833091833255a31740797"}, + {file = "rpds_py-0.27.1-cp314-cp314-macosx_10_12_x86_64.whl", hash = "sha256:acb9aafccaae278f449d9c713b64a9e68662e7799dbd5859e2c6b3c67b56d334"}, + {file = "rpds_py-0.27.1-cp314-cp314-macosx_11_0_arm64.whl", hash = "sha256:b7fb801aa7f845ddf601c49630deeeccde7ce10065561d92729bfe81bd21fb33"}, + {file = "rpds_py-0.27.1-cp314-cp314-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:fe0dd05afb46597b9a2e11c351e5e4283c741237e7f617ffb3252780cca9336a"}, + {file = "rpds_py-0.27.1-cp314-cp314-manylinux_2_17_armv7l.manylinux2014_armv7l.whl", hash = "sha256:b6dfb0e058adb12d8b1d1b25f686e94ffa65d9995a5157afe99743bf7369d62b"}, + {file = "rpds_py-0.27.1-cp314-cp314-manylinux_2_17_ppc64le.manylinux2014_ppc64le.whl", hash = "sha256:ed090ccd235f6fa8bb5861684567f0a83e04f52dfc2e5c05f2e4b1309fcf85e7"}, + {file = "rpds_py-0.27.1-cp314-cp314-manylinux_2_17_s390x.manylinux2014_s390x.whl", hash = "sha256:bf876e79763eecf3e7356f157540d6a093cef395b65514f17a356f62af6cc136"}, + {file = "rpds_py-0.27.1-cp314-cp314-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:12ed005216a51b1d6e2b02a7bd31885fe317e45897de81d86dcce7d74618ffff"}, + {file = "rpds_py-0.27.1-cp314-cp314-manylinux_2_31_riscv64.whl", hash = "sha256:ee4308f409a40e50593c7e3bb8cbe0b4d4c66d1674a316324f0c2f5383b486f9"}, + {file = "rpds_py-0.27.1-cp314-cp314-manylinux_2_5_i686.manylinux1_i686.whl", hash = "sha256:0b08d152555acf1f455154d498ca855618c1378ec810646fcd7c76416ac6dc60"}, + {file = "rpds_py-0.27.1-cp314-cp314-musllinux_1_2_aarch64.whl", hash = "sha256:dce51c828941973a5684d458214d3a36fcd28da3e1875d659388f4f9f12cc33e"}, + {file = "rpds_py-0.27.1-cp314-cp314-musllinux_1_2_i686.whl", hash = "sha256:c1476d6f29eb81aa4151c9a31219b03f1f798dc43d8af1250a870735516a1212"}, + {file = "rpds_py-0.27.1-cp314-cp314-musllinux_1_2_x86_64.whl", hash = "sha256:3ce0cac322b0d69b63c9cdb895ee1b65805ec9ffad37639f291dd79467bee675"}, + {file = "rpds_py-0.27.1-cp314-cp314-win32.whl", hash = "sha256:dfbfac137d2a3d0725758cd141f878bf4329ba25e34979797c89474a89a8a3a3"}, + {file = "rpds_py-0.27.1-cp314-cp314-win_amd64.whl", hash = "sha256:a6e57b0abfe7cc513450fcf529eb486b6e4d3f8aee83e92eb5f1ef848218d456"}, + {file = "rpds_py-0.27.1-cp314-cp314-win_arm64.whl", hash = "sha256:faf8d146f3d476abfee026c4ae3bdd9ca14236ae4e4c310cbd1cf75ba33d24a3"}, + {file = "rpds_py-0.27.1-cp314-cp314t-macosx_10_12_x86_64.whl", hash = "sha256:ba81d2b56b6d4911ce735aad0a1d4495e808b8ee4dc58715998741a26874e7c2"}, + {file = "rpds_py-0.27.1-cp314-cp314t-macosx_11_0_arm64.whl", hash = "sha256:84f7d509870098de0e864cad0102711c1e24e9b1a50ee713b65928adb22269e4"}, + {file = "rpds_py-0.27.1-cp314-cp314t-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:a9e960fc78fecd1100539f14132425e1d5fe44ecb9239f8f27f079962021523e"}, + {file = "rpds_py-0.27.1-cp314-cp314t-manylinux_2_17_armv7l.manylinux2014_armv7l.whl", hash = "sha256:62f85b665cedab1a503747617393573995dac4600ff51869d69ad2f39eb5e817"}, + {file = "rpds_py-0.27.1-cp314-cp314t-manylinux_2_17_ppc64le.manylinux2014_ppc64le.whl", hash = "sha256:fed467af29776f6556250c9ed85ea5a4dd121ab56a5f8b206e3e7a4c551e48ec"}, + {file = "rpds_py-0.27.1-cp314-cp314t-manylinux_2_17_s390x.manylinux2014_s390x.whl", hash = "sha256:f2729615f9d430af0ae6b36cf042cb55c0936408d543fb691e1a9e36648fd35a"}, + {file = "rpds_py-0.27.1-cp314-cp314t-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:1b207d881a9aef7ba753d69c123a35d96ca7cb808056998f6b9e8747321f03b8"}, + {file = "rpds_py-0.27.1-cp314-cp314t-manylinux_2_31_riscv64.whl", hash = "sha256:639fd5efec029f99b79ae47e5d7e00ad8a773da899b6309f6786ecaf22948c48"}, + {file = "rpds_py-0.27.1-cp314-cp314t-manylinux_2_5_i686.manylinux1_i686.whl", hash = "sha256:fecc80cb2a90e28af8a9b366edacf33d7a91cbfe4c2c4544ea1246e949cfebeb"}, + {file = "rpds_py-0.27.1-cp314-cp314t-musllinux_1_2_aarch64.whl", hash = "sha256:42a89282d711711d0a62d6f57d81aa43a1368686c45bc1c46b7f079d55692734"}, + {file = "rpds_py-0.27.1-cp314-cp314t-musllinux_1_2_i686.whl", hash = "sha256:cf9931f14223de59551ab9d38ed18d92f14f055a5f78c1d8ad6493f735021bbb"}, + {file = "rpds_py-0.27.1-cp314-cp314t-musllinux_1_2_x86_64.whl", hash = "sha256:f39f58a27cc6e59f432b568ed8429c7e1641324fbe38131de852cd77b2d534b0"}, + {file = "rpds_py-0.27.1-cp314-cp314t-win32.whl", hash = "sha256:d5fa0ee122dc09e23607a28e6d7b150da16c662e66409bbe85230e4c85bb528a"}, + {file = "rpds_py-0.27.1-cp314-cp314t-win_amd64.whl", hash = "sha256:6567d2bb951e21232c2f660c24cf3470bb96de56cdcb3f071a83feeaff8a2772"}, + {file = "rpds_py-0.27.1-cp39-cp39-macosx_10_12_x86_64.whl", hash = "sha256:c918c65ec2e42c2a78d19f18c553d77319119bf43aa9e2edf7fb78d624355527"}, + {file = "rpds_py-0.27.1-cp39-cp39-macosx_11_0_arm64.whl", hash = "sha256:1fea2b1a922c47c51fd07d656324531adc787e415c8b116530a1d29c0516c62d"}, + {file = "rpds_py-0.27.1-cp39-cp39-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:bbf94c58e8e0cd6b6f38d8de67acae41b3a515c26169366ab58bdca4a6883bb8"}, + {file = "rpds_py-0.27.1-cp39-cp39-manylinux_2_17_armv7l.manylinux2014_armv7l.whl", hash = "sha256:c2a8fed130ce946d5c585eddc7c8eeef0051f58ac80a8ee43bd17835c144c2cc"}, + {file = "rpds_py-0.27.1-cp39-cp39-manylinux_2_17_ppc64le.manylinux2014_ppc64le.whl", hash = "sha256:037a2361db72ee98d829bc2c5b7cc55598ae0a5e0ec1823a56ea99374cfd73c1"}, + {file = "rpds_py-0.27.1-cp39-cp39-manylinux_2_17_s390x.manylinux2014_s390x.whl", hash = "sha256:5281ed1cc1d49882f9997981c88df1a22e140ab41df19071222f7e5fc4e72125"}, + {file = "rpds_py-0.27.1-cp39-cp39-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:2fd50659a069c15eef8aa3d64bbef0d69fd27bb4a50c9ab4f17f83a16cbf8905"}, + {file = "rpds_py-0.27.1-cp39-cp39-manylinux_2_31_riscv64.whl", hash = "sha256:c4b676c4ae3921649a15d28ed10025548e9b561ded473aa413af749503c6737e"}, + {file = "rpds_py-0.27.1-cp39-cp39-manylinux_2_5_i686.manylinux1_i686.whl", hash = "sha256:079bc583a26db831a985c5257797b2b5d3affb0386e7ff886256762f82113b5e"}, + {file = "rpds_py-0.27.1-cp39-cp39-musllinux_1_2_aarch64.whl", hash = "sha256:4e44099bd522cba71a2c6b97f68e19f40e7d85399de899d66cdb67b32d7cb786"}, + {file = "rpds_py-0.27.1-cp39-cp39-musllinux_1_2_i686.whl", hash = "sha256:e202e6d4188e53c6661af813b46c37ca2c45e497fc558bacc1a7630ec2695aec"}, + {file = "rpds_py-0.27.1-cp39-cp39-musllinux_1_2_x86_64.whl", hash = "sha256:f41f814b8eaa48768d1bb551591f6ba45f87ac76899453e8ccd41dba1289b04b"}, + {file = "rpds_py-0.27.1-cp39-cp39-win32.whl", hash = "sha256:9e71f5a087ead99563c11fdaceee83ee982fd39cf67601f4fd66cb386336ee52"}, + {file = "rpds_py-0.27.1-cp39-cp39-win_amd64.whl", hash = "sha256:71108900c9c3c8590697244b9519017a400d9ba26a36c48381b3f64743a44aab"}, + {file = "rpds_py-0.27.1-pp310-pypy310_pp73-macosx_10_12_x86_64.whl", hash = "sha256:7ba22cb9693df986033b91ae1d7a979bc399237d45fccf875b76f62bb9e52ddf"}, + {file = "rpds_py-0.27.1-pp310-pypy310_pp73-macosx_11_0_arm64.whl", hash = "sha256:5b640501be9288c77738b5492b3fd3abc4ba95c50c2e41273c8a1459f08298d3"}, + {file = "rpds_py-0.27.1-pp310-pypy310_pp73-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:fb08b65b93e0c6dd70aac7f7890a9c0938d5ec71d5cb32d45cf844fb8ae47636"}, + {file = "rpds_py-0.27.1-pp310-pypy310_pp73-manylinux_2_17_armv7l.manylinux2014_armv7l.whl", hash = "sha256:d7ff07d696a7a38152ebdb8212ca9e5baab56656749f3d6004b34ab726b550b8"}, + {file = "rpds_py-0.27.1-pp310-pypy310_pp73-manylinux_2_17_ppc64le.manylinux2014_ppc64le.whl", hash = "sha256:fb7c72262deae25366e3b6c0c0ba46007967aea15d1eea746e44ddba8ec58dcc"}, + {file = "rpds_py-0.27.1-pp310-pypy310_pp73-manylinux_2_17_s390x.manylinux2014_s390x.whl", hash = "sha256:7b002cab05d6339716b03a4a3a2ce26737f6231d7b523f339fa061d53368c9d8"}, + {file = "rpds_py-0.27.1-pp310-pypy310_pp73-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:23f6b69d1c26c4704fec01311963a41d7de3ee0570a84ebde4d544e5a1859ffc"}, + {file = "rpds_py-0.27.1-pp310-pypy310_pp73-manylinux_2_31_riscv64.whl", hash = "sha256:530064db9146b247351f2a0250b8f00b289accea4596a033e94be2389977de71"}, + {file = "rpds_py-0.27.1-pp310-pypy310_pp73-manylinux_2_5_i686.manylinux1_i686.whl", hash = "sha256:7b90b0496570bd6b0321724a330d8b545827c4df2034b6ddfc5f5275f55da2ad"}, + {file = "rpds_py-0.27.1-pp310-pypy310_pp73-musllinux_1_2_aarch64.whl", hash = "sha256:879b0e14a2da6a1102a3fc8af580fc1ead37e6d6692a781bd8c83da37429b5ab"}, + {file = "rpds_py-0.27.1-pp310-pypy310_pp73-musllinux_1_2_i686.whl", hash = "sha256:0d807710df3b5faa66c731afa162ea29717ab3be17bdc15f90f2d9f183da4059"}, + {file = "rpds_py-0.27.1-pp310-pypy310_pp73-musllinux_1_2_x86_64.whl", hash = "sha256:3adc388fc3afb6540aec081fa59e6e0d3908722771aa1e37ffe22b220a436f0b"}, + {file = "rpds_py-0.27.1-pp310-pypy310_pp73-win_amd64.whl", hash = "sha256:c796c0c1cc68cb08b0284db4229f5af76168172670c74908fdbd4b7d7f515819"}, + {file = "rpds_py-0.27.1-pp311-pypy311_pp73-macosx_10_12_x86_64.whl", hash = "sha256:cdfe4bb2f9fe7458b7453ad3c33e726d6d1c7c0a72960bcc23800d77384e42df"}, + {file = "rpds_py-0.27.1-pp311-pypy311_pp73-macosx_11_0_arm64.whl", hash = "sha256:8fabb8fd848a5f75a2324e4a84501ee3a5e3c78d8603f83475441866e60b94a3"}, + {file = "rpds_py-0.27.1-pp311-pypy311_pp73-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:eda8719d598f2f7f3e0f885cba8646644b55a187762bec091fa14a2b819746a9"}, + {file = "rpds_py-0.27.1-pp311-pypy311_pp73-manylinux_2_17_armv7l.manylinux2014_armv7l.whl", hash = "sha256:3c64d07e95606ec402a0a1c511fe003873fa6af630bda59bac77fac8b4318ebc"}, + {file = "rpds_py-0.27.1-pp311-pypy311_pp73-manylinux_2_17_ppc64le.manylinux2014_ppc64le.whl", hash = "sha256:93a2ed40de81bcff59aabebb626562d48332f3d028ca2036f1d23cbb52750be4"}, + {file = "rpds_py-0.27.1-pp311-pypy311_pp73-manylinux_2_17_s390x.manylinux2014_s390x.whl", hash = "sha256:387ce8c44ae94e0ec50532d9cb0edce17311024c9794eb196b90e1058aadeb66"}, + {file = "rpds_py-0.27.1-pp311-pypy311_pp73-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:aaf94f812c95b5e60ebaf8bfb1898a7d7cb9c1af5744d4a67fa47796e0465d4e"}, + {file = "rpds_py-0.27.1-pp311-pypy311_pp73-manylinux_2_31_riscv64.whl", hash = "sha256:4848ca84d6ded9b58e474dfdbad4b8bfb450344c0551ddc8d958bf4b36aa837c"}, + {file = "rpds_py-0.27.1-pp311-pypy311_pp73-manylinux_2_5_i686.manylinux1_i686.whl", hash = "sha256:2bde09cbcf2248b73c7c323be49b280180ff39fadcfe04e7b6f54a678d02a7cf"}, + {file = "rpds_py-0.27.1-pp311-pypy311_pp73-musllinux_1_2_aarch64.whl", hash = "sha256:94c44ee01fd21c9058f124d2d4f0c9dc7634bec93cd4b38eefc385dabe71acbf"}, + {file = "rpds_py-0.27.1-pp311-pypy311_pp73-musllinux_1_2_i686.whl", hash = "sha256:df8b74962e35c9249425d90144e721eed198e6555a0e22a563d29fe4486b51f6"}, + {file = "rpds_py-0.27.1-pp311-pypy311_pp73-musllinux_1_2_x86_64.whl", hash = "sha256:dc23e6820e3b40847e2f4a7726462ba0cf53089512abe9ee16318c366494c17a"}, + {file = "rpds_py-0.27.1-pp39-pypy39_pp73-macosx_10_12_x86_64.whl", hash = "sha256:aa8933159edc50be265ed22b401125c9eebff3171f570258854dbce3ecd55475"}, + {file = "rpds_py-0.27.1-pp39-pypy39_pp73-macosx_11_0_arm64.whl", hash = "sha256:a50431bf02583e21bf273c71b89d710e7a710ad5e39c725b14e685610555926f"}, + {file = "rpds_py-0.27.1-pp39-pypy39_pp73-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:78af06ddc7fe5cc0e967085a9115accee665fb912c22a3f54bad70cc65b05fe6"}, + {file = "rpds_py-0.27.1-pp39-pypy39_pp73-manylinux_2_17_armv7l.manylinux2014_armv7l.whl", hash = "sha256:70d0738ef8fee13c003b100c2fbd667ec4f133468109b3472d249231108283a3"}, + {file = "rpds_py-0.27.1-pp39-pypy39_pp73-manylinux_2_17_ppc64le.manylinux2014_ppc64le.whl", hash = "sha256:e2f6fd8a1cea5bbe599b6e78a6e5ee08db434fc8ffea51ff201c8765679698b3"}, + {file = "rpds_py-0.27.1-pp39-pypy39_pp73-manylinux_2_17_s390x.manylinux2014_s390x.whl", hash = "sha256:8177002868d1426305bb5de1e138161c2ec9eb2d939be38291d7c431c4712df8"}, + {file = "rpds_py-0.27.1-pp39-pypy39_pp73-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:008b839781d6c9bf3b6a8984d1d8e56f0ec46dc56df61fd669c49b58ae800400"}, + {file = "rpds_py-0.27.1-pp39-pypy39_pp73-manylinux_2_31_riscv64.whl", hash = "sha256:a55b9132bb1ade6c734ddd2759c8dc132aa63687d259e725221f106b83a0e485"}, + {file = "rpds_py-0.27.1-pp39-pypy39_pp73-manylinux_2_5_i686.manylinux1_i686.whl", hash = "sha256:a46fdec0083a26415f11d5f236b79fa1291c32aaa4a17684d82f7017a1f818b1"}, + {file = "rpds_py-0.27.1-pp39-pypy39_pp73-musllinux_1_2_aarch64.whl", hash = "sha256:8a63b640a7845f2bdd232eb0d0a4a2dd939bcdd6c57e6bb134526487f3160ec5"}, + {file = "rpds_py-0.27.1-pp39-pypy39_pp73-musllinux_1_2_i686.whl", hash = "sha256:7e32721e5d4922deaaf963469d795d5bde6093207c52fec719bd22e5d1bedbc4"}, + {file = "rpds_py-0.27.1-pp39-pypy39_pp73-musllinux_1_2_x86_64.whl", hash = "sha256:2c426b99a068601b5f4623573df7a7c3d72e87533a2dd2253353a03e7502566c"}, + {file = "rpds_py-0.27.1-pp39-pypy39_pp73-win_amd64.whl", hash = "sha256:4fc9b7fe29478824361ead6e14e4f5aed570d477e06088826537e202d25fe859"}, + {file = "rpds_py-0.27.1.tar.gz", hash = "sha256:26a1c73171d10b7acccbded82bf6a586ab8203601e565badc74bbbf8bc5a10f8"}, +] + [[package]] name = "ruff" version = "0.12.12" @@ -1927,4 +2251,4 @@ dev = ["black (>=19.3b0) ; python_version >= \"3.6\"", "pytest (>=4.6.2)"] [metadata] lock-version = "2.1" python-versions = "^3.13" -content-hash = "01523761e407eb4721a6ac25255a75913ec9eb170901cd8ad47a4dc31857fef4" +content-hash = "9049da9f95908d67870adae3eb3a34cf3f62f9d7008f82d36958cc7dabfc4ab2" diff --git a/pyproject.toml b/pyproject.toml index 4dfd014..7306c4a 100644 --- a/pyproject.toml +++ b/pyproject.toml @@ -20,6 +20,7 @@ cookiecutter = "^2.6.0" graphviz = "^0.21" ipykernel = "^6.30.1" isort = "^6.0.1" +jupytext = "^1.16.6" mypy = "^1.17.1" nbqa = "^1.9.1" pre-commit = "^4.3.0" diff --git a/scripts/shared b/scripts/shared index d6e9580..0216476 160000 --- a/scripts/shared +++ b/scripts/shared @@ -1 +1 @@ -Subproject commit d6e9580673bd0b1b6908add1fc721ad6e3489f7f +Subproject commit 021647623d9d0304e3e1004e34c766b987f79a25 diff --git a/sonar-project.properties b/sonar-project.properties index cb6e2c2..bdfd507 100644 --- a/sonar-project.properties +++ b/sonar-project.properties @@ -8,7 +8,7 @@ sonar.projectVersion=1.0 sonar.sources=leetcode,leetcode_py sonar.tests=leetcode sonar.test.inclusions=**/tests.py -sonar.exclusions=**/conftest.py,**/.templates/**,**/__pycache__/**,**/.venv/** +sonar.exclusions=**/conftest.py,**/.templates/**,**/__pycache__/**,**/.venv/**,**/playground.py # Python specific settings sonar.python.version=3.13 From af405d8b258e141b9466a15792af481753045f67 Mon Sep 17 00:00:00 2001 From: Wisaroot <66859294+wisarootl@users.noreply.github.com> Date: Sat, 13 Sep 2025 11:08:49 +0700 Subject: [PATCH 03/57] feat: add find_all_anagrams_in_a_string (#38) --- .amazonq/rules/development-rules.md | 14 ++ .amazonq/rules/test-case-enhancement.md | 16 +- .pre-commit-config.yaml | 2 +- .templates/leetcode/json/accounts_merge.json | 71 +++++--- ...e_from_preorder_and_inorder_traversal.json | 62 +++++++ .../leetcode/json/diagonal_traverse.json | 62 +++++++ .../json/find_all_anagrams_in_a_string.json | 64 +++++++ ...letter_combinations_of_a_phone_number.json | 63 +++++++ .templates/leetcode/json/subsets.json | 62 +++++++ .templates/leetcode/json/unique_paths.json | 64 +++++++ .templates/leetcode/json/word_search.json | 67 +++++++ Makefile | 2 +- leetcode/accounts_merge/README.md | 14 +- leetcode/accounts_merge/test_solution.py | 71 ++++---- .../README.md | 39 ++++ .../__init__.py | 0 .../helpers.py | 12 ++ .../playground.py | 30 ++++ .../solution.py | 59 ++++++ .../test_solution.py | 41 +++++ leetcode/diagonal_traverse/README.md | 37 ++++ leetcode/diagonal_traverse/__init__.py | 0 leetcode/diagonal_traverse/helpers.py | 8 + leetcode/diagonal_traverse/playground.py | 29 +++ leetcode/diagonal_traverse/solution.py | 70 ++++++++ leetcode/diagonal_traverse/test_solution.py | 34 ++++ .../find_all_anagrams_in_a_string/README.md | 43 +++++ .../find_all_anagrams_in_a_string/__init__.py | 0 .../find_all_anagrams_in_a_string/helpers.py | 8 + .../playground.py | 30 ++++ .../find_all_anagrams_in_a_string/solution.py | 56 ++++++ .../test_solution.py | 33 ++++ .../README.md | 43 +++++ .../__init__.py | 0 .../helpers.py | 10 ++ .../playground.py | 29 +++ .../solution.py | 31 ++++ .../test_solution.py | 169 ++++++++++++++++++ leetcode/subsets/README.md | 35 ++++ leetcode/subsets/__init__.py | 0 leetcode/subsets/helpers.py | 11 ++ leetcode/subsets/playground.py | 29 +++ leetcode/subsets/solution.py | 16 ++ leetcode/subsets/test_solution.py | 53 ++++++ leetcode/unique_paths/README.md | 43 +++++ leetcode/unique_paths/__init__.py | 0 leetcode/unique_paths/helpers.py | 8 + leetcode/unique_paths/playground.py | 30 ++++ leetcode/unique_paths/solution.py | 29 +++ leetcode/unique_paths/test_solution.py | 34 ++++ leetcode/word_search/README.md | 52 ++++++ leetcode/word_search/__init__.py | 0 leetcode/word_search/helpers.py | 8 + leetcode/word_search/playground.py | 30 ++++ leetcode/word_search/solution.py | 42 +++++ leetcode/word_search/test_solution.py | 44 +++++ pyproject.toml | 3 + 57 files changed, 1840 insertions(+), 72 deletions(-) create mode 100644 .templates/leetcode/json/construct_binary_tree_from_preorder_and_inorder_traversal.json create mode 100644 .templates/leetcode/json/diagonal_traverse.json create mode 100644 .templates/leetcode/json/find_all_anagrams_in_a_string.json create mode 100644 .templates/leetcode/json/letter_combinations_of_a_phone_number.json create mode 100644 .templates/leetcode/json/subsets.json create mode 100644 .templates/leetcode/json/unique_paths.json create mode 100644 .templates/leetcode/json/word_search.json create mode 100644 leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/README.md create mode 100644 leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/__init__.py create mode 100644 leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/helpers.py create mode 100644 leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/playground.py create mode 100644 leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/solution.py create mode 100644 leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/test_solution.py create mode 100644 leetcode/diagonal_traverse/README.md create mode 100644 leetcode/diagonal_traverse/__init__.py create mode 100644 leetcode/diagonal_traverse/helpers.py create mode 100644 leetcode/diagonal_traverse/playground.py create mode 100644 leetcode/diagonal_traverse/solution.py create mode 100644 leetcode/diagonal_traverse/test_solution.py create mode 100644 leetcode/find_all_anagrams_in_a_string/README.md create mode 100644 leetcode/find_all_anagrams_in_a_string/__init__.py create mode 100644 leetcode/find_all_anagrams_in_a_string/helpers.py create mode 100644 leetcode/find_all_anagrams_in_a_string/playground.py create mode 100644 leetcode/find_all_anagrams_in_a_string/solution.py create mode 100644 leetcode/find_all_anagrams_in_a_string/test_solution.py create mode 100644 leetcode/letter_combinations_of_a_phone_number/README.md create mode 100644 leetcode/letter_combinations_of_a_phone_number/__init__.py create mode 100644 leetcode/letter_combinations_of_a_phone_number/helpers.py create mode 100644 leetcode/letter_combinations_of_a_phone_number/playground.py create mode 100644 leetcode/letter_combinations_of_a_phone_number/solution.py create mode 100644 leetcode/letter_combinations_of_a_phone_number/test_solution.py create mode 100644 leetcode/subsets/README.md create mode 100644 leetcode/subsets/__init__.py create mode 100644 leetcode/subsets/helpers.py create mode 100644 leetcode/subsets/playground.py create mode 100644 leetcode/subsets/solution.py create mode 100644 leetcode/subsets/test_solution.py create mode 100644 leetcode/unique_paths/README.md create mode 100644 leetcode/unique_paths/__init__.py create mode 100644 leetcode/unique_paths/helpers.py create mode 100644 leetcode/unique_paths/playground.py create mode 100644 leetcode/unique_paths/solution.py create mode 100644 leetcode/unique_paths/test_solution.py create mode 100644 leetcode/word_search/README.md create mode 100644 leetcode/word_search/__init__.py create mode 100644 leetcode/word_search/helpers.py create mode 100644 leetcode/word_search/playground.py create mode 100644 leetcode/word_search/solution.py create mode 100644 leetcode/word_search/test_solution.py diff --git a/.amazonq/rules/development-rules.md b/.amazonq/rules/development-rules.md index aae1892..d7f1080 100644 --- a/.amazonq/rules/development-rules.md +++ b/.amazonq/rules/development-rules.md @@ -18,6 +18,20 @@ - Test all: `make test` - Beautiful logging with loguru +### Multiple Solution Classes Pattern + +When implementing multiple approaches (e.g., Solution, SolutionMath), use parametrized testing: + +```python +@pytest.mark.parametrize("solution_class", [Solution, SolutionMath]) +@pytest.mark.parametrize("input_params, expected", test_cases) +def test_method(self, solution_class, input_params, expected): + result = run_helper(solution_class, *input_params) + assert_helper(result, expected) +``` + +This pattern tests all solution approaches with the same test cases, ensuring consistency across implementations. + ## File Structure Each problem has: diff --git a/.amazonq/rules/test-case-enhancement.md b/.amazonq/rules/test-case-enhancement.md index 11b5019..8b341d7 100644 --- a/.amazonq/rules/test-case-enhancement.md +++ b/.amazonq/rules/test-case-enhancement.md @@ -2,7 +2,7 @@ ## Simple Enhancement Workflow -When user requests test case enhancement: +When user requests test case enhancement or **test reproducibility verification**: ### 1. Problem Resolution @@ -69,6 +69,19 @@ make p-gen PROBLEM={problem_name} FORCE=1 make p-lint PROBLEM={problem_name} ``` +## Test Reproducibility Verification + +Use this same workflow when CI tests fail due to reproducibility issues: + +**Process Name**: Test Reproducibility Verification + +**When to Use**: + +- CI test failures in reproducibility checks +- Inconsistent test results between environments +- Missing edge cases causing coverage gaps +- Need to ensure 100% code coverage + ## Success Criteria - All tests pass with enhanced test cases @@ -76,3 +89,4 @@ make p-lint PROBLEM={problem_name} - Original solution code preserved - **Enhanced test cases in final test_solution.py** - JSON template updated for future regeneration +- **100% code coverage including edge cases** diff --git a/.pre-commit-config.yaml b/.pre-commit-config.yaml index 23a8453..f080465 100644 --- a/.pre-commit-config.yaml +++ b/.pre-commit-config.yaml @@ -23,7 +23,7 @@ repos: - repo: local hooks: - id: sync-submodules - name: Sync git submodules + name: sync git submodules entry: bash -c 'output=$(git submodule update --init --recursive --remote 2>&1); [ -z "$output" ]' language: system always_run: true diff --git a/.templates/leetcode/json/accounts_merge.json b/.templates/leetcode/json/accounts_merge.json index bcbddb6..ec92c0d 100644 --- a/.templates/leetcode/json/accounts_merge.json +++ b/.templates/leetcode/json/accounts_merge.json @@ -5,47 +5,60 @@ "problem_title": "Accounts Merge", "difficulty": "Medium", "topics": "Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union Find, Sorting", - "tags": ["grind-75"], - "readme_description": "Given a list of `accounts` where each element `accounts[i]` is a list of strings, where the first element `accounts[i][0]` is a name, and the rest of the elements are **emails** representing emails of the account.\n\nNow, we would like to merge these accounts. Two accounts definitely belong to the same person if there is some common email to both accounts. Note that even if two accounts have the same name, they may belong to different people as people could have the same name. A person can have any number of accounts initially, but all of their accounts definitely have the same name.\n\nAfter merging the accounts, return the accounts in the following format: the first element of each account is the name, and the rest of the elements are emails **in sorted order**. The accounts themselves can be returned in **any order**.", - "readme_examples": [ - { - "content": "```\nInput: accounts = [[\"John\",\"johnsmith@mail.com\",\"john_newyork@mail.com\"],[\"John\",\"johnsmith@mail.com\",\"john00@mail.com\"],[\"Mary\",\"mary@mail.com\"],[\"John\",\"johnnybravo@mail.com\"]]\nOutput: [[\"John\",\"john00@mail.com\",\"john_newyork@mail.com\",\"johnsmith@mail.com\"],[\"Mary\",\"mary@mail.com\"],[\"John\",\"johnnybravo@mail.com\"]]\n```\n**Explanation:** The first and second John's are the same person as they have the common email \"johnsmith@mail.com\". The third John and Mary are different people as none of their email addresses are used by other accounts." - }, - { - "content": "```\nInput: accounts = [[\"Gabe\",\"Gabe0@m.co\",\"Gabe3@m.co\",\"Gabe1@m.co\"],[\"Kevin\",\"Kevin3@m.co\",\"Kevin5@m.co\",\"Kevin0@m.co\"],[\"Ethan\",\"Ethan5@m.co\",\"Ethan4@m.co\",\"Ethan0@m.co\"],[\"Hanzo\",\"Hanzo3@m.co\",\"Hanzo1@m.co\",\"Hanzo0@m.co\"],[\"Fern\",\"Fern5@m.co\",\"Fern1@m.co\",\"Fern0@m.co\"]]\nOutput: [[\"Ethan\",\"Ethan0@m.co\",\"Ethan4@m.co\",\"Ethan5@m.co\"],[\"Gabe\",\"Gabe0@m.co\",\"Gabe1@m.co\",\"Gabe3@m.co\"],[\"Hanzo\",\"Hanzo0@m.co\",\"Hanzo1@m.co\",\"Hanzo3@m.co\"],[\"Kevin\",\"Kevin0@m.co\",\"Kevin3@m.co\",\"Kevin5@m.co\"],[\"Fern\",\"Fern0@m.co\",\"Fern1@m.co\",\"Fern5@m.co\"]]\n```" - } - ], - "readme_constraints": "- `1 <= accounts.length <= 1000`\n- `2 <= accounts[i].length <= 10`\n- `1 <= accounts[i][j].length <= 30`\n- `accounts[i][0]` consists of English letters.\n- `accounts[i][j] (for j > 0)` is a valid email.", + "_tags": { "list": ["grind-75"] }, + "readme_description": "Given a list of `accounts` where each element `accounts[i]` is a list of strings, where the first element `accounts[i][0]` is a name, and the rest of the elements are emails representing emails of the account.\n\nNow, we would like to merge these accounts. Two accounts definitely belong to the same person if there is some common email to both accounts. Note that even if two accounts have the same name, they may belong to different people as people could have the same name. A person can have any number of accounts initially, but all of their accounts definitely have the same name.\n\nAfter merging the accounts, return the accounts in the following format: the first element of each account is the name, and the rest of the elements are emails in sorted order. The accounts themselves can be returned in any order.", + "_readme_examples": { + "list": [ + { + "content": "```\nInput: accounts = [[\"John\",\"johnsmith@mail.com\",\"john_newyork@mail.com\"],[\"John\",\"johnsmith@mail.com\",\"john00@mail.com\"],[\"Mary\",\"mary@mail.com\"],[\"John\",\"johnnybravo@mail.com\"]]\nOutput: [[\"John\",\"john00@mail.com\",\"john_newyork@mail.com\",\"johnsmith@mail.com\"],[\"Mary\",\"mary@mail.com\"],[\"John\",\"johnnybravo@mail.com\"]]\n```\n**Explanation:** The first and second John's are the same person as they have the common email \"johnsmith@mail.com\". The third John and Mary are different people as none of their email addresses are used by other accounts." + }, + { + "content": "```\nInput: accounts = [[\"Gabe\",\"Gabe0@m.co\",\"Gabe3@m.co\",\"Gabe1@m.co\"],[\"Kevin\",\"Kevin3@m.co\",\"Kevin5@m.co\",\"Kevin0@m.co\"],[\"Ethan\",\"Ethan5@m.co\",\"Ethan4@m.co\",\"Ethan0@m.co\"],[\"Hanzo\",\"Hanzo3@m.co\",\"Hanzo1@m.co\",\"Hanzo0@m.co\"],[\"Fern\",\"Fern5@m.co\",\"Fern1@m.co\",\"Fern0@m.co\"]]\nOutput: [[\"Ethan\",\"Ethan0@m.co\",\"Ethan4@m.co\",\"Ethan5@m.co\"],[\"Gabe\",\"Gabe0@m.co\",\"Gabe1@m.co\",\"Gabe3@m.co\"],[\"Hanzo\",\"Hanzo0@m.co\",\"Hanzo1@m.co\",\"Hanzo3@m.co\"],[\"Kevin\",\"Kevin0@m.co\",\"Kevin3@m.co\",\"Kevin5@m.co\"],[\"Fern\",\"Fern0@m.co\",\"Fern1@m.co\",\"Fern5@m.co\"]]\n```" + } + ] + }, + "readme_constraints": "- 1 <= accounts.length <= 1000\n- 2 <= accounts[i].length <= 10\n- 1 <= accounts[i][j].length <= 30\n- accounts[i][0] consists of English letters.\n- accounts[i][j] (for j > 0) is a valid email.", + "readme_additional": "", "helpers_imports": "", + "helpers_content": "", "helpers_run_name": "accounts_merge", "helpers_run_signature": "(solution_class: type, accounts: list[list[str]])", "helpers_run_body": " implementation = solution_class()\n return implementation.accounts_merge(accounts)", "helpers_assert_name": "accounts_merge", "helpers_assert_signature": "(result: list[list[str]], expected: list[list[str]]) -> bool", "helpers_assert_body": " # Sort both result and expected for comparison since order doesn't matter\n result_sorted = [sorted(account) for account in sorted(result)]\n expected_sorted = [sorted(account) for account in sorted(expected)]\n assert result_sorted == expected_sorted\n return True", - "solution_methods": [ - { - "name": "accounts_merge", - "signature": "(self, accounts: list[list[str]]) -> list[list[str]]", - "body": " # TODO: Implement accounts_merge\n return []" - } - ], + "solution_imports": "", + "solution_contents": "", + "solution_class_content": "", "test_imports": "import pytest\nfrom leetcode_py.test_utils import logged_test\nfrom .helpers import assert_accounts_merge, run_accounts_merge\nfrom .solution import Solution", "test_content": "", "test_class_name": "AccountsMerge", "test_class_content": " def setup_method(self):\n self.solution = Solution()", - "test_helper_methods": [], - "test_methods": [ - { - "name": "test_accounts_merge", - "signature": "(self, accounts: list[list[str]], expected: list[list[str]])", - "parametrize": "accounts, expected", - "test_cases": "[([[\"John\", \"johnsmith@mail.com\", \"john_newyork@mail.com\"], [\"John\", \"johnsmith@mail.com\", \"john00@mail.com\"], [\"Mary\", \"mary@mail.com\"], [\"John\", \"johnnybravo@mail.com\"]], [[\"John\", \"john00@mail.com\", \"john_newyork@mail.com\", \"johnsmith@mail.com\"], [\"Mary\", \"mary@mail.com\"], [\"John\", \"johnnybravo@mail.com\"]]), ([[\"Gabe\", \"Gabe0@m.co\", \"Gabe3@m.co\", \"Gabe1@m.co\"], [\"Kevin\", \"Kevin3@m.co\", \"Kevin5@m.co\", \"Kevin0@m.co\"], [\"Ethan\", \"Ethan5@m.co\", \"Ethan4@m.co\", \"Ethan0@m.co\"], [\"Hanzo\", \"Hanzo3@m.co\", \"Hanzo1@m.co\", \"Hanzo0@m.co\"], [\"Fern\", \"Fern5@m.co\", \"Fern1@m.co\", \"Fern0@m.co\"]], [[\"Ethan\", \"Ethan0@m.co\", \"Ethan4@m.co\", \"Ethan5@m.co\"], [\"Gabe\", \"Gabe0@m.co\", \"Gabe1@m.co\", \"Gabe3@m.co\"], [\"Hanzo\", \"Hanzo0@m.co\", \"Hanzo1@m.co\", \"Hanzo3@m.co\"], [\"Kevin\", \"Kevin0@m.co\", \"Kevin3@m.co\", \"Kevin5@m.co\"], [\"Fern\", \"Fern0@m.co\", \"Fern1@m.co\", \"Fern5@m.co\"]]), ([[\"John\", \"john@mail.com\"]], [[\"John\", \"john@mail.com\"]]), ([[\"John\", \"john1@mail.com\"], [\"John\", \"john2@mail.com\"], [\"John\", \"john3@mail.com\"]], [[\"John\", \"john1@mail.com\"], [\"John\", \"john2@mail.com\"], [\"John\", \"john3@mail.com\"]]), ([[\"John\", \"a@mail.com\", \"b@mail.com\"], [\"John\", \"b@mail.com\", \"c@mail.com\"], [\"John\", \"d@mail.com\"]], [[\"John\", \"a@mail.com\", \"b@mail.com\", \"c@mail.com\"], [\"John\", \"d@mail.com\"]]), ([[\"Alice\", \"alice@mail.com\", \"alice1@mail.com\"], [\"Alice\", \"alice2@mail.com\", \"alice3@mail.com\"], [\"Alice\", \"alice1@mail.com\", \"alice2@mail.com\"]], [[\"Alice\", \"alice1@mail.com\", \"alice2@mail.com\", \"alice3@mail.com\", \"alice@mail.com\"]]), ([[\"Bob\", \"bob@mail.com\"], [\"Bob\", \"bob@mail.com\"]], [[\"Bob\", \"bob@mail.com\"]]), ([[\"David\", \"david1@mail.com\", \"david2@mail.com\"], [\"David\", \"david3@mail.com\"], [\"David\", \"david2@mail.com\", \"david4@mail.com\"]], [[\"David\", \"david1@mail.com\", \"david2@mail.com\", \"david4@mail.com\"], [\"David\", \"david3@mail.com\"]]), ([[\"Alex\", \"alex@mail.com\"], [\"Alex\", \"alex@mail.com\", \"alex2@mail.com\"], [\"Alex\", \"alex3@mail.com\"]], [[\"Alex\", \"alex2@mail.com\", \"alex@mail.com\"], [\"Alex\", \"alex3@mail.com\"]]), ([[\"Tom\", \"tom1@mail.com\"], [\"Tom\", \"tom2@mail.com\"], [\"Tom\", \"tom3@mail.com\"], [\"Tom\", \"tom4@mail.com\"]], [[\"Tom\", \"tom1@mail.com\"], [\"Tom\", \"tom2@mail.com\"], [\"Tom\", \"tom3@mail.com\"], [\"Tom\", \"tom4@mail.com\"]]), ([[\"Sam\", \"sam@mail.com\", \"sam1@mail.com\", \"sam2@mail.com\"]], [[\"Sam\", \"sam@mail.com\", \"sam1@mail.com\", \"sam2@mail.com\"]])]", - "body": " result = run_accounts_merge(Solution, accounts)\n assert_accounts_merge(result, expected)" - } - ], + "_solution_methods": { + "list": [ + { + "name": "accounts_merge", + "signature": "(self, accounts: list[list[str]]) -> list[list[str]]", + "body": " # TODO: Implement accounts_merge\n return []" + } + ] + }, + "_test_helper_methods": { + "list": [{ "name": "setup_method", "parameters": "", "body": "self.solution = Solution()" }] + }, + "_test_methods": { + "list": [ + { + "name": "test_accounts_merge", + "signature": "(self, accounts: list[list[str]], expected: list[list[str]])", + "parametrize": "accounts, expected", + "test_cases": "[([['John', 'johnsmith@mail.com', 'john_newyork@mail.com'], ['John', 'johnsmith@mail.com', 'john00@mail.com'], ['Mary', 'mary@mail.com'], ['John', 'johnnybravo@mail.com']], [['John', 'john00@mail.com', 'john_newyork@mail.com', 'johnsmith@mail.com'], ['Mary', 'mary@mail.com'], ['John', 'johnnybravo@mail.com']]), ([['Gabe', 'Gabe0@m.co', 'Gabe3@m.co', 'Gabe1@m.co'], ['Kevin', 'Kevin3@m.co', 'Kevin5@m.co', 'Kevin0@m.co'], ['Ethan', 'Ethan5@m.co', 'Ethan4@m.co', 'Ethan0@m.co'], ['Hanzo', 'Hanzo3@m.co', 'Hanzo1@m.co', 'Hanzo0@m.co'], ['Fern', 'Fern5@m.co', 'Fern1@m.co', 'Fern0@m.co']], [['Ethan', 'Ethan0@m.co', 'Ethan4@m.co', 'Ethan5@m.co'], ['Gabe', 'Gabe0@m.co', 'Gabe1@m.co', 'Gabe3@m.co'], ['Hanzo', 'Hanzo0@m.co', 'Hanzo1@m.co', 'Hanzo3@m.co'], ['Kevin', 'Kevin0@m.co', 'Kevin3@m.co', 'Kevin5@m.co'], ['Fern', 'Fern0@m.co', 'Fern1@m.co', 'Fern5@m.co']]), ([['Alice', 'alice@mail.com']], [['Alice', 'alice@mail.com']]), ([['Bob', 'bob1@mail.com'], ['Bob', 'bob2@mail.com']], [['Bob', 'bob1@mail.com'], ['Bob', 'bob2@mail.com']]), ([['Alice', 'alice@mail.com', 'alice2@mail.com'], ['Alice', 'alice2@mail.com', 'alice3@mail.com']], [['Alice', 'alice2@mail.com', 'alice3@mail.com', 'alice@mail.com']]), ([['A', 'a@mail.com', 'b@mail.com'], ['B', 'b@mail.com', 'c@mail.com'], ['C', 'c@mail.com', 'd@mail.com']], [['A', 'a@mail.com', 'b@mail.com', 'c@mail.com', 'd@mail.com']]), ([['David', 'david@mail.com'], ['David', 'david@mail.com']], [['David', 'david@mail.com']]), ([['Alex', 'alex1@mail.com'], ['Bob', 'bob1@mail.com'], ['Charlie', 'charlie1@mail.com']], [['Alex', 'alex1@mail.com'], ['Bob', 'bob1@mail.com'], ['Charlie', 'charlie1@mail.com']]), ([['John', 'john1@mail.com', 'john2@mail.com'], ['John', 'john3@mail.com'], ['Jane', 'jane1@mail.com']], [['John', 'john1@mail.com', 'john2@mail.com'], ['John', 'john3@mail.com'], ['Jane', 'jane1@mail.com']]), ([['User', 'user@mail.com', 'user1@mail.com'], ['User', 'user2@mail.com', 'user@mail.com'], ['User', 'user3@mail.com', 'user1@mail.com']], [['User', 'user1@mail.com', 'user2@mail.com', 'user3@mail.com', 'user@mail.com']]), ([['Test', 'test1@mail.com'], ['Test', 'test2@mail.com'], ['Test', 'test1@mail.com', 'test3@mail.com']], [['Test', 'test2@mail.com'], ['Test', 'test1@mail.com', 'test3@mail.com']]), ([['Name', 'a@mail.com', 'b@mail.com', 'c@mail.com'], ['Name', 'd@mail.com', 'e@mail.com'], ['Name', 'c@mail.com', 'f@mail.com']], [['Name', 'd@mail.com', 'e@mail.com'], ['Name', 'a@mail.com', 'b@mail.com', 'c@mail.com', 'f@mail.com']])]", + "body": " result = run_accounts_merge(Solution, accounts)\n assert_accounts_merge(result, expected)" + } + ] + }, "playground_imports": "from helpers import run_accounts_merge, assert_accounts_merge\nfrom solution import Solution", - "playground_setup": "# Example test case\naccounts = [[\"John\", \"johnsmith@mail.com\", \"john_newyork@mail.com\"], [\"John\", \"johnsmith@mail.com\", \"john00@mail.com\"], [\"Mary\", \"mary@mail.com\"], [\"John\", \"johnnybravo@mail.com\"]]\nexpected = [[\"John\", \"john00@mail.com\", \"john_newyork@mail.com\", \"johnsmith@mail.com\"], [\"Mary\", \"mary@mail.com\"], [\"John\", \"johnnybravo@mail.com\"]]", + "playground_setup": "# Example test case\naccounts = [['John', 'johnsmith@mail.com', 'john_newyork@mail.com'], ['John', 'johnsmith@mail.com', 'john00@mail.com'], ['Mary', 'mary@mail.com'], ['John', 'johnnybravo@mail.com']]\nexpected = [['John', 'john00@mail.com', 'john_newyork@mail.com', 'johnsmith@mail.com'], ['Mary', 'mary@mail.com'], ['John', 'johnnybravo@mail.com']]", "playground_run": "result = run_accounts_merge(Solution, accounts)\nresult", "playground_assert": "assert_accounts_merge(result, expected)" } diff --git a/.templates/leetcode/json/construct_binary_tree_from_preorder_and_inorder_traversal.json b/.templates/leetcode/json/construct_binary_tree_from_preorder_and_inorder_traversal.json new file mode 100644 index 0000000..e7e7716 --- /dev/null +++ b/.templates/leetcode/json/construct_binary_tree_from_preorder_and_inorder_traversal.json @@ -0,0 +1,62 @@ +{ + "problem_name": "construct_binary_tree_from_preorder_and_inorder_traversal", + "solution_class_name": "Solution", + "problem_number": "105", + "problem_title": "Construct Binary Tree from Preorder and Inorder Traversal", + "difficulty": "Medium", + "topics": "Array, Hash Table, Divide and Conquer, Tree, Binary Tree", + "_tags": { "list": ["grind-75"] }, + "readme_description": "Given two integer arrays `preorder` and `inorder` where `preorder` is the preorder traversal of a binary tree and `inorder` is the inorder traversal of the same tree, construct and return the binary tree.", + "_readme_examples": { + "list": [ + { + "content": "![Example 1](https://assets.leetcode.com/uploads/2021/02/19/tree.jpg)\n\n```\nInput: preorder = [3,9,20,15,7], inorder = [9,3,15,20,7]\nOutput: [3,9,20,null,null,15,7]\n```" + }, + { "content": "```\nInput: preorder = [-1], inorder = [-1]\nOutput: [-1]\n```" } + ] + }, + "readme_constraints": "- 1 <= preorder.length <= 3000\n- inorder.length == preorder.length\n- -3000 <= preorder[i], inorder[i] <= 3000\n- preorder and inorder consist of unique values.\n- Each value of inorder also appears in preorder.\n- preorder is guaranteed to be the preorder traversal of the tree.\n- inorder is guaranteed to be the inorder traversal of the tree.", + "readme_additional": "", + "helpers_imports": "from leetcode_py import TreeNode", + "helpers_content": "", + "helpers_run_name": "build_tree", + "helpers_run_signature": "(solution_class: type, preorder: list[int], inorder: list[int])", + "helpers_run_body": " implementation = solution_class()\n return implementation.build_tree(preorder, inorder)", + "helpers_assert_name": "build_tree", + "helpers_assert_signature": "(result: TreeNode | None, expected_list: list[int | None]) -> bool", + "helpers_assert_body": " expected = TreeNode.from_list(expected_list) if expected_list else None\n assert result == expected\n return True", + "solution_imports": "from leetcode_py import TreeNode", + "solution_contents": "", + "solution_class_content": "", + "test_imports": "import pytest\nfrom leetcode_py.test_utils import logged_test\nfrom .helpers import assert_build_tree, run_build_tree\nfrom .solution import Solution", + "test_content": "", + "test_class_name": "ConstructBinaryTreeFromPreorderAndInorderTraversal", + "test_class_content": " def setup_method(self):\n self.solution = Solution()", + "_solution_methods": { + "list": [ + { + "name": "build_tree", + "signature": "(self, preorder: list[int], inorder: list[int]) -> TreeNode | None", + "body": " # TODO: Implement build_tree\n return None" + } + ] + }, + "_test_helper_methods": { + "list": [{ "name": "setup_method", "parameters": "", "body": "self.solution = Solution()" }] + }, + "_test_methods": { + "list": [ + { + "name": "test_build_tree", + "signature": "(self, preorder: list[int], inorder: list[int], expected_list: list[int | None])", + "parametrize": "preorder, inorder, expected_list", + "test_cases": "[([], [], []), ([1], [1], [1]), ([3, 9, 20, 15, 7], [9, 3, 15, 20, 7], [3, 9, 20, None, None, 15, 7]), ([-1], [-1], [-1]), ([1, 2], [2, 1], [1, 2]), ([1, 2], [1, 2], [1, None, 2]), ([1, 2, 3], [2, 1, 3], [1, 2, 3]), ([1, 2, 4, 5, 3, 6], [4, 2, 5, 1, 6, 3], [1, 2, 3, 4, 5, 6]), ([1, 2, 3, 4], [1, 2, 3, 4], [1, None, 2, None, 3, None, 4]), ([4, 3, 2, 1], [1, 2, 3, 4], [4, 3, None, 2, None, 1]), ([10, 5, 1, 7, 40, 50], [1, 5, 7, 10, 40, 50], [10, 5, 40, 1, 7, None, 50]), ([1, 3, 2], [1, 2, 3], [1, None, 3, 2]), ([2, 1, 3], [1, 2, 3], [2, 1, 3]), ([5, 3, 2, 1, 4, 6, 7], [1, 2, 3, 4, 5, 6, 7], [5, 3, 6, 2, 4, None, 7, 1]), ([7, 3, 2, 1, 5, 4, 6, 10, 9, 11], [1, 2, 3, 4, 5, 6, 7, 9, 10, 11], [7, 3, 10, 2, 5, 9, 11, 1, None, 4, 6]), ([-3000, -2999, -2998], [-2998, -2999, -3000], [-3000, -2999, None, -2998])]", + "body": " result = run_build_tree(Solution, preorder, inorder)\n assert_build_tree(result, expected_list)" + } + ] + }, + "playground_imports": "from helpers import run_build_tree, assert_build_tree\nfrom solution import Solution\nfrom leetcode_py import TreeNode", + "playground_setup": "# Example test case\npreorder = [3, 9, 20, 15, 7]\ninorder = [9, 3, 15, 20, 7]\nexpected_list = [3, 9, 20, None, None, 15, 7]", + "playground_run": "result = run_build_tree(Solution, preorder, inorder)\nresult", + "playground_assert": "assert_build_tree(result, expected_list)" +} diff --git a/.templates/leetcode/json/diagonal_traverse.json b/.templates/leetcode/json/diagonal_traverse.json new file mode 100644 index 0000000..df17575 --- /dev/null +++ b/.templates/leetcode/json/diagonal_traverse.json @@ -0,0 +1,62 @@ +{ + "problem_name": "diagonal_traverse", + "solution_class_name": "Solution", + "problem_number": "498", + "problem_title": "Diagonal Traverse", + "difficulty": "Medium", + "topics": "Array, Matrix, Simulation", + "_tags": { "list": [] }, + "readme_description": "Given an `m x n` matrix `mat`, return *an array of all the elements of the array in a diagonal order*.", + "_readme_examples": { + "list": [ + { + "content": "![Diagonal Traverse](https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg)\n\n```\nInput: mat = [[1,2,3],[4,5,6],[7,8,9]]\nOutput: [1,2,4,7,5,3,6,8,9]\n```" + }, + { "content": "```\nInput: mat = [[1,2],[3,4]]\nOutput: [1,2,3,4]\n```" } + ] + }, + "readme_constraints": "- `m == mat.length`\n- `n == mat[i].length`\n- `1 <= m, n <= 10^4`\n- `1 <= m * n <= 10^4`\n- `-10^5 <= mat[i][j] <= 10^5`", + "readme_additional": "", + "helpers_imports": "", + "helpers_content": "", + "helpers_run_name": "find_diagonal_order", + "helpers_run_signature": "(solution_class: type, mat: list[list[int]])", + "helpers_run_body": " implementation = solution_class()\n return implementation.find_diagonal_order(mat)", + "helpers_assert_name": "find_diagonal_order", + "helpers_assert_signature": "(result: list[int], expected: list[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.test_utils import logged_test\nfrom .helpers import assert_find_diagonal_order, run_find_diagonal_order\nfrom .solution import Solution", + "test_content": "", + "test_class_name": "DiagonalTraverse", + "test_class_content": " def setup_method(self):\n self.solution = Solution()", + "_solution_methods": { + "list": [ + { + "name": "find_diagonal_order", + "signature": "(self, mat: list[list[int]]) -> list[int]", + "body": " # TODO: Implement find_diagonal_order\n return []" + } + ] + }, + "_test_helper_methods": { + "list": [{ "name": "setup_method", "parameters": "", "body": "self.solution = Solution()" }] + }, + "_test_methods": { + "list": [ + { + "name": "test_find_diagonal_order", + "signature": "(self, mat: list[list[int]], expected: list[int])", + "parametrize": "mat, expected", + "test_cases": "[([[1, 2, 3], [4, 5, 6], [7, 8, 9]], [1, 2, 4, 7, 5, 3, 6, 8, 9]), ([[1, 2], [3, 4]], [1, 2, 3, 4]), ([[1]], [1]), ([[1, 2, 3]], [1, 2, 3]), ([[1], [2], [3]], [1, 2, 3]), ([[1, 2, 3, 4], [5, 6, 7, 8]], [1, 2, 5, 6, 3, 4, 7, 8]), ([[1, 2], [3, 4], [5, 6]], [1, 2, 3, 5, 4, 6]), ([[1, 2, 3, 4, 5]], [1, 2, 3, 4, 5]), ([[1], [2], [3], [4], [5]], [1, 2, 3, 4, 5]), ([[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12]], [1, 2, 5, 9, 6, 3, 4, 7, 10, 11, 8, 12]), ([[-1, 0, 1], [2, -3, 4]], [-1, 0, 2, -3, 1, 4]), ([[100]], [100])]", + "body": " result = run_find_diagonal_order(Solution, mat)\n assert_find_diagonal_order(result, expected)" + } + ] + }, + "playground_imports": "from helpers import run_find_diagonal_order, assert_find_diagonal_order\nfrom solution import Solution", + "playground_setup": "# Example test case\nmat = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]\nexpected = [1, 2, 4, 7, 5, 3, 6, 8, 9]", + "playground_run": "result = run_find_diagonal_order(Solution, mat)\nresult", + "playground_assert": "assert_find_diagonal_order(result, expected)" +} diff --git a/.templates/leetcode/json/find_all_anagrams_in_a_string.json b/.templates/leetcode/json/find_all_anagrams_in_a_string.json new file mode 100644 index 0000000..fa9cd1a --- /dev/null +++ b/.templates/leetcode/json/find_all_anagrams_in_a_string.json @@ -0,0 +1,64 @@ +{ + "problem_name": "find_all_anagrams_in_a_string", + "solution_class_name": "Solution", + "problem_number": "438", + "problem_title": "Find All Anagrams in a String", + "difficulty": "Medium", + "topics": "Hash Table, String, Sliding Window", + "_tags": { "list": ["grind-75"] }, + "readme_description": "Given two strings `s` and `p`, return an array of all the start indices of `p`'s anagrams in `s`. You may return the answer in any order.\n\nAn **anagram** is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.", + "_readme_examples": { + "list": [ + { + "content": "```\nInput: s = \"cbaebabacd\", p = \"abc\"\nOutput: [0,6]\n```\n**Explanation:**\nThe substring with start index = 0 is \"cba\", which is an anagram of \"abc\".\nThe substring with start index = 6 is \"bac\", which is an anagram of \"abc\"." + }, + { + "content": "```\nInput: s = \"abab\", p = \"ab\"\nOutput: [0,1,2]\n```\n**Explanation:**\nThe substring with start index = 0 is \"ab\", which is an anagram of \"ab\".\nThe substring with start index = 1 is \"ba\", which is an anagram of \"ab\".\nThe substring with start index = 2 is \"ab\", which is an anagram of \"ab\"." + } + ] + }, + "readme_constraints": "- 1 <= s.length, p.length <= 3 * 10^4\n- s and p consist of lowercase English letters.", + "readme_additional": "", + "helpers_imports": "", + "helpers_content": "", + "helpers_run_name": "find_anagrams", + "helpers_run_signature": "(solution_class: type, s: str, p: str)", + "helpers_run_body": " implementation = solution_class()\n return implementation.find_anagrams(s, p)", + "helpers_assert_name": "find_anagrams", + "helpers_assert_signature": "(result: list[int], expected: list[int]) -> bool", + "helpers_assert_body": " assert sorted(result) == sorted(expected)\n return True", + "solution_imports": "", + "solution_contents": "", + "solution_class_content": "", + "test_imports": "import pytest\nfrom leetcode_py.test_utils import logged_test\nfrom .helpers import assert_find_anagrams, run_find_anagrams\nfrom .solution import Solution", + "test_content": "", + "test_class_name": "FindAllAnagramsInAString", + "test_class_content": " def setup_method(self):\n self.solution = Solution()", + "_solution_methods": { + "list": [ + { + "name": "find_anagrams", + "signature": "(self, s: str, p: str) -> list[int]", + "body": " # TODO: Implement find_anagrams\n return []" + } + ] + }, + "_test_helper_methods": { + "list": [{ "name": "setup_method", "parameters": "", "body": "self.solution = Solution()" }] + }, + "_test_methods": { + "list": [ + { + "name": "test_find_anagrams", + "signature": "(self, s: str, p: str, expected: list[int])", + "parametrize": "s, p, expected", + "test_cases": "[('cbaebabacd', 'abc', [0, 6]), ('abab', 'ab', [0, 1, 2]), ('a', 'aa', []), ('aa', 'aa', [0]), ('abcdefg', 'xyz', []), ('aab', 'ab', [1]), ('aaab', 'ab', [2]), ('baa', 'aa', [1]), ('abacabad', 'aaab', []), ('ababacb', 'abc', [3, 4]), ('abaacbabc', 'abc', [3, 4, 6]), ('abab', 'abab', [0])]", + "body": " result = run_find_anagrams(Solution, s, p)\n assert_find_anagrams(result, expected)" + } + ] + }, + "playground_imports": "from helpers import run_find_anagrams, assert_find_anagrams\nfrom solution import Solution", + "playground_setup": "# Example test case\ns = 'cbaebabacd'\np = 'abc'\nexpected = [0, 6]", + "playground_run": "result = run_find_anagrams(Solution, s, p)\nresult", + "playground_assert": "assert_find_anagrams(result, expected)" +} diff --git a/.templates/leetcode/json/letter_combinations_of_a_phone_number.json b/.templates/leetcode/json/letter_combinations_of_a_phone_number.json new file mode 100644 index 0000000..990afaf --- /dev/null +++ b/.templates/leetcode/json/letter_combinations_of_a_phone_number.json @@ -0,0 +1,63 @@ +{ + "problem_name": "letter_combinations_of_a_phone_number", + "solution_class_name": "Solution", + "problem_number": "17", + "problem_title": "Letter Combinations of a Phone Number", + "difficulty": "Medium", + "topics": "Hash Table, String, Backtracking", + "_tags": { "list": ["grind-75"] }, + "readme_description": "Given a string containing digits from `2-9` inclusive, return all possible letter combinations that the number could represent. Return the answer in **any order**.\n\nA mapping of digits to letters (just like on the telephone buttons) is given below. Note that 1 does not map to any letters.", + "_readme_examples": { + "list": [ + { + "content": "![Phone Keypad](https://assets.leetcode.com/uploads/2022/03/15/1200px-telephone-keypad2svg.png)\n\n```\nInput: digits = \"23\"\nOutput: [\"ad\",\"ae\",\"af\",\"bd\",\"be\",\"bf\",\"cd\",\"ce\",\"cf\"]\n```" + }, + { "content": "```\nInput: digits = \"\"\nOutput: []\n```" }, + { "content": "```\nInput: digits = \"2\"\nOutput: [\"a\",\"b\",\"c\"]\n```" } + ] + }, + "readme_constraints": "- `0 <= digits.length <= 4`\n- `digits[i]` is a digit in the range `['2', '9']`.", + "readme_additional": "", + "helpers_imports": "", + "helpers_content": "", + "helpers_run_name": "letter_combinations", + "helpers_run_signature": "(solution_class: type, digits: str)", + "helpers_run_body": " implementation = solution_class()\n return implementation.letter_combinations(digits)", + "helpers_assert_name": "letter_combinations", + "helpers_assert_signature": "(result: list[str], expected: list[str]) -> bool", + "helpers_assert_body": " result.sort()\n expected.sort()\n assert result == expected\n return True", + "solution_imports": "", + "solution_contents": "", + "solution_class_content": "", + "test_imports": "import pytest\nfrom leetcode_py.test_utils import logged_test\nfrom .helpers import assert_letter_combinations, run_letter_combinations\nfrom .solution import Solution", + "test_content": "", + "test_class_name": "LetterCombinationsOfAPhoneNumber", + "test_class_content": " def setup_method(self):\n self.solution = Solution()", + "_solution_methods": { + "list": [ + { + "name": "letter_combinations", + "signature": "(self, digits: str) -> list[str]", + "body": " # TODO: Implement letter_combinations\n return []" + } + ] + }, + "_test_helper_methods": { + "list": [{ "name": "setup_method", "parameters": "", "body": "self.solution = Solution()" }] + }, + "_test_methods": { + "list": [ + { + "name": "test_letter_combinations", + "signature": "(self, digits: str, expected: list[str])", + "parametrize": "digits, expected", + "test_cases": "[('23', ['ad', 'ae', 'af', 'bd', 'be', 'bf', 'cd', 'ce', 'cf']), ('', []), ('2', ['a', 'b', 'c']), ('234', ['adg', 'adh', 'adi', 'aeg', 'aeh', 'aei', 'afg', 'afh', 'afi', 'bdg', 'bdh', 'bdi', 'beg', 'beh', 'bei', 'bfg', 'bfh', 'bfi', 'cdg', 'cdh', 'cdi', 'ceg', 'ceh', 'cei', 'cfg', 'cfh', 'cfi']), ('7', ['p', 'q', 'r', 's']), ('9', ['w', 'x', 'y', 'z']), ('79', ['pw', 'px', 'py', 'pz', 'qw', 'qx', 'qy', 'qz', 'rw', 'rx', 'ry', 'rz', 'sw', 'sx', 'sy', 'sz']), ('22', ['aa', 'ab', 'ac', 'ba', 'bb', 'bc', 'ca', 'cb', 'cc']), ('3456', ['dgjm', 'dgjn', 'dgjo', 'dgkm', 'dgkn', 'dgko', 'dglm', 'dgln', 'dglo', 'dhjm', 'dhjn', 'dhjo', 'dhkm', 'dhkn', 'dhko', 'dhlm', 'dhln', 'dhlo', 'dijm', 'dijn', 'dijo', 'dikm', 'dikn', 'diko', 'dilm', 'diln', 'dilo', 'egjm', 'egjn', 'egjo', 'egkm', 'egkn', 'egko', 'eglm', 'egln', 'eglo', 'ehjm', 'ehjn', 'ehjo', 'ehkm', 'ehkn', 'ehko', 'ehlm', 'ehln', 'ehlo', 'eijm', 'eijn', 'eijo', 'eikm', 'eikn', 'eiko', 'eilm', 'eiln', 'eilo', 'fgjm', 'fgjn', 'fgjo', 'fgkm', 'fgkn', 'fgko', 'fglm', 'fgln', 'fglo', 'fhjm', 'fhjn', 'fhjo', 'fhkm', 'fhkn', 'fhko', 'fhlm', 'fhln', 'fhlo', 'fijm', 'fijn', 'fijo', 'fikm', 'fikn', 'fiko', 'film', 'filn', 'filo']), ('25', ['aj', 'ak', 'al', 'bj', 'bk', 'bl', 'cj', 'ck', 'cl']), ('78', ['pt', 'pu', 'pv', 'qt', 'qu', 'qv', 'rt', 'ru', 'rv', 'st', 'su', 'sv']), ('89', ['tw', 'tx', 'ty', 'tz', 'uw', 'ux', 'uy', 'uz', 'vw', 'vx', 'vy', 'vz'])]", + "body": " result = run_letter_combinations(Solution, digits)\n assert_letter_combinations(result, expected)" + } + ] + }, + "playground_imports": "from helpers import run_letter_combinations, assert_letter_combinations\nfrom solution import Solution", + "playground_setup": "# Example test case\ndigits = '23'\nexpected = ['ad', 'ae', 'af', 'bd', 'be', 'bf', 'cd', 'ce', 'cf']", + "playground_run": "result = run_letter_combinations(Solution, digits)\nresult", + "playground_assert": "assert_letter_combinations(result, expected)" +} diff --git a/.templates/leetcode/json/subsets.json b/.templates/leetcode/json/subsets.json new file mode 100644 index 0000000..a30f10a --- /dev/null +++ b/.templates/leetcode/json/subsets.json @@ -0,0 +1,62 @@ +{ + "problem_name": "subsets", + "solution_class_name": "Solution", + "problem_number": "78", + "problem_title": "Subsets", + "difficulty": "Medium", + "topics": "Array, Backtracking, Bit Manipulation", + "_tags": { "list": ["grind-75"] }, + "readme_description": "Given an integer array `nums` of **unique** elements, return *all possible* subsets (the power set).\n\nThe solution set **must not** contain duplicate subsets. Return the solution in **any order**.", + "_readme_examples": { + "list": [ + { + "content": "```\nInput: nums = [1,2,3]\nOutput: [[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]\n```" + }, + { "content": "```\nInput: nums = [0]\nOutput: [[],[0]]\n```" } + ] + }, + "readme_constraints": "- 1 <= nums.length <= 10\n- -10 <= nums[i] <= 10\n- All the numbers of nums are unique.", + "readme_additional": "", + "helpers_imports": "", + "helpers_content": "", + "helpers_run_name": "subsets", + "helpers_run_signature": "(solution_class: type, nums: list[int])", + "helpers_run_body": " implementation = solution_class()\n return implementation.subsets(nums)", + "helpers_assert_name": "subsets", + "helpers_assert_signature": "(result: list[list[int]], expected: list[list[int]]) -> bool", + "helpers_assert_body": " # Sort both result and expected for comparison since order doesn't matter\n result_sorted = [sorted(subset) for subset in sorted(result)]\n expected_sorted = [sorted(subset) for subset in sorted(expected)]\n assert result_sorted == expected_sorted\n return True", + "solution_imports": "", + "solution_contents": "", + "solution_class_content": "", + "test_imports": "import pytest\nfrom leetcode_py.test_utils import logged_test\nfrom .helpers import assert_subsets, run_subsets\nfrom .solution import Solution", + "test_content": "", + "test_class_name": "Subsets", + "test_class_content": " def setup_method(self):\n self.solution = Solution()", + "_solution_methods": { + "list": [ + { + "name": "subsets", + "signature": "(self, nums: list[int]) -> list[list[int]]", + "body": " # TODO: Implement subsets\n return []" + } + ] + }, + "_test_helper_methods": { + "list": [{ "name": "setup_method", "parameters": "", "body": "self.solution = Solution()" }] + }, + "_test_methods": { + "list": [ + { + "name": "test_subsets", + "signature": "(self, nums: list[int], expected: list[list[int]])", + "parametrize": "nums, expected", + "test_cases": "[([1, 2, 3], [[], [1], [2], [1, 2], [3], [1, 3], [2, 3], [1, 2, 3]]), ([0], [[], [0]]), ([1], [[], [1]]), ([1, 2], [[], [1], [2], [1, 2]]), ([4, 1, 0], [[], [4], [4, 1], [4, 1, 0], [4, 0], [1], [1, 0], [0]]), ([-1, 0, 1], [[], [-1], [-1, 0], [-1, 0, 1], [-1, 1], [0], [0, 1], [1]]), ([5], [[], [5]]), ([2, 1, 3], [[], [2], [2, 1], [2, 1, 3], [2, 3], [1], [1, 3], [3]]), ([10], [[], [10]]), ([-10, 10], [[], [-10], [-10, 10], [10]]), ([1, 2, 3, 4], [[], [1], [1, 2], [1, 2, 3], [1, 2, 3, 4], [1, 2, 4], [1, 3], [1, 3, 4], [1, 4], [2], [2, 3], [2, 3, 4], [2, 4], [3], [3, 4], [4]]), ([5, 2], [[], [5], [5, 2], [2]])]", + "body": " result = run_subsets(Solution, nums)\n assert_subsets(result, expected)" + } + ] + }, + "playground_imports": "from helpers import run_subsets, assert_subsets\nfrom solution import Solution", + "playground_setup": "# Example test case\nnums = [1, 2, 3]\nexpected = [[], [1], [2], [1, 2], [3], [1, 3], [2, 3], [1, 2, 3]]", + "playground_run": "result = run_subsets(Solution, nums)\nresult", + "playground_assert": "assert_subsets(result, expected)" +} diff --git a/.templates/leetcode/json/unique_paths.json b/.templates/leetcode/json/unique_paths.json new file mode 100644 index 0000000..001900d --- /dev/null +++ b/.templates/leetcode/json/unique_paths.json @@ -0,0 +1,64 @@ +{ + "problem_name": "unique_paths", + "solution_class_name": "Solution", + "problem_number": "62", + "problem_title": "Unique Paths", + "difficulty": "Medium", + "topics": "Math, Dynamic Programming, Combinatorics", + "_tags": { "list": ["grind-75"] }, + "readme_description": "There is a robot on an `m x n` grid. The robot is initially located at the **top-left corner** (i.e., `grid[0][0]`). The robot tries to move to the **bottom-right corner** (i.e., `grid[m - 1][n - 1]`). The robot can only move either down or right at any point in time.\n\nGiven the two integers `m` and `n`, return *the number of possible unique paths that the robot can take to reach the bottom-right corner*.\n\nThe test cases are generated so that the answer will be less than or equal to `2 * 10^9`.", + "_readme_examples": { + "list": [ + { + "content": "![Example 1](https://assets.leetcode.com/uploads/2018/10/22/robot_maze.png)\n\n```\nInput: m = 3, n = 7\nOutput: 28\n```" + }, + { + "content": "```\nInput: m = 3, n = 2\nOutput: 3\n```\n**Explanation:** From the top-left corner, there are a total of 3 ways to reach the bottom-right corner:\n1. Right -> Down -> Down\n2. Down -> Down -> Right\n3. Down -> Right -> Down" + } + ] + }, + "readme_constraints": "- 1 <= m, n <= 100", + "readme_additional": "", + "helpers_imports": "", + "helpers_content": "", + "helpers_run_name": "unique_paths", + "helpers_run_signature": "(solution_class: type, m: int, n: int)", + "helpers_run_body": " implementation = solution_class()\n return implementation.unique_paths(m, n)", + "helpers_assert_name": "unique_paths", + "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.test_utils import logged_test\nfrom .helpers import assert_unique_paths, run_unique_paths\nfrom .solution import Solution", + "test_content": "", + "test_class_name": "UniquePaths", + "test_class_content": " def setup_method(self):\n self.solution = Solution()", + "_solution_methods": { + "list": [ + { + "name": "unique_paths", + "signature": "(self, m: int, n: int) -> int", + "body": " # TODO: Implement unique_paths\n return 0" + } + ] + }, + "_test_helper_methods": { + "list": [{ "name": "setup_method", "parameters": "", "body": "self.solution = Solution()" }] + }, + "_test_methods": { + "list": [ + { + "name": "test_unique_paths", + "signature": "(self, m: int, n: int, expected: int)", + "parametrize": "m, n, expected", + "test_cases": "[(3, 7, 28), (3, 2, 3), (1, 1, 1), (1, 10, 1), (10, 1, 1), (2, 2, 2), (3, 3, 6), (4, 4, 20), (5, 5, 70), (2, 3, 3), (3, 4, 10), (4, 5, 35), (6, 3, 21), (7, 3, 28), (10, 10, 48620)]", + "body": " result = run_unique_paths(Solution, m, n)\n assert_unique_paths(result, expected)" + } + ] + }, + "playground_imports": "from helpers import run_unique_paths, assert_unique_paths\nfrom solution import Solution", + "playground_setup": "# Example test case\nm = 3\nn = 7\nexpected = 28", + "playground_run": "result = run_unique_paths(Solution, m, n)\nresult", + "playground_assert": "assert_unique_paths(result, expected)" +} diff --git a/.templates/leetcode/json/word_search.json b/.templates/leetcode/json/word_search.json new file mode 100644 index 0000000..776a490 --- /dev/null +++ b/.templates/leetcode/json/word_search.json @@ -0,0 +1,67 @@ +{ + "problem_name": "word_search", + "solution_class_name": "Solution", + "problem_number": "79", + "problem_title": "Word Search", + "difficulty": "Medium", + "topics": "Array, String, Backtracking, Depth-First Search, Matrix", + "_tags": { "list": ["grind-75"] }, + "readme_description": "Given an `m x n` grid of characters `board` and a string `word`, return `true` *if* `word` *exists in the grid*.\n\nThe word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once.", + "_readme_examples": { + "list": [ + { + "content": "![Word Search Example 1](https://assets.leetcode.com/uploads/2020/11/04/word2.jpg)\n\n```\nInput: board = [[\"A\",\"B\",\"C\",\"E\"],[\"S\",\"F\",\"C\",\"S\"],[\"A\",\"D\",\"E\",\"E\"]], word = \"ABCCED\"\nOutput: true\n```" + }, + { + "content": "![Word Search Example 2](https://assets.leetcode.com/uploads/2020/11/04/word-1.jpg)\n\n```\nInput: board = [[\"A\",\"B\",\"C\",\"E\"],[\"S\",\"F\",\"C\",\"S\"],[\"A\",\"D\",\"E\",\"E\"]], word = \"SEE\"\nOutput: true\n```" + }, + { + "content": "![Word Search Example 3](https://assets.leetcode.com/uploads/2020/10/15/word3.jpg)\n\n```\nInput: board = [[\"A\",\"B\",\"C\",\"E\"],[\"S\",\"F\",\"C\",\"S\"],[\"A\",\"D\",\"E\",\"E\"]], word = \"ABCB\"\nOutput: false\n```" + } + ] + }, + "readme_constraints": "- `m == board.length`\n- `n = board[i].length`\n- `1 <= m, n <= 6`\n- `1 <= word.length <= 15`\n- `board` and `word` consists of only lowercase and uppercase English letters.", + "readme_additional": "**Follow up:** Could you use search pruning to make your solution faster with a larger `board`?", + "helpers_imports": "", + "helpers_content": "", + "helpers_run_name": "exist", + "helpers_run_signature": "(solution_class: type, board: list[list[str]], word: str)", + "helpers_run_body": " implementation = solution_class()\n return implementation.exist(board, word)", + "helpers_assert_name": "exist", + "helpers_assert_signature": "(result: bool, expected: bool) -> bool", + "helpers_assert_body": " assert result == expected\n return True", + "solution_imports": "", + "solution_contents": "", + "solution_class_content": "", + "test_imports": "import pytest\nfrom leetcode_py.test_utils import logged_test\nfrom .helpers import assert_exist, run_exist\nfrom .solution import Solution", + "test_content": "", + "test_class_name": "WordSearch", + "test_class_content": " def setup_method(self):\n self.solution = Solution()", + "_solution_methods": { + "list": [ + { + "name": "exist", + "signature": "(self, board: list[list[str]], word: str) -> bool", + "body": " # TODO: Implement exist\n return False" + } + ] + }, + "_test_helper_methods": { + "list": [{ "name": "setup_method", "parameters": "", "body": "self.solution = Solution()" }] + }, + "_test_methods": { + "list": [ + { + "name": "test_exist", + "signature": "(self, board: list[list[str]], word: str, expected: bool)", + "parametrize": "board, word, expected", + "test_cases": "[([['A', 'B', 'C', 'E'], ['S', 'F', 'C', 'S'], ['A', 'D', 'E', 'E']], 'ABCCED', True), ([['A', 'B', 'C', 'E'], ['S', 'F', 'C', 'S'], ['A', 'D', 'E', 'E']], 'SEE', True), ([['A', 'B', 'C', 'E'], ['S', 'F', 'C', 'S'], ['A', 'D', 'E', 'E']], 'ABCB', False), ([['A']], 'A', True), ([['A']], 'B', False), ([['A', 'B'], ['C', 'D']], 'ACDB', True), ([['A', 'B'], ['C', 'D']], 'ABDC', True), ([['A', 'B'], ['C', 'D']], 'ABCD', False), ([['C', 'A', 'A'], ['A', 'A', 'A'], ['B', 'C', 'D']], 'AAB', True), ([['A', 'B', 'C', 'E'], ['S', 'F', 'C', 'S'], ['A', 'D', 'E', 'E']], 'ABCESEEEFS', False), ([['A', 'A', 'A', 'A', 'A', 'A'], ['A', 'A', 'A', 'A', 'A', 'A'], ['A', 'A', 'A', 'A', 'A', 'A'], ['A', 'A', 'A', 'A', 'A', 'A'], ['A', 'A', 'A', 'A', 'A', 'A'], ['A', 'A', 'A', 'A', 'A', 'A']], 'AAAAAAAAAAAAAAB', False), ([['A', 'B', 'C', 'E'], ['S', 'F', 'C', 'S'], ['A', 'D', 'E', 'E']], 'SFCS', True)]", + "body": " result = run_exist(Solution, board, word)\n assert_exist(result, expected)" + } + ] + }, + "playground_imports": "from helpers import run_exist, assert_exist\nfrom solution import Solution", + "playground_setup": "# Example test case\nboard = [['A', 'B', 'C', 'E'], ['S', 'F', 'C', 'S'], ['A', 'D', 'E', 'E']]\nword = 'ABCCED'\nexpected = True", + "playground_run": "result = run_exist(Solution, board, word)\nresult", + "playground_assert": "assert_exist(result, expected)" +} diff --git a/Makefile b/Makefile index 377ff6d..c6eeb6a 100644 --- a/Makefile +++ b/Makefile @@ -1,5 +1,5 @@ PYTHON_VERSION = 3.13 -PROBLEM ?= two_sum +PROBLEM ?= find_all_anagrams_in_a_string FORCE ?= 0 COMMA := , diff --git a/leetcode/accounts_merge/README.md b/leetcode/accounts_merge/README.md index 53a64a3..dd3f61e 100644 --- a/leetcode/accounts_merge/README.md +++ b/leetcode/accounts_merge/README.md @@ -8,11 +8,11 @@ ## Problem Description -Given a list of `accounts` where each element `accounts[i]` is a list of strings, where the first element `accounts[i][0]` is a name, and the rest of the elements are **emails** representing emails of the account. +Given a list of `accounts` where each element `accounts[i]` is a list of strings, where the first element `accounts[i][0]` is a name, and the rest of the elements are emails representing emails of the account. Now, we would like to merge these accounts. Two accounts definitely belong to the same person if there is some common email to both accounts. Note that even if two accounts have the same name, they may belong to different people as people could have the same name. A person can have any number of accounts initially, but all of their accounts definitely have the same name. -After merging the accounts, return the accounts in the following format: the first element of each account is the name, and the rest of the elements are emails **in sorted order**. The accounts themselves can be returned in **any order**. +After merging the accounts, return the accounts in the following format: the first element of each account is the name, and the rest of the elements are emails in sorted order. The accounts themselves can be returned in any order. ## Examples @@ -34,8 +34,8 @@ Output: [["Ethan","Ethan0@m.co","Ethan4@m.co","Ethan5@m.co"],["Gabe","Gabe0@m.co ## Constraints -- `1 <= accounts.length <= 1000` -- `2 <= accounts[i].length <= 10` -- `1 <= accounts[i][j].length <= 30` -- `accounts[i][0]` consists of English letters. -- `accounts[i][j] (for j > 0)` is a valid email. +- 1 <= accounts.length <= 1000 +- 2 <= accounts[i].length <= 10 +- 1 <= accounts[i][j].length <= 30 +- accounts[i][0] consists of English letters. +- accounts[i][j] (for j > 0) is a valid email. diff --git a/leetcode/accounts_merge/test_solution.py b/leetcode/accounts_merge/test_solution.py index fc73296..8f18c66 100644 --- a/leetcode/accounts_merge/test_solution.py +++ b/leetcode/accounts_merge/test_solution.py @@ -43,64 +43,69 @@ def setup_method(self): ["Fern", "Fern0@m.co", "Fern1@m.co", "Fern5@m.co"], ], ), - ([["John", "john@mail.com"]], [["John", "john@mail.com"]]), + ([["Alice", "alice@mail.com"]], [["Alice", "alice@mail.com"]]), ( - [["John", "john1@mail.com"], ["John", "john2@mail.com"], ["John", "john3@mail.com"]], - [["John", "john1@mail.com"], ["John", "john2@mail.com"], ["John", "john3@mail.com"]], + [["Bob", "bob1@mail.com"], ["Bob", "bob2@mail.com"]], + [["Bob", "bob1@mail.com"], ["Bob", "bob2@mail.com"]], ), ( [ - ["John", "a@mail.com", "b@mail.com"], - ["John", "b@mail.com", "c@mail.com"], - ["John", "d@mail.com"], + ["Alice", "alice@mail.com", "alice2@mail.com"], + ["Alice", "alice2@mail.com", "alice3@mail.com"], ], - [["John", "a@mail.com", "b@mail.com", "c@mail.com"], ["John", "d@mail.com"]], + [["Alice", "alice2@mail.com", "alice3@mail.com", "alice@mail.com"]], ), ( [ - ["Alice", "alice@mail.com", "alice1@mail.com"], - ["Alice", "alice2@mail.com", "alice3@mail.com"], - ["Alice", "alice1@mail.com", "alice2@mail.com"], + ["A", "a@mail.com", "b@mail.com"], + ["B", "b@mail.com", "c@mail.com"], + ["C", "c@mail.com", "d@mail.com"], ], - [["Alice", "alice1@mail.com", "alice2@mail.com", "alice3@mail.com", "alice@mail.com"]], + [["A", "a@mail.com", "b@mail.com", "c@mail.com", "d@mail.com"]], + ), + ([["David", "david@mail.com"], ["David", "david@mail.com"]], [["David", "david@mail.com"]]), + ( + [["Alex", "alex1@mail.com"], ["Bob", "bob1@mail.com"], ["Charlie", "charlie1@mail.com"]], + [["Alex", "alex1@mail.com"], ["Bob", "bob1@mail.com"], ["Charlie", "charlie1@mail.com"]], ), - ([["Bob", "bob@mail.com"], ["Bob", "bob@mail.com"]], [["Bob", "bob@mail.com"]]), ( [ - ["David", "david1@mail.com", "david2@mail.com"], - ["David", "david3@mail.com"], - ["David", "david2@mail.com", "david4@mail.com"], + ["John", "john1@mail.com", "john2@mail.com"], + ["John", "john3@mail.com"], + ["Jane", "jane1@mail.com"], ], [ - ["David", "david1@mail.com", "david2@mail.com", "david4@mail.com"], - ["David", "david3@mail.com"], + ["John", "john1@mail.com", "john2@mail.com"], + ["John", "john3@mail.com"], + ["Jane", "jane1@mail.com"], ], ), ( [ - ["Alex", "alex@mail.com"], - ["Alex", "alex@mail.com", "alex2@mail.com"], - ["Alex", "alex3@mail.com"], + ["User", "user@mail.com", "user1@mail.com"], + ["User", "user2@mail.com", "user@mail.com"], + ["User", "user3@mail.com", "user1@mail.com"], ], - [["Alex", "alex2@mail.com", "alex@mail.com"], ["Alex", "alex3@mail.com"]], + [["User", "user1@mail.com", "user2@mail.com", "user3@mail.com", "user@mail.com"]], ), ( [ - ["Tom", "tom1@mail.com"], - ["Tom", "tom2@mail.com"], - ["Tom", "tom3@mail.com"], - ["Tom", "tom4@mail.com"], - ], - [ - ["Tom", "tom1@mail.com"], - ["Tom", "tom2@mail.com"], - ["Tom", "tom3@mail.com"], - ["Tom", "tom4@mail.com"], + ["Test", "test1@mail.com"], + ["Test", "test2@mail.com"], + ["Test", "test1@mail.com", "test3@mail.com"], ], + [["Test", "test2@mail.com"], ["Test", "test1@mail.com", "test3@mail.com"]], ), ( - [["Sam", "sam@mail.com", "sam1@mail.com", "sam2@mail.com"]], - [["Sam", "sam@mail.com", "sam1@mail.com", "sam2@mail.com"]], + [ + ["Name", "a@mail.com", "b@mail.com", "c@mail.com"], + ["Name", "d@mail.com", "e@mail.com"], + ["Name", "c@mail.com", "f@mail.com"], + ], + [ + ["Name", "d@mail.com", "e@mail.com"], + ["Name", "a@mail.com", "b@mail.com", "c@mail.com", "f@mail.com"], + ], ), ], ) diff --git a/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/README.md b/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/README.md new file mode 100644 index 0000000..1fff676 --- /dev/null +++ b/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/README.md @@ -0,0 +1,39 @@ +# Construct Binary Tree from Preorder and Inorder Traversal + +**Difficulty:** Medium +**Topics:** Array, Hash Table, Divide and Conquer, Tree, Binary Tree +**Tags:** grind-75 + +**LeetCode:** [Problem 105](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/) + +## Problem Description + +Given two integer arrays `preorder` and `inorder` where `preorder` is the preorder traversal of a binary tree and `inorder` is the inorder traversal of the same tree, construct and return the binary tree. + +## Examples + +### Example 1: + +![Example 1](https://assets.leetcode.com/uploads/2021/02/19/tree.jpg) + +``` +Input: preorder = [3,9,20,15,7], inorder = [9,3,15,20,7] +Output: [3,9,20,null,null,15,7] +``` + +### Example 2: + +``` +Input: preorder = [-1], inorder = [-1] +Output: [-1] +``` + +## Constraints + +- 1 <= preorder.length <= 3000 +- inorder.length == preorder.length +- -3000 <= preorder[i], inorder[i] <= 3000 +- preorder and inorder consist of unique values. +- Each value of inorder also appears in preorder. +- preorder is guaranteed to be the preorder traversal of the tree. +- inorder is guaranteed to be the inorder traversal of the tree. diff --git a/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/__init__.py b/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/__init__.py new file mode 100644 index 0000000..e69de29 diff --git a/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/helpers.py b/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/helpers.py new file mode 100644 index 0000000..10c4f04 --- /dev/null +++ b/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/helpers.py @@ -0,0 +1,12 @@ +from leetcode_py import TreeNode + + +def run_build_tree(solution_class: type, preorder: list[int], inorder: list[int]): + implementation = solution_class() + return implementation.build_tree(preorder, inorder) + + +def assert_build_tree(result: TreeNode | None, expected_list: list[int | None]) -> bool: + expected = TreeNode.from_list(expected_list) if expected_list else None + assert result == expected + return True diff --git a/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/playground.py b/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/playground.py new file mode 100644 index 0000000..fa4baf4 --- /dev/null +++ b/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_build_tree, run_build_tree +from solution import Solution + +# %% +# Example test case +preorder = [3, 9, 20, 15, 7] +inorder = [9, 3, 15, 20, 7] +expected_list = [3, 9, 20, None, None, 15, 7] + +# %% +result = run_build_tree(Solution, preorder, inorder) +result + +# %% +assert_build_tree(result, expected_list) diff --git a/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/solution.py b/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/solution.py new file mode 100644 index 0000000..8dce67c --- /dev/null +++ b/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/solution.py @@ -0,0 +1,59 @@ +from leetcode_py import TreeNode + + +class Solution: + """ + Construct Binary Tree from Preorder and Inorder Traversal + + Algorithm Explanation: + - Preorder: Root -> Left -> Right (first element is always root) + - Inorder: Left -> Root -> Right (root splits left/right subtrees) + + Example: preorder=[3,9,20,15,7], inorder=[9,3,15,20,7] + + Step 1: Root = 3 (first in preorder) + Find 3 in inorder at index 1 + Left subtree: inorder[0:1] = [9] + Right subtree: inorder[2:] = [15,20,7] + + Step 2: Build left subtree with preorder=[9], inorder=[9] + Root = 9, no children + + Step 3: Build right subtree with preorder=[20,15,7], inorder=[15,20,7] + Root = 20, left=[15], right=[7] + + Final tree: + 3 + / \ + 9 20 + / \ + 15 7 + """ + + # Time: O(n) - hashmap lookup O(1) for each of n nodes + # Space: O(n) - hashmap + recursion stack + def build_tree(self, preorder: list[int], inorder: list[int]) -> TreeNode | None: + if not preorder or not inorder: + return None + + inorder_map = {val: i for i, val in enumerate(inorder)} + self.preorder_index = 0 + + def build(left: int, right: int) -> TreeNode | None: + # left, right: boundaries in inorder array for current subtree + if left > right: + return None + + root_val = preorder[self.preorder_index] + self.preorder_index += 1 + root = TreeNode(root_val) + + mid = inorder_map[root_val] # root position in inorder + # Left subtree: inorder[left:mid-1] + root.left = build(left, mid - 1) + # Right subtree: inorder[mid+1:right] + root.right = build(mid + 1, right) + + return root + + return build(0, len(inorder) - 1) diff --git a/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/test_solution.py b/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/test_solution.py new file mode 100644 index 0000000..5f08fe6 --- /dev/null +++ b/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/test_solution.py @@ -0,0 +1,41 @@ +import pytest + +from leetcode_py.test_utils import logged_test + +from .helpers import assert_build_tree, run_build_tree +from .solution import Solution + + +class TestConstructBinaryTreeFromPreorderAndInorderTraversal: + def setup_method(self): + self.solution = Solution() + + @logged_test + @pytest.mark.parametrize( + "preorder, inorder, expected_list", + [ + ([], [], []), + ([1], [1], [1]), + ([3, 9, 20, 15, 7], [9, 3, 15, 20, 7], [3, 9, 20, None, None, 15, 7]), + ([-1], [-1], [-1]), + ([1, 2], [2, 1], [1, 2]), + ([1, 2], [1, 2], [1, None, 2]), + ([1, 2, 3], [2, 1, 3], [1, 2, 3]), + ([1, 2, 4, 5, 3, 6], [4, 2, 5, 1, 6, 3], [1, 2, 3, 4, 5, 6]), + ([1, 2, 3, 4], [1, 2, 3, 4], [1, None, 2, None, 3, None, 4]), + ([4, 3, 2, 1], [1, 2, 3, 4], [4, 3, None, 2, None, 1]), + ([10, 5, 1, 7, 40, 50], [1, 5, 7, 10, 40, 50], [10, 5, 40, 1, 7, None, 50]), + ([1, 3, 2], [1, 2, 3], [1, None, 3, 2]), + ([2, 1, 3], [1, 2, 3], [2, 1, 3]), + ([5, 3, 2, 1, 4, 6, 7], [1, 2, 3, 4, 5, 6, 7], [5, 3, 6, 2, 4, None, 7, 1]), + ( + [7, 3, 2, 1, 5, 4, 6, 10, 9, 11], + [1, 2, 3, 4, 5, 6, 7, 9, 10, 11], + [7, 3, 10, 2, 5, 9, 11, 1, None, 4, 6], + ), + ([-3000, -2999, -2998], [-2998, -2999, -3000], [-3000, -2999, None, -2998]), + ], + ) + def test_build_tree(self, preorder: list[int], inorder: list[int], expected_list: list[int | None]): + result = run_build_tree(Solution, preorder, inorder) + assert_build_tree(result, expected_list) diff --git a/leetcode/diagonal_traverse/README.md b/leetcode/diagonal_traverse/README.md new file mode 100644 index 0000000..e988eef --- /dev/null +++ b/leetcode/diagonal_traverse/README.md @@ -0,0 +1,37 @@ +# Diagonal Traverse + +**Difficulty:** Medium +**Topics:** Array, Matrix, Simulation +**Tags:** + +**LeetCode:** [Problem 498](https://leetcode.com/problems/diagonal-traverse/description/) + +## Problem Description + +Given an `m x n` matrix `mat`, return _an array of all the elements of the array in a diagonal order_. + +## Examples + +### Example 1: + +![Diagonal Traverse](https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg) + +``` +Input: mat = [[1,2,3],[4,5,6],[7,8,9]] +Output: [1,2,4,7,5,3,6,8,9] +``` + +### Example 2: + +``` +Input: mat = [[1,2],[3,4]] +Output: [1,2,3,4] +``` + +## Constraints + +- `m == mat.length` +- `n == mat[i].length` +- `1 <= m, n <= 10^4` +- `1 <= m * n <= 10^4` +- `-10^5 <= mat[i][j] <= 10^5` diff --git a/leetcode/diagonal_traverse/__init__.py b/leetcode/diagonal_traverse/__init__.py new file mode 100644 index 0000000..e69de29 diff --git a/leetcode/diagonal_traverse/helpers.py b/leetcode/diagonal_traverse/helpers.py new file mode 100644 index 0000000..e828640 --- /dev/null +++ b/leetcode/diagonal_traverse/helpers.py @@ -0,0 +1,8 @@ +def run_find_diagonal_order(solution_class: type, mat: list[list[int]]): + implementation = solution_class() + return implementation.find_diagonal_order(mat) + + +def assert_find_diagonal_order(result: list[int], expected: list[int]) -> bool: + assert result == expected + return True diff --git a/leetcode/diagonal_traverse/playground.py b/leetcode/diagonal_traverse/playground.py new file mode 100644 index 0000000..ffdfc99 --- /dev/null +++ b/leetcode/diagonal_traverse/playground.py @@ -0,0 +1,29 @@ +# --- +# jupyter: +# jupytext: +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_find_diagonal_order, run_find_diagonal_order +from solution import Solution + +# %% +# Example test case +mat = [[1, 2, 3], [4, 5, 6], [7, 8, 9]] +expected = [1, 2, 4, 7, 5, 3, 6, 8, 9] + +# %% +result = run_find_diagonal_order(Solution, mat) +result + +# %% +assert_find_diagonal_order(result, expected) diff --git a/leetcode/diagonal_traverse/solution.py b/leetcode/diagonal_traverse/solution.py new file mode 100644 index 0000000..e3f8ecb --- /dev/null +++ b/leetcode/diagonal_traverse/solution.py @@ -0,0 +1,70 @@ +class Solution: + """ + Diagonal Traverse Pattern: + + Matrix with coordinates: d = i+j (diagonal index): + 1(0,0) 2(0,1) 3(0,2) d=0: 1(0,0) ↗ + 4(1,0) 5(1,1) 6(1,2) d=1: 2(0,1), 4(1,0) ↙ + 7(2,0) 8(2,1) 9(2,2) d=2: 3(0,2), 5(1,1), 7(2,0) ↗ + d=3: 6(1,2), 8(2,1) ↙ + d=4: 9(2,2) ↗ + + 'd' = diagonal number = sum of row+col indices (i+j) + Each diagonal contains elements where i+j equals the same value + + Result: [1,2,4,7,5,3,6,8,9] + """ + + # Time: O(m*n) + # Space: O(1) + def find_diagonal_order(self, mat: list[list[int]]) -> list[int]: + m, n = len(mat), len(mat[0]) + result = [] + + for d in range(m + n - 1): + if d % 2 == 0: # up-right diagonal + for i in range(min(d, m - 1), max(-1, d - n), -1): + result.append(mat[i][d - i]) + else: # down-left diagonal + for i in range(max(0, d - n + 1), min(d + 1, m)): + result.append(mat[i][d - i]) + + return result + + +class SolutionRowShift: + """ + Row-shift approach: shift each row to align diagonals into columns + + Original matrix: After shifting rows (col-row=actual_col): + 1 2 3 col=0 col=1 col=2 col=3 col=4 + 4 5 6 1 2 3 + 7 8 9 4 5 6 + 7 8 9 + ↑ ↓ ↑ ↓ ↑ + + Each row is shifted right by its row index, creating vertical columns + from the original diagonals. Then alternate traversal direction. + + Traverse: 1 → 2,4 → 7,5,3 → 6,8 → 9 + """ + + # Time: O(m*n) + # Space: O(1) + def find_diagonal_order(self, mat: list[list[int]]) -> list[int]: + m, n = len(mat), len(mat[0]) + result = [] + + for col in range(m + n - 1): + if col % 2 == 1: # upward + for row in range(m): + i = col - row + if 0 <= i < n: + result.append(mat[row][i]) + else: # downward + for row in range(m - 1, -1, -1): + i = col - row + if 0 <= i < n: + result.append(mat[row][i]) + + return result diff --git a/leetcode/diagonal_traverse/test_solution.py b/leetcode/diagonal_traverse/test_solution.py new file mode 100644 index 0000000..a57c110 --- /dev/null +++ b/leetcode/diagonal_traverse/test_solution.py @@ -0,0 +1,34 @@ +import pytest + +from leetcode_py.test_utils import logged_test + +from .helpers import assert_find_diagonal_order, run_find_diagonal_order +from .solution import Solution, SolutionRowShift + + +class TestDiagonalTraverse: + def setup_method(self): + self.solution = Solution() + + @logged_test + @pytest.mark.parametrize("solution_class", [Solution, SolutionRowShift]) + @pytest.mark.parametrize( + "mat, expected", + [ + ([[1, 2, 3], [4, 5, 6], [7, 8, 9]], [1, 2, 4, 7, 5, 3, 6, 8, 9]), + ([[1, 2], [3, 4]], [1, 2, 3, 4]), + ([[1]], [1]), + ([[1, 2, 3]], [1, 2, 3]), + ([[1], [2], [3]], [1, 2, 3]), + ([[1, 2, 3, 4], [5, 6, 7, 8]], [1, 2, 5, 6, 3, 4, 7, 8]), + ([[1, 2], [3, 4], [5, 6]], [1, 2, 3, 5, 4, 6]), + ([[1, 2, 3, 4, 5]], [1, 2, 3, 4, 5]), + ([[1], [2], [3], [4], [5]], [1, 2, 3, 4, 5]), + ([[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12]], [1, 2, 5, 9, 6, 3, 4, 7, 10, 11, 8, 12]), + ([[-1, 0, 1], [2, -3, 4]], [-1, 0, 2, -3, 1, 4]), + ([[100]], [100]), + ], + ) + def test_find_diagonal_order(self, solution_class, mat: list[list[int]], expected: list[int]): + result = run_find_diagonal_order(solution_class, mat) + assert_find_diagonal_order(result, expected) diff --git a/leetcode/find_all_anagrams_in_a_string/README.md b/leetcode/find_all_anagrams_in_a_string/README.md new file mode 100644 index 0000000..d84fab3 --- /dev/null +++ b/leetcode/find_all_anagrams_in_a_string/README.md @@ -0,0 +1,43 @@ +# Find All Anagrams in a String + +**Difficulty:** Medium +**Topics:** Hash Table, String, Sliding Window +**Tags:** grind-75 + +**LeetCode:** [Problem 438](https://leetcode.com/problems/find-all-anagrams-in-a-string/description/) + +## Problem Description + +Given two strings `s` and `p`, return an array of all the start indices of `p`'s anagrams in `s`. You may return the answer in any order. + +An **anagram** is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once. + +## Examples + +### Example 1: + +``` +Input: s = "cbaebabacd", p = "abc" +Output: [0,6] +``` + +**Explanation:** +The substring with start index = 0 is "cba", which is an anagram of "abc". +The substring with start index = 6 is "bac", which is an anagram of "abc". + +### Example 2: + +``` +Input: s = "abab", p = "ab" +Output: [0,1,2] +``` + +**Explanation:** +The substring with start index = 0 is "ab", which is an anagram of "ab". +The substring with start index = 1 is "ba", which is an anagram of "ab". +The substring with start index = 2 is "ab", which is an anagram of "ab". + +## Constraints + +- 1 <= s.length, p.length <= 3 \* 10^4 +- s and p consist of lowercase English letters. diff --git a/leetcode/find_all_anagrams_in_a_string/__init__.py b/leetcode/find_all_anagrams_in_a_string/__init__.py new file mode 100644 index 0000000..e69de29 diff --git a/leetcode/find_all_anagrams_in_a_string/helpers.py b/leetcode/find_all_anagrams_in_a_string/helpers.py new file mode 100644 index 0000000..5836a99 --- /dev/null +++ b/leetcode/find_all_anagrams_in_a_string/helpers.py @@ -0,0 +1,8 @@ +def run_find_anagrams(solution_class: type, s: str, p: str): + implementation = solution_class() + return implementation.find_anagrams(s, p) + + +def assert_find_anagrams(result: list[int], expected: list[int]) -> bool: + assert sorted(result) == sorted(expected) + return True diff --git a/leetcode/find_all_anagrams_in_a_string/playground.py b/leetcode/find_all_anagrams_in_a_string/playground.py new file mode 100644 index 0000000..42f330b --- /dev/null +++ b/leetcode/find_all_anagrams_in_a_string/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_find_anagrams, run_find_anagrams +from solution import Solution + +# %% +# Example test case +s = "cbaebabacd" +p = "abc" +expected = [0, 6] + +# %% +result = run_find_anagrams(Solution, s, p) +result + +# %% +assert_find_anagrams(result, expected) diff --git a/leetcode/find_all_anagrams_in_a_string/solution.py b/leetcode/find_all_anagrams_in_a_string/solution.py new file mode 100644 index 0000000..f26a54f --- /dev/null +++ b/leetcode/find_all_anagrams_in_a_string/solution.py @@ -0,0 +1,56 @@ +from collections import Counter + + +class Solution: + """ + Sliding Window with Character Frequency Counting + + Algorithm: + 1. Count character frequencies in pattern p + 2. Use sliding window of size len(p) on string s + 3. Maintain frequency count of current window + 4. When frequencies match, record start index + + ASCII Visualization: + s = "cbaebabacd", p = "abc" (need: a=1, b=1, c=1) + + Window positions: + [cba]ebabacd -> {c:1, b:1, a:1} ✓ matches -> index 0 + c[bae]babacd -> {b:1, a:1, e:1} ✗ + cb[aeb]abacd -> {a:1, e:1, b:1} ✗ + cba[eba]bacd -> {e:1, b:1, a:1} ✗ + cbae[bab]acd -> {b:2, a:1} ✗ + cbaeb[aba]cd -> {a:2, b:1} ✗ + cbaeba[bac]d -> {b:1, a:1, c:1} ✓ matches -> index 6 + """ + + # Time: O(n) where n is length of s + # Space: O(1) - at most 26 lowercase letters + def find_anagrams(self, s: str, p: str) -> list[int]: + if len(p) > len(s): + return [] + + result = [] + p_count = Counter(p) + window_count = Counter(s[: len(p)]) + + # Check first window + if window_count == p_count: + result.append(0) + + # Slide window + for i in range(len(p), len(s)): + # Add new character + window_count[s[i]] += 1 + + # Remove old character + left_char = s[i - len(p)] + window_count[left_char] -= 1 + if window_count[left_char] == 0: + del window_count[left_char] + + # Check if current window is anagram + if window_count == p_count: + result.append(i - len(p) + 1) + + return result diff --git a/leetcode/find_all_anagrams_in_a_string/test_solution.py b/leetcode/find_all_anagrams_in_a_string/test_solution.py new file mode 100644 index 0000000..3782888 --- /dev/null +++ b/leetcode/find_all_anagrams_in_a_string/test_solution.py @@ -0,0 +1,33 @@ +import pytest + +from leetcode_py.test_utils import logged_test + +from .helpers import assert_find_anagrams, run_find_anagrams +from .solution import Solution + + +class TestFindAllAnagramsInAString: + def setup_method(self): + self.solution = Solution() + + @logged_test + @pytest.mark.parametrize( + "s, p, expected", + [ + ("cbaebabacd", "abc", [0, 6]), + ("abab", "ab", [0, 1, 2]), + ("a", "aa", []), + ("aa", "aa", [0]), + ("abcdefg", "xyz", []), + ("aab", "ab", [1]), + ("aaab", "ab", [2]), + ("baa", "aa", [1]), + ("abacabad", "aaab", []), + ("ababacb", "abc", [3, 4]), + ("abaacbabc", "abc", [3, 4, 6]), + ("abab", "abab", [0]), + ], + ) + def test_find_anagrams(self, s: str, p: str, expected: list[int]): + result = run_find_anagrams(Solution, s, p) + assert_find_anagrams(result, expected) diff --git a/leetcode/letter_combinations_of_a_phone_number/README.md b/leetcode/letter_combinations_of_a_phone_number/README.md new file mode 100644 index 0000000..43f0064 --- /dev/null +++ b/leetcode/letter_combinations_of_a_phone_number/README.md @@ -0,0 +1,43 @@ +# Letter Combinations of a Phone Number + +**Difficulty:** Medium +**Topics:** Hash Table, String, Backtracking +**Tags:** grind-75 + +**LeetCode:** [Problem 17](https://leetcode.com/problems/letter-combinations-of-a-phone-number/description/) + +## Problem Description + +Given a string containing digits from `2-9` inclusive, return all possible letter combinations that the number could represent. Return the answer in **any order**. + +A mapping of digits to letters (just like on the telephone buttons) is given below. Note that 1 does not map to any letters. + +## Examples + +### Example 1: + +![Phone Keypad](https://assets.leetcode.com/uploads/2022/03/15/1200px-telephone-keypad2svg.png) + +``` +Input: digits = "23" +Output: ["ad","ae","af","bd","be","bf","cd","ce","cf"] +``` + +### Example 2: + +``` +Input: digits = "" +Output: [] +``` + +### Example 3: + +``` +Input: digits = "2" +Output: ["a","b","c"] +``` + +## Constraints + +- `0 <= digits.length <= 4` +- `digits[i]` is a digit in the range `['2', '9']`. diff --git a/leetcode/letter_combinations_of_a_phone_number/__init__.py b/leetcode/letter_combinations_of_a_phone_number/__init__.py new file mode 100644 index 0000000..e69de29 diff --git a/leetcode/letter_combinations_of_a_phone_number/helpers.py b/leetcode/letter_combinations_of_a_phone_number/helpers.py new file mode 100644 index 0000000..b35cae8 --- /dev/null +++ b/leetcode/letter_combinations_of_a_phone_number/helpers.py @@ -0,0 +1,10 @@ +def run_letter_combinations(solution_class: type, digits: str): + implementation = solution_class() + return implementation.letter_combinations(digits) + + +def assert_letter_combinations(result: list[str], expected: list[str]) -> bool: + result.sort() + expected.sort() + assert result == expected + return True diff --git a/leetcode/letter_combinations_of_a_phone_number/playground.py b/leetcode/letter_combinations_of_a_phone_number/playground.py new file mode 100644 index 0000000..3dcbf29 --- /dev/null +++ b/leetcode/letter_combinations_of_a_phone_number/playground.py @@ -0,0 +1,29 @@ +# --- +# jupyter: +# jupytext: +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_letter_combinations, run_letter_combinations +from solution import Solution + +# %% +# Example test case +digits = "23" +expected = ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"] + +# %% +result = run_letter_combinations(Solution, digits) +result + +# %% +assert_letter_combinations(result, expected) diff --git a/leetcode/letter_combinations_of_a_phone_number/solution.py b/leetcode/letter_combinations_of_a_phone_number/solution.py new file mode 100644 index 0000000..b198a2e --- /dev/null +++ b/leetcode/letter_combinations_of_a_phone_number/solution.py @@ -0,0 +1,31 @@ +class Solution: + + # Time: O(4^n) + # Space: O(4^n) + def letter_combinations(self, digits: str) -> list[str]: + if not digits: + return [] + + phone = { + "2": "abc", + "3": "def", + "4": "ghi", + "5": "jkl", + "6": "mno", + "7": "pqrs", + "8": "tuv", + "9": "wxyz", + } + + result = [] + + def backtrack(i: int, path: str) -> None: + if i == len(digits): + result.append(path) + return + + for letter in phone[digits[i]]: + backtrack(i + 1, path + letter) + + backtrack(0, "") + return result diff --git a/leetcode/letter_combinations_of_a_phone_number/test_solution.py b/leetcode/letter_combinations_of_a_phone_number/test_solution.py new file mode 100644 index 0000000..c28498c --- /dev/null +++ b/leetcode/letter_combinations_of_a_phone_number/test_solution.py @@ -0,0 +1,169 @@ +import pytest + +from leetcode_py.test_utils import logged_test + +from .helpers import assert_letter_combinations, run_letter_combinations +from .solution import Solution + + +class TestLetterCombinationsOfAPhoneNumber: + def setup_method(self): + self.solution = Solution() + + @logged_test + @pytest.mark.parametrize( + "digits, expected", + [ + ("23", ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"]), + ("", []), + ("2", ["a", "b", "c"]), + ( + "234", + [ + "adg", + "adh", + "adi", + "aeg", + "aeh", + "aei", + "afg", + "afh", + "afi", + "bdg", + "bdh", + "bdi", + "beg", + "beh", + "bei", + "bfg", + "bfh", + "bfi", + "cdg", + "cdh", + "cdi", + "ceg", + "ceh", + "cei", + "cfg", + "cfh", + "cfi", + ], + ), + ("7", ["p", "q", "r", "s"]), + ("9", ["w", "x", "y", "z"]), + ( + "79", + [ + "pw", + "px", + "py", + "pz", + "qw", + "qx", + "qy", + "qz", + "rw", + "rx", + "ry", + "rz", + "sw", + "sx", + "sy", + "sz", + ], + ), + ("22", ["aa", "ab", "ac", "ba", "bb", "bc", "ca", "cb", "cc"]), + ( + "3456", + [ + "dgjm", + "dgjn", + "dgjo", + "dgkm", + "dgkn", + "dgko", + "dglm", + "dgln", + "dglo", + "dhjm", + "dhjn", + "dhjo", + "dhkm", + "dhkn", + "dhko", + "dhlm", + "dhln", + "dhlo", + "dijm", + "dijn", + "dijo", + "dikm", + "dikn", + "diko", + "dilm", + "diln", + "dilo", + "egjm", + "egjn", + "egjo", + "egkm", + "egkn", + "egko", + "eglm", + "egln", + "eglo", + "ehjm", + "ehjn", + "ehjo", + "ehkm", + "ehkn", + "ehko", + "ehlm", + "ehln", + "ehlo", + "eijm", + "eijn", + "eijo", + "eikm", + "eikn", + "eiko", + "eilm", + "eiln", + "eilo", + "fgjm", + "fgjn", + "fgjo", + "fgkm", + "fgkn", + "fgko", + "fglm", + "fgln", + "fglo", + "fhjm", + "fhjn", + "fhjo", + "fhkm", + "fhkn", + "fhko", + "fhlm", + "fhln", + "fhlo", + "fijm", + "fijn", + "fijo", + "fikm", + "fikn", + "fiko", + "film", + "filn", + "filo", + ], + ), + ("25", ["aj", "ak", "al", "bj", "bk", "bl", "cj", "ck", "cl"]), + ("78", ["pt", "pu", "pv", "qt", "qu", "qv", "rt", "ru", "rv", "st", "su", "sv"]), + ("89", ["tw", "tx", "ty", "tz", "uw", "ux", "uy", "uz", "vw", "vx", "vy", "vz"]), + ], + ) + def test_letter_combinations(self, digits: str, expected: list[str]): + result = run_letter_combinations(Solution, digits) + assert_letter_combinations(result, expected) diff --git a/leetcode/subsets/README.md b/leetcode/subsets/README.md new file mode 100644 index 0000000..a28b3e0 --- /dev/null +++ b/leetcode/subsets/README.md @@ -0,0 +1,35 @@ +# Subsets + +**Difficulty:** Medium +**Topics:** Array, Backtracking, Bit Manipulation +**Tags:** grind-75 + +**LeetCode:** [Problem 78](https://leetcode.com/problems/subsets/description/) + +## Problem Description + +Given an integer array `nums` of **unique** elements, return _all possible_ subsets (the power set). + +The solution set **must not** contain duplicate subsets. Return the solution in **any order**. + +## Examples + +### Example 1: + +``` +Input: nums = [1,2,3] +Output: [[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]] +``` + +### Example 2: + +``` +Input: nums = [0] +Output: [[],[0]] +``` + +## Constraints + +- 1 <= nums.length <= 10 +- -10 <= nums[i] <= 10 +- All the numbers of nums are unique. diff --git a/leetcode/subsets/__init__.py b/leetcode/subsets/__init__.py new file mode 100644 index 0000000..e69de29 diff --git a/leetcode/subsets/helpers.py b/leetcode/subsets/helpers.py new file mode 100644 index 0000000..a28c5a3 --- /dev/null +++ b/leetcode/subsets/helpers.py @@ -0,0 +1,11 @@ +def run_subsets(solution_class: type, nums: list[int]): + implementation = solution_class() + return implementation.subsets(nums) + + +def assert_subsets(result: list[list[int]], expected: list[list[int]]) -> bool: + # Sort both result and expected for comparison since order doesn't matter + result_sorted = [sorted(subset) for subset in sorted(result)] + expected_sorted = [sorted(subset) for subset in sorted(expected)] + assert result_sorted == expected_sorted + return True diff --git a/leetcode/subsets/playground.py b/leetcode/subsets/playground.py new file mode 100644 index 0000000..c7f57bb --- /dev/null +++ b/leetcode/subsets/playground.py @@ -0,0 +1,29 @@ +# --- +# jupyter: +# jupytext: +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_subsets, run_subsets +from solution import Solution + +# %% +# Example test case +nums = [1, 2, 3] +expected = [[], [1], [2], [1, 2], [3], [1, 3], [2, 3], [1, 2, 3]] + +# %% +result = run_subsets(Solution, nums) +result + +# %% +assert_subsets(result, expected) diff --git a/leetcode/subsets/solution.py b/leetcode/subsets/solution.py new file mode 100644 index 0000000..3b9d8a2 --- /dev/null +++ b/leetcode/subsets/solution.py @@ -0,0 +1,16 @@ +class Solution: + + # Time: O(2^n) + # Space: O(2^n) + def subsets(self, nums: list[int]) -> list[list[int]]: + result = [] + + def backtrack(start: int, path: list[int]) -> None: + result.append(path[:]) + for i in range(start, len(nums)): + path.append(nums[i]) + backtrack(i + 1, path) + path.pop() + + backtrack(0, []) + return result diff --git a/leetcode/subsets/test_solution.py b/leetcode/subsets/test_solution.py new file mode 100644 index 0000000..6efd136 --- /dev/null +++ b/leetcode/subsets/test_solution.py @@ -0,0 +1,53 @@ +import pytest + +from leetcode_py.test_utils import logged_test + +from .helpers import assert_subsets, run_subsets +from .solution import Solution + + +class TestSubsets: + def setup_method(self): + self.solution = Solution() + + @logged_test + @pytest.mark.parametrize( + "nums, expected", + [ + ([1, 2, 3], [[], [1], [2], [1, 2], [3], [1, 3], [2, 3], [1, 2, 3]]), + ([0], [[], [0]]), + ([1], [[], [1]]), + ([1, 2], [[], [1], [2], [1, 2]]), + ([4, 1, 0], [[], [4], [4, 1], [4, 1, 0], [4, 0], [1], [1, 0], [0]]), + ([-1, 0, 1], [[], [-1], [-1, 0], [-1, 0, 1], [-1, 1], [0], [0, 1], [1]]), + ([5], [[], [5]]), + ([2, 1, 3], [[], [2], [2, 1], [2, 1, 3], [2, 3], [1], [1, 3], [3]]), + ([10], [[], [10]]), + ([-10, 10], [[], [-10], [-10, 10], [10]]), + ( + [1, 2, 3, 4], + [ + [], + [1], + [1, 2], + [1, 2, 3], + [1, 2, 3, 4], + [1, 2, 4], + [1, 3], + [1, 3, 4], + [1, 4], + [2], + [2, 3], + [2, 3, 4], + [2, 4], + [3], + [3, 4], + [4], + ], + ), + ([5, 2], [[], [5], [5, 2], [2]]), + ], + ) + def test_subsets(self, nums: list[int], expected: list[list[int]]): + result = run_subsets(Solution, nums) + assert_subsets(result, expected) diff --git a/leetcode/unique_paths/README.md b/leetcode/unique_paths/README.md new file mode 100644 index 0000000..d40c811 --- /dev/null +++ b/leetcode/unique_paths/README.md @@ -0,0 +1,43 @@ +# Unique Paths + +**Difficulty:** Medium +**Topics:** Math, Dynamic Programming, Combinatorics +**Tags:** grind-75 + +**LeetCode:** [Problem 62](https://leetcode.com/problems/unique-paths/description/) + +## Problem Description + +There is a robot on an `m x n` grid. The robot is initially located at the **top-left corner** (i.e., `grid[0][0]`). The robot tries to move to the **bottom-right corner** (i.e., `grid[m - 1][n - 1]`). The robot can only move either down or right at any point in time. + +Given the two integers `m` and `n`, return _the number of possible unique paths that the robot can take to reach the bottom-right corner_. + +The test cases are generated so that the answer will be less than or equal to `2 * 10^9`. + +## Examples + +### Example 1: + +![Example 1](https://assets.leetcode.com/uploads/2018/10/22/robot_maze.png) + +``` +Input: m = 3, n = 7 +Output: 28 +``` + +### Example 2: + +``` +Input: m = 3, n = 2 +Output: 3 +``` + +**Explanation:** From the top-left corner, there are a total of 3 ways to reach the bottom-right corner: + +1. Right -> Down -> Down +2. Down -> Down -> Right +3. Down -> Right -> Down + +## Constraints + +- 1 <= m, n <= 100 diff --git a/leetcode/unique_paths/__init__.py b/leetcode/unique_paths/__init__.py new file mode 100644 index 0000000..e69de29 diff --git a/leetcode/unique_paths/helpers.py b/leetcode/unique_paths/helpers.py new file mode 100644 index 0000000..c0ead78 --- /dev/null +++ b/leetcode/unique_paths/helpers.py @@ -0,0 +1,8 @@ +def run_unique_paths(solution_class: type, m: int, n: int): + implementation = solution_class() + return implementation.unique_paths(m, n) + + +def assert_unique_paths(result: int, expected: int) -> bool: + assert result == expected + return True diff --git a/leetcode/unique_paths/playground.py b/leetcode/unique_paths/playground.py new file mode 100644 index 0000000..e70351b --- /dev/null +++ b/leetcode/unique_paths/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_unique_paths, run_unique_paths +from solution import Solution + +# %% +# Example test case +m = 3 +n = 7 +expected = 28 + +# %% +result = run_unique_paths(Solution, m, n) +result + +# %% +assert_unique_paths(result, expected) diff --git a/leetcode/unique_paths/solution.py b/leetcode/unique_paths/solution.py new file mode 100644 index 0000000..0a3ddb9 --- /dev/null +++ b/leetcode/unique_paths/solution.py @@ -0,0 +1,29 @@ +class Solution: + # Dynamic Programming + # Time: O(m * n) + # Space: O(min(m, n)) + def unique_paths(self, m: int, n: int) -> int: + if m > n: + m, n = n, m + dp = [1] * m + for _ in range(1, n): + for j in range(1, m): + dp[j] += dp[j - 1] + return dp[m - 1] + + +class SolutionMath: + + # Math solution: C(m+n-2, m-1) = (m+n-2)! / ((m-1)! * (n-1)!) + # Time: O(min(m, n)) + # Space: O(1) + def unique_paths(self, m: int, n: int) -> int: + # Total moves: (m-1) right + (n-1) down = m+n-2 + # Choose (m-1) positions for right moves out of (m+n-2) total + if m > n: + m, n = n, m # Optimize for smaller factorial + + result = 1 + for i in range(m - 1): + result = result * (n + i) // (i + 1) + return result diff --git a/leetcode/unique_paths/test_solution.py b/leetcode/unique_paths/test_solution.py new file mode 100644 index 0000000..b66ad67 --- /dev/null +++ b/leetcode/unique_paths/test_solution.py @@ -0,0 +1,34 @@ +import pytest + +from leetcode_py.test_utils import logged_test + +from .helpers import assert_unique_paths, run_unique_paths +from .solution import Solution, SolutionMath + + +class TestUniquePaths: + @logged_test + @pytest.mark.parametrize("solution_class", [Solution, SolutionMath]) + @pytest.mark.parametrize( + "m, n, expected", + [ + (3, 7, 28), + (3, 2, 3), + (1, 1, 1), + (1, 10, 1), + (10, 1, 1), + (2, 2, 2), + (3, 3, 6), + (4, 4, 20), + (5, 5, 70), + (2, 3, 3), + (3, 4, 10), + (4, 5, 35), + (6, 3, 21), + (7, 3, 28), + (10, 10, 48620), + ], + ) + def test_unique_paths(self, solution_class, m: int, n: int, expected: int): + result = run_unique_paths(solution_class, m, n) + assert_unique_paths(result, expected) diff --git a/leetcode/word_search/README.md b/leetcode/word_search/README.md new file mode 100644 index 0000000..8ceb82b --- /dev/null +++ b/leetcode/word_search/README.md @@ -0,0 +1,52 @@ +# Word Search + +**Difficulty:** Medium +**Topics:** Array, String, Backtracking, Depth-First Search, Matrix +**Tags:** grind-75 + +**LeetCode:** [Problem 79](https://leetcode.com/problems/word-search/description/) + +## Problem Description + +Given an `m x n` grid of characters `board` and a string `word`, return `true` _if_ `word` _exists in the grid_. + +The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once. + +## Examples + +### Example 1: + +![Word Search Example 1](https://assets.leetcode.com/uploads/2020/11/04/word2.jpg) + +``` +Input: board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCCED" +Output: true +``` + +### Example 2: + +![Word Search Example 2](https://assets.leetcode.com/uploads/2020/11/04/word-1.jpg) + +``` +Input: board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "SEE" +Output: true +``` + +### Example 3: + +![Word Search Example 3](https://assets.leetcode.com/uploads/2020/10/15/word3.jpg) + +``` +Input: board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCB" +Output: false +``` + +## Constraints + +- `m == board.length` +- `n = board[i].length` +- `1 <= m, n <= 6` +- `1 <= word.length <= 15` +- `board` and `word` consists of only lowercase and uppercase English letters. + +**Follow up:** Could you use search pruning to make your solution faster with a larger `board`? diff --git a/leetcode/word_search/__init__.py b/leetcode/word_search/__init__.py new file mode 100644 index 0000000..e69de29 diff --git a/leetcode/word_search/helpers.py b/leetcode/word_search/helpers.py new file mode 100644 index 0000000..e1d096d --- /dev/null +++ b/leetcode/word_search/helpers.py @@ -0,0 +1,8 @@ +def run_exist(solution_class: type, board: list[list[str]], word: str): + implementation = solution_class() + return implementation.exist(board, word) + + +def assert_exist(result: bool, expected: bool) -> bool: + assert result == expected + return True diff --git a/leetcode/word_search/playground.py b/leetcode/word_search/playground.py new file mode 100644 index 0000000..5e69458 --- /dev/null +++ b/leetcode/word_search/playground.py @@ -0,0 +1,30 @@ +# --- +# jupyter: +# jupytext: +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_exist, run_exist +from solution import Solution + +# %% +# Example test case +board = [["A", "B", "C", "E"], ["S", "F", "C", "S"], ["A", "D", "E", "E"]] +word = "ABCCED" +expected = True + +# %% +result = run_exist(Solution, board, word) +result + +# %% +assert_exist(result, expected) diff --git a/leetcode/word_search/solution.py b/leetcode/word_search/solution.py new file mode 100644 index 0000000..0b5a659 --- /dev/null +++ b/leetcode/word_search/solution.py @@ -0,0 +1,42 @@ +from collections import Counter + + +class Solution: + + # Time: O(m*n*4^L) where L is word length + # Space: O(L) + def exist(self, board: list[list[str]], word: str) -> bool: + + m, n = len(board), len(board[0]) + + # Early pruning: check if board has enough characters + board_counter = Counter(ch for row in board for ch in row) + word_counter = Counter(word) + for ch in word_counter: + if board_counter[ch] < word_counter[ch]: + return False + + # Optimization: start from less frequent end + if board_counter[word[0]] > board_counter[word[-1]]: + word = word[::-1] + + def dfs(i: int, j: int, k: int) -> bool: + if k == len(word): + return True + if i < 0 or i >= m or j < 0 or j >= n or board[i][j] != word[k]: + return False + + temp = board[i][j] + board[i][j] = "#" + for di, dj in [(1, 0), (-1, 0), (0, 1), (0, -1)]: + if dfs(i + di, j + dj, k + 1): + board[i][j] = temp + return True + board[i][j] = temp + return False + + for i in range(m): + for j in range(n): + if dfs(i, j, 0): + return True + return False diff --git a/leetcode/word_search/test_solution.py b/leetcode/word_search/test_solution.py new file mode 100644 index 0000000..5e1151d --- /dev/null +++ b/leetcode/word_search/test_solution.py @@ -0,0 +1,44 @@ +import pytest + +from leetcode_py.test_utils import logged_test + +from .helpers import assert_exist, run_exist +from .solution import Solution + + +class TestWordSearch: + def setup_method(self): + self.solution = Solution() + + @logged_test + @pytest.mark.parametrize( + "board, word, expected", + [ + ([["A", "B", "C", "E"], ["S", "F", "C", "S"], ["A", "D", "E", "E"]], "ABCCED", True), + ([["A", "B", "C", "E"], ["S", "F", "C", "S"], ["A", "D", "E", "E"]], "SEE", True), + ([["A", "B", "C", "E"], ["S", "F", "C", "S"], ["A", "D", "E", "E"]], "ABCB", False), + ([["A"]], "A", True), + ([["A"]], "B", False), + ([["A", "B"], ["C", "D"]], "ACDB", True), + ([["A", "B"], ["C", "D"]], "ABDC", True), + ([["A", "B"], ["C", "D"]], "ABCD", False), + ([["C", "A", "A"], ["A", "A", "A"], ["B", "C", "D"]], "AAB", True), + ([["A", "B", "C", "E"], ["S", "F", "C", "S"], ["A", "D", "E", "E"]], "ABCESEEEFS", False), + ( + [ + ["A", "A", "A", "A", "A", "A"], + ["A", "A", "A", "A", "A", "A"], + ["A", "A", "A", "A", "A", "A"], + ["A", "A", "A", "A", "A", "A"], + ["A", "A", "A", "A", "A", "A"], + ["A", "A", "A", "A", "A", "A"], + ], + "AAAAAAAAAAAAAAB", + False, + ), + ([["A", "B", "C", "E"], ["S", "F", "C", "S"], ["A", "D", "E", "E"]], "SFCS", True), + ], + ) + def test_exist(self, board: list[list[str]], word: str, expected: bool): + result = run_exist(Solution, board, word) + assert_exist(result, expected) diff --git a/pyproject.toml b/pyproject.toml index 7306c4a..7debb1c 100644 --- a/pyproject.toml +++ b/pyproject.toml @@ -76,3 +76,6 @@ python_files = ["tests.py", "test_*.py"] python_classes = ["Test*"] python_functions = ["test_*"] addopts = "-v --tb=short" + +[tool.coverage.run] +omit = ["**/playground.py"] From 71ebd05d777f476ef23dd1048c6bb36debc056d5 Mon Sep 17 00:00:00 2001 From: Wisaroot <66859294+wisarootl@users.noreply.github.com> Date: Sat, 13 Sep 2025 12:11:00 +0700 Subject: [PATCH 04/57] docs!: update README.md (#39) - update README.md - add issues/PR templates --- .github/ISSUE_TEMPLATE/bug_report.md | 28 +++ .github/ISSUE_TEMPLATE/feature_request.md | 19 ++ .github/ISSUE_TEMPLATE/problem_request.md | 13 ++ .github/PULL_REQUEST_TEMPLATE.md | 7 + CONTRIBUTING.md | 56 ++++++ README.md | 201 ++++++++++++++-------- docs/images/linkedlist-viz.png | Bin 30293 -> 39106 bytes 7 files changed, 248 insertions(+), 76 deletions(-) create mode 100644 .github/ISSUE_TEMPLATE/bug_report.md create mode 100644 .github/ISSUE_TEMPLATE/feature_request.md create mode 100644 .github/ISSUE_TEMPLATE/problem_request.md create mode 100644 .github/PULL_REQUEST_TEMPLATE.md create mode 100644 CONTRIBUTING.md diff --git a/.github/ISSUE_TEMPLATE/bug_report.md b/.github/ISSUE_TEMPLATE/bug_report.md new file mode 100644 index 0000000..2071edd --- /dev/null +++ b/.github/ISSUE_TEMPLATE/bug_report.md @@ -0,0 +1,28 @@ +--- +name: Bug report +about: Create a report to help us improve +title: "[BUG] " +labels: bug +assignees: "" +--- + +**Describe the bug** +A clear and concise description of what the bug is. + +**To Reproduce** +Steps to reproduce the behavior: + +1. Run command '...' +2. See error + +**Expected behavior** +A clear and concise description of what you expected to happen. + +**Environment:** + +- OS: [e.g. macOS, Ubuntu] +- Python version: [e.g. 3.13] +- Poetry version: [e.g. 1.8.0] + +**Additional context** +Add any other context about the problem here. diff --git a/.github/ISSUE_TEMPLATE/feature_request.md b/.github/ISSUE_TEMPLATE/feature_request.md new file mode 100644 index 0000000..205ef6c --- /dev/null +++ b/.github/ISSUE_TEMPLATE/feature_request.md @@ -0,0 +1,19 @@ +--- +name: Feature request +about: Suggest an idea for this project +title: "[FEATURE] " +labels: enhancement +assignees: "" +--- + +**Is your feature request related to a problem? Please describe.** +A clear and concise description of what the problem is. Ex. I'm always frustrated when [...] + +**Describe the solution you'd like** +A clear and concise description of what you want to happen. + +**Describe alternatives you've considered** +A clear and concise description of any alternative solutions or features you've considered. + +**Additional context** +Add any other context or screenshots about the feature request here. diff --git a/.github/ISSUE_TEMPLATE/problem_request.md b/.github/ISSUE_TEMPLATE/problem_request.md new file mode 100644 index 0000000..6338c01 --- /dev/null +++ b/.github/ISSUE_TEMPLATE/problem_request.md @@ -0,0 +1,13 @@ +--- +name: Problem request +about: Request a new LeetCode problem to be added +title: "[PROBLEM] Add LeetCode #" +labels: problem-request +assignees: "" +--- + +**Problem(s)** +Paste problem URL(s) or list name here (LeetCode, Blind 75, NeetCode 150, etc.): + +**Why this problem?** +Brief explanation of why this problem should be added (e.g. part of a study plan, important pattern, etc.) diff --git a/.github/PULL_REQUEST_TEMPLATE.md b/.github/PULL_REQUEST_TEMPLATE.md new file mode 100644 index 0000000..f41f9b3 --- /dev/null +++ b/.github/PULL_REQUEST_TEMPLATE.md @@ -0,0 +1,7 @@ +## What changed? + +Describe your changes here. + +## Why? + +Brief explanation of the motivation behind this change. diff --git a/CONTRIBUTING.md b/CONTRIBUTING.md new file mode 100644 index 0000000..60ef591 --- /dev/null +++ b/CONTRIBUTING.md @@ -0,0 +1,56 @@ +# Contributing to LeetCode Practice Repository + +Thank you for your interest in contributing! This repository welcomes contributions from the community. + +## Ways to Contribute + +### 1. Add New Problems + +Use an LLM assistant (Cursor, GitHub Copilot Chat, Amazon Q) with the rule files: + +- Include `.amazonq/rules/problem-creation.md` in your LLM context +- Ask: "Create LeetCode problem [number] ([name])" + +### 2. Enhance Test Cases + +- Include `.amazonq/rules/test-case-enhancement.md` in your LLM context +- Ask: "Enhance test cases for [problem_name] problem" + +### 3. Improve Helper Classes + +- Add new data structure helpers in `leetcode_py/data_structures/` +- Follow existing patterns with generic types and visualization support + +### 4. Bug Fixes & Improvements + +- Fix issues in existing problems +- Improve documentation +- Enhance CI/CD workflows + +## Development Setup + +```bash +git clone https://github.com/wisarootl/leetcode-py.git +cd leetcode-py +poetry install +make test +``` + +## Code Standards + +- Follow [PEP 8](https://peps.python.org/pep-0008/) Python style guide +- Use modern type hints per [PEP 585](https://peps.python.org/pep-0585/)/[PEP 604](https://peps.python.org/pep-0604/): `list[str]`, `dict[str, int]`, `Type | None` +- Automated linting enforced by CI (black, isort, ruff, mypy) +- Minimum 12 test cases per problem + +## Pull Request Process + +1. Fork the repository +2. Create a feature branch +3. Make your changes +4. Run `make lint` and `make test` +5. Submit a pull request with clear description + +## Questions? + +Open an issue for questions or discussions about contributions. diff --git a/README.md b/README.md index ffd2a86..5ee0760 100644 --- a/README.md +++ b/README.md @@ -7,24 +7,38 @@ [![tests](https://img.shields.io/github/actions/workflow/status/wisarootl/leetcode-py/ci-test.yml?branch=main&label=tests&logo=github)](https://github.com/wisarootl/zerv/actions/workflows/ci-test.yml) [![release](https://img.shields.io/github/actions/workflow/status/wisarootl/leetcode-py/cd.yml?branch=main&label=release&logo=github)](https://github.com/wisarootl/zerv/actions/workflows/cd.yml) -Premium LeetCode practice repository with Python solutions, algorithm templates, data structure visualizations, and automated testing. Perfect for coding interview preparation, competitive programming, and mastering algorithms with Blind 75, Grind 75, and NeetCode 150 problems. +A modern Python LeetCode practice environment that goes beyond basic problem solving. Features automated problem generation from LeetCode URLs, beautiful data structure visualizations (TreeNode, ListNode, GraphNode), and comprehensive testing with 12+ test cases per problem. Built with professional development practices including CI/CD, type hints, and quality gates. + +**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 + +Includes all **75 Grind problems** - the most essential coding interview questions curated for maximum impact. + +## 🎯 What's Included + +**Current**: All 75 problems from [Grind 75](https://www.techinterviewhandbook.org/grind75/) - the most essential coding interview problems curated by the creator of Blind 75. + +**Future**: Planned expansion to all 169 Grind problems for comprehensive interview preparation. ## 🚀 Quick Start ```bash -# Clone the repository +# Clone and setup git clone https://github.com/wisarootl/leetcode-py.git cd leetcode-py - -# Install dependencies poetry install -# Generate all problems to start practicing (fresh start - wipes all solutions) -make gen-all-problems +# Start with existing Grind 75 problems +make gen-all-problems # Regenerates all problems with TODO placeholders -# Run existing problems -make p-test PROBLEM=insert_interval -make p-test PROBLEM=invert_binary_tree +# Practice a specific problem +make p-test PROBLEM=two_sum +# Edit leetcode/two_sum/solution.py, then rerun tests # Run all tests make test @@ -33,113 +47,148 @@ make test ## 📋 Prerequisites - Python 3.13+ -- make, git, Graphviz, poetry +- Poetry, Make, Git, Graphviz ## 📁 Problem Structure -Each problem follows a consistent template: +Each problem follows a consistent, production-ready template: ``` leetcode/two_sum/ -├── README.md # Problem description and examples -├── solution.py # Your implementation with TODO placeholder -├── tests.py # Comprehensive test cases -├── notebook.ipynb # Interactive playground -└── __init__.py # Package marker +├── README.md # Problem description with examples and constraints +├── solution.py # Implementation with type hints and TODO placeholder +├── test_solution.py # Comprehensive parametrized tests (12+ test cases) +├── helpers.py # Test helper functions +├── playground.py # Interactive debugging environment (converted from .ipynb) +└── __init__.py # Package marker ``` -## 🎯 Supported Problem Categories (ongoing) +## ✨ Key Features -- **Arrays & Hashing** - Two Sum, Group Anagrams, Top K Elements -- **Two Pointers** - Valid Palindrome, Container With Most Water -- **Sliding Window** - Longest Substring, Minimum Window -- **Stack** - Valid Parentheses, Daily Temperatures -- **Binary Search** - Search Rotated Array, Find Minimum -- **Linked Lists** - Reverse List, Merge Lists, Detect Cycle -- **Trees** - Invert Tree, Maximum Depth, Serialize/Deserialize -- **Tries** - Implement Trie, Word Search II -- **Heap/Priority Queue** - Merge K Lists, Find Median -- **Backtracking** - Combination Sum, Word Search, N-Queens -- **Graphs** - Clone Graph, Course Schedule, Islands -- **Advanced DP** - Climbing Stairs, Coin Change, LCS -- **Greedy** - Jump Game, Gas Station -- **Intervals** - Merge Intervals, Meeting Rooms -- **Math & Geometry** - Rotate Image, Spiral Matrix +### Production-Grade Development Environment -Includes problems from **Blind 75**, **Grind 75**, **NeetCode 150**, and **Top Interview Questions**. +- **Modern Python**: PEP 585/604 type hints, snake_case conventions +- **Comprehensive Linting**: black, isort, ruff, mypy with nbqa for notebooks +- **High Test Coverage**: 12+ 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 -## 🎨 Visualizations +### Enhanced Data Structure Visualization -### Tree Visualization +- **TreeNode**: Beautiful tree rendering with anytree and Graphviz +- **ListNode**: Clean arrow-based visualization (`1 -> 2 -> 3`) +- **Interactive Debugging**: Multi-cell playground environment ![Tree Visualization Placeholder](docs/images/tree-viz.png) _Beautiful tree rendering with anytree and Graphviz_ -### Linked List Visualization - ![LinkedList Visualization Placeholder](docs/images/linkedlist-viz.png) _Clean arrow-based list visualization_ -### Jupyter Notebook Integration +### Flexible Notebook Support + +- **Template Generation**: Creates Jupyter notebooks (`.ipynb`) by default +- **Repository State**: This repo uses Python files (`.py`) for better version control +- **User Choice**: Use `make nb-to-py` to convert notebooks to Python files, or keep as `.ipynb` for interactive development ![Notebook Placeholder](docs/images/notebook-example.png) _Interactive multi-cell playground for each problem_ -## ✨ Features - -- **Template-driven development** - Consistent structure for every problem -- **Beautiful visualizations** - TreeNode with anytree/Graphviz, ListNode with arrows -- **Interactive notebooks** - Multi-cell playground for each problem -- **One-command testing** - `make p-test PROBLEM=problem_name` -- **Bulk regeneration** - `make gen-all-problems` from JSON templates -- **Full linting** - black, isort, ruff, mypy with nbqa for notebooks -- **Modern Python** - PEP 585/604 syntax with full type hints +## 🔄 Usage Patterns -## 🔄 Workflow Examples +### For Current Grind 75 Problems -**Practice existing problems**: +Perfect if you want to focus on the most essential interview problems: ```bash -# Work on a specific problem -make p-test PROBLEM=lru_cache -# Edit leetcode/lru_cache/solution.py -# Run tests to verify +# Regenerate all 75 problems with fresh TODO placeholders +make gen-all-problems -# Or use make p-test if default problem is set in Makefile -make p-test +# Work through problems systematically +make p-test PROBLEM=two_sum +make p-test PROBLEM=valid_palindrome +make p-test PROBLEM=merge_two_sorted_lists ``` -**Add new problems**: +### For Additional Problems (LLM-Assisted) + +If you need more problems beyond Grind 75, use an LLM assistant in your IDE (Cursor, GitHub Copilot Chat, Amazon Q, etc.): ```bash -# Ask your LLM assistant: -# "Create LeetCode problem 146 (LRU Cache)" -# The assistant handles everything automatically! +# Example commands to give your LLM assistant: +"Create LeetCode problem 146 (LRU Cache)" +"Add problem 'Word Ladder' by number 127" +"Generate problem 'Serialize and Deserialize Binary Tree'" + +# For test enhancement (when you need more comprehensive test coverage): +"Enhance test cases for two_sum problem" +"Fix test reproducibility for binary_tree_inorder_traversal" ``` -_Behind the scenes: Assistant follows `.amazonq/rules/problem-creation.md` to scrape problem data, create JSON template, generate structure with `make p-gen`, and verify with `make lint`._ +**Required LLM Context**: Include these rule files in your LLM context for automated problem generation and test enhancement: + +- [`.amazonq/rules/problem-creation.md`](.amazonq/rules/problem-creation.md) - Complete problem generation workflow +- [`.amazonq/rules/test-case-enhancement.md`](.amazonq/rules/test-case-enhancement.md) - Test enhancement and reproducibility verification -**Bulk operations**: +**Manual Check**: Find problems needing more test cases: ```bash -# Test all problems -make test -# Regenerate all from templates -make gen-all-problems -# Check code quality -make lint +poetry run python .templates/check_test_cases.py --threshold=10 ``` -## 🧰 Helper Classes (ongoing) +## 🧰 Helper Classes - **TreeNode**: `from leetcode_py import TreeNode` - - Beautiful tree visualization with anytree rendering - - Jupyter notebook support with Graphviz diagrams - - Easy array ↔ tree conversion for testing + - 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]` + - **ListNode**: `from leetcode_py import ListNode` - - Clean arrow visualization (`1 -> 2 -> 3`) - - Simple array ↔ list conversion - - Perfect for debugging linked list problems -- New helpers: Add to `leetcode_py/` + - 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]` + +- **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 + +- **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 + +## 🛠️ Development Commands + +```bash +# 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) +``` + +## 🏗️ Architecture + +- **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 + +## 📊 Quality Metrics + +- **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 interview preparation with professional-grade tooling and beautiful visualizations. +Perfect for systematic coding interview preparation with professional development practices and enhanced debugging capabilities. diff --git a/docs/images/linkedlist-viz.png b/docs/images/linkedlist-viz.png index 46df3b5c81fdde319d5b931eca5706d32505d85f..49c8ed0c4ccd053e2fa8ac7b4f69a00c68bb2ebb 100644 GIT binary patch literal 39106 zcmeFZhg%cP-akwe5CjV-0#a-sU8&MRq*v)3rT0j0hJf6HqJYwSk)qTny$3{^lu)EY zf*=G45PBd9$-Ca?JkL45^ZH!(`2+5~uHBuT*_oaB%y(wKZT6Lco;m{^8yy)L8H1+A zLqjq$8Uh&^`7K&%Am&D_<|W|4+D%2pKvPA9+rSs(?B?l2Mt0|&!{f*Hnu2%wo;-Q{ zxNk^+kIpy9@a4-lhL0ir9sL~x9i91K9;c*RTQ6R{ut;hAg{<&VXM@MNH{7^t;l2t- zwUP#szF6_34S$XF%AwsQBYC<-ElnXk>M=-!xj<9?$3G$?A5r!(-Vxy=`z#RQ`R+!3 zVZZjV|`=22N7^Oe_k zw{^Yyc9qheHTp5NI<*})>$k<;MaFaNo9?bR@tBBq&{d)A)BTo|Ci_1m*hQu>{HAXu6b`6P^zGU|`J z4|G;!DJeETHvzx$MwEj*N6NHmE=LJ&zL zq?6J<=-%CH$JAsRFC1=RJ$@qaVEg2O#8`&8kL=Kz^2HVq-4@_)kQw}3P< zWg`_$P2g_i;Ope%?dJ;ech(XO10v2o)v)j*BfE0@*GaBvcxwkJf6C3++}~VRN5%o< zCH%w@WbY&#?Dh0lIb?FdGCg)jX&Rz0m8qcMQ(8a`HH`X{0(zm z18xt7P*9L?keD#Y*G1%> zw6wIyT~QHHQ6b_Gwk@;7e$ z`q2L#|EQ-^u-m`BaTxh{`bUxW|R~8 z)%1UZ;vYEw84CcdKqn{izn!K)H|6(=2=wDMw}<-1z#X8nKaWJcK(|o9G98A8sK=X{*3D>b3qjZTv^Uihu2kJ5!AUgBU*(-7_*oL4-pIMS`Jb&pT z;sTxSjz46kQocaG-j-%SalPR7^&JReW>BU)V_~!>c-7{4d`BL`8eN&&?e{MnU@*mkTc_s0f8SC6Ao` zvJOBsfl|-?MS*{Q^Y2psM&NG*{zl+$1pY?gZv_5E;BN%}M&NG*{s(~!ezREU9U+`l zYOx|TRfXof>bi-6*I)DBk&n;N9@7Z0^gp}&5O;o^FD~qR+6t`V-8yvem7~`k_FrNI z_qQ`L9CNy%*e#I^*`U6dW#pT^@&X(!_tRVS*#W~RhOj4@1o@y;ojjQnjdtTIhTqB_ zFo4s?cN@1eZut7hx_;B2N+?JZ`R|I1R%B4P4`kzt^H;$7GmzHiT@Tdi%P@1L)a!B>la}?@vN)0h2UY@79ZQ<>L z;fE!ktb?X#U`esNuU>r1lt1F~eVjmID6(hr==+RqWaF#A@2YC%;gk#fqTN+=te+cK z*_uJ>xst(ilhGTs;W?-`HAFu7(8HQ|@aijdr{4HCH}*|NlsxjnDU0%`=Pq3;(>QZF z<1*Gsh)R6-S@+6tp1^o*ub191@do^2Up%Kg{u`@Hp4pv&>TY@`LJO2-mh&6Ks-;og zqjXJKF|k`BQX-4vcA+PAV;kv`rie#f7>4_#cd6HzVSaI%zQyJlBfW=%3ZFe+JJU9G=Hssg4?gQI3e`tUGj1833Ae(wZ_q>ubgWeqr4lcxXp!odAQGe zO_BZqW6#;&3c9qP$;e3;qEc7ZH|lj$k~lX7?p+q>+dO~e+jEhGK}3m@+ZuSgzJH>~ zVxnwvm5r?t*6PFLA^kRj^q~!}8L-8QA5ZmXZ4p0!Xke?v(6kSelx|TFOKpae8*feZ zar6s?Y8fuaU$F>bJf7O}D=1=U?k+>k^Ah=*EQk{K`L}8=u(Jr9SCH$W%l7*IPS-YM zxAca-g=SPm17nkZ*~G_3KkqsB#$ej6zpfiKzGFC)Y`i{Fkc2m;)MsO^=e9d!lW^)= zP^qlu4VPDT*2&wbih?8;7M-^(V4FbxtvnsK2Y^axrMDenvAvRppn;l#0% z@D-b{O$66n8!yQzCgt_2X_!t{-DzYpzWBQV99eyld(lp^>bjzbZ`(uZt#{;?@~#R9 z@Kh$bkxm7EI$hi1tuSh;euEjEv*%uf)G9JqLq1a7xVRHE*@o~*(<)2?eUd!Gwv+HG zF3lO$MA5!JuJ~@j10}7`F}9*{hJZg*RMt~C)InP!LYAE@n(W=)O$C%vPg`E5n)a=u zA&Gh|ieoS{hWAR|4}VxNXbwc*HYwwY7GK2JWW=bwsVm{6Rfi%Bs0b~AXg(p!y3_@k zB2t4LWE(84ei-@*=Eq=}9WUr(Q?r_yx4r;-e=f$KchPRof$dcUWNS8HWpxhonIDVd z8vmIERS;@=e=YJi!!x4eBEM3HBAvJAGy806JpT1r9LS>8Cj6R&3F8Vnomljij*9)+ z%dcF`Dxp8J&qazdzg&%guvRn61QbyagOG|3E+r-UGj4i@JUjUG;ILZitE&O&$2*5g z#G!>n#@_ekgm0ZuCr92`m)>C;r>?6K!xbNWMAx^HB>bXiM4lYR^eOLY<%byFel}*PBS`4>?sHlV3Kx z8l5qmCu&03ZjrcTC%B4>g;SGt16y{Wmd>I8r$-fAA+iOGlU|G4V#=P z`>iEyB#C>?lb_4Kulq$Zp3l3Hp!Rl9$bA((p@B^C8%%sMUoS`LS*Hw z*;9#9A6}t-V@=O#J>NjD6dM8OzIqEg&A33y?m>B2(7tHDrNmr|hQ~s);+B5$*V@2K zY1URpUN%BA;1!pz5zrPW>By{9b0&9I%`GFdeddWQ^$SMWH9W> zSZW5-Eu_z8feMY&G8ANqZzY|r)o~$y{ra#8ANg*w1coB;F)5sMG|f3QS?pi&J(-ZQ znBzIc(43f%=*7ETp_|+CI1S6B5<>x#ycTenQx`5k6f|sCZGyUj}&S`Z;yG@2pe7&`9dUs=Bc0#}@j)>B! zan{31zX?vr1s5mkr7Y^;kG4~!Aw&M&drkArx?yesI_#xZ(8xN-cn?Fhe?Nsq)&6(9 zRv}6aWTdS>CZ?=%< zCo1Ojniwu3+`R^0i^S>pSD4yttOwC21^!%J3(E4$X!gqT9O~cgLntSB*xp^xubaMq z64dFhnAG5va$<{o!n0nlb4vV?Lm@OS3%QFHI>^~BAAejsj!|U|1=k#~-VKl}WGVjI zi}t5l7j=Gx`mS=hmRoG%K|&_qn39(cWz1F+z7iu$AGnqHLLvH_$QCyL@wbB&pD+C% zv`LY?7A>~nKlo;9KOg6fwhwno{+2V0ry{2yt`LNenhMHmuf8o&Cdx4!=~q7|{;1fS z0w<(VF-$_*+>$&;uV+KuW-APKAsbxDm^@NLSXc#hfVbDEmR`9PyltrI?mcjlT+K6! zf{r%n)h}vpzFtOCciV>Lj`mpC3?Sj%qG1!bXPRAtq$nXS8f2TvU<%-36?2*#cvP2_tJrGV!b0mG_X?eqBqb`x|vi+uR z^-6-i)7Dp)d9-tZ?-0&+@G@NE*c%0_@@8-ED2eT~cZ^uMNt!fn`wsrM}yp%MMI}u-hPnGsYJpc{R9L z{OVe>{&w6M`c;H*`017Yh0D#-Wv}UudrQrFtq`f{jr^wTk`3)C@_y63f)P=GmZpz5i-U+1|Gc7J-uG_K$HJ`g@NUa*p{^%!LTt^)o+e=lAt7=}f zBV%p0^IwjGY?GX1KC}d}DQukexJ89JYMqy3m1te#?EC!rv+u5xndW|K@BNylG!~&_ zD}|Gtwg-j$(}xm9f`g>6cz+?+{Kesq^z^GkqpcVjsg&1FzXoB7&<4JfY4+-ub7(tb zQSwcege~_ot*>QP4@#46o8_s<&L9Og50?~TKDGqijClM_u<9J-=(I2#+*GOh1BC*4 zGw3ASyFm2qIFKtsCF=_qpId+iw z^7q(z8Y%orc=0&-u%gtXuTpKtE|_^f>|h>Rm{h7~Q>0SoK8Z7Bc%U}=T6EL$`eYwk^2o&IU}lj#74BeAVLk6Wf;*Kk?B0Yy=V7}yr( z$8Am*8iMXfwV{cbyl)UFEt@0jw(#eY^p2BuAps{My_q?RPPGGBWjs8rYYHOq2V`nK z;4pJ|8x)BM&@sVbxwg9M{X0#v zQrcBV+fs!LU&}D7e9KO!`lPz*3~tbCdalo@L!T`KNZ;R)1zHwz8*6D)>u-rIB99N| zYRyhy)*%63BWwmpBa1{y569hn$qITE6mpusp1K53l#R$EU4M)dyej5XyoKt}*uXWjq%e4~eH2 zCMvp371Y$N=SbP6rU<0U1ceF8s#D%ihZrE99iFjh@UH8TbOMnK)?qF>-6k(1M20g5A71ME|@bg^9lgOi%1JcycdGn(ch+&cSkc!u!X0uF9$lM#_|uk!Rp+SWoU= zBtj+Zb*xTUNPNX{fbLay%SKw+MbOcv^i!qn$y~xf^?7V^MI}VT8ydN0caYG@b694f ztyYJ5ER>}vm|)ZVbwOZ|s+-FT`KWoFt3NDltUC7+f#)Y!VYE$)C3%d zyNIfsnoV`YoJ7@%y^vkR2+j${IBd_>&pL?rc)WDQgx;Up$8INecVYaz`6sG5cBFWv zgSpL8+rrYQlTnRux6l+b5Tc7McHZ-xNeA-aSW+Ig^?m8Rx_?;&`Q%1*5GGZJ!90ye znvz&T)3&Z@_n}v@csE0(VtiH}?Xi9VKSW%iYaC_^h`lzr;IaiOJuH1>z{T`dDl$Yi zBl=>{;r{kNU=D;^GSNx?LPA^!_rpkQ5{j#=xjJuD_^uy{O5F06lsg5g*e?pmUD|0ow) zq1%0i;ISc2CnS8$jibTlgR{BBk4GrCui|8-B^dP{LY{oRtl8j43TJ=vq*aAo{r(~T zYZ`%^T(P3i_V7ixDh^8{XKUS03`0kSgOIxXiD?ZXl2w)))b+$!-e^9H`Nk=W(VZOVUxHXBv4k)lu%I zB&w$_FumNUKO8}df3vl>RI}`#`CLu_!aK%dP2d5?)~C*`?3L^)TBtTE#5%7k( zjbye1?nPiuSz|@p;1*-e@`>-7sQuzRY9Ezon(&(@rnLn6(QJdy5JYr6DyH(Tmmkjf z@torLmSqC#OPodL;2DytfoQCf9p4B>x!}(D_bweKQ5_gphGQ7E}^o zL7jqo9qb*7=8Cs&D@fax$e~ZvSC?XS-Aq;VIKs1s$*mt<0k=JHj?1%~|KZdOXWfCB zMV&(2p!lURcA1C1mMLY`Xr)~1`=>$Dixb+7#Ybz;O0}iX%pf;V1$MH^CvRJiLv%Km zdXbbSy2e0Gie|ClNqKheg-x=ycaP-E!Hl}<7GrRW*dj(Bvt%*02G#!corVmnUcE z8?Y8O-U35YA}!{QJk15^?fB%rhR?c1EsS#shJ?MG@SAJDvcKNS$wbKYC{Y|i;8csh z)v;;zS|J+(vuqbvvxk#sSNz>V2^0ws zGwejd8!29J(wzCcbnY06U*&TPI~ADhqgf42V@ooriMn4-viNdw2RgoN?R9I3?MnF8 z*AD?3F>nI(apyaLjZ}HGTB)*~#Jtt-NzvaGgD|nr(S3}=WqGIZn=sLHWaZ_FI8UEI zVaLY4{ny|YMpHx{`$rM_!jfw7&3lUwTn0)@f6K{h z43!to?br5vtPOWfwrp|@-10gUUX*(qEPpl38xju$-{9N)aNb91@q{ZX`CF@q=~ zyz9_!XqbH+{*;Q46!1s>*)|&n%J8v^Y(4JF$x24~JGsK2wvCF{q&hb4HRwkvDtgXTw7t^hx@Q(E{nJu%e=zeP=I9Q4 z^V3|955%zWE;V0p&6P>q^9r31@FBm&M-`kbDlUL))BHXg1u=dgt`Fcb;qaMC<>PU! z3Y9w)L_oYx3W3{hJW6GyKn#X?8{#lrea&392h&_@u>d9Stav!Vdv0@fg2nQ{N3*c* zgLup{)Q8D+mUjQT&6!r6#4JvMO6ar6S?B0wWSe)Sa7(Taz6qLapqrT47;S+NU)P=4 z8DQr$@uwz;)zQFMr3)H=UK@t2xD?)6#&kt0CP5!`o3ATuvY?p} z6se@8fNd0n2_+pa`OEV#3O)WZ3eO@{yV*~x@w zYu*Vs<~sZ5ypZuv=znbPL3)s*fLcCp9hWdj z?a~36rmRxqos2v~n&0oBEiGf%s^7SV6>-Io_L8$BH{QLz(g#u~QNL5xPCVL?I@!Y9 zF2Ujl%FWiqRjdLuAS5>COv0ZdvP3!t)~^$=(+G$M>px!XSB}zUhd9)+5Q5GWUSqzz zBL!oSF@shyNHTT5DRGQGkScZd%uXk3)jThp&MOw^Xg+`-Q8Dd^cx41~Y=fT`P0;r1 zxZDf<8FjQ8p@{yjm$HmMtliViku;M0z{Tm->nV5g$8vG#p=1BxU}9eQ$Fyn^^iN?4{4EV3!>1d93iZCX zS;bpn-(3?0WhXZiF)_NSl+rP%EDX0*BJ?QMQY~45K8OCGGT=f_mU3-z?gNr*@M)NtR zqpQ;0mh+;^Vix$V@uSszg&cCy3EYMUUtgJW%yw8b{x+dSQd!proa> zPH!#;20lrqeun_b&=A`{EwlJkvE+FJLPjJCmn9Z2!os}l1P%`ssggy(&* zDu$J64E-bA4H^9Ta>Y-9HGUF>-Y6N86JB`pK->&A)mnIyp;9Pap>vt6H+H`zPEiGy zRZ%Q7{^;4O*B_=TMS^N&dSteHW@;Qyyy0#MgN!YsQNX0k0#?|b#NL-^_xXaKZz)w{^ts&TaW>nh%7->1T836$-BNv!-B>T_dVL@nq zkEV~1!3zXL*OV+Ju^h(6JLe2GF%I+yD>SM~3q2LCN!{w9MX<)w9S3pUvk2SkeaTw< zWMB~9RufX?p+C()3e)wswuf&iSN!7Uu`Qa;%;ZU%Zp;-aqBve_auVIW%f))o{h}Xd z&9rr_FDI1W8)xyHctU*bv3NnJ16J!ayFZZitsOTeR{iAEG9i?v+E6!)6&a3-x@0tZ z=ofbIlBS~I)Zx3+^c^$!o|8;A?zq8D$bZ(dG{AA^!W29u1EP}xf@K=4T@CAccXbDb zCO%0_Hr98evB7WA!pQ*h>8TKP@gYl$+mAA7TrMNecxJ20$sZTeo7Gyrv(WRxrx{d8iu@|J^%^Hq0K-;2PCh1SjbnQ>YB^^k!@*eYZk8;njDk@R|tG7}UzI$jFw zS>wvfGOpyO^bcPb+n7jmPqDA;8ZstF>0~X9j*}E}vW{-$6iVLYRTs{_S2^N_+(u}# z-MY0lUz6dBpO=1dG{^pY%j;?%SMydi#i?hxyrYA^xeLUIhyYgyAA^aUwo5*N9T3zK z((#1m_W2B}2KbpoN!L#SwsvhPR@UNL?)6)st-O;RAI_Dm>-eFO(-rweJM{E;(M(en z*<2Z1ec(tM8DbryD8NZh66xuypJ94Elsdbj12CZicbf^Pcqde1>5KRV_J_gP9gHt> zYW8VC^R?+DzM5WQp+S4~>|;Q8^a+9(XF(s())g-VK+U^31_$0rFAtw}UBfG(SpmgV zjqO>PfCocIyjok^F4~^m-FnlPWUXDiKT3kn1QRd~O5YImxLx$wTf7~|Hm^-R!>IXBt z0EwDH9~ni@%YT>Y{R-vnd$axmDdpjEk2D>}zvsJO@rd~uN9gI0N>O-}noNF=GV89v z4>dg=_{&j!OA9lor7)=NC=o9ncpgGQBr+7_USk)?DK|+ILrYx{V{Xr}HJ&=lE;(J! znb%28*h-=@D#@A3gA;M`>jjcq6)G`n{#Q#ni-T|{$B~mfmwYH3;MXtA+(0tq3C@{q`lror{45zmZw#Bd%=YWA@4&^Rny{*&*WX6KO3T3n>#f^? zQ>{xM$Y_7g=E~NW*J^6jS6lC*&dq!RL1pn>N*S0c>Q5y+$+|d#Cl~W!c5NfA~Z2pg#f{c;3SVQbS#9*zygF zgS|u5pTeik5Ch}V~kL337b=SwzAH85dcPLAwk`5WknEbqq4AD&$;=`fVqPovz0g-e zh;CD@N2Y2}2w?T*b2;6A;8E`8_?V6T{&-vzCb{{L%{(g>a4r~$AgN5=yDjnXY3^Lp zrhW(M`D>E?Y`~hQQ`pkyABj0BD{?Qs>u9FTZTmA!DTYmQv3>W~m9}RDl(?{F#`SQ( zR@5>uUmcP}P*^d;hFS#Z&0z^8x2D;%`NKVWvP84a)ck*nH_l%Fhyk41AwTD_g#8vFzwg1 zuZY~Y4oUs(wubw$fWkdy*Ey)EF{f6sCB@Ne<|Yz>fBkbyk^4~Qdur15*3HZOCU0jj zBFSg$gyu3(YZQIOA^D57!%slLS#ghKOoPlXQo4TOc>E{Ty+h+*6oGmQY+zeMX z6>UYvL;OHvCw>Drx;Fy8GQaU%grDsDVF$>$+6aVxG&)@=?3h;yeWMZ@+#@s5jLAzn zaEqZdPAM~;;@(J`+}T@=aAi35NOM}3JWy{F@$ubJsv6`3XCAH(Kp*JbW~k-5Q!6kM z0plx2k8t@b9BA2x4#GLX(bvAg{qh=CZaWmId6-=olwCwVUQ8K#yl67{nP<)OIb5~) z{f5=|-EJ=|AUpKRqVnuW;}EC)-?ncy}g7R2|YV%g0O(LDAB$w#o*1rhUkJDqj;Q z?R3aGh_NMA0Ik@3=_)+`@r^xh+OgPk1w`D8OV_%)RCP$kb!eQ3B!Ikx_P_N zqEhSB$*(fSK^>$xZ~0rgF^5t{JUQhz&F{m~Ovcbe9d_l+QZgNW;YF@KY`#H?+lC{| z&N<}!r?A^1m>rBtP23;9Qyp}S-T*vH-UKy2=%(|<-K4x#Y!P5_&n-s~7n*S{^kG;Y z`Yj3Ywn=d#<#6=O9-A2h%8%LEq|MV@a77YE<}GhwT`%5FHmH%l9J=30EL5hHwhA*v z6t(qdGf-@MEU1+kSKP|;G#8-{bc#K@oE}YHnRscXKi;Oo7I(rn&noVeSO-^dgJ<&X zxps~W*3?$S)TQOFZy|NUD&x@8Gx8h}iU5Eb6n3s;p3jfyhDJF@Y5X0dZDc-FLdA_^ z#w3i+rym^b74OX*RVJpG-ETw-fNDMI#TV`P3NrnhNbKl6#?|eV6A|0n(z22pJF5~! zTM{Cg&veb;mVQd#sR?!4bz#{zb%$HWn}_EI{VhtmHZi((Pb#xcCX%uOQ*e~REaUs( zsp}?~6hOUz!7a2E8nJ(6$QBA`-XU~Zl-@51rk za(jD_@0lxOD@niv1nEP@FLY%$=)wJ*0KVC&OTX#~c7gYtZ^6e1h^Jw!fBU`|L$hh^ zM$H;*sxNnFAWE=!&GYhdxmFqtk0pbSPT}jJS#8K%1?a$~Px&5vHL@+Ytu)7FPioN) z)2Qu#O!TXJG7wX}1qFT8F?np5GOJs>;*_8b7>XxxV-1*O8-epQ9+h!tNa;cE$G56} zeDtenurPAjTxk7Ls2sC@Y>@0W9JCD+P92^dm@4|v6PKvd3-|DF=v3VG+1=~dx#z1y z=?+6{@YAE<6Sha|GH|T2#~Qw7SlTWV?JB^tHHrAL+;dK#k8d`qy?y@vv9O1{KD%Sv z-jZ0g$$n-8E`-IJe@m9rW6P>Qz77d4KSpg2)(~$mgf)ft0!+0cm{hkp{qD&Md`wNR zM1jX-lzX*J<(FCQDON5}VRsJvDY2zq3bCjdQaMJ%Z2S=pSr zc!`sBW3=!3EG4m%Ff4I}NKHU*1jW0^a0oE@XBJ>2L8*eLw)QJi7s0|)N{uJN_G5D% zQ++KSW>y33#1kELrn^S;8JH_7EQ3j^GIU+xr{0SKFUoZ6P{QtWi>Z}zRV(ssSN1u| z%(PyOs2_2)#5cS=7|toK~9*6w8|NMMz*UTl)k>-quxLdX=Nvr0)d zz1-N-2TLrJO7-heb6FVF_e+wbW_WR%pLCx*BxL!nFm= z`drw4`jpT$@4Y&DAO^{=PXesItUbtNFXH|$y}^{UcokT9-)-2ZOj3L&B@>V;pqCHY z4-lkW>Wc_|o|lW@XCXG{#es>l@Gu4L-Z6K%PYlg7?H(GRoa;CNk zcSh6w+5LR`=t0HwJORKfp#m*NGVfYD&$S5nDgf+w@7LQJF;)m4ns-}%8T!kX%Irhw z+@S>#ux+Wfg@h9rZ{=yAf|#L_PWSx;FTfqbYLy&f6s{GMRCIDu)v@!--WxP8ts0;B zcuFcA4w!Wk0S5`;@#9RedzV<#C)H#DtGFccG$5CWL#w3 zbYycOoa+3LnZ^&fw6NQzlpR{hN;RdmA(ISJER5K776PZDOr`f%iMR8>atNCezfQ(u z*@g@!ru_P_Z*zFtkaf42#_*grcd+dqrhFy+c}UL?_4w2L#ATOyR*A)v51f8975HZyVF=*Rd*a4aBRd0-xlks=k1)dDD*0VpejIBFJe=zB%5OI0XgIq~H^Qt)J z?0#|4yKxKzO}M;-X+7HbF3;h}^=0^dyj+mvct=N3dTiAr+QI53sZ~ztBye2Gqprf6 zoKLr_Q@2K$MC-j$TqdT>+$WkVt#Od4#vs6|1}C`GhP4T@5KePs@7Bf3O_x;KnfOrG zvGW+eYiP#$qvk%qJ8ZXxa^J@>Z8?TE*bz}&i55DT9lwLHA)$DTM4;`y^h0)+!Js!E znaV_SoRVv^-!u3Q2JkS;Ay;KzpKv-t=T34YovkcW`1hjqAU||^I*AH(CVAzvxZw<- zjf!sp+YSGIkrDjuGOmSfEChxhMn7Twy+ol5NEB4tzU4`o8c+}G$dSzhc~PIWTm3UR z?2(zt)6uWEs57z&GvP&N2tk6Gw*(ZP^;uiK>OZ&& zD(~F+RyQ`^o0+@v%OO=OrCiHBO{_9^0m6vJAV61|6%Gn73&O3BVg$o5-U(pm;@&>K z$$FvC+&ZMZl`DjseW`pZO)sc1dR?;9oGCd@w@RoNahMU12{3aQw48P0)9Eayc>W4AnyY5h46fL6Xx&^AF#ALJaL^-=rxJP zN8Grg)AeeVLN{R(z*q5W9&1VdEjAB z;IH=(d8q?-pJx$_acOdXN^2i#PuG^!_xO<4?T{!2{H) z3#ceP5AC_+_rmkK?6VNZQN#DuXWgL4hw4x}ms8yYJk%f1IcG`9NVTNVWG{CMq zHQo3J-PCWhvW?mewx&@peyG?Ko}cc$uPET!6^8)hw2{j+mXXg~$Pi{7kdN`tFO+wh zLB{Cy6}{v9A9KwCj_AIf-DZvKH>T%w??MQ&pfzLKs!^5At<`G-_CTRD(6ht_X<92S>--H zN&0bhxPF)wyWlJX#o(Iec`^_mm>hEfX3fvzGX|I)Sv|`I6ReI{Z zssrYnXJ8=6=aWG_rjO+|A9BS#r~Bx3pjHi&bf#(PpP6ZjHj)M0;N)F5X8`8+g7{C7d7rIaA+TYi5Xz*R=nhtDKj;K(etYPvBb!+>lAY2 zUEXQ0Ic2{w+qj4~YL>ifQGhI9%tZ1zr2{I|4-PH;ig4K1GLAONb4?mQEX~4G?n_R9uYkH`F2p7{!+-6&Y9QcF+jy@lzII?aH1@*Xn^JOe zdp_8Y^d$U~_XNo%e?_U-JF!FEw87`w>;?-sTXYKhsu>5vn9cP}z1g0neJ?e$n_Sm; z1cl+ANta%p`0d{cxP5`Y4%~Fn@2BOyKoMCl^9R_z@JKnQKP>$qU++?+PA_7=`0^l9 z^i-_Bf8KGTOdK}@gIeh&(@nL6X(|BY(v`Zdoo!)tj8^n;x)y0~#1-stdGH5$l&Zvwmi3 z%e@5%ONQH`+?gh^c>dblY9>pu`>8_(f)H4&v#7}H5LIy;oW2RjXdp)1xK7gB`JdDI zdzb-p-lmN8f8oX*p+tLT(E6w{DKSdMA#_-wzptNxUnJwVoV3znA3%eUpYz&PROD3g zqLF~J>m@rOlRZDI_I8z!`pkr1)9;k@|B9m`gi!y!=>PYp7%v|Ht|pIy$3KexHkI_-ppP7)Yo3 z{}SqNr@MTAfF!k1>fXPZ#{Yjq{KhZU(v3~#*xxCh{v%Fl{g?0ZaKilmSY)PK_B=OG#B?EwrqU>M0@&IjF;sqMz8ms(Q9hnbM z2u=5uQ5~QyU-f}TjW9?3j+FjAP8k@D=VOK5X8?+;SAhOJJ)e*IuSW6nOTYxhZ1qs= zBG48Hu%A^wQ@r0WT`r`0dfN8h9b&2)^r-^AOz&QZ)g@nCJJ5q|->Tj+-v8g+alF^}32j5$zX*vN-e|n<*C{btTri z6;@y%*9`B(vp3=4cy?+0&0L3N-=IX`a-^=+ z-wJ!zk_2386b-djPvhou1VI=Pa#Ei>eP^mphoX5C*}kgGB8ZePnOD?De~wFGzKp7q z)Q5cS`jH$1I%(E!g{`2&lTowjK~tRIC?srUSuX>d#(807*)|z#37`X${ff6DZfk~A zUIa3?S|d=~maav`im zs&0K!+mfXs%gJ#4%oR9JC6yq(0KQSvKK*$cQ9!>MBNYkxKs%ro0W=m4RQKm*LULjV zDHt+fRleT$>QQw=gdzrd3eLd55uwFas8bw^w7D zpo@x;B*P`n>oXyc0ZbgQEtu*QZnkuKSnPY?wR|cB!)9X}2#BmbLooz$&zF~ODhk{1 z>8zF9nP7;#{I_v73@D_TeWgYi0CK-Q-4ehN8D?bb-h;QY-G2BZbcc9F^2zHDWEkiN z^$<$|{aNW<{*c~O1fR(!6a8sV;SJIRJIteP* z3Ik?{mY{cos=!Fc0UNoo6a250fGN|P@AW;!*0a}AFWviA1JEmm;pb@_B8;UhbDtQk zB}zd3IAwr^gb2LDHnc8WB%!;2x=p+b1?qNyumCF17F19sjRAeU)dk^1Aa}CT8ZH3< z&vER+6k1_KD~?iifc`N#ao_RU9g4Wz3=$0)8Hps^X{h@@|F+x8Ioo>8B%=X&p(8&c zg6kvGIqh>7s3|p+j&4Q7SAXpPbW`@h^TM~EXrDAmUH?P%h=YgfE@L8@vZ-?CAF4AA z7ieE{zkb5X^T;Ck0yk3ra=8(>1s7-%Fd>a84aH%#y#s(CNS+ibBXt^RhPA9Ab*LtG zd9?*hy=%kH>MEQb7&Uos#O)F2A#XSWP7kM&iy#KoQkI=5Qt<8+>0Aw`ayHC?S3fB- zN(wG>3va;_0ZWY($Yg|Ee(~-zGhv9fimK%YlyrRwN@8`EryvYz>A}N~%X#VNQWl|J zODAyD7i3*~b2yRa%gYy+)>6#6NR19^0}QTBG=LkU*MM#kqC37D$_U_8-kXL`N~ z)Yrev)8ieqceeK%o5uk?XBfJ&Vdak`{Z|XaX(_4_gct^P9x<2UiYHea*RLoS=CKHP zXtY|cAr7Rv;pz8Oq8T|hCVUJ$MJbN6-Xw`w{eX&St{CwWSGyh!+&M14eO5N$>xt~q zx6(i!m(=;Qi=b@{lk+cOWy_j2*N7!*tA~uo=zwPo-OC`#L_=r?(zp9HY~@?c#ONYO z;6b>&_qZJ!F+7L8#FCAeDk|{)2lBK(Q~%J4u4d8Ay49+DQN{lFD#bB7WieIxP6O3- zp8J5iJz0O3?#@)#h-mT~7;ApWCwgM&1w+Q$OCZJzml-2rbSixLMcYJQlN<_e*{hcz z97;iVZxdxAyq{d0nxnO9ZbuO^+2o`1cEfi4^PW+GBy;sigs!KJ%R5`?BA2)uM< zW(Pxb9QuF@bH<H zbObNeK6vl$6nuWnG!EwW>g03V?vyxvS60YrZ286?;@|d}AOlHG2O2w4T7|6xKrx>G zD5mWFY4HzaP9qTy)Zmb-Y>sZ<^H?2e(GN+TU$s2gR8@3iu~A%>y3~PG<8iWyf~{!R zn?Y^sqLz?Iwpc^qMbL?TH*(KucJt*<11l?JY8eWfDXzQ*8NW0RlP7M#??CBxr9=`# zdphmpEtqZ260hh^6OWHQ@|wz7Tku(^DV6b^pcMC`5VvC&mo#^HD;rUq-sp))caN%q zTN=e%b(%;R=Zh4h(&H>9jWb<~(B~Hf(|!>z%YB>gcI_19N+Yq+J$9;3YAxu9^=C)A z7IuLS$^<${w<9@Nf|$x{O%T#g)l8s*Bqff)IR3x(z5}SKb#2#%2#BaCO5YYlk)l+o zv7sUgHb80=sUk!{K3s~r?n`<(y3 z^WXXB&KzelBeKf(mhUak`+SkPBoceTe6$ZVq_G<%#K{=pWtACgBP-xbOeKkScJ8^y zK3<81{axF0ww`2R^@rI{-@mZ|QQD9+noo&8aH-X&8r`}f;E2MiDJzVsTPHRrMqff1 zfe$Y0{9{Y$v_ovI>JrR)Eqf1E0f{2fNC(=(a6s(;>SEQk)Q@g^%fZ zHbn&OysB$g{L}r^thof0ZZwVS7gJBIgVsL3`z$tBbfL5+I0&wpU%LH}zO*lu!Z)Xo zs2SNkf`zS_svg%-L?+bRkrPaf7V^&N8SbwqR^i988cIcw)p&96F*b>uoRQ*Wl!tv# z*v1KIX7$@r&cn{;4Ou zd3j`Fu#FG|L1%V$(fnYclD0c*5F6JuF6Xzt5Gpqkkx4YtGh=rSIq+W z_do%6i2a`_L_)wv$*LGUT}&vI(H!&U#u%L#kA ziqtB%>+T-1o~>**2M$gA+@H7|>OXfgZaom-@LUhv!m0~xi-(cB7tfrRpkyBKJ*YE`*?F<6Z!@@@|JPfnnmD|! zDYf|w4uy(R4UQ-vw5EP^`()6|x==2wX}*ugeb|US`_@Mxt`K+?heNONmSk*)j6=26 zq>w|FIt3DQde8_Z6Lmmu_XzgreEnn%uyIDA2r{KD04-ULWt^rvs;g1UDe*6Lx(b_c zKsqErPL?iV9+e7SbyM7X^t-H)!AAqzI1+0Z-w_UT)ObU zSP&`IdNoO%E3#D6@sxFq6vREjPJD5eAI4T*%D?dpHVCsaVMXLE!A)d62DoWe#$M;P z5Yi6zu*u){a6Ts_Srf*N5m5+Mvv#nCjMLX4Qw?YC$WbznN7l#@utWFqZ}>1DmbDS$ zkA0t(xDM%F`0|hol1qJ^$3yRm4S2^6Emy9!Mw~|% zAS>|TMP>Je5+o42B9dRMsj#6_~6r4o4Y9$Os(w(u-Z5BI9FX{QzM(2_6z zrjaef7=hg@L~@VEX0;oSVWsQU=!6ohOm?V1B)3@T_qBot>`2g2M~x>HLT7Pk%QRIT zbsQ|Jq^K5^MiBOJ=8?KNvG=rwFFPC%(YQ+7vKMk38`j)S$vk?5-WBP)e3z`JcN+Y} zHPbbW&3OiX66(vWLL0LYusJIEdR}np&T6!=ixqY=0Mz`Mb2((n`L!JD9un z2s@1CBC{K6(9Y8yiM)_witpbZbn_eOGZAk)q3jOkLQ@ zw7em({DI@(rCu1FVQlcH>PG4U11;!6xu%{^NXiE;gpYn0-Kl|t*aA*Rhso1jswHK8 z+P4W+h-h`De{z+uy2mXT$AzZtClx!CG(Fj!IKgMoKSlhX&_YJe=r` z@xLIY<0RTNxZ~6x7n!~k?E^!89ps`2{XQQQC#z;vgjJj$D`}sDkjE7(N*P-ux_IEe zR3likyv85z9>w-=n(L8(@RoJxBDN8%AyU~I4BK%B{)mls0k@qsZiuvl+|51jf7u%=6O;jVKU=^C_W#@DvCY~z3uUQ5+{0+OBk zuS)g_T}1at5(LY8{$qJ=29Py{7JUL#O0jLA@-MCKNb#u7IhJvHTLQY6y~-f=6!3`7 zpC0j7>iXkDf4AOpK1h};QV*E5Uorv1_R#ys;&0#Z7Eprk?|xb!?KOh!fBR=P`16PM zk22bxa+&wGE?Q%@hpg11iwJ}tW=mx13K7v_RyeZsg^g>|I5^s*!nJ-i-ZmEhN@VYm z8Ez-GZTemN$Q*jPC&&tk+(@m%hXNjGRHN0+A*Xzmo+rJMy2rfAmk}X_Eh)@Gx*St6 z3`eu?=23q5cTa7A9==idTNz8Jme4&(o^KlQs0LONVqEzZ)BKSTR5)m|>b~qSr>t{d z0x9Jbgu)ll#kZa`70($^7sIv9Is_{ZpegqFG3Dronsi5gapcfs2pp6}E(-N)mZR`% z(}YQ|C}VoHW4dryn6U+s@FaFckG~Dbu`AU74myqg=W_~*(C8vZ2x@jCB^B*?dqxRFL7~#c*5Y>YUMh~OP$)66)XM1dm@PL$Z z)=p{4p6(N!-YMuhbHxG_y=Q#4We*mWe3UX$?Wn~kQf~~RM{`ODn8#IAG~_X9TSA@Z z7)!LiZff(rA9^exPcYIa;#q6dObQ|?$}-OdAjg-~T0F58b!HYG_xbu%mpT$X{wlb` z9GC6;cULVXQF{_(uG+z?xv##AiW=9&KHfQJMUH93_yI&rnz99%h`w1A8=vkZ0SrULKHefjS&}TfIzE&`n zZLpvH+@=o;dy+jH{h$+wc<(Z;tY{!-ntxadxvN+=39qHS>>MYREld`Ozgy@tOkr&1 zFZlKMtM`LZv@aX&S6{pJTuddvds&bX%w_f(4hp~UHt<(^EWvI@vsL9t0?i$3zTQKv zsN6_p^nre1tGz^#1aUJZ05)i~bx;@VI8!m1mV;>alW7zYSZx+?;vCA{NW`PgF#IihhFBK zyPHZMIix!nzRFi472lZPI9(7Bqq!@t|8C|AhguCxP7ZmhFj!N;Hay)=iteh+JvUc# zByl|yT|T@chz&}X^+(Hl2ICp18lwg%A&9kcg-iLGuJHRD_uTuhW3U~uPRMsh%%)>{ zQzzEa-2A03QMXe1zhPZ)SyUXURY_}T1(8Pw(~xCH5K7Q5Igt_UHqCgwCvbBwP_R5o zc|gUU(3U(FiXRxVpEuq{4V^~9lL`lNntm8S1;$erH0|4t`?4~Gw-J?77B2NVQG}}W z&iE2D5SgETap!OPnb250y0M#k!8o}Ug}kSa1h(}3B1^Y9e3!#I>Aj6|l-a&jHb(Io zvDF$)K4htLt|;+*rkl=6kv@rQ#(qA>8(wUXI^4l~N<1LJPK zYbk`C-V@gubs=A0=U6`?sD{*E%*@d>x+)YH2vaiGWL2TX*YjUhox3AJL34Z?y#}vz zeAiGFe&Y2{?M$OgbL^cLTlzP1CmnN%6YogZzPCeDsv_`5d|PSnD&O^J3kx)-pt2{Q z?!HztX-@Y%FqLxyP%~x5@ZD3`)U$GqDaT=ejAi*00$vE_8d@t099Xp} zIAulYxzfqgu6Db}Nxc4arVq4utT}yKvqY=5WE+|5MJ?hDf4DiNt2>C-F7)Mw!g*h>#6(Q%D?91_w6^xw{FTrCkOZ~7eQ?0q3*D8qJI^VY;%XFX~Bc^)j zQ7G!z9o~hR>@ht2AyPo;^-$|K@rmo26CIj_nNOLR7mjeH{-dHW)Z89OE{U?D1#2C0 z6goPgd>)rcigC53NNI6G%-?Z;E0G7fN^IR;7NVtCamLeOMklvp{Q>jV<9BAXW(oJe z&Wh7AT<}Slqj6&0?vzp2HCo{NG_J?qy{o~j1LWF7B%k>}rZ;A6FW_KR&k66Qjq)aC z@>@6=eExmRz}goqqJN=-93o_I(#*<-T+LVlNL1^AS(C0c&`N~Nbf>B3FU-o8b7c4gRhysr;jk0x(vPs4rN$~9y!j_h8-o%U|Tg*8ymGfZ&w87h^l}9O`GIOH2of%r$ zr}>b8tH3$BQ?3*~hO;+Tq3O0BQD1vUD&UrIobNq>OHNg)Aq@?go^36kgj$~hHydA+ z!)gZ&E}^D|_R^Xww!K&j76y*t_|q{;w;1xA#la$P+~r>Z$2iaDlTA(asJ2smgElk+ z=u1d$!o)^k`1)0Ifa~pW#!ev?;GgwJFcIfg%@^bZCKB4xFI6Ouw}dMNhq__n4Ekrs zlJEyN%J-!>!FK_TbcQA5o6A#X1d?D-d-d(-O_W)=W3aQu-<(4ff%Gdqz zQxiueU+_yR9gTU5VXV(x-ppUG$Ldi*6uTLJ5swgep&$FofNSq6+NPsja|Sw>M9X6{ zO)r-dB=sj`lGya-^7x-H%N)|?FJ5H;gYX8rQ2ipi)o?+R_H5AgEL`|GnINoc+Tp%e z+U$7@Nl42+nSg(}695a`YS$d01uKfLc(XRx6&DKWiyLLkyd!nLyFR&ti&7p?`feKQ zRK;5`Bbi7|iJ7>qgQ4^z971gltiTcGjVp=Jp+>2eZ(BF7&GkmtTi^$dNa`96n+PT6KHR^e*Z@_I3SR=t1OagP$taT zpEBzPC(C%+Htw7EN^+W49lm=Q4Cf%dQ8*8tL^;Wiz8GLg+)6nL7a; zW_(SQlOZC`ZVYf`A(Ov1|JWe#e~+*q=Kt`!`6s|XOVbdDR4r?%fZ=J1Zd z@FbVGZ(e=~Ao>+xa_h&ywELr2a0%Rt@iNY!?SuUjk0w97oEDy z`9z0z2F=h6hhi55w#$`Ddhk_EnpQ>gS}#xQ)|wy9<56Jbg?w8{q!-8ltR~6kHH4r#UMwmz^0Oq%Mr5 z*rYWo@pEl+8sSFfrh&_kwr*9hnNtvS26}jCdFi+zYCgVyyb6sMXMhrVEIS8VL?e5x z#A})5SUJ1)@XzVqEGgA1tO@S1n-Z$ z%N@+2kt3acc3j6!=3BMBIdQ|02yy~}Jix3`&<9Ll25^zNAO>0hV5(Ghl^@h8aC$ zF=y>H7h^w~Aj+h$e~q=hOd-i0xN&wkZccEa_NDJ^xw=n?%C&O>YH7Nh%xGN70>m!m zuAUR5U*5A0gvL^tG)ng6QDWp|VyLJEqB~3L${!BO9kd*8o(=E=GCMirme)|tuBU6) zhG`!>9pe`zB_$AQfP6blZO%?JiVrXmePCq@W%U&7dzY<_9a-R z@xOXzIEpR10)X!|P}sjfC#s$jsw5UtI7_>8;NB?v>2dh2dxtO-pSa%}^%!1y4nf3+ zCDYFin9p#^M}$M3*9XndTT^=S*hvJ;g=$2bo^2Tn>bbB19R6U0fA40<&|&Qn;dHFx zTD0_1d4~<=A=io$J&?mZfaES!Zdjj0Axb*Yjhm1maC$VQ`t_oh-pVa7 z5Qy~o09;}0>DgEB*dMf4&cMfc?cJ2b6u{i=6Inp~8^8El{0mUKT{ILYG5^bUlf+K? z7&p@FH-d4HCmf*ghrM6nhC1>Pvas;ytIBqQMt8p&wcoE^a%Se8<7+2H`Zq!|U>u<; z11&^Gk8u?-E>2V^>X~>he;-!fI=cMTq3LGt_s5|RxO6N8k-iW9X={!J|y>}Yf|5o@ZQ7yR7?nMq(oUgzpF9&%k8 z?`z3)pKG*7Fv2;5Sa1TVPg@Wo#xh!4Ya0`;AL`PzQ!!)Z^{9$$&(y>AmEOPIM@?_c z)-%~T#OYbPR%u*x%8zswz-#E1SJt49sJ2rwL8zT&(xfC zER_RcYWcbw;VFwfzPV#;icM5D!u8jhu={g$eGw0omj|+Cv*+^H!G#|IL)9s(>=Pq(r8R6E1&0lu-qj5D9C7tw z`Mv4Td0Ky3Ps3ivK5Fi`7S3iRnIp-a{vi;LDK1x`eeatZ^t8`%UwOgE7{s=pHh_9o zr&e{UulwIg1vtq$K4j)e+U>7#XiyM!A6P9=59MUM|9}T`T-mLopTCepl5-yk{+0;? z?omcDkD>}zI_Q&c?~sh2o;s(cqFvbMa@K8Qlof_9G0Vb5Z`O;L6n4ANg3O(Aj6S3~ z^(NCi*|wU5TZS+9X9#%?ck_?Wb4M9%pi?w@SkNJ<85aU-KpZeo88l5V9r<+Jo*|*o zDWp6%#cwu<#pssdJqSH02Bu^=>-ycyBI<08{kLZ|!WQqcvpxeA07S*v^v{#Sb063x zG&%hc6tNvtL_zH3aZtIjbo`;0u zhxY9eDj1VS%7h=hoVF(us9R?Vhe5)V)b8Jtl-Esge+Alm@86U1$WORoN`)`$65z5T8OH;(^m(m zO#N^iC@FfDzVEFhNMNHM@cJU)%owlY}3M_Y{K^eF`>T~v)`I2CU0bG zsd|#9*dE3rJVq$9ie5u9JPTF=Sh_ZVv4)c{buwmozKy0 z&}EiJqxYnmJufP)Aa*lPbQ$T!`BtIRMFhTrnV#N9?_WM_UhG>Fllal=L6)q)qDMb7 zH|Xt(gxavoq0fSq^jWqxa!C7IbS>Uh=)p?HECwL2NNs{T64ZZwcA~691ji#4^Sr9Dp7ZA42g^z^69hcI zTk0ktO1RabR>?{BWD8<9yP{{iV-?(5uzR;LC~%etoppFh#Lsdr!KRtv%+>esjmnQe;rZ^1cUZYux@&P*faj0xhne|YdthuFM3k_r1g)MzC_ z95Jp#*7kU8T0P5(O5Y;trs}p~suzWy0XFQE%7@9y#Ww;9?zC6M8?}`#7xvo@s@UvVBCd3ESj_QX(@0v@+hItzr5}>qQscA_|7N@a^$)D zP7Fw@nQjo$Q7*IM$h(k`eYbyc(dX-=FmzK(^?uPU!-a{*4xXTfKxLV(W4bdmvunZP z3Bb_bT2YEvU8_)xeZKB@D*ArG_t8%Ft`t8gpoynI)sp;qRyfqXY3GLzFBBUs&Vgc1 zYcCX^$0n=+kg#I3zUMi9kF69ZdV0w4=8tdxUeI}s zvnGZlS^lb#R5x34eKUq(ORZOo*2J1r@D*mZvjd5RTb%iP=8h0B74QUpc;6YH3lz)) zl>&PAJOghg4$4LDA9&$y%nTY?d^+%;d3V(_qU}6q@7?GfA223KjOBRyPYUpkdqtBm zADB?b%P?HxgR4(+_|u6YJxyL5@R zS_!1V5*;Wt=|a&=1Says#79oE9%11F{C28Yg)OoIO_9o=E|#Y@C~Y(cg-Vmggzi+ z-%X&^1BBMkMR4`GgH&{C)Rf@twcaG)hz42+RL)3z`QY2o{QPvfSJV{ zlUk&{+JVaa+CKZfAUHHN+E~6+BQ>hyM;z(!0uI+?MM-C^_|~Carlv~KJ5DMsN1n=z zYv(1tjIE0I)oo0y5yJo!r5DP(@r4% zXQduQMHO0$33=4ZSvwzXUIt^Ii}c+t%<}jvNz!`O*Dt0Pc^o7k>Vj#C+>_{jLybPX zHq5RM{$mx)v}jEATE-$bG?*3y*Hb!<1x`ML=Zx-U*Wk@ke)!JMS%^9lEd!`o&iWE6 zJY&F6yI>N#5UApaCp{%?M%|j;)N4OUh=iqew{QSL&Da(S&wXxJ*Z5CCLJjBLWuZq?dyQh9qmtJ0C*lYN+K+5>FKw5m&?7RUF5P-AF zCieL2k!!P&+pmCX@jl9P;>=@o@suKXNr>(WxoG!mQ{g&vX!!Ei4@C8#-q@4zM`vTS zRcItrL=}!`Pj=>?}RUZaz9TnAVQa$(h=tY#xZ^CuC6y+dY-({U?P)Z z$Ef4j)9@sI5o=T(|=F&z`3BPaXkY?qh{dZ6ymb%NBkpX29cx}9kIYT1K-+T}$_4&&VxBBP8 zL4?aBUcj9|J1e<707zbH3;>%q7!$0)#MhQWuO4U4TK_OvBke>u_K3f5!NB`S%}G*? z%ij-x;f}w%llSiEdmpcDTu-+>Y3j&=7}OY-){}c|Q~qu~=gh`%o~V?>(5c$uw(WM4 z{h1*Eu**z^u*jF)iH88Z;eBwHMpQ`k-h_b=tS)rminXX0SEHP7ulm{gxThx@{u9CNJ+Dm{GL6muN6 zf}6|nq%TQI>#+P7OJ`7a?gk8~9cjx77u(56iVkTpqP7kosj4kx1idG{@~qmoz!4ok zHrK%2xAFH{*N3{ichk>9RmU6(f`EUSj3tVf6Wzefo=e5#kFH1u@=8F z)wqIveBk&iOhOVieye-JZfH={7oL?N7i<9R0Rg16^>KEX!x(U0hrdIFZV z)jb=i_n$BPK^}qgf0J)G&G7Trqv-}2!Pf4gFUHyWSMGG*geX3O^sboTp*TRtkpCkm zWh70rHS)VL)D)!9RI14Z4Sra0u>eF7p`YxOH%J_bA&=IqZ&q7RFK8{_Dl>u&-Zl4w z020b%H&mt$EIpZ*qj4FHp?eXXm-z(Ly|2fPlRDqr{)VoVJlZnI>^b>Zx;&u5XH&(&^A8GLekWF*2{IedE}Nt!69XMPN83AlvkZ~amDKPBY+ z{-)oVJNp9wp5>t#3n(L>06T^%#A6d0arX_ND{=(a8L>AT?F@?N-*6Rj!36`OzLZ;x zZe%OF4754F;^+jlDezO9fA;7ocdo{xDBY9AN;$!hk zmo(qb z`mX5}2Ai3Oa}?uz&dL@h@v{#QKW+V<{~#XfK7&`os?Z*>R@qyiB@r)pRl3b!2QsC( z8Co)bQ?Q@j6}=UiYCLPBPRW$w1wZ+9`}YBo5!`(vz6TKF6yuGAH9E)&+zXP~Msv|l z@4s;`2lC38ef#n{RaG}>oA?wdLLW=Lp;TaSaQjkpro+umcvCUD?fU1w8#hog7tVhC zS2R2Vw#A6DqGu`Dmr)ItES|&qm-N77Qaj(@h){!U&!X=f5Ay6FPo{YRg5>8@Zo6N@ zKN(Q3D+U@mec?zyrG+OouST7&QUf0$(wvd21MC{7c zvu*hho?id4D!yknZyn&eLm!G0i+e;ClAdg1^$G(iK{~+ZhYd2e0Gejo zO%6m}`gZfq4V1EH-nAki#P}zI5TniWAd*R9?DpP7Ryg>2K@^#4Qr84)5b>iZ0g4HS z%^q&69wsp*LE~3;s<20N_pc1Lf*TSYR-z~K&~B%fNV%WTYc9Q6+acTb7WqAZ{5z`a zT|w4^8b)h_xEIceIgH}*fE2VA0Cb1i4SsPhN9+??Z!Eku0It{9vDKt^C7l3t@6S5k z6r#WTybBn6WMIB0Jpc-AC&Bxf*3#K$|%O4XQN94~{HHv7P?c@K1W zk<$H1o+k9mty$AEvPo3RVB4Yh-W=(b6>d(VADLpy8GP;Rcy5u|VbAfiI) zSHtB7J%*8k{xD)@p4nawY8}kc5A=!Gge2icq4N!WWCbsK>nNc%-PtN9shVqww}QF$ zLV~QX?zz%+crFCklZ#kh`Kt!Po-Dzz=eW+p0*aw5fnFP8VqO>6pw~ZM*WD9J?nweX zv!twhI{t9sg(4IeQrPWxivunaLtD$TQmBS#BpS8N$SIh*bicL&G?PZ&w%N@zu$Ji zi4UH%*aKcqKOtPGXdZlZ~Isz>RG>q0EhtBEranAMNt-xn` zK0^Rn*l!I9fV5-OA4tiR2pwA*#@Oqc5AKB4F7rTZ&63y#=E;KPx+*lSsh~Ng2-vki zWS~@t56R{o&s8r2+2QPBdkV8SB^X1+I$kGNEFeqEbddIMj1FtsM^FsIevuK_j95HQ zySE2u{&|f(xo7|M)3j>*(~qvl#F?i%0(Q;;W9&o)!iaAGj9A7jZ6PZhRTQMDV{`9_ zjVxITmVC|F031TnLWnNmlPQ(V!({iP+tI&`02`7Ct>I3ucf1oUe=cfMz-l;BO)mOG zSiWyX>E9?2B2vvAZa3L4sL)Htl6fsdmIcK-h?+o?tBPUCP?sjh!4ygBRX@lJk?mg zGu+Yo$r02sx{lD5mT>~6<)k2&FC4t_y^1Pgu-SzCkYaf3mN{+|n|rcPTy)i=+TyU9 z_18mJ#>+;r^N+7Z`NBt@xKt`4u0pqp=I4s|UxeXn@b)Z$KabPw`VL;LySSvP1xlSm zE^_qCB`Vg2?9Fqs>T3GRYWWwnL*TCG!cb$Z3=$>NGke|}9`uVCRYRf<)ajmo0-8B0 z^#rmSYuJ}Dryy}0Ral2c+21X?NVkoC)v`7R;;M^Y*P1d+oYP6oR;(_rauMYU6y3y-mS}(&f|dY{<+FxH^nC0>4O6S^TAy%I2h);Ua!jy;_<|S z35Dq3x>V4=3?L;{NO%?yCL^weazYMU2IIF`2ud08v9DqtfW=&{4i4TH=e;`Gn0gv~ zvs-fbsW_@l+}c0}^Q22N?>}$n=WyRn4HGWr;fHPs5E0D&GAa}^&+^O%=HJr*4!BcY zfsVuNmA@Ag<7}&rkwuba7scyTuf|VNZor9w_jGrz*lEh3kiJX%s7B1g61xjOq2X(_ zXn0<%)POD#cfWE}VIewmYOJw0x{cfuox;=O_j?R>udBnmyR545A*+$UfRA2VS1t7i z-ya-2FsHn2Q`c^#9APVF>Z9S~u6xWqv89j?nYcePlx^M}U;DabZcOmj{rPB@Fi)h7 zwTAw(V@bw!^!nOWzAochbVcvzUmcFXM#4rq=dT;s-K|0^41|O3NaL`M8$Z1(9)(Ob zpVKsF=Ga;#K%Qi?nF7b*RJks%$bw@h=#JRXEFM0j{zO4VWU~)+^Io2)-NK`tvs&b5A1LMih@U+>jjsc7wNd&2QmPHeyOzT?ETAb-{3FR3 zeA8Yy4!y!lF<1{S+{V1{4$DLbvNGg`xnDpiUi~gybG05yumH(uGRe8^Ks#9~jttj2 zgIOO}GkwH7@ndsRqTR&2#K8Q%FKZpN2g&WbO2n)^YcRB({i|MyTuTL9T$;eE)X%a z6Vsz4z{b5;ZH_~!ob4c!z8f17oao}g>n3O!*lwCwjA+*Y3PdpNZWaVgXK|^cIWsazNo%OyixvDG}vG*P%V&@D46{ z1{iCZSDt@86d!uq!vySWsj#5YVax&U?lH}E(84&cASd8W+?0H}4&gcFI2TjN3}D3$ zul{xhtB(&EY#5c?^vk;STTZUqu>JA6zxwNy2OF3NZUDgfD+qFF zK3y3Ehi6Gl?BqYU{cown**~d%-@mo<&kK6Dd?B~i237ofzxa8*7TXu{f1dx>Tj)Rf z`K!3{|ImL*uG_v{w~ob&`Q3JZ7uo(}i~j{%{73))iKTy0Ui>H5{OkSr|G$3dP2)_bi`Ria8tPhSb57rS`hNhoi9}@p literal 30293 zcmeFZRahL$8a9eUa3>I4g1fuByF-vc0t9z=3+}<)-Q5Gh-C+`v!6kTLkbkm$ueJV* zb1u$vE_P4%(=}D~mVEt{bk+BEw3>=68Zr?w6ciMiyquH<6cpTRC@5%bBm{_$u7p(u zq$IhTi=&mTJpc-dF3BNLSPoVkGaP6uAvKC*pch3vB0&=~g2aQ*E{&-r zaTX%FX2fGn`NO(XP+jnipq-%j8$}c>bfzVR6L>rnUpsbuqLuZWPg2_e4-rzwjCI78 zU#K%EB2c5r7NyvnM+=uRL|!s)5HQ7%0z%h?(v@bC;DNo~+Ghph0fG!b0glkK>Hwc2 z5+UW|jKXo#z{U5opLmL&#kq$%Ku{By&Mu4JlG~$vnTcY&R9$AiOMW3tn0-$wj7Qr? zac1RBrT8dDJi~R+iNJ!-v$l%r@}Sb3x>Dh(ej_P~dgWHu7z78n>gP4M`mByH#=}%Y z6)8kq;g-F~GC-Xt{R-6r2}hPqg`1x9IoH^jaWTJaCU|AJD}5b)i=?2wybi4odeClx zwZn{1G@1b~znAA5sLrh;D9|)2LzY!W=8JiVE@5Yz)P6&Z!rWQ?%&?5l;nSl;$|mIsi&+)F6rn3Am?FWV_~BdK_(|B z7jm(*63~#6`3D^GPngoi&CN-GmDSVJlf{#h#nHu@m7SlTpOuY+m4kyB5`)>*`-7XA z7xM>Ks=p`l&vc{!t`;t~PHwi2AIN{FYi91~?j}r0`8%V39e*z;z{~dEIel>bN3|do zWc?k&%Fe>Z`d2VFTdV&I?03lDVSlUF-?J0?otS{OE5Jq4(ZK=m!A<1f5*PYgPX877 z?{fYfsAlU0u-B8ag&r@;#ywNC%N!`xU08g z7$cHfp)?d7-I@id$nLD}?Yf>%tEV^Gz-sVuwMJpx-0s;KCekZxjEjMnobJx%=Im|D zlx^znZ=S!HI9(mi{H&V<@3vfLZBst&93zQ~LBajSIe-S^uw4;bMGgh?7iR&I*kBMM z^j`uUVAR+;;xN&IppgE2LSWW^o!|dpe|!o9{}ajoGm-p)4fcf_qAc3BgK8E3vz86S zBHBF4K7wL;y)_g$ z@fWQF3Pu7789@l~FM~ed1ceMbgxUPLe7}7lFxdaW{!2Fh6UiT2!T+~fGC+p(j{+1l z!o9tYDc3}#U3?yL@i~iBR>`&<=AX?0X23jdE_4T;7NGgY=A=s_AO!_EVmsY{2YBnz zdl8^9D`KGn_K%BP-9X}lPHx+dMzxWzh_f@LsLa3HwLSnot8D0egiaOCY;)LDGj~He zon$T@mW^Mt_Wj|d1%&I`YsqWf_|(ghE%NB?TI=Sh*m0P%6Ei=-%zu3Y6zr|_<#~E# z2^d5hb1xL@Z%fV6eV<|-NbV`fHrrkR6GS8Z${CC|M>)S@xHp z#qp}@Leh~!Bq(vM3C`$Ao3p# z(o#D;zT8dzRvlh^QX#Rx)7iST9j#ZnlAH7_r;-w1>f=xaqXVXQ6gMwSq@W!(7w-KM z!X{2&!8WUfk}(OiFDbVcu%R}90G8=}U!YM4@P3c-^l3jhWDtCg<#R9!7cn|A|4RPU z?#2l^u&}%8T@(s((Lh^(mXWr6cv|iGD8CR_5NWp$650vAq`1()l7_Z_mumc(&+zrw+rk72N? zY1>`}s3L?(Yl?N-RMpXyUiL6;VbcB3Rr9_ko1b(LpOPYiOs8k^gP z)tPUC^2^_br_0`TR4MXyQMW4AmP_qK=g_}40Q)8q%0%Up8Bc$da+#RSmKt<2Qy_>z zMJhmg=F%A?cOQO)t=M(qCixN2#qcZFGfnH51rc8IxUavX>+Rd0-*<#t`WnP?Y2LCW z*2x`jeC6!pwC9p`-3ID)zf3)Fqt%^H<5?EG%=mvFPhciE83op(m3kuWtEwh2yxyzX zkWDfR{(Lx-mng%HLnmXPd1~ZmuG7kW#|WLu@#>eVf7-|Ms+B(&rSEG9YI^lk}|E z$D}30dTVHQ#+f^2pn3oK)Wz{a@SLMc#~2eiLdW0N*;!dxEMN*mmHe7`fev0$^RBUU zTbWw0qXbFABCbtvP}DLLi#cf74H^CEd&^8h6hsV4A$io zF}6wDAcGaNYC$6qkr{ZkvK;CU09;F!-GF~}U7rb|Z2Q$eP$?_Q)Efxpd#n^{*%<#Y z?*G(u^!~v^HKMAaG>wID@Vw`ER??1n-47^Gn?_!T0w*>=5quGvESD}D#kA>__`%yY zSh;idd97^ahpGE}jO^>;r>_@xy1(E;G}ju7<)E{xd8Ook3Nxye#h;Z}Ezgk57mB<4 z!=MVhf{~>N{v1F?9A05?L*t2rroE~=sK`-Z%Z)ysP25x9+RaiZYew)qg@FF68BMa(z8(?fEqHL}Ff!@yTwA51y7cC~f zFb@k0cgk*s2M>QCd5hR!^sT46JhmZr&O#rRyE&~SyLhmcnz}rALQy`4xORN9ltFMm z#Gk5|E^hh(*$b_dZ>uo_Yikwm17~-OR4!1Yzi@2m9d&zUsqyrQ#NAIMfocou+?qDK zH34&!<|}E!g+-sZbAf0UH63;3dVdG*{g!@}#*mJWBrvzr|rs=#W)uq>){!{Po4JlB5qy6;kD48uT@L9 zZr911n41%yP4c7znZCH`?T;jp;LV2K1FoMFvgP9wNEY(C++zwt??GI#cu+53hw9-j z0rnU?+4;hB0NrF~K3dWQL%@ZQQ`7>^P=%~={u_<{LcnH1Z{nlmP^Htp!UV7>N&=@_ z?QsByz6wkyV5F}iO;~MvH+5IpRnvC=!E*H*?xF>1xciZ^18m5l+MdkBHe0r+>wEX& z;a`ehSlPm2N~a$5TQ6zES1xH21XMwwnx|NFz&bw(s8#4ysA^f%Qt(opKgO9UA>OHp zEI8vyj%I!4JlfRhwfk$&r1zdLm-%a|112$YZ+HDK`7d46J;R?IPP){y3d`a3C@w3AJl za6uhDp@jRKv$L_=Y^g^7w;DDYx}!9X-;D$sE>{JzZ!n?@!YF7pz4o7RlM`j|?$@V0 zm;ub0GTJmcv9z{QXYOOKG6+w@UA)uI$fR;Un8F{WiZ6J(D{DTr500>-<7!e&`7=?wCLkva)CwONA=)px_JpaeywgX%UD{M6E2(#AO?=AlP-ZfNksUm^AhJT;UP>KDj7 ziQs=DEcZy8le#5tyt@?&PIC+)os!S-pSWV|LmolQcygti&C80jYRLi0-=*oNCmwKt z9gNi2q9rfH)!84PeKJdCfR8z}PCf(yo_Ijxs}9x~sT_p~-$zCzAv*8W@`49aq>}BsQU}EKkM$%8lCE zQ>oBVFYBTzckh=H>5^TfX1vM!5kgho=OSax#C<_9L$dQNlVjO| zzPxr)*+@f#?S+2vZ429*l`cHV+ts9r&{^IyQc0{+CLK(He!DTGPaIV^{+D2#?BKo` z#}kj;L`wndA^`aX=;LWCM1sQ*YFI8O5RoBZ zBmWhNtaq`<#_Rl-0X}WlNBhW9**B4daX&eevUJOEQFo1d?95+BV?>rEr{a7l;R%2i zI(RXp$JeSphEc5j(l;XK_y$u-n8h!>$oC`9f@Qg}i>JbCA0m)Lj^rEB zPT<>5!BYH4F$x+A!QlxX+bhd4er%C^Hbki72;xi@q(C<=P5ydv z-?+My6t1z||6(eypQtX|SQ2SLx66vNVavT* z&_u*R-uI4a$S|r&O9Yx0%#H7j5g_rb<&U1t`iva;y<(W1U~!|pzTAa$#MhuJ$GKi0 z@`G+}^NVE+nNT>7pO+w`+Iz<8;_fTpm(f{u!@yV#r6UDlb&fAjYd?X4mG6$tx2fSH zMqdlXN$uDU&vmsMYn`F>u<7SS{Tkzz^Ot~emp6h|VE$`aGfWM8W*aM@)7RDo{Q*=$WFu*`+I z;$5uwjhr%t{O-axiqEcvAnU}-`zM>nXZxqT3}_JG#MPFOk$Pk8_b*Vk%>;~dCWJy;d+RA+ia<_|d+HST%c+^{W4*zz zvv=P{#U(4rWF6)y0~s$x9>+J*xa|7fHEJpDG@eb4G}y*FKV5m6n7(P-k%YWBop%z{ zcF~5eV~cZjPzrh}n;_T?fyQch1HF$hWrzk)U?Z#aVffQ;!ip;Kti`{t8@eLqJrOu` zW@fH4BL9$84-8g(PTmStxMDGJ0tsj~|B#=8M!GEF(Z7zRUa11az9y^Dd?7(8?f z{!e15M1G!v=jz$ws{whSH0buJfXS0)?|~|!-IrZNW%ce|rUs`mms}-tX|{vg*)&Qi z>`507&B0s1dk?{~Rlc;H`(JOo2m0!FvK~}~hDl$~*xw5_Gx4U>61dzG3I1&TddC8uYV(ncRd$aG?3`J=a^StBoIX@g>bBHEUWgQk1@AWpVz>ziHi~M zYy6y?q|@OFZy0Y68g#AFV0slPqT8b|nI}4|7NwPr&k&wkM}4=*%BE$kcov~ApznYI za8TbI*2bIq8lqWbkO3Z37yu5IxU|+$9=tn!Xo_m<@~*jvdsYW{5&-*i+7-x=Pw%p>oZ{6 z&05NHf8@`n3^I~*er_}P$cq7$qj7%2(6FY`!$8@1Z5#;~;a$V``X=!)l;oVZ9O`Za zjJB3)y@|ELEyTMAx_ftogmRPqX`Vb;s2s8UO*)D_h*{v>=qE-!{bPGogV@@#i3+($swu`=P%q)>60dh1K2G!uUI zo$w>*@w*Maz5s;*C>?)Zpx^TH(ht?HxYX4A)=K5hQgnFTyvPBzPIx?=tnT6A?zAS? zZS>1_8jkG6DBEeJd=2J1){|q5IY*Scxg&>}G}?^3rD-)5`#l;gU18xdHd7K_^60!y zvrM8e(?F|Pd|fu7$F}8%y$4QTLUn3VKi5h{lQfLZ-#wFH6`5GPOW31Whvcfd~M#QxmY4%sl#o% z#RIH{yYdiO3<*iOjvUb)1@rb!eJvuCUs#rhk@3G4wwm+MW%BX2)wEQ9*c`;HkeQILzn z#Az4f$xMETyG(O_VZGm;sqSQ{Yu`IPuCQ5U_}+qL8(MMB?Z`kAn`$_DPuXN-_5J0H zd*Y_^fm;#xm5GSC3NP}~39ifLrBT?3d)sW4I}%O&UfNDNC6f`aEd@{-g}OzW(hlF1iTB zIspyMx7i!O4mT`3Edyrsne!Y4UboXi1TRfJ=a&@QAi;d)@xX6cyV62(oQ$M4i1Xq0 z_jD_19Bk=#NLNq>8%q=6`(ADO8<^e+Kv~i=PO+@IYB;i&^P}qz5iZ}n+qBr4!A@g3 z4_-g`@NR$ZnD`%Vc?Z71FKOyoe%zr{6alDZ&)$vZd`Kv#*$F)Xe?4oY!?FAt@Nxv= zNoRffMRF@Q?OQDp*^_YOsqyNCkLOu07vyFaa69te(`R}lRq1JKdLl37p3qZTWV*%`+a$UPM8fSDvRQq*{&V-^4%okMIY$I<4&+o~j2_ZTxa=U$78V`@ElS;)( zMMgZM1}ha>%~W@?j0Dv3#EwVcG+etU-==y3EOSCsvOV3K$7BWYiBEzjaYM~;TFAVI z;=7~T6PaL${22qgoDX&RLXhIc%%MrVxq8{8-(&4x3+)YXCIzrQ>)>T%`4Hl+(sLvRe1Ffu zNKoQOI{Rzi(d3<0T5xCjuJD`dx<))8%54nh7hL#|zP6ilpgknF$L+u#0F$QN4-j=8 zek1wZ1iY-#U?AIN6$Y15Clgs+U>fI@Jw1F_6IDX<6eSsuEy zB&ePztrgL+)bXPMAJfk?^NUO}dPneaB;Avp$pD1WI`6n|*RPg@*B@@aN4SU!Fgy#z zYZ*TGg<1%__W#?AQw*Wdpp*P`!ocM;g`PjNRz}H1{rxBQwG4TNri9;XzLUGIx+MZYg%82)ex)Nja6 z|G+2aX*8D*anbdh_=yH%fpDFmAE6jbQ$_fT!Q-KlrpdTqBQ3ZYHS-j-f8SjRzE20U zil7o50SEhpO$9&9#t<=^HuNL;-iPIK#keXZ&76E6$eJ>>Fb=GojKWdWXTehcKB8Wp z-7e5_V3u+@o?{9O@Gf;fj0!YdB=h#i+a4!aJSWb3s#k^C(8tx`=mwrXjyc4%vjC-8TP+yq?G4s-&CIjo1OHji!Ra)pGrut}y1aH_UV)D_Pkt?O|mRZ@>l1Kar$lh3i z!dZ@wbkbvNqK|lzn_T-e_HnBbnBh0mtF{w=X|>|fM5cch@y+X^4Hwistb4u5(6)z3 z6URjB^7hP+jL*fKNs)BqNIi!uyVOuG%$W|>{3^dVK$LGJJvmqi3BO-HUMgod8e80u zYa6PPPP+hl)R~pK6hnwPMitqXYD3Y=2;5MArw%Tru`hI$IQUJEe z0P5S)Ok|W{UN!HJXI0Rxwlz1)c;_7_D@()kAPdnmrZ^aw6TMrnI_~Ilhz5G=f+Jj% zRR2iG7zWWJXO4@Ona)F{? zT}R`Pip)(~(yJKQO7cEk5Vv~`&C$-Wy+)#3=Hy=DWzUI^Dh}@Sv9{e#4FKPO5^srS zVl}vO;29*Uk+FED;}A6(qQfR9g;YzO7=>w-B*eU6;=hj@8SgGHf1BRb6xUN^T)lkK z%O{8n5PKlJt4{cpGY)JD@_4>hU_OScWKzInzPZs(<+{Y0#88d?mDWJecsYknYyqO` zqi*TgB@jRADt?D)hpcY-#RaWVC$R$6ppp71s^+4bT#=|{SpMRiVt1x_KiXHr*o?%j z0)6?BHc3Zn<0p~7^}^aYEI7+_yHAP*lU-0d)#7wa{`S~cG_k7*-NdjzTH@O`k*75I zjwR2x4$3%$yR-_iO38f5u=e4$qy>Tu-%o8T%~pVF?BEPlV@mZ_a{NGZ{6Wr;RC$dGG*RfJgzzh4Ddn8wI*ga3Ow)I?3 zn1y{I3+hy|+rdC@smZP9(f407t!Hw_qzRVFcA_o{vZ={TgQ34DY~imCh*aHkEgdzq zesqb=mLL2oAr(5{R6X3b0NZU({FDW*zXMEn>07etblA}d3KEwLNlg?eO#xG6^R00w zKfRPTvI_2HnY{|s@9J-pj_H)>qu&VTH$E363OW`7pE8&@=8wc+zUr;WdF=xI>X2R$ zh5FHQC4|)>JxtDD)We*f64thHtwJ&0Nsjy8O9S-<`8ICFX36qPbb63lY(6&sOwLV` zibq!(X7QQA{MpR}e^FQfZuFtBiNk1>Byo^JrdBj+5l!HgMC&m`39@__ezAr@R{6)V zt0SWFq%)vbGYAEbYZz2>O%PenVRoZU{Y0XpmVM^D#Uf z0wx6Xx##X}wT+znxtfs8X!AmkIp(>qinAbbWd<>(!wUE%ak1<~lxImicKAqSVR^f3 zzvp(PFz|{d@lyb+Ok~An3W#iYlIIHfMzB{?oUT}dNG5LljD5DA)IxKFbedsnxiNOu zOER9ebBx_K@BQVA2s04}IhyONfv1vMN9gWR&FE^JZ@yWowOj10@S-DEUkJXdThst! zYfC<=!XfCHN}Pa;m@zM7Y9?NTIpTzOrecaHD$`p}EB#oBs@}=5>$BOL(`MAk8In?G zf}ExY26A*(`=o*^R26Pd*3%LFLFEz8=S}Fow1j0v_e}l+Cpoby6+0y-eni<^42M zG}qp;wOL@39R2H&!g9TcsA1WQ{iM+q)ZIsp_>2jg7gTd*4Q(s$=WXv>gNM8hu>aR1 z|HNoyeHnUubTn_#*V7a*V(ax_> z))7O04F)Z#7F6|RL_B0W8BlgFy;r9$WG9K%Xa7OhU%E(iB?w&b|9mejJ8&B}?Rr{7 zgK5JC?R-*_D_FW>QKW17-5j4@0ofVZ`ynT*$D~0_I|+odF&p}!xWx)VLIQ>#yE&_* z*e_Sdj03h!G?GPgb;VS5b5*+{4FuRXFtwk`(9ytI7K;qz+W*oQUqB8Pyj>9%TUJEc z&1J$%6q^TFedU02!Bop0)U$?O?5|0%ftO2$)Mg=T;PiXntrSCjs*--8 z&RurGPDZk*?C@Ip_uhU>-7Qg)C3s@ZalX|OxC>ES-mh_GS=zR}bnu?`m5-d;=(m0N zVLo42>MB@$X;RL;-&S}ou1?&f?wWSmaWTei?U{XIWKLL|-@D`S{P{=8<>P95>ge{& zvfpV^zwv8p-A#vs^PcL{q8vv|$hIKw*`oTQBFSfK%om%b8&IV`cL%Z+USyElTd>`V zP7GmbZ<*KYF_aZW=A7l#!@ZjlNxNOt4VU!xi_S5d;pVzP9+8)l z<}xD{g8f+QcvW`;6Jq|h`bMcaWO!pQN9EMucOG!`X7s0ki3$~&g(~Km^IBX6A5lnk`@MyWNxQdaCEa8wwGH@fvf zQOyGl@%}lfE`4u}YhbRs9)7AkE!DJs7!h(>wJjwc6`R_ZPL|2DsF_~9-*YfN{yGiX z+U6BxyhdpvaXNr*p(7Ab>FAl!=dIkK zs=r&{Ps?W?hNFma!iB4JDr;I06O9+ecZ(~ExO*kx#}@UYSyH7Lvb$(^=(~G%7n~(- z3~s6smkLNxwF5TR6-9{B(*Lj~BInn5HvKY5oBJjH69~p)9eK#UjRizg(iZmMDlJ7J zkeFdRZaw~UzE0~xj?jUSA)qqHdpRjFziCA4M^P#ZH9pBqN#VK4%toWCG z5kS!IhaR}h|JF-C&f+>)ojuh)CiyJ^^=z?HCU)B6OerMzeQ`RK~CH)}>qIC`6w-&5LHlp9y`>6nM<_ zULQreHDlh(a1Hq?ZTQG<8Cd2*_qXekNfsu~G?!sG=Nv~wwWVUhM`s#MOnw|$iRZY_ zXmC`Wow$Bizgq5bAmx)=>Cf*O&!{)3(I>hIQUxd*S$fX!7Z{>$yPJtVoR;EfONB03 z9*eozzeqitTtrXE2IW}v+72*{u?Bp|UH9GHpje`vHjh6)AG5P{B$H0!4j|w;nJTX# z9@D{Gh#%iLO&{!-x}D@7!%%qZ%tN2wRu){%LhC*wT8H9(YLj)N@MHbrBryJ{gJeTE2ut*s;~naF>*(O#xtiUX`)=jn_&UYoGT9)o1w!lPiJI+iXkX z$@rSW^O<=X84;e%N*MF=9#$szUxl$}w%*^;FjJR7t@+x{K^<4+8QR{2J?LE)pWZbv|ioMTWDoZm<4Yj&6F;Gf?vBgV(Gr!L+)lkI4h8Mm!G)Wi*<2qkTGA zQ}eBLEvOIA-q2i=YPJL_=_BM-huL4XVGTqOfVG{H?M6d?S|@n`yRtDm^x^46D&urTgdLZ7qW;!piJ5nLQoh591%v z0iii7SLq*1xkI%MUz%YfD()z}X_FGHXz}w|?G4Jim=xtr$vB2S7nY?S;}A+GTwpJr zexfPw9eUrZk>`BDek%uz=*{LS%eI$8nnJ zzp0);p@MiP_Kt;+CGY!GR+Z7c(I>v7#Avcr0c$SlmZM*S0dhCr*|{ICQt2 z1w;?itym?PP1i-)jGP|#bh>LYxASo@Qm!Ck1HJW>h@V8vnqo?so2iQu6ZwYf4A>vD z!Ox%Pl8zp+WfaHK(>>lk-E=Foznp*1-At`VlJ9Spb-bAeJWqO`ul9UB;4yj3n(0wfi~YAN5+2+%w(W&+M2UY0ym^B1Qr#y z$aF2=$K6CfDnB;)+@?(pgvMkOLIGLrl(Jxp+^tpK5&d9-(xrtM@9M_?EL}IkH5Z$ zQ7(@vYxWt5r!hq0EtKW%SKYiVy04`;bp|YQ*~$P1P(}Z(?JnxomP#eVRvDef)I{oW zI+NP!TleRU3}u|%6dON@BIJvEc0-u)?u4+XR8K1AptM~p3eF;MM2fKL4C4v?IxOP};Oi;WTPO#1;DUoekA&gkl>5lzIUeaFWN~5C!lcV$6#HhO zU^AHjuhMmYqO?Sr8sKDft47C@X@6PUSUUC!{tr2U-rFTE~MxndtDKi%tC4!%ihlE?4az};Q`}V(XSnn?gk@Cgvmh?3_ zoCF`>2(EpqWu^u{k?}5mKd)zFA}pcb&Y`0^3$%FU&tBYi6Y^~6c1u~7w3b}CU1+Z} zZa>pDWtng|qZoap-Y180x{eWX%Oq?!44rLVd`nnEFY8ubBTt;yY{uF(Q@6TQ(%9|$ zxw~br)=qv1ox!YuVL}4!9U(gmoqrmnVtH$W2IRY95^dnR&LQ#nIw<7UOJ?J8+@u#ptbmYstG!4TD<< zOR2}RIEmJuI~B#qbm-k)O*Y_1ce6!bAKFXr@KDrwxDHFyZ0rr$){wgB`+U_7W^XHG z!P!UkA>@h=QAGnaMs&g*iu_$}E3(n(O}nG6X~QbLIivde^0S**}Alsx#z?dxyR=-XLQ;wu7#tCn__<^h4%)>7%ogJZ>q_%69 zS7ufG@`T>BV5i8@BFWW8;E}J@?0jF&ld}adbYZ<{nW_3dx0Zg?&-lUMSTNr^TE!m_ zn%Svuve}eWtGJTFWHH~A_7wXB{FK(xIKJC27wNuy-?aSH(m%Gx(PX-s-}<<1)aJwz z4a9y@T3hvW+gby9%Q{d@d%kLsS3cKXy#jUXt|$p(#5QDp*xxq@^!s$UBs*$r8JET9 zr?h)x-3h`=HP$iDloNm@7maG-5`Uy0C#bIxPi3|CzNk=?3Z~dU8lOp&a?Jr;?i%U} z|5#QPOP3x0*fX_8#!y={-Hl?yDR{?df%E(zHN^>T((h&JT+1+2h+QEgk1m=^rF^D} zxcyk1OZ@Gf2%|zv@pzd~xuCWk>jx=b{YCpVWL_2;-<`XU;y|m z#rs~ST@R1wY=JjJqY~w=pTDlS&NT`nq#?eSk4Ov|WBg9@OK|S{vd%hzvpx8TF?GH2 z9fmM~{+S5_=mvZ{PrD@?S;x9ci;fv;vC$k-#cT>>!QPKj85Tc^;WoT5o@1%ZelJN$ zDR(e~Z9+-@jXzssg9c*xwU8adp~Lusz>*u=uP9+I$i69ZWI!_^C4bA4QNLX3>eZkI z(Y5q0TC^t-CxWy`D^GLUSo)L9hA>(+>(*u>(v}}V{M@KdNv0!Im`mL4&Gk=$id|}7ehnB zyy-}X#;{4~VtiX``mT*ThR*K?vreRvzug)gK)*RmG6vY|lC^5o#QHqrizdW+B&VfR zbfoNTHZ7$H3r2vKgbiLNhzuFbLyCvcLgL@Tc;+m{eZGk*?ny@Ox^&oQZ(>yN}Ic z_Dc~dyFEUXx0?pe=kBSsM+7kmdp~CB{^|~&zS9eM0r`FcS<=5(PSa_|f}gu4DoxYd zizyA|MGDyO{l?-|hH=L5`fKPQ=N)wIZ@Scgy8Kt^+g|eg2Pq|wC0ckM6{;?rH!tbfI56ykhH#4hOI6MeVZUTZWp;JPzN} z5im?l+RoI78g6TgER~BwmOaVVcL9j3ahNCw7u`QQz6>7d*1Y?P4>7`R--=E@N5n;C z4#b#){TDGt5T?lz76ztIiJXE$-rdx1!2Vn7HF({bbc7R5pz%uK)NudKwBND8lyvsG z$ks54Mr`+;mLMvDsPP6cD(4>dHoCFCro~n;ctyMb3$8(`2y1RiyFqG52^RbhmdiUu za!U6g7fRb~gBNvBp`XhhYUA?;9rSP3S)cOPp;Rt`UderfdCC#m2tF3m9M`#aR?OZz z1DG?GB*?q@v>^(7Xf~8O$$wMP1}LBdZ#l6>=a($I^QkHh>9EjIsIcIK#0HGvVbkTj zzP>GZ^{-0)!|{_Vn8C!{b&iFryL>kIR%{>zu3=z4g=-%FFL-Rkr4ZW#J_Sc1mN);M z^WUf|Lh=wxBh>{d!@r>NIHh6-g?yvyz38z2V+kO1q@UE#bgzZvaU6pG%$^%iSAar} zD8Byuz3H#mO(~EP{iIfIf&UA_o-92i+4zMw36l^q#-CVEs*n;5{=cl~05B!4kQtM2 z1L>c94&z(M0<5i}vwE!?^&bg6`WL&g$hz3Br9zISsELomzznFC^7l(lxD;D?!p zdE9CDz{wrO*&5TuuMZV}A}{XzrdT<4pd5tGV(aN9s$OErqoUiUh74M>l9C|)Q8qZx zeBNAx11x``06}8kfA1MOZ>dd6!_ZQ3U~B44&urO`#CYjac{GmY>U{KuP}P1VZ&CD1itO}ncHNa>>Y)2& zbY>$+NiVh@ZadW3*!#ht#l#f)>M(OIz;3jaZu(xA(SITN$hD3Y8ADL+L2=>x^Rn!w z6&GH^>b(Myv9%|?NCWlKW8hniBU+lbnkv$rlJLXJ#$D>Xq>uIV z<5y83g{E4#+Y7xJ%49#tYmN14uM<2!M1~aN)BjOvyr>|$+jCLZG9-d#r3lwZhq>-t zk;$QeuI{JCb`u{(-OuA-U-v6KSh7--kxJ?|Eo~kMZm#@Pi~gCGTI09%-f>vWaHJhQ zvQGoH7-UmFQ2tDOV*vd%gj2HQU820nxt`Ouj^0K!d+F5UtCR-Q@qqZ>hNS2WJ_?;v&=A(aaim^@=6VWyMpOS}y z$)kcoL6~inQgp|}yb5%l)5{;nMoJR99d@E(d^1%|yRpXXbbv=_yST+-;!_Cv`>wcz z+N-QX7|CQL_SMM^LdFbGek}IXC=uO%hMrw)Q62yrmW3EQKsFVEpGC{N+ z&tBdJx*)A4GS+S{_n%H_y}cb#0bhH_*5*t6;a<7=pM?IYXXMI*!bOdKJ@69zPJ}&3_rm1I$Y4`iLA^7G)vTdK_U)-3CNJ%WjA(uMw8%}t#pC~fvm@_D$^))$538MS}f zxZFT~1@^Kx$Ck}KkV=AvCRQHGCp{HRRLK(#9mx+(A6_xewQNQM`C$IBPlF2XdNuIH zV%slq^CKLjmyj2stgIn+l9dW3|L1l>OWv?{%=iMz>ArZosey5+$1s0RDOHlwr#iV& zGeux&%@e;-<+-B=-!}#LROml;Vyu*q8W3!wx`lt7OAalvNQDpKd>ep9{IPx)GjYaJ zRImUyi3ZQvV*XPfmKUosf4V8U^W8-dw!3tdy#ck`wsbnkS{g z34NnGUuWw$(ZVIfNC`DuLIC{1t6~=F>hO4bH66Q%yfgesB#K7T{vD=t)}!JYZxPA6 zTcm^nO+mLJB$FBFKh@KeDrgkc=P_pB9XRUzeX_=~BMxzYm-pL!u%ve8m&XZYZn^qN z7x8qyk1?_3?9Q)ZlJyYA2X>71r)#svcR)i$Ik40#i1We0HFHtLKw70TNT-ojB#w*i z1H`+2+3V|PcPnA=!IvFOOo(dXJgf&U_dNwd?D5O|q~#uRg?*|MSguTGd;`Hc{!xF@ ze=lZeJvOh?T3cfhPC@OO^NF(aF9p>Ev*p{|=?F#Sn2b=hbaapwdzeM&R$yft`au;J zeviwQB%1948RMCRKOVQ^RvhvH4E9&QzXcFJOv0F+*itQ>t|*r)sLN6cY0TOj$4EzM zXeY>j4L&*LPI$4T@1YLViNYkXkxQI~cQ)v`U2$M2qATr>DOQT5B@=~@2=?Gi> z-FT-!M8v{gk;DW;t!Rst@hJtyA7@2=(PFb)w*0!(sV@ZkB(Nbe*F;iN4O19!=`?=ev1XM=oekjpTelP4x zJO#{84{N4cCR%3G_Itfp!;$mjSi^K8B6%(@F1GhE5N^e7j?5h;Gk17=z8|ss$y}a- zf}-u@iUZeEH(5nhRn@#h5#@ikEwM$MgHL%X{^08}sz+8%&c(ej!}imH$49^HmOVbc zm#yZ*DNdE*;pND~A;o%|cuk*EegmaJHs?panD}@XWUIx!+Uwzjel;&IzMJFCY=Nd- zau%Kl7#Ns}rl#cEv*{vHt4HZb^t9IwsBZ)^ecaC96K|gX0D&Y2-(if-JHIKi_&}<1 zv2AX%S|qGxvc)kGJ~yZ4b9P8eM?tZ30BEl}R9JVKU%EO7jwCG&<>!~lV-)lRdcQ#< z;aDp>7=V5{oLW>Z%`o+kOJ_2+N{RgU`|;oVu5${f+3j{sOR2C$^t24!xwg~I!_Ixv zf~F>yau8867Qq|ETmg5j?{lrkE2~vR#Mnv>8!d%x0ea+f=Ew;Cy2!{ebiSqzis8!H zZ55PMkr<`Wun$MO@84j4RWckkHyAoT+s~ZcMP^6$+Vb6jjT4{u!ia$aayhNg z1m{A6d|~kZZJ{K8>Gghdb7fTzARR3#I!TA+WT!Xs%>S!dRb8Eq=YApL8K62{gc=`R z*VviA_x7{l%}y(N53%{uI964T4Yy&hqkNMevMA023QqqSxoPfRUwJN?&X;><3PQh?3_vI7l5q5Mt(c?7)Z5 zs;`jmcUx*e%i6rwL~TB^b>CvOEg&shL-@liq(hawQCBFg*Njg)U3>oH{+^orhb(X$ zPgA(2s)+nDF7r3n7oRU`5F_M%6Thsg_o-+WG6`;nsJg~x%Ul7EU#ubawG1zh$Bq&G z3BNk{j=q>GxkvwcK*GSNu1322!>UuB^?gx zGw`cGSj?jXv$M0miVeE#`APVk2Fe(l(vMb61Isn_UQqx>1t>UO>y-(?u=g%l^mKFu zqR%;I`N}T=r^-G@(Xv_(1^=hLuMCSS+WJ>15hO)KVvueSkxuD0=opX~N;(G^5Kux| zx*JqLx?zwmi2_caWSvES(z)iTm8Mf!mui3@~V=wx;|v1Osq3Qfr=39Ia9YF zgP>r$;MhtY)ccv>AdtcEqT6+6T2b}ghIbiT?P)9CTKf|7CW9$E@j<(Gs!UhZTWr1D z2*DiGYK8h}xzcTX{FjiZ1F?&F$d7<7>BU!Sp%Re^vX7mR#R8kTpea2s*qeekry-b! zLyrPtQSaB*ET7&uTx~HlHz!M}LBV#hU$oKE-p3P>0X2 z#32_~x0;lcRFyo{ogiESlzL8AyX$|jmUbe}quut$u3Zw3Xzlewb&f@McVb+{=J$}} z9vynlstP^f*Ag#^6O<4WNm3?^s4)=)3?+V<`nBO)>0#^Ai)b7BQhYc&8hNyXC&xMS^QfK7UoA~fTrHc%Xx!HPK5y;+(_Ew|=o_c#^ULSWuqD&8uKL(SG zgGOg-Hl1N(PmTEN79t9Y7NCfH)Vr*$-e`K6I$B<@0a3RbR@9dKLYx3Wsg!Elhd=tF zwF$EbE=gH!W^N{*#IHn_NZsX=THvz!ELUjaxva3v%oVOO6=kW=o zxapR#4qk59HzTF;`o5#ual1Z2E;BeHhqP`;T$$lSio4d zihwe*z5Qo>tB|LG=ta;pYywR+^_>Ne#%EIZs3+8&& z-g&*GL2+$CcQuj6s2a%Hr|dgHx^o-*xO<}Tx7ypRt|Tkfu|36FUZ^px$X9O3Zk|xCB|Ivs%4fg z`Rqbe_@(XROZU%Cr1yt0ys4kIPJZrX=YR^xuxlqUlvj{)g27fXb8Iiinlomok6x?n=&eY(Pg|$nsJVBJZ09{X6V~F(cJnQ_ zH|Cr%X}rfozV>dV-s0sSmdTVix4y7F5!F#Yq)TpV?aCXfr5mrK8&&MVGBYz%^wGEbwcWo^xhL0(t^%nI6aK+>qYk#r~SP(T*~#>pYa@vs;UW^JtgKZkM9HOCJan zM;eB{>|-z!YUyFtMMqLUu2YM+@z?fuY7iOuXGamq$~z&=3RKq=hZ?>6mg`6SfgcxQ z?&Bw?0Sgh|TLQV<`E2{{^jgkthW1DdMRv~dC&SP6?aO?lBve5w&l+lp^bTg^;G(8M z+S!v$U0+&6e9E`sEHeuu>SD48r?nn9NI?$NulAy>qxspKI3zavo4Aq5pmk{Qwi;AJ zhVpDRtT~qdaG$*-kKE|0=JhC#Q#%im$r1lLsWAT@^Xkiw}q;x^?Ok_^--TIp05Uk_vx9B@RrU^Ft?rp=U&&*v zjpW()4Bnx-izcR;-DHZSo9|Mo^a1!*pINQbKGsDXH_+Oob1m-j96KGwB~U7c-sgUN z>~*rCcrxcjKI1&T&4w8k-6HamE2lG+m3F8+zBe@z@&_A(px>Q|lz2FXF>d5uMJ%?s zX`e5$RiyJUIJinGNI2d=q{u*iakj}z)9#LZ$L2_bcJW66pl^6tn8{J{)2jWZ$1R&= z_@-T9*_&URp2>zLIt}mfT_rx|JGyXQ+j^p|DJr}9#PlbJz1dVYMDJn&UF$_(0iwPs z)dL~5oRGy}F_)3=os3qm02)fl6X;(l=vBtJre64F_<)vYolmG4l(3?AcX>RQ7jVKP zDl>e}M_HIfYUVtjh#?P24`-)JUJcTW?ZzUSP+1FpM+_0NBALyydvtv?b`2{`!^u*Q zLwJMASy?!8{V>ieq+wErKb9gt>NW`aOzSAAmRVA|?@XJI5K{d?GkGxIM0a_@>pqdD zV2(5%5qZ87ZwYzcA9T@d!j<-jAvV1PM^_{nJKrI12+mGJikhfT`5n`w*jNQ^BUhnF zNZ055cGyyOhq9qXpy1unthU1ri$L2vA4rwO9A_j7}7i?rq9JXdHoq+oHFfl+ui2J zGx{=+#Z|Vf%b0FKA${3bpFN{Nr*D3u^$Yp>+oAkxI%t=s>oo!$AW_>Ysl6aMdMrTq z`UwJhBK1`3ae>z+bX=dudw)Fv|I+k$vH9It@ti`TR&k!h)kWwm7(svjQS5Ci%Kt!~ z-9n#+6ZIziC0B6kLgXr_;$zkiFcxitpQ9ZE`3-%8f#JDJ@K?vdK{;;sc zfI*y5N5EBv@0sEDCJKtYl3#hDwJ(FF5%3vX`~q;+uYzb^7~QLHoE1Oa%{d(5Zf2E_ z{>TJ44e(!l#u zOK(6_6j9rcnd$k&7xbTO#<_a+*SrAUZw8#aBsf}4G@~;b2Dht|v;Fwd1@@585DhII zIUx~9+rcNXpoxhGABP^J83mVJV**a2x|f$X;Rz#MBy#0NMMd%ZQmdiaCTmeG4ACsT zO3J#9Res;2*^+Tjm($n+P^XglB1iysx{b@L8X-xx9=D^ab#=Xlcrs|^GFT2`@ zX?c15@8E^T%2q1J8E`Nt;gvf2!AQkhVRd&89}h=owH*XA`?YqI>5NjS1xv z<1rEUq;8X^tzkd?A58SOKHTp8+qTq~3-T!Ex|(vcmf4=hzPL?RmN9J45O*=zCjN#F zbnOdwi+%hG=cSM)uZoBGsvDLTZzI@J(oTeWp#AC<94mw{7@DNNx=v6JacQ-)_pSev~yeMV%gYo<{=X`bl_>R zuxoZ_8KzyAJ$KE|`b~87D}OU&jvSkK*gs{TdiT0N@(-Uilk8W8BeEG4gFAoudgZ-e z;m;4E1Ak0~-@=Q7(ZRUlHPGVAKeqJ0ZZq@Hg@cD)E;|DM7%snVEoITPzNM@HX~G|N z=C@o zzi6%}gpSix?o)>KVO;lLekD!#{X_=?rJbL53jIyBICNpxthhO21Dd};#)pH3EIEL8 z;O2Gf@ejySe?fMEz4Rxa^BXduUyxD7IuiU1vXx(utq43w!1;^ZekpXm$j{6$=f6ND z$LzKt0Pc*8=ZFAEDdiUyh&M`$io%Y~5u>`|b!e`a zlhJ)mVcoF)m9YcuHoPp&Z5s|_+tHShVQ}4qg$_5k6?~LttTaEshC^+iXliMlFE`zZ z49-kUto20BCST2NH0j*C4mu&R<*(}C!9nn6PiPp17@OD)J$jzrBYKdjce!y8Y1O|$ zMk6ZS$H$1#D6(@UVZCYbIGvT9HP0g5yVP8G$*&@UN-RPx)k(POHDf^2o7vI`apW@k zVB~2jBz_zaI=sAJXqOpVd8h{wYaKsW??S+Ss#037fW2C+EK-%F10%oGq!{_0;T8ky zie{buh@$*vSPRmm6AWE*vJ5Q!?D!^G3xFrXbM1?GGJRaPVUNuJ9|Bd185Av7g!g-)1b@3k7-G1SmW zEK#HFjSb~$2s}RmEGLojo3bxNzu-zMuK&`T=fr|}eYzPlzGWoQy3YwEr>0icHh|E} z%E=c(yT5VK@_gz*u6!oIrx5lRcG)OOE@a`(kp!amLL~R^%Si|7f?A!O35Jn~i=Yp8 z&_#ew&(2_E;}-$Ku4;_B1Rp=b-@ENh{CtuiY&>tQq@bjAX;@`~3wg5rBnL6$b)1jK z4SmU~$wck@aZq=(8$zmEZFUoa+U8rTFU7dt!g+DDVXGY+GUZJ5IR>LiWo$S5=Bp1~ zaJRAN&mC@unB;tBWZ;Wc6ThT#O)hFmsz-*GT{Th9}_3bYOf6S5l{>b0c8TRDHd`D$0u_&t~T1AFD#GEi5@J2u@YI# zld}!iU37G6H@tj+U*U@qe;A!X;)Xy_D-+d{`!ZCE0aff z+)W>N-7SVPno->Z7u92$jWF6 zNU=`!gy|L0oqcC3PGma~PFx-%V^zHdP)jMOkg#xt*3ZwcYF{jRNMrmyHMO+nR=Xp; zL_h?C=_C|snXr7oXY9L#<=L<-4P}`7=4{Mx z!_o6`28>RBe}7OD^fu7l7oM~VQ)JFi3?(1P)AdCuX5Vm-kLT3w1|8$2@x#*Sxh>`6 zRjrC)=syG4P#zR+;_3+wtzm;Ev)u|l1+R_RXP%qwO!j{W%&`Q>s*WXKlBTm)#b_bBIjUH~8C&E`*ur}8QLn3hwnw~*x(pUSgaKM|3@ zBN&wYy3eZ$tx(W6^nMoPU*C0Z!72#DDMX^pbftf$8)~cswuw-* z8@eyqGGH_`P6r&WSfDfw5i>OsJwkdI9oVx;$CouInUupRW4{;r3XQLG3D2v5Z zJg$`%u)eu&sqyR<_K;)o+5q)b-8`|9>qnMeNci zY*_|Ye=2>eRcs&^O8#B*PGD{>fi<>J1dbuSTzDR^iIV?8WO!&n#Xy4sF|gXh@8O!w z^bX4df5Gy=3Y!>nTwcq{g#CS|m2s1Sq9ld^Jkpq$(YH@UMg7kSsh+igvGp&Ew)&@+ zqQW6wKbIJ)+t<3H$>Eh%fjO})wcf|2_Mx|qZ!UcCn5s%bLS}y`E5@?YDc>I`Fjr3F zCVo5~19_n{dZf~Ou(pT@PJlk`et{Ir|Q( zr;2Zc2^jbbf*X$pkeb?1lR12wiO-qryz8f|z0*^=x_g8DChai%V`;*K7EesFCh13J?d>;(#SGtO}`UWLr!C)cRYWob<{F6P=J}$bS7v=cU_js>Tx%Sb^ zE$d34@TVmS`$qnmnI7g;71PPH?CxsL6on%4hjim}F3kF^E)II;LhS5N-Ghyj$ z+%YU(+AUSVu{l6<}`|!7U(^Dl!ZY_mz}6Ep9G0UuV$@sbwg2Z zTYbsJm|F)AJsW+E;_IPmX(RYSVRvn%d$pa~v8WZLswoAEG<_I%YFAM#v^;MIK)(3u z62NAX4$2bMul9$DxPeZuC6HXFbMgoUr-0lmi{YxEYJbibyjRUl4dJ8ZMHn}H?#g~D z>TEx|^#jzd#Xw)7nWETuPgo#u-CL?K??@^oB?WM<(Whl=4(T?Bu%y&S)8%utYuq+r zQq@>cg1^WGLKJ) z&@oYPJ%GAn_oBL3o)bhZdMXF6-Ra>oJ)U-P+G!!`2oubZdwb*NEzH|Qw32Tny>8KK z87E30viTOiw+W;s7z#^3PLL80d0JVxR1zIP2Zk3{+bO<0^KOn|ill@R#7(011>c7H z4ktFyb=~t@yhLOo{j=cm1!~Gq4#Kqx6^N#~hWz8$X=tp+eZ@ z`rEj&(MF%i(7jEyAJJ@B$+JBTJ`CY7>X&|C*KiaMLf%A)@VNw~J{d@i0<8dP00XAm zrd9ryWgJVdz$;-ovN@ETKMQr5?Noh+#dE;JG%@r9m8s@)&T$^LBL_~=&fLl4?R>=Z6!mOV(08znp2l<6Z)|GG2f|pw z1hXz!4UsgOy)xM>*8X33e&G~I^q}lk85S17)zXqgzdy9DZxcxKSF z>b=DB3S-7pecm>Ue458;rE8lIAh}Zi*P&AU2*@C);A1 z5L_~D=wa{AZK!BuJGb4X;)s6E5rnw}xqm^kH)2I8uoKJYJTUEYTL%1imi_~H`;!?JU{*rd?v{Ee{_YD|I+p29Ootlog)IG zj2+GsD0@gv_jn@EF$^lrfIT&^Dvj69aakem`x^M-we=wBWo^h*vbL1YRd+dv36&K& z>>FBTldez@2JqJDSY`!S)n|3R3rooW&TTb%xg!NaF9-Qg8+7>hFGPdd>oP7>o)~0R ztrUu6Tb6T_q(0syN*!|xXzCQa+CzwNLhO#ohwH0susPIJ`kYl{LcvVOR~0A^R7=EE z&uW{iEwS`>`m*^An`8$QasQ0V!}vqb^aqZ)@YqI@uJ1zRhwN&y+%cuVChN1Pj%2^Z zFq#JlfWX(YkTU_G&u3r6yTsuARA-6Nt%nD(?NPYl|C$#!{Eo3y_9vjD!S>*y7*RKp zHC;e*D%5HFNUWi8Z>~1Pi*Bx6EE$MYN06ST->pAXE>hq*+FGYp-=A1tZ$4-OoUkXq z0Usw-(vjbHLz!w91Z~t@GVh14HF5)Iz3;1^kaITDZ+G`W=)xD7#?BB}| z-yFUSMeNl03e4h&h4)Q}LyKNse4v6x8*AFlF;Y>sXWfT=XL1k=|jf&TgKKXCP)V z*jv+cIV-Q&u!#h12mV*_p}=p!N5+=)_fr}%Zso{FS`9pOCTv%o4iqJ9*_&=}!bouV z@v4(3j3v3KzwLq6>dI}?Qw0Hd=iSX=-I#*hNL8fA2lKnlK9}MBuX9%AZGb_iv`jq) z^~+GZ)P38o2VZR(_P>-I-y>hl#e;fpPYukR8$*CTF6$pVifatP;R_6~tK@`JgT1wY z_4lhat}C@c1Wift)4uBUrytpqHyh|qhJwA(Mh(FxMzyK4V-rHhMBPvKOV=HD-n;j!>& zq>5&dUVHBM67${zrJi?!zn6!9%?HVjTX*ounAO+*-Hcx^WZt`p75I|(5yAhlA?WAN z%ii9S?&u*E{^v6D4>>Hdl73mSD!~E&68rl?g9F`Zj{EP_{*BYG=l^Z?f6@N;ApGwj k`R|nc<*@$0S&~ygEQMIEk2T)d4fIb@R!!#XGh_e%0XvQ!I{*Lx From 8d5f91d3bb5a784220abf802d8da1240d03c3329 Mon Sep 17 00:00:00 2001 From: Wisaroot Lertthaweedech Date: Sat, 13 Sep 2025 12:18:29 +0700 Subject: [PATCH 05/57] feat: update .releaserc.js --- .releaserc.js | 1 + 1 file changed, 1 insertion(+) diff --git a/.releaserc.js b/.releaserc.js index 300a89d..0cc594a 100644 --- a/.releaserc.js +++ b/.releaserc.js @@ -6,6 +6,7 @@ module.exports = { { preset: "angular", releaseRules: [ + { breaking: true, release: "major" }, { type: "feat", release: "minor" }, { type: "fix", release: "patch" }, { type: "chore", release: "patch" }, From ad9d25cfc30e86ec0113d92c25442d4fa865a865 Mon Sep 17 00:00:00 2001 From: "renovate[bot]" <29139614+renovate[bot]@users.noreply.github.com> Date: Sun, 14 Sep 2025 08:52:15 +0700 Subject: [PATCH 06/57] chore(deps): update dependency ruff to ^0.13.0 (#32) --- poetry.lock | 42 +++++++++++++++++++++--------------------- pyproject.toml | 2 +- 2 files changed, 22 insertions(+), 22 deletions(-) diff --git a/poetry.lock b/poetry.lock index 9f49b72..9d67ee4 100644 --- a/poetry.lock +++ b/poetry.lock @@ -1964,31 +1964,31 @@ files = [ [[package]] name = "ruff" -version = "0.12.12" +version = "0.13.0" description = "An extremely fast Python linter and code formatter, written in Rust." optional = false python-versions = ">=3.7" groups = ["dev"] files = [ - {file = "ruff-0.12.12-py3-none-linux_armv6l.whl", hash = "sha256:de1c4b916d98ab289818e55ce481e2cacfaad7710b01d1f990c497edf217dafc"}, - {file = "ruff-0.12.12-py3-none-macosx_10_12_x86_64.whl", hash = "sha256:7acd6045e87fac75a0b0cdedacf9ab3e1ad9d929d149785903cff9bb69ad9727"}, - {file = "ruff-0.12.12-py3-none-macosx_11_0_arm64.whl", hash = "sha256:abf4073688d7d6da16611f2f126be86523a8ec4343d15d276c614bda8ec44edb"}, - {file = "ruff-0.12.12-py3-none-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:968e77094b1d7a576992ac078557d1439df678a34c6fe02fd979f973af167577"}, - {file = "ruff-0.12.12-py3-none-manylinux_2_17_armv7l.manylinux2014_armv7l.whl", hash = "sha256:42a67d16e5b1ffc6d21c5f67851e0e769517fb57a8ebad1d0781b30888aa704e"}, - {file = "ruff-0.12.12-py3-none-manylinux_2_17_i686.manylinux2014_i686.whl", hash = "sha256:b216ec0a0674e4b1214dcc998a5088e54eaf39417327b19ffefba1c4a1e4971e"}, - {file = "ruff-0.12.12-py3-none-manylinux_2_17_ppc64.manylinux2014_ppc64.whl", hash = "sha256:59f909c0fdd8f1dcdbfed0b9569b8bf428cf144bec87d9de298dcd4723f5bee8"}, - {file = "ruff-0.12.12-py3-none-manylinux_2_17_ppc64le.manylinux2014_ppc64le.whl", hash = "sha256:9ac93d87047e765336f0c18eacad51dad0c1c33c9df7484c40f98e1d773876f5"}, - {file = "ruff-0.12.12-py3-none-manylinux_2_17_s390x.manylinux2014_s390x.whl", hash = "sha256:01543c137fd3650d322922e8b14cc133b8ea734617c4891c5a9fccf4bfc9aa92"}, - {file = "ruff-0.12.12-py3-none-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:2afc2fa864197634e549d87fb1e7b6feb01df0a80fd510d6489e1ce8c0b1cc45"}, - {file = "ruff-0.12.12-py3-none-manylinux_2_31_riscv64.whl", hash = "sha256:0c0945246f5ad776cb8925e36af2438e66188d2b57d9cf2eed2c382c58b371e5"}, - {file = "ruff-0.12.12-py3-none-musllinux_1_2_aarch64.whl", hash = "sha256:a0fbafe8c58e37aae28b84a80ba1817f2ea552e9450156018a478bf1fa80f4e4"}, - {file = "ruff-0.12.12-py3-none-musllinux_1_2_armv7l.whl", hash = "sha256:b9c456fb2fc8e1282affa932c9e40f5ec31ec9cbb66751a316bd131273b57c23"}, - {file = "ruff-0.12.12-py3-none-musllinux_1_2_i686.whl", hash = "sha256:5f12856123b0ad0147d90b3961f5c90e7427f9acd4b40050705499c98983f489"}, - {file = "ruff-0.12.12-py3-none-musllinux_1_2_x86_64.whl", hash = "sha256:26a1b5a2bf7dd2c47e3b46d077cd9c0fc3b93e6c6cc9ed750bd312ae9dc302ee"}, - {file = "ruff-0.12.12-py3-none-win32.whl", hash = "sha256:173be2bfc142af07a01e3a759aba6f7791aa47acf3604f610b1c36db888df7b1"}, - {file = "ruff-0.12.12-py3-none-win_amd64.whl", hash = "sha256:e99620bf01884e5f38611934c09dd194eb665b0109104acae3ba6102b600fd0d"}, - {file = "ruff-0.12.12-py3-none-win_arm64.whl", hash = "sha256:2a8199cab4ce4d72d158319b63370abf60991495fb733db96cd923a34c52d093"}, - {file = "ruff-0.12.12.tar.gz", hash = "sha256:b86cd3415dbe31b3b46a71c598f4c4b2f550346d1ccf6326b347cc0c8fd063d6"}, + {file = "ruff-0.13.0-py3-none-linux_armv6l.whl", hash = "sha256:137f3d65d58ee828ae136a12d1dc33d992773d8f7644bc6b82714570f31b2004"}, + {file = "ruff-0.13.0-py3-none-macosx_10_12_x86_64.whl", hash = "sha256:21ae48151b66e71fd111b7d79f9ad358814ed58c339631450c66a4be33cc28b9"}, + {file = "ruff-0.13.0-py3-none-macosx_11_0_arm64.whl", hash = "sha256:64de45f4ca5441209e41742d527944635a05a6e7c05798904f39c85bafa819e3"}, + {file = "ruff-0.13.0-py3-none-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:2b2c653ae9b9d46e0ef62fc6fbf5b979bda20a0b1d2b22f8f7eb0cde9f4963b8"}, + {file = "ruff-0.13.0-py3-none-manylinux_2_17_armv7l.manylinux2014_armv7l.whl", hash = "sha256:4cec632534332062bc9eb5884a267b689085a1afea9801bf94e3ba7498a2d207"}, + {file = "ruff-0.13.0-py3-none-manylinux_2_17_i686.manylinux2014_i686.whl", hash = "sha256:dcd628101d9f7d122e120ac7c17e0a0f468b19bc925501dbe03c1cb7f5415b24"}, + {file = "ruff-0.13.0-py3-none-manylinux_2_17_ppc64.manylinux2014_ppc64.whl", hash = "sha256:afe37db8e1466acb173bb2a39ca92df00570e0fd7c94c72d87b51b21bb63efea"}, + {file = "ruff-0.13.0-py3-none-manylinux_2_17_ppc64le.manylinux2014_ppc64le.whl", hash = "sha256:0f96a8d90bb258d7d3358b372905fe7333aaacf6c39e2408b9f8ba181f4b6ef2"}, + {file = "ruff-0.13.0-py3-none-manylinux_2_17_s390x.manylinux2014_s390x.whl", hash = "sha256:94b5e3d883e4f924c5298e3f2ee0f3085819c14f68d1e5b6715597681433f153"}, + {file = "ruff-0.13.0-py3-none-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:03447f3d18479df3d24917a92d768a89f873a7181a064858ea90a804a7538991"}, + {file = "ruff-0.13.0-py3-none-manylinux_2_31_riscv64.whl", hash = "sha256:fbc6b1934eb1c0033da427c805e27d164bb713f8e273a024a7e86176d7f462cf"}, + {file = "ruff-0.13.0-py3-none-musllinux_1_2_aarch64.whl", hash = "sha256:a8ab6a3e03665d39d4a25ee199d207a488724f022db0e1fe4002968abdb8001b"}, + {file = "ruff-0.13.0-py3-none-musllinux_1_2_armv7l.whl", hash = "sha256:d2a5c62f8ccc6dd2fe259917482de7275cecc86141ee10432727c4816235bc41"}, + {file = "ruff-0.13.0-py3-none-musllinux_1_2_i686.whl", hash = "sha256:b7b85ca27aeeb1ab421bc787009831cffe6048faae08ad80867edab9f2760945"}, + {file = "ruff-0.13.0-py3-none-musllinux_1_2_x86_64.whl", hash = "sha256:79ea0c44a3032af768cabfd9616e44c24303af49d633b43e3a5096e009ebe823"}, + {file = "ruff-0.13.0-py3-none-win32.whl", hash = "sha256:4e473e8f0e6a04e4113f2e1de12a5039579892329ecc49958424e5568ef4f768"}, + {file = "ruff-0.13.0-py3-none-win_amd64.whl", hash = "sha256:48e5c25c7a3713eea9ce755995767f4dcd1b0b9599b638b12946e892123d1efb"}, + {file = "ruff-0.13.0-py3-none-win_arm64.whl", hash = "sha256:ab80525317b1e1d38614addec8ac954f1b3e662de9d59114ecbf771d00cf613e"}, + {file = "ruff-0.13.0.tar.gz", hash = "sha256:5b4b1ee7eb35afae128ab94459b13b2baaed282b1fb0f472a73c82c996c8ae60"}, ] [[package]] @@ -2251,4 +2251,4 @@ dev = ["black (>=19.3b0) ; python_version >= \"3.6\"", "pytest (>=4.6.2)"] [metadata] lock-version = "2.1" python-versions = "^3.13" -content-hash = "9049da9f95908d67870adae3eb3a34cf3f62f9d7008f82d36958cc7dabfc4ab2" +content-hash = "436edf031cba51092142ade6fa349b92e21874b6a48f54a2ea3928a88aa5a9c0" diff --git a/pyproject.toml b/pyproject.toml index 7debb1c..e86293b 100644 --- a/pyproject.toml +++ b/pyproject.toml @@ -26,7 +26,7 @@ nbqa = "^1.9.1" pre-commit = "^4.3.0" pytest = "^8.4.1" pytest-cov = "^6.2.1" -ruff = "^0.12.11" +ruff = "^0.13.0" [build-system] requires = ["poetry-core"] From bf760e6aeac4146ae9f23f6873da86d477693b81 Mon Sep 17 00:00:00 2001 From: Wisaroot <66859294+wisarootl@users.noreply.github.com> Date: Sun, 14 Sep 2025 09:57:46 +0700 Subject: [PATCH 07/57] feat: add publish to PyPI in cd (#41) --- .github/workflows/cd.yml | 38 ++++++++++++++++++++++++++++++++++++++ README.md | 4 +--- poetry.lock | 4 ++-- pyproject.toml | 25 ++++++++++++++++++++----- 4 files changed, 61 insertions(+), 10 deletions(-) diff --git a/.github/workflows/cd.yml b/.github/workflows/cd.yml index 26daa0b..91a7aa7 100644 --- a/.github/workflows/cd.yml +++ b/.github/workflows/cd.yml @@ -55,3 +55,41 @@ jobs: echo "published=${{ steps.release.outputs.new_release_published }}" >> $GITHUB_OUTPUT echo "New release: ${{ steps.release.outputs.new_release_version }}" fi + + publish: + name: publish to pypi + runs-on: ubuntu-latest + needs: versioning + if: needs.versioning.outputs.new_release_published == 'true' + environment: + name: pypi + url: https://pypi.org/p/leetcode-py + permissions: + id-token: write + steps: + - name: Checkout + uses: actions/checkout@08c6903cd8c0fde910a37f88322edcfb5dd907a8 # v5.0.0 + + - name: Set up Python + uses: actions/setup-python@0b93645e9fea7318ecaed2b359559ac225c90a2b # v5.3.0 + with: + python-version: "3.13" + + - name: Install Poetry + uses: snok/install-poetry@76e04a911780d5b312d89783f7b1cd627778900a # v1.4.1 + with: + version: latest + virtualenvs-create: true + virtualenvs-in-project: true + + - name: Update version in pyproject.toml + run: | + poetry version ${{ needs.versioning.outputs.new_release_version }} + + - name: Build package + run: poetry build + + - name: Publish to PyPI + uses: pypa/gh-action-pypi-publish@15c56dba361d8335944d31a2ecd17d700fc7bcbc # v1.12.2 + with: + verbose: true diff --git a/README.md b/README.md index 5ee0760..ba2846d 100644 --- a/README.md +++ b/README.md @@ -17,11 +17,9 @@ A modern Python LeetCode practice environment that goes beyond basic problem sol - 🚀 **Modern Python**: PEP 585/604 type hints, Poetry, and professional tooling - 📊 **Quality Assurance**: 95%+ test coverage, security scanning, automated linting -Includes all **75 Grind problems** - the most essential coding interview questions curated for maximum impact. - ## 🎯 What's Included -**Current**: All 75 problems from [Grind 75](https://www.techinterviewhandbook.org/grind75/) - the most essential coding interview problems curated by the creator of Blind 75. +**Current**: All 75 problems from [Grind 75](https://www.techinterviewhandbook.org/grind75/) - the most essential coding interview questions curated by the creator of Blind 75. **Future**: Planned expansion to all 169 Grind problems for comprehensive interview preparation. diff --git a/poetry.lock b/poetry.lock index 9d67ee4..2598c1b 100644 --- a/poetry.lock +++ b/poetry.lock @@ -653,7 +653,7 @@ version = "0.21" description = "Simple Python interface for Graphviz" optional = false python-versions = ">=3.9" -groups = ["dev"] +groups = ["main"] files = [ {file = "graphviz-0.21-py3-none-any.whl", hash = "sha256:54f33de9f4f911d7e84e4191749cac8cc5653f815b06738c54db9a15ab8b1e42"}, {file = "graphviz-0.21.tar.gz", hash = "sha256:20743e7183be82aaaa8ad6c93f8893c923bd6658a04c32ee115edb3c8a835f78"}, @@ -2251,4 +2251,4 @@ dev = ["black (>=19.3b0) ; python_version >= \"3.6\"", "pytest (>=4.6.2)"] [metadata] lock-version = "2.1" python-versions = "^3.13" -content-hash = "436edf031cba51092142ade6fa349b92e21874b6a48f54a2ea3928a88aa5a9c0" +content-hash = "e8769741fb13e346d2f8b7a6bc97b1a3042f1b2a0cfafbaa2125279ab454c9af" diff --git a/pyproject.toml b/pyproject.toml index e86293b..68c5bab 100644 --- a/pyproject.toml +++ b/pyproject.toml @@ -1,12 +1,28 @@ [tool.poetry] -name = "leetcode-py" -version = "0.1.0" -description = "LeetCode solutions in Python" -authors = ["Your Name "] +name = "leetcode-py-sdk" +version = "0.1.0" # use git tag instead +description = "Modern Python LeetCode practice environment with automated problem generation, beautiful data structure visualizations, and comprehensive testing" +authors = ["Wisaroot Lertthaweedech "] +license = "Apache-2.0" readme = "README.md" +homepage = "https://github.com/wisarootl/leetcode-py" +repository = "https://github.com/wisarootl/leetcode-py" +keywords = ["leetcode", "algorithms", "data-structures", "interview-prep", "coding-practice"] +classifiers = [ + "Development Status :: 4 - Beta", + "Intended Audience :: Developers", + "Intended Audience :: Education", + "Topic :: Software Development :: Libraries :: Python Modules", + "Topic :: Education", + "License :: OSI Approved :: Apache Software License", + "Programming Language :: Python :: 3", + "Programming Language :: Python :: 3.13", +] +packages = [{include = "leetcode_py"}] [tool.poetry.dependencies] python = "^3.13" +graphviz = "^0.21" requests = "^2.32.5" typer = "^0.17.0" @@ -17,7 +33,6 @@ loguru = "^0.7.3" [tool.poetry.group.dev.dependencies] black = "^25.1.0" cookiecutter = "^2.6.0" -graphviz = "^0.21" ipykernel = "^6.30.1" isort = "^6.0.1" jupytext = "^1.16.6" From 425cdd8bc21dc2360719c0c027c950efd232d780 Mon Sep 17 00:00:00 2001 From: "renovate[bot]" <29139614+renovate[bot]@users.noreply.github.com> Date: Sun, 14 Sep 2025 14:21:36 +0700 Subject: [PATCH 08/57] chore(deps): update actions/setup-python action to v5.6.0 (#42) --- .github/workflows/cd.yml | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/.github/workflows/cd.yml b/.github/workflows/cd.yml index 91a7aa7..f19acf9 100644 --- a/.github/workflows/cd.yml +++ b/.github/workflows/cd.yml @@ -71,7 +71,7 @@ jobs: uses: actions/checkout@08c6903cd8c0fde910a37f88322edcfb5dd907a8 # v5.0.0 - name: Set up Python - uses: actions/setup-python@0b93645e9fea7318ecaed2b359559ac225c90a2b # v5.3.0 + uses: actions/setup-python@a26af69be951a213d495a4c3e4e4022e16d87065 # v5.6.0 with: python-version: "3.13" From c54a637542dc51ed5f538ef28bf4b642ae923faf Mon Sep 17 00:00:00 2001 From: "renovate[bot]" <29139614+renovate[bot]@users.noreply.github.com> Date: Sun, 14 Sep 2025 14:29:17 +0700 Subject: [PATCH 09/57] chore(deps): update pypa/gh-action-pypi-publish action to v1.13.0 (#43) --- .github/workflows/cd.yml | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/.github/workflows/cd.yml b/.github/workflows/cd.yml index f19acf9..013f9a1 100644 --- a/.github/workflows/cd.yml +++ b/.github/workflows/cd.yml @@ -90,6 +90,6 @@ jobs: run: poetry build - name: Publish to PyPI - uses: pypa/gh-action-pypi-publish@15c56dba361d8335944d31a2ecd17d700fc7bcbc # v1.12.2 + uses: pypa/gh-action-pypi-publish@ed0c53931b1dc9bd32cbe73a98c7f6766f8a527e # v1.13.0 with: verbose: true From 1c4c78efa0c2523511869da08956b04df3129992 Mon Sep 17 00:00:00 2001 From: "renovate[bot]" <29139614+renovate[bot]@users.noreply.github.com> Date: Sun, 14 Sep 2025 15:37:53 +0700 Subject: [PATCH 10/57] chore(deps): update actions/setup-python action to v6 (#44) --- .github/workflows/cd.yml | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/.github/workflows/cd.yml b/.github/workflows/cd.yml index 013f9a1..ef4f5c5 100644 --- a/.github/workflows/cd.yml +++ b/.github/workflows/cd.yml @@ -71,7 +71,7 @@ jobs: uses: actions/checkout@08c6903cd8c0fde910a37f88322edcfb5dd907a8 # v5.0.0 - name: Set up Python - uses: actions/setup-python@a26af69be951a213d495a4c3e4e4022e16d87065 # v5.6.0 + uses: actions/setup-python@e797f83bcb11b83ae66e0230d6156d7c80228e7c # v6.0.0 with: python-version: "3.13" From fbab7955c4236cffe1e3e726d4cff26df0521066 Mon Sep 17 00:00:00 2001 From: Wisaroot <66859294+wisarootl@users.noreply.github.com> Date: Mon, 15 Sep 2025 17:11:49 +0700 Subject: [PATCH 11/57] feat: implement cli (#45) - implement cli for lcpy to gen/list leetcode problems --- .amazonq/rules/development-rules.md | 1 + .amazonq/rules/problem-creation.md | 74 +--- ...hancement.md => test-quality-assurance.md} | 29 +- .github/workflows/ci-test-reproducibility.yml | 2 +- .github/workflows/ci-test.yml | 4 +- .templates/check_test_cases.py | 95 ----- .templates/leetcode/gen.py | 26 -- .templates/leetcode/scrape.py | 48 --- CONTRIBUTING.md | 2 +- Makefile | 19 +- README.md | 80 +++- docs/cli-usage.md | 210 +++++++++++ .../cli}/__init__.py | 0 leetcode_py/cli/commands/__init__.py | 0 leetcode_py/cli/commands/gen.py | 153 ++++++++ leetcode_py/cli/commands/list.py | 94 +++++ leetcode_py/cli/commands/scrape.py | 49 +++ leetcode_py/cli/main.py | 32 ++ .../cli/resources}/leetcode/cookiecutter.json | 0 .../leetcode/examples/example.json5 | 0 .../json/problems}/accounts_merge.json | 0 .../leetcode/json/problems}/add_binary.json | 0 .../json/problems}/balanced_binary_tree.json | 0 .../json/problems}/basic_calculator.json | 0 .../best_time_to_buy_and_sell_stock.json | 0 .../json/problems}/binary_search.json | 0 .../binary_tree_level_order_traversal.json | 0 .../binary_tree_right_side_view.json | 0 .../json/problems}/climbing_stairs.json | 0 .../leetcode/json/problems}/clone_graph.json | 0 .../leetcode/json/problems}/coin_change.json | 0 .../json/problems}/combination_sum.json | 0 ...e_from_preorder_and_inorder_traversal.json | 0 .../problems}/container_with_most_water.json | 0 .../json/problems}/contains_duplicate.json | 0 .../json/problems}/course_schedule.json | 0 .../json/problems}/diagonal_traverse.json | 0 .../problems}/diameter_of_binary_tree.json | 0 .../evaluate_reverse_polish_notation.json | 0 .../find_all_anagrams_in_a_string.json | 0 .../find_median_from_data_stream.json | 0 .../json/problems}/first_bad_version.json | 0 .../leetcode/json/problems}/flood_fill.json | 0 .../implement_queue_using_stacks.json | 0 .../problems}/implement_trie_prefix_tree.json | 0 .../json/problems}/insert_interval.json | 0 .../json/problems}/invert_binary_tree.json | 0 .../problems}/k_closest_points_to_origin.json | 0 .../kth_smallest_element_in_a_bst.json | 0 .../largest_rectangle_in_histogram.json | 0 ...letter_combinations_of_a_phone_number.json | 0 .../json/problems}/linked_list_cycle.json | 0 .../json/problems}/longest_palindrome.json | 0 .../longest_palindromic_substring.json | 0 ...ubstring_without_repeating_characters.json | 0 ...mmon_ancestor_of_a_binary_search_tree.json | 0 ...west_common_ancestor_of_a_binary_tree.json | 0 .../leetcode/json/problems}/lru_cache.json | 0 .../json/problems}/majority_element.json | 0 .../maximum_depth_of_binary_tree.json | 0 .../maximum_profit_in_job_scheduling.json | 0 .../json/problems}/maximum_subarray.json | 0 .../json/problems}/merge_intervals.json | 0 .../json/problems}/merge_k_sorted_lists.json | 0 .../problems}/merge_two_sorted_lists.json | 0 .../problems}/middle_of_the_linked_list.json | 0 .../leetcode/json/problems}/min_stack.json | 0 .../json/problems}/minimum_height_trees.json | 0 .../problems}/minimum_window_substring.json | 0 .../json/problems}/number_of_islands.json | 0 .../problems}/partition_equal_subset_sum.json | 0 .../leetcode/json/problems}/permutations.json | 0 .../product_of_array_except_self.json | 0 .../leetcode/json/problems}/ransom_note.json | 0 .../json/problems}/reverse_linked_list.json | 0 .../problems}/reverse_linked_list_ii.json | 0 .../json/problems}/rotting_oranges.json | 0 .../search_in_rotated_sorted_array.json | 0 ...serialize_and_deserialize_binary_tree.json | 0 .../leetcode/json/problems}/sort_colors.json | 0 .../json/problems}/spiral_matrix.json | 0 .../problems}/string_to_integer_atoi.json | 0 .../leetcode/json/problems}/subsets.json | 0 .../json/problems}/task_scheduler.json | 0 .../leetcode/json/problems}/three_sum.json | 0 .../problems}/time_based_key_value_store.json | 0 .../json/problems}/trapping_rain_water.json | 0 .../leetcode/json/problems}/two_sum.json | 0 .../leetcode/json/problems}/unique_paths.json | 0 .../json/problems}/valid_anagram.json | 0 .../json/problems}/valid_palindrome.json | 0 .../json/problems}/valid_parentheses.json | 0 .../validate_binary_search_tree.json | 0 .../leetcode/json/problems}/word_break.json | 0 .../leetcode/json/problems}/word_ladder.json | 0 .../leetcode/json/problems}/word_search.json | 0 .../json/problems}/zero_one_matrix.json | 0 .../cli/resources/leetcode/json/tags.json5 | 87 +++++ .../{{cookiecutter.problem_name}}/README.md | 0 .../{{cookiecutter.problem_name}}/__init__.py | 0 .../{{cookiecutter.problem_name}}/helpers.py | 0 .../playground.ipynb | 0 .../{{cookiecutter.problem_name}}/solution.py | 0 .../test_solution.py | 0 leetcode_py/cli/utils/__init__.py | 0 leetcode_py/cli/utils/problem_finder.py | 78 ++++ leetcode_py/cli/utils/resources.py | 19 + leetcode_py/tools/__init__.py | 4 +- leetcode_py/tools/check_test_cases.py | 81 +++++ leetcode_py/tools/generator.py | 249 +++---------- leetcode_py/tools/parser.py | 6 +- leetcode_py/tools/scraper.py | 67 ++-- poetry.lock | 83 +++-- pyproject.toml | 23 +- tests/cli/__init__.py | 0 tests/cli/test_gen.py | 161 ++++++++ tests/cli/test_list.py | 53 +++ tests/cli/test_main.py | 68 ++++ tests/cli/test_problem_finder.py | 106 ++++++ tests/cli/test_resources.py | 92 +++++ tests/cli/test_scrape.py | 76 ++++ tests/{ => data_structures}/test_dict_tree.py | 0 tests/tools/test_check_test_cases.py | 149 ++++++++ tests/tools/test_generator.py | 344 ++++++------------ tests/tools/test_generator_file_ops.py | 137 ------- 125 files changed, 1886 insertions(+), 915 deletions(-) rename .amazonq/rules/{test-case-enhancement.md => test-quality-assurance.md} (79%) delete mode 100644 .templates/check_test_cases.py delete mode 100644 .templates/leetcode/gen.py delete mode 100644 .templates/leetcode/scrape.py create mode 100644 docs/cli-usage.md rename {.templates/leetcode/{{cookiecutter.problem_name}} => leetcode_py/cli}/__init__.py (100%) create mode 100644 leetcode_py/cli/commands/__init__.py create mode 100644 leetcode_py/cli/commands/gen.py create mode 100644 leetcode_py/cli/commands/list.py create mode 100644 leetcode_py/cli/commands/scrape.py create mode 100644 leetcode_py/cli/main.py rename {.templates => leetcode_py/cli/resources}/leetcode/cookiecutter.json (100%) rename {.templates => leetcode_py/cli/resources}/leetcode/examples/example.json5 (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/accounts_merge.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/add_binary.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/balanced_binary_tree.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/basic_calculator.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/best_time_to_buy_and_sell_stock.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/binary_search.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/binary_tree_level_order_traversal.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/binary_tree_right_side_view.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/climbing_stairs.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/clone_graph.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/coin_change.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/combination_sum.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/construct_binary_tree_from_preorder_and_inorder_traversal.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/container_with_most_water.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/contains_duplicate.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/course_schedule.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/diagonal_traverse.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/diameter_of_binary_tree.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/evaluate_reverse_polish_notation.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/find_all_anagrams_in_a_string.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/find_median_from_data_stream.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/first_bad_version.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/flood_fill.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/implement_queue_using_stacks.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/implement_trie_prefix_tree.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/insert_interval.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/invert_binary_tree.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/k_closest_points_to_origin.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/kth_smallest_element_in_a_bst.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/largest_rectangle_in_histogram.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/letter_combinations_of_a_phone_number.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/linked_list_cycle.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/longest_palindrome.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/longest_palindromic_substring.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/longest_substring_without_repeating_characters.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/lowest_common_ancestor_of_a_binary_search_tree.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/lowest_common_ancestor_of_a_binary_tree.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/lru_cache.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/majority_element.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/maximum_depth_of_binary_tree.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/maximum_profit_in_job_scheduling.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/maximum_subarray.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/merge_intervals.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/merge_k_sorted_lists.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/merge_two_sorted_lists.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/middle_of_the_linked_list.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/min_stack.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/minimum_height_trees.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/minimum_window_substring.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/number_of_islands.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/partition_equal_subset_sum.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/permutations.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/product_of_array_except_self.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/ransom_note.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/reverse_linked_list.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/reverse_linked_list_ii.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/rotting_oranges.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/search_in_rotated_sorted_array.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/serialize_and_deserialize_binary_tree.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/sort_colors.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/spiral_matrix.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/string_to_integer_atoi.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/subsets.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/task_scheduler.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/three_sum.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/time_based_key_value_store.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/trapping_rain_water.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/two_sum.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/unique_paths.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/valid_anagram.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/valid_palindrome.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/valid_parentheses.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/validate_binary_search_tree.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/word_break.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/word_ladder.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/word_search.json (100%) rename {.templates/leetcode/json => leetcode_py/cli/resources/leetcode/json/problems}/zero_one_matrix.json (100%) create mode 100644 leetcode_py/cli/resources/leetcode/json/tags.json5 rename {.templates => leetcode_py/cli/resources}/leetcode/{{cookiecutter.problem_name}}/README.md (100%) create mode 100644 leetcode_py/cli/resources/leetcode/{{cookiecutter.problem_name}}/__init__.py rename {.templates => leetcode_py/cli/resources}/leetcode/{{cookiecutter.problem_name}}/helpers.py (100%) rename {.templates => leetcode_py/cli/resources}/leetcode/{{cookiecutter.problem_name}}/playground.ipynb (100%) rename {.templates => leetcode_py/cli/resources}/leetcode/{{cookiecutter.problem_name}}/solution.py (100%) rename {.templates => leetcode_py/cli/resources}/leetcode/{{cookiecutter.problem_name}}/test_solution.py (100%) create mode 100644 leetcode_py/cli/utils/__init__.py create mode 100644 leetcode_py/cli/utils/problem_finder.py create mode 100644 leetcode_py/cli/utils/resources.py create mode 100644 leetcode_py/tools/check_test_cases.py create mode 100644 tests/cli/__init__.py create mode 100644 tests/cli/test_gen.py create mode 100644 tests/cli/test_list.py create mode 100644 tests/cli/test_main.py create mode 100644 tests/cli/test_problem_finder.py create mode 100644 tests/cli/test_resources.py create mode 100644 tests/cli/test_scrape.py rename tests/{ => data_structures}/test_dict_tree.py (100%) create mode 100644 tests/tools/test_check_test_cases.py delete mode 100644 tests/tools/test_generator_file_ops.py diff --git a/.amazonq/rules/development-rules.md b/.amazonq/rules/development-rules.md index d7f1080..8d11859 100644 --- a/.amazonq/rules/development-rules.md +++ b/.amazonq/rules/development-rules.md @@ -11,6 +11,7 @@ - Use snake_case for Python methods - Include type hints: `list[str]`, `dict[str, int]`, `Type | None` - Follow linting rules (black, isort, ruff, mypy) +- **NO noise docstrings**: Avoid docstrings that merely restate the function name (e.g., `"""Test CLI help command."""` for `test_cli_help()`). Only add docstrings when they provide meaningful context beyond what the code itself conveys ## Testing diff --git a/.amazonq/rules/problem-creation.md b/.amazonq/rules/problem-creation.md index 4cafbf6..a262244 100644 --- a/.amazonq/rules/problem-creation.md +++ b/.amazonq/rules/problem-creation.md @@ -4,7 +4,7 @@ When user requests a problem by **number** or **name/slug**, the assistant will: -1. **Scrape** problem data using `.templates/leetcode/scrape.py` +1. **Scrape** problem data using `lcpy scrape` 2. **Transform** data into proper JSON template format 3. **CRITICAL: Include images** - Extract image URLs from scraped data and add to readme_examples with format: `![Example N](image_url)\n\n` before code blocks - Check scraped data for image URLs in the `raw_content` field @@ -12,7 +12,7 @@ When user requests a problem by **number** or **name/slug**, the assistant will: - Common patterns: `kthtree1.jpg`, `kthtree2.jpg`, `clone_graph.png`, `container.jpg` - Images provide crucial visual context, especially for tree and graph problems - Always verify images are included in `readme_examples` and accessible -4. **Create** JSON file in `.templates/leetcode/json/{problem_name}.json` +4. **Create** JSON file in `leetcode_py/cli/resources/leetcode/json/problems/{problem_name}.json` 5. **Update** Makefile with `PROBLEM ?= {problem_name}` 6. **Generate** problem structure using `make p-gen` 7. **Verify** with `make p-lint` - fix template issues in JSON if possible, or manually fix generated files if template limitations @@ -22,15 +22,15 @@ When user requests a problem by **number** or **name/slug**, the assistant will: ```bash # Fetch by number -poetry run python .templates/leetcode/scrape.py -n 1 +lcpy scrape -n 1 # Fetch by slug -poetry run python .templates/leetcode/scrape.py -s "two-sum" +lcpy scrape -s "two-sum" ``` ## JSON Template Format -Required fields for `.templates/leetcode/json/{problem_name}.json`: +Required fields for `leetcode_py/cli/resources/leetcode/json/problems/{problem_name}.json`: **CRITICAL: Use single quotes for Python strings in playground fields to avoid JSON escaping issues with Jupyter notebooks.** @@ -41,61 +41,15 @@ Required fields for `.templates/leetcode/json/{problem_name}.json`: - `playground_assertion`: Use single quotes for string literals - Double quotes in JSON + cookiecutter + Jupyter notebook = triple escaping issues -**Reference examples in `.templates/leetcode/examples/` for complete templates:** - -- `basic.json5` - All standard problems (array, string, tree, linked list, etc.) -- `design.json5` - Data structure design problems (LRU Cache, etc.) - -````json -{ - "problem_name": "two_sum", - "solution_class_name": "Solution", - "problem_number": "1", - "problem_title": "Two Sum", - "difficulty": "Easy", - "topics": "Array, Hash Table", - "tags": ["grind-75"], - "readme_description": "Given an array of integers `nums` and an integer `target`, return indices of the two numbers such that they add up to `target`.", - "readme_examples": [ - { - "content": "![Example 1](https://example.com/image1.jpg)\n\n```\nInput: nums = [2,7,11,15], target = 9\nOutput: [0,1]\n```\n**Explanation:** Because nums[0] + nums[1] == 9, we return [0, 1]." - } - ], - "readme_constraints": "- 2 <= nums.length <= 10^4\n- -10^9 <= nums[i] <= 10^9\n- -10^9 <= target <= 10^9\n- Only one valid answer exists.", - "readme_additional": "", - "solution_imports": "", - "solution_methods": [ - { - "name": "two_sum", - "parameters": "nums: list[int], target: int", - "return_type": "list[int]", - "dummy_return": "[]" - } - ], - "test_imports": "import pytest\nfrom leetcode_py.test_utils import logged_test\nfrom .solution import Solution", - "test_class_name": "TwoSum", - "test_helper_methods": [ - { - "name": "setup_method", - "parameters": "", - "body": "self.solution = Solution()" - } - ], - "test_methods": [ - { - "name": "test_two_sum", - "parametrize": "nums, target, expected", - "parametrize_typed": "nums: list[int], target: int, expected: list[int]", - "test_cases": "[([2, 7, 11, 15], 9, [0, 1]), ([3, 2, 4], 6, [1, 2])]", - "body": "result = self.solution.two_sum(nums, target)\nassert result == expected" - } - ], - "playground_imports": "from solution import Solution", - "playground_test_case": "# Example test case\nnums = [2, 7, 11, 15]\ntarget = 9\nexpected = [0, 1]", - "playground_execution": "result = Solution().two_sum(nums, target)\nresult", - "playground_assertion": "assert result == expected" -} -```` +**Reference the complete template example:** + +See `leetcode_py/cli/resources/leetcode/examples/example.json5` for a comprehensive template with: + +- All field definitions and variations +- Comments explaining each field +- Examples for different problem types (basic, tree, linked list, design, trie) +- Proper JSON escaping rules for playground fields +- Multiple solution class patterns ## Naming Conventions diff --git a/.amazonq/rules/test-case-enhancement.md b/.amazonq/rules/test-quality-assurance.md similarity index 79% rename from .amazonq/rules/test-case-enhancement.md rename to .amazonq/rules/test-quality-assurance.md index 8b341d7..dd68f27 100644 --- a/.amazonq/rules/test-case-enhancement.md +++ b/.amazonq/rules/test-quality-assurance.md @@ -1,4 +1,4 @@ -# Test Case Enhancement Rules +# Test Quality Assurance Rules ## Simple Enhancement Workflow @@ -7,7 +7,7 @@ When user requests test case enhancement or **test reproducibility verification* ### 1. Problem Resolution - Use active file context or user-provided problem name -- If unclear, run: `poetry run python .templates/check_test_cases.py --threshold=10 --max=1` +- If unclear, run: `poetry run python -m leetcode_py.tools.check_test_cases --threshold=10 --max=1` ### 2. Enhancement Process @@ -55,20 +55,35 @@ mv .cache/leetcode/{problem_name} leetcode/{problem_name} ## Quick Commands +### CLI Commands (Recommended) + ```bash -# Find problems needing enhancement -poetry run python .templates/check_test_cases.py --threshold=10 +# Generate enhanced problem +lcpy gen -s {problem_name} -o leetcode --force # Test specific problem make p-test PROBLEM={problem_name} -# Generate from JSON template -make p-gen PROBLEM={problem_name} FORCE=1 - # Lint check make p-lint PROBLEM={problem_name} ``` +### Development Commands + +```bash +# Find problems needing enhancement +poetry run python -m leetcode_py.tools.check_test_cases --threshold=10 + +# Check all problems (no limit) +poetry run python -m leetcode_py.tools.check_test_cases --threshold=10 --max=none + +# Check with custom threshold +poetry run python -m leetcode_py.tools.check_test_cases --threshold=12 + +# Generate from JSON template (uses lcpy internally) +make p-gen PROBLEM={problem_name} FORCE=1 +``` + ## Test Reproducibility Verification Use this same workflow when CI tests fail due to reproducibility issues: diff --git a/.github/workflows/ci-test-reproducibility.yml b/.github/workflows/ci-test-reproducibility.yml index 1be9cab..4e1a841 100644 --- a/.github/workflows/ci-test-reproducibility.yml +++ b/.github/workflows/ci-test-reproducibility.yml @@ -62,7 +62,7 @@ jobs: fi - name: Check test case count - run: poetry run python .templates/check_test_cases.py --threshold=10 --max=100 + run: poetry run python -m leetcode_py.tools.check_test_cases --threshold=10 --max=none - name: Backup existing problems run: | diff --git a/.github/workflows/ci-test.yml b/.github/workflows/ci-test.yml index 7526068..6365946 100644 --- a/.github/workflows/ci-test.yml +++ b/.github/workflows/ci-test.yml @@ -33,7 +33,9 @@ jobs: key: venv-${{ runner.os }}-${{ steps.setup-python.outputs.python-version }}-${{ hashFiles('**/poetry.lock') }} - name: Install dependencies - run: poetry install --no-interaction --no-ansi + run: | + poetry install --no-interaction --no-ansi + poetry run pip install -e . - name: Cache Graphviz installation id: cache-graphviz diff --git a/.templates/check_test_cases.py b/.templates/check_test_cases.py deleted file mode 100644 index a99a310..0000000 --- a/.templates/check_test_cases.py +++ /dev/null @@ -1,95 +0,0 @@ -#!/usr/bin/env python3 - -import json -from pathlib import Path -from typing import Optional -import typer - - -def count_test_cases(json_data): - """Count total test cases across all test methods.""" - total = 0 - - # Handle both direct test_methods and nested _test_methods.list - test_methods = json_data.get("test_methods", []) - if not test_methods and "_test_methods" in json_data: - test_methods = json_data["_test_methods"].get("list", []) - - for method in test_methods: - test_cases = method.get("test_cases", "") - if test_cases.strip(): - # Parse the test_cases string to count actual test cases - try: - # Remove outer brackets and split by top-level commas - cases_str = test_cases.strip() - if cases_str.startswith("[") and cases_str.endswith("]"): - cases_str = cases_str[1:-1] # Remove outer brackets - - # Count test cases by counting commas at parenthesis depth 0 - depth = 0 - case_count = 1 if cases_str.strip() else 0 - - for char in cases_str: - if char in "([{": - depth += 1 - elif char in ")]}": - depth -= 1 - elif char == "," and depth == 0: - case_count += 1 - - total += case_count - except Exception: - # Fallback to old method if parsing fails - total += test_cases.count("(") - test_cases.count("([") + test_cases.count("[(") - return total - - -def main( - threshold: int = typer.Option( - 10, "--threshold", "-t", help="Show files with test cases <= threshold" - ), - max_results: str = typer.Option( - 1, "--max", "-m", help="Maximum number of results to show ('none' for no limit)" - ), -): - """Check test case counts in LeetCode JSON templates.""" - json_dir = Path(".templates/leetcode/json") - all_files = [] - - for json_file in json_dir.glob("*.json"): - try: - with open(json_file) as f: - data = json.load(f) - - test_count = count_test_cases(data) - all_files.append((json_file.name, test_count)) - except Exception as e: - typer.echo(f"Error reading {json_file.name}: {e}", err=True) - - # Sort by test count - all_files.sort(key=lambda x: x[1]) - - # Filter by threshold - filtered_files = [f for f in all_files if f[1] <= threshold] - - # Apply max results limit - if max_results.lower() not in ["none", "null", "-1"]: - try: - max_count = int(max_results) - if max_count > 0: - filtered_files = filtered_files[:max_count] - except ValueError: - typer.echo(f"Invalid max_results value: {max_results}", err=True) - raise typer.Exit(1) - - typer.echo(f"Problems with ≤{threshold} test cases ({len(filtered_files)} total):") - for filename, count in filtered_files: - typer.echo(f"{filename}: {count} test cases") - - # Exit with non-zero code if any files found - if filtered_files: - raise typer.Exit(1) - - -if __name__ == "__main__": - typer.run(main) diff --git a/.templates/leetcode/gen.py b/.templates/leetcode/gen.py deleted file mode 100644 index 585c769..0000000 --- a/.templates/leetcode/gen.py +++ /dev/null @@ -1,26 +0,0 @@ -#!/usr/bin/env python3 -"""Compatibility wrapper for generator.""" -import sys -from pathlib import Path -sys.path.insert(0, str(Path(__file__).parent.parent.parent)) - -import typer -from leetcode_py.tools import TemplateGenerator - -app = typer.Typer(help="Generate LeetCode problem templates") - - -@app.command() -def generate( - json_file: str = typer.Argument(help="Path to JSON problem definition"), - force: bool = typer.Option(False, "--force", help="Force overwrite existing files") -): - """Generate LeetCode problem from JSON using cookiecutter.""" - generator = TemplateGenerator() - template_dir = Path(__file__).parent - output_dir = template_dir.parent.parent / "leetcode" - generator.generate_problem(json_file, template_dir, output_dir, force) - - -if __name__ == "__main__": - app() diff --git a/.templates/leetcode/scrape.py b/.templates/leetcode/scrape.py deleted file mode 100644 index 82fa996..0000000 --- a/.templates/leetcode/scrape.py +++ /dev/null @@ -1,48 +0,0 @@ -#!/usr/bin/env python3 -"""Compatibility wrapper for scraper.""" -import sys -from pathlib import Path -sys.path.insert(0, str(Path(__file__).parent.parent.parent)) - -import json -from typing import Optional -import typer -from leetcode_py.tools import LeetCodeScraper - -app = typer.Typer(help="Fetch LeetCode problem information") - - -@app.command() -def fetch( - number: Optional[int] = typer.Option(None, "-n", "--number", help="Problem number (e.g., 1)"), - slug: Optional[str] = typer.Option(None, "-s", "--slug", help="Problem slug (e.g., 'two-sum')"), -): - """Fetch LeetCode problem information and return as JSON.""" - if not number and not slug: - typer.echo("Error: Must provide either --number or --slug", err=True) - raise typer.Exit(1) - - if number and slug: - typer.echo("Error: Cannot provide both --number and --slug", err=True) - raise typer.Exit(1) - - scraper = LeetCodeScraper() - - if number: - problem = scraper.get_problem_by_number(number) - else: - if slug is None: - typer.echo("Error: Slug cannot be None", err=True) - raise typer.Exit(1) - problem = scraper.get_problem_by_slug(slug) - - if not problem: - typer.echo(json.dumps({"error": "Problem not found"})) - raise typer.Exit(1) - - formatted = scraper.format_problem_info(problem) - typer.echo(json.dumps(formatted, indent=2)) - - -if __name__ == "__main__": - app() diff --git a/CONTRIBUTING.md b/CONTRIBUTING.md index 60ef591..f1d27ba 100644 --- a/CONTRIBUTING.md +++ b/CONTRIBUTING.md @@ -13,7 +13,7 @@ Use an LLM assistant (Cursor, GitHub Copilot Chat, Amazon Q) with the rule files ### 2. Enhance Test Cases -- Include `.amazonq/rules/test-case-enhancement.md` in your LLM context +- Include `.amazonq/rules/test-quality-assurance.md` in your LLM context - Ask: "Enhance test cases for [problem_name] problem" ### 3. Improve Helper Classes diff --git a/Makefile b/Makefile index c6eeb6a..1849e62 100644 --- a/Makefile +++ b/Makefile @@ -24,7 +24,7 @@ define lint_target poetry run black $(1) poetry run isort $(1) $(if $(filter .,$(1)), \ - poetry run nbqa ruff . --nbqa-exclude=".templates" --ignore=F401$(COMMA)F821, \ + poetry run nbqa ruff . --nbqa-exclude="leetcode_py/cli/resources/" --ignore=F401$(COMMA)F821, \ poetry run nbqa ruff $(1) --ignore=F401$(COMMA)F821) poetry run ruff check $(1) --exclude="**/*.ipynb" poetry run mypy $(1) \ @@ -33,10 +33,10 @@ define lint_target --non-interactive \ --check-untyped-defs $(if $(filter .,$(1)), \ - poetry run nbqa isort . --nbqa-exclude=".templates", \ + poetry run nbqa isort . --nbqa-exclude="leetcode_py/cli/resources/", \ poetry run nbqa isort $(1)) $(if $(filter .,$(1)), \ - poetry run nbqa mypy . --nbqa-exclude=".templates" \ + poetry run nbqa mypy . --nbqa-exclude="leetcode_py/cli/resources/" \ --ignore-missing-imports --disable-error-code=name-defined, \ poetry run nbqa mypy $(1) --ignore-missing-imports --disable-error-code=name-defined) endef @@ -72,7 +72,7 @@ p-lint: p-gen: @echo "Generating problem: $(PROBLEM)" - poetry run python .templates/leetcode/gen.py .templates/leetcode/json/$(PROBLEM).json $(if $(filter 1,$(FORCE)),--force) + poetry run lcpy gen -s $(PROBLEM) -o leetcode $(if $(filter 1,$(FORCE)),--force) p-del: rm -rf leetcode/$(PROBLEM) @@ -84,6 +84,11 @@ nb-to-py: @find leetcode -name "*.ipynb" -delete @echo "Conversion complete. All .ipynb files converted to .py and deleted." +# Find problems with few test cases +check-test-cases: + @echo "Checking test case coverage..." + poetry run python leetcode_py/tools/check_test_cases.py --threshold=$(or $(THRESHOLD),10) --max=$(or $(MAX),1) + # Generate All Problems - useful for people who fork this repo gen-all-problems: @echo "This will DELETE all existing problems and regenerate from JSON templates." @@ -93,8 +98,4 @@ gen-all-problems: @echo "Deleting existing problems..." @rm -rf leetcode/*/ @echo "Generating all problems..." - @for json_file in .templates/leetcode/json/*.json; do \ - problem=$$(basename "$$json_file" .json); \ - echo "Generating: $$problem"; \ - poetry run python .templates/leetcode/gen.py "$$json_file" $(if $(filter 1,$(FORCE)),--force); \ - done + poetry run lcpy gen -t grind-75 -o leetcode $(if $(filter 1,$(FORCE)),--force) diff --git a/README.md b/README.md index ba2846d..bf5c4a9 100644 --- a/README.md +++ b/README.md @@ -25,8 +25,23 @@ A modern Python LeetCode practice environment that goes beyond basic problem sol ## 🚀 Quick Start +### CLI Installation (Recommended) + +```bash +# Install globally via pip +pip install leetcode-py + +# Generate problems anywhere +lcpy gen -n 1 # Generate Two Sum +lcpy gen -t grind-75 # Generate all Grind 75 problems +lcpy list -t grind-75 # List available problems +lcpy scrape -n 1 # Fetch problem data +``` + +### Development Setup + ```bash -# Clone and setup +# Clone and setup for development git clone https://github.com/wisarootl/leetcode-py.git cd leetcode-py poetry install @@ -77,10 +92,10 @@ leetcode/two_sum/ - **ListNode**: Clean arrow-based visualization (`1 -> 2 -> 3`) - **Interactive Debugging**: Multi-cell playground environment -![Tree Visualization Placeholder](docs/images/tree-viz.png) +![Tree Visualization](https://raw.githubusercontent.com/wisarootl/leetcode-py/main/docs/images/tree-viz.png) _Beautiful tree rendering with anytree and Graphviz_ -![LinkedList Visualization Placeholder](docs/images/linkedlist-viz.png) +![LinkedList Visualization](https://raw.githubusercontent.com/wisarootl/leetcode-py/main/docs/images/linkedlist-viz.png) _Clean arrow-based list visualization_ ### Flexible Notebook Support @@ -89,14 +104,36 @@ _Clean arrow-based list visualization_ - **Repository State**: This repo uses Python files (`.py`) for better version control - **User Choice**: Use `make nb-to-py` to convert notebooks to Python files, or keep as `.ipynb` for interactive development -![Notebook Placeholder](docs/images/notebook-example.png) +![Notebook Example](https://raw.githubusercontent.com/wisarootl/leetcode-py/main/docs/images/notebook-example.png) _Interactive multi-cell playground for each problem_ ## 🔄 Usage Patterns -### For Current Grind 75 Problems +### CLI Usage (Global Installation) + +Perfect for quick problem generation anywhere: + +```bash +# Generate specific problems +lcpy gen -n 1 -n 125 -n 206 # Multiple problems by number +lcpy gen -s two-sum -s valid-palindrome # Multiple problems by slug + +# Bulk generation +lcpy gen -t grind-75 # All Grind 75 problems +lcpy gen -t grind-75 -d Easy # Only Easy problems from Grind 75 -Perfect if you want to focus on the most essential interview problems: +# Explore available problems +lcpy list # All problems +lcpy list -t grind-75 # Filter by tag +lcpy list -d Medium # Filter by difficulty + +# Fetch problem data +lcpy scrape -n 1 > two_sum.json # Save problem data +``` + +### Development Workflow + +For repository development and customization: ```bash # Regenerate all 75 problems with fresh TODO placeholders @@ -108,7 +145,7 @@ make p-test PROBLEM=valid_palindrome make p-test PROBLEM=merge_two_sorted_lists ``` -### For Additional Problems (LLM-Assisted) +### LLM-Assisted Problem Creation If you need more problems beyond Grind 75, use an LLM assistant in your IDE (Cursor, GitHub Copilot Chat, Amazon Q, etc.): @@ -126,12 +163,12 @@ If you need more problems beyond Grind 75, use an LLM assistant in your IDE (Cur **Required LLM Context**: Include these rule files in your LLM context for automated problem generation and test enhancement: - [`.amazonq/rules/problem-creation.md`](.amazonq/rules/problem-creation.md) - Complete problem generation workflow -- [`.amazonq/rules/test-case-enhancement.md`](.amazonq/rules/test-case-enhancement.md) - Test enhancement and reproducibility verification +- [`.amazonq/rules/test-quality-assurance.md`](.amazonq/rules/test-quality-assurance.md) - Test enhancement and reproducibility verification **Manual Check**: Find problems needing more test cases: ```bash -poetry run python .templates/check_test_cases.py --threshold=10 +poetry run python -m leetcode_py.tools.check_test_cases --threshold=10 ``` ## 🧰 Helper Classes @@ -160,7 +197,30 @@ poetry run python .templates/check_test_cases.py --threshold=10 - Graphviz visualization for Jupyter notebooks - Generic key type support -## 🛠️ Development Commands +## 🛠️ Commands + +### CLI Commands (Global) + +```bash +# 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 -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 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 +``` + +### Development Commands (Repository) ```bash # Problem-specific operations diff --git a/docs/cli-usage.md b/docs/cli-usage.md new file mode 100644 index 0000000..811beb5 --- /dev/null +++ b/docs/cli-usage.md @@ -0,0 +1,210 @@ +# CLI Usage Guide + +## Installation + +```bash +pip install leetcode-py +``` + +## Quick Start + +```bash +# Generate a single problem +lcpy gen -n 1 + +# Generate multiple problems +lcpy gen -n 1 -n 125 -n 206 + +# Generate by slug +lcpy gen -s two-sum -s valid-palindrome + +# Generate all problems with a tag +lcpy gen -t grind-75 + +# List available problems +lcpy list + +# Scrape problem data +lcpy scrape -n 1 +``` + +## Commands + +### `lcpy gen` - Generate Problems + +Generate LeetCode problem templates from existing JSON definitions. + +**Basic Usage:** + +```bash +lcpy gen [OPTIONS] +``` + +**Options:** + +- `-n, --problem-num` - Problem number(s) (use multiple -n flags) +- `-s, --problem-slug` - Problem slug(s) (use multiple -s flags) +- `-t, --problem-tag` - Problem tag for bulk generation +- `-d, --difficulty` - Filter by difficulty (Easy/Medium/Hard) +- `--all` - Generate all problems +- `-o, --output` - Output directory (default: current directory) +- `--force` - Force overwrite existing files + +**Examples:** + +```bash +# Single problem by number +lcpy gen -n 1 + +# Multiple problems by number +lcpy gen -n 1 -n 2 -n 3 + +# Single problem by slug +lcpy gen -s two-sum + +# Multiple problems by slug +lcpy gen -s two-sum -s valid-palindrome + +# All problems with specific tag +lcpy gen -t grind-75 + +# Filter by difficulty +lcpy gen -t grind-75 -d Easy + +# Custom output directory +lcpy gen -n 1 -o my-problems + +# Force overwrite existing files +lcpy gen -n 1 --force +``` + +### `lcpy scrape` - Scrape Problem Data + +Fetch problem data from LeetCode and output as JSON. + +**Basic Usage:** + +```bash +lcpy scrape [OPTIONS] +``` + +**Options:** + +- `-n, --problem-num` - Problem number +- `-s, --problem-slug` - Problem slug + +**Examples:** + +```bash +# Scrape by problem number +lcpy scrape -n 1 + +# Scrape by problem slug +lcpy scrape -s two-sum + +# Save to file +lcpy scrape -n 1 > two_sum.json +``` + +### `lcpy list` - List Problems + +Display available problems in a formatted table. + +**Basic Usage:** + +```bash +lcpy list [OPTIONS] +``` + +**Options:** + +- `-t, --tag` - Filter by tag +- `-d, --difficulty` - Filter by difficulty + +**Examples:** + +```bash +# List all problems +lcpy list + +# Filter by tag +lcpy list -t grind-75 + +# Filter by difficulty +lcpy list -d Easy + +# Combine filters +lcpy list -t grind-75 -d Medium +``` + +## Problem Structure + +Each generated problem creates the following structure: + +``` +problem_name/ +├── README.md # Problem description +├── solution.py # Implementation template +├── test_solution.py # Test cases +├── helpers.py # Test helpers +├── playground.py # Interactive debugging +└── __init__.py # Package marker +``` + +## Tags + +Available tags for bulk operations: + +- `grind-75` - Essential 75 coding interview problems +- `blind-75` - Original Blind 75 problems +- `neetcode-150` - NeetCode 150 problems +- `top-interview` - Top interview questions +- `easy`, `medium`, `hard` - Difficulty-based tags + +## Output Directory + +By default, problems are generated in the current directory. Use `-o` to specify a different location: + +```bash +# Generate in current directory +lcpy gen -n 1 + +# Generate in specific directory +lcpy gen -n 1 -o leetcode + +# Generate in absolute path +lcpy gen -n 1 -o /path/to/problems +``` + +## Error Handling + +The CLI provides clear error messages and exit codes: + +- **Exit code 0**: Success +- **Exit code 1**: Error occurred + +**Common errors:** + +- Problem number not found +- Invalid tag name +- File already exists (use `--force` to overwrite) +- Network errors during scraping + +## Integration with Existing Workflow + +The CLI is designed to work alongside the existing repository structure: + +```bash +# In existing leetcode-py repository +lcpy gen -n 1 -o leetcode + +# This creates: leetcode/two_sum/ +``` + +## Tips + +1. **Bulk Generation**: Use tags for efficient bulk operations +2. **Force Overwrite**: Use `--force` when regenerating existing problems +3. **Output Organization**: Use `-o` to organize problems in subdirectories +4. **Filtering**: Combine tags and difficulty filters for precise selection +5. **Scripting**: CLI commands work well in shell scripts and automation diff --git a/.templates/leetcode/{{cookiecutter.problem_name}}/__init__.py b/leetcode_py/cli/__init__.py similarity index 100% rename from .templates/leetcode/{{cookiecutter.problem_name}}/__init__.py rename to leetcode_py/cli/__init__.py diff --git a/leetcode_py/cli/commands/__init__.py b/leetcode_py/cli/commands/__init__.py new file mode 100644 index 0000000..e69de29 diff --git a/leetcode_py/cli/commands/gen.py b/leetcode_py/cli/commands/gen.py new file mode 100644 index 0000000..067a97d --- /dev/null +++ b/leetcode_py/cli/commands/gen.py @@ -0,0 +1,153 @@ +import json +from pathlib import Path + +import typer + +from leetcode_py.tools.generator import generate_problem + +from ..utils.problem_finder import ( + find_problem_by_number, + find_problems_by_tag, + get_all_problems, + get_problem_json_path, +) +from ..utils.resources import get_template_path + + +def _get_problem_difficulty(problem_name: str) -> str | None: + json_path = get_problem_json_path(problem_name) + if not json_path.exists(): + return None + + try: + with open(json_path) as f: + data = json.load(f) + return data.get("difficulty") + except Exception: + return None + + +def _validate_single_option( + problem_nums: list[int], + problem_slugs: list[str], + problem_tag: str | None, + all_problems: bool, +) -> None: + options_count = sum( + [ + len(problem_nums) > 0, + len(problem_slugs) > 0, + problem_tag is not None, + all_problems, + ] + ) + + if options_count != 1: + typer.echo( + "Error: Exactly one of --problem-num, --problem-slug, --problem-tag, or --all is required", + err=True, + ) + raise typer.Exit(1) + + +def _resolve_by_numbers(problem_nums: list[int]) -> list[str]: + problems = [] + for num in problem_nums: + problem_name = find_problem_by_number(num) + if not problem_name: + typer.echo(f"Error: Problem number {num} not found", err=True) + raise typer.Exit(1) + problems.append(problem_name) + return problems + + +def _resolve_by_tag(problem_tag: str) -> list[str]: + problems = find_problems_by_tag(problem_tag) + if not problems: + typer.echo(f"Error: No problems found with tag '{problem_tag}'", err=True) + raise typer.Exit(1) + typer.echo(f"Found {len(problems)} problems with tag '{problem_tag}'") + return problems + + +def _filter_by_difficulty(problems: list[str], difficulty: str) -> list[str]: + filtered_problems = [] + for problem_name in problems: + problem_difficulty = _get_problem_difficulty(problem_name) + if problem_difficulty and problem_difficulty.lower() == difficulty.lower(): + filtered_problems.append(problem_name) + typer.echo(f"Filtered to {len(filtered_problems)} problems with difficulty '{difficulty}'") + return filtered_problems + + +def resolve_problems( + problem_nums: list[int], + problem_slugs: list[str], + problem_tag: str | None, + difficulty: str | None, + all_problems: bool, +) -> list[str]: + _validate_single_option(problem_nums, problem_slugs, problem_tag, all_problems) + + if problem_nums: + problems = _resolve_by_numbers(problem_nums) + elif problem_slugs: + problems = problem_slugs + elif problem_tag: + problems = _resolve_by_tag(problem_tag) + else: # all_problems + problems = get_all_problems() + typer.echo(f"Found {len(problems)} problems") + + if difficulty: + problems = _filter_by_difficulty(problems, difficulty) + + return problems + + +def generate( + problem_nums: list[int] = typer.Option( + [], "-n", "--problem-num", help="Problem number(s) (use multiple -n flags)" + ), + problem_slugs: list[str] = typer.Option( + [], "-s", "--problem-slug", help="Problem slug(s) (use multiple -s flags)" + ), + problem_tag: str | None = typer.Option(None, "-t", "--problem-tag", help="Problem tag (bulk)"), + difficulty: str | None = typer.Option( + None, "-d", "--difficulty", help="Filter by difficulty (Easy/Medium/Hard)" + ), + all_problems: bool = typer.Option(False, "--all", help="Generate all problems"), + output: str = typer.Option(".", "-o", "--output", help="Output directory"), + force: bool = typer.Option(False, "--force", help="Force overwrite existing files"), +): + template_dir = get_template_path() + output_dir = Path(output) + + # Determine which problems to generate + problems = resolve_problems(problem_nums, problem_slugs, problem_tag, difficulty, all_problems) + + # Generate each problem + success_count = 0 + failed_count = 0 + + for problem_name in problems: + json_path = get_problem_json_path(problem_name) + if not json_path.exists(): + typer.echo(f"Warning: JSON file not found for problem '{problem_name}', skipping", err=True) + failed_count += 1 + continue + + try: + generate_problem(json_path, template_dir, output_dir, force) + success_count += 1 + except typer.Exit: + # typer.Exit was already handled with proper error message + failed_count += 1 + except Exception as e: + typer.echo(f"Error generating problem '{problem_name}': {e}", err=True) + failed_count += 1 + + typer.echo(f"Completed: {success_count} successful, {failed_count} failed") + + if failed_count > 0: + raise typer.Exit(1) diff --git a/leetcode_py/cli/commands/list.py b/leetcode_py/cli/commands/list.py new file mode 100644 index 0000000..6b8c3e4 --- /dev/null +++ b/leetcode_py/cli/commands/list.py @@ -0,0 +1,94 @@ +"""List command for displaying available LeetCode problems.""" + +import typer +from rich.console import Console +from rich.table import Table + +from ..utils.problem_finder import find_problems_by_tag, get_all_problems, get_tags_for_problem + +console = Console() + + +def list_problems( + tag: str | None = typer.Option(None, "-t", "--tag", help="Filter by tag (e.g., 'grind-75')"), + difficulty: str | None = typer.Option( + None, "-d", "--difficulty", help="Filter by difficulty (Easy/Medium/Hard)" + ), +) -> None: + + # Get problems based on filters + if tag: + problems = find_problems_by_tag(tag) + if not problems: + typer.echo(f"Error: No problems found with tag '{tag}'", err=True) + raise typer.Exit(1) + else: + problems = get_all_problems() + + if not problems: + typer.echo("No problems found", err=True) + raise typer.Exit(1) + + # Create table + table = Table(title="LeetCode Problems") + table.add_column("Number", style="cyan", no_wrap=True) + table.add_column("Title", style="magenta") + table.add_column("Difficulty", style="green") + table.add_column("Tags", style="blue") + + # Get problem data and sort by number + problem_list = [] + for problem_name in problems: + try: + problem_data = _get_problem_data(problem_name) + + # Apply difficulty filter + if difficulty and problem_data.get("difficulty", "").lower() != difficulty.lower(): + continue + + problem_list.append((problem_data, problem_name)) + except Exception: + # Skip problems that can't be loaded + continue + + # Sort by problem number (convert to int for proper numerical sorting) + problem_list.sort( + key=lambda x: int(x[0].get("number", "999999")) if x[0].get("number", "?").isdigit() else 999999 + ) + + # Update table title with count + table.title = f"LeetCode Problems ({len(problem_list)} problems)" + + # Add sorted problems to table + for problem_data, problem_name in problem_list: + table.add_row( + problem_data.get("number", "?"), + problem_data.get("title", problem_name), + problem_data.get("difficulty", "Unknown"), + ", ".join(problem_data.get("tags", [])), + ) + + console.print(table) + + +def _get_problem_data(problem_name: str) -> dict: + import json + + from ..utils.problem_finder import get_problem_json_path + + json_path = get_problem_json_path(problem_name) + if not json_path.exists(): + return {"title": problem_name, "tags": get_tags_for_problem(problem_name)} + + try: + with open(json_path) as f: + data = json.load(f) + + return { + "number": data.get("problem_number", "?"), + "title": data.get("problem_title", problem_name), + "difficulty": data.get("difficulty", "Unknown"), + "tags": get_tags_for_problem(problem_name), + } + except Exception: + return {"title": problem_name, "tags": get_tags_for_problem(problem_name)} diff --git a/leetcode_py/cli/commands/scrape.py b/leetcode_py/cli/commands/scrape.py new file mode 100644 index 0000000..7a55c1b --- /dev/null +++ b/leetcode_py/cli/commands/scrape.py @@ -0,0 +1,49 @@ +import json + +import typer + +from leetcode_py.tools.scraper import LeetCodeScraper + +ERROR_EXACTLY_ONE_OPTION = "Error: Exactly one of --problem-num or --problem-slug is required" + + +def fetch_and_format_problem( + scraper: LeetCodeScraper, problem_num: int | None, problem_slug: str | None +) -> dict: + if problem_num is not None: + problem = scraper.get_problem_by_number(problem_num) + if not problem: + typer.echo(f"Error: Problem number {problem_num} not found", err=True) + raise typer.Exit(1) + elif problem_slug is not None: + problem = scraper.get_problem_by_slug(problem_slug) + if not problem: + typer.echo(f"Error: Problem slug '{problem_slug}' not found", err=True) + raise typer.Exit(1) + else: + typer.echo(ERROR_EXACTLY_ONE_OPTION, err=True) + raise typer.Exit(1) + + return scraper.format_problem_info(problem) + + +def scrape( + problem_num: int | None = typer.Option(None, "-n", "--problem-num", help="Problem number (e.g., 1)"), + problem_slug: str | None = typer.Option( + None, "-s", "--problem-slug", help="Problem slug (e.g., 'two-sum')" + ), +) -> None: + options_provided = sum(x is not None for x in [problem_num, problem_slug]) + if options_provided != 1: + typer.echo(ERROR_EXACTLY_ONE_OPTION, err=True) + raise typer.Exit(1) + + scraper = LeetCodeScraper() + + try: + formatted = fetch_and_format_problem(scraper, problem_num, problem_slug) + typer.echo(json.dumps(formatted, indent=2)) + + except Exception as e: + typer.echo(f"Error fetching problem: {e}", err=True) + raise typer.Exit(1) diff --git a/leetcode_py/cli/main.py b/leetcode_py/cli/main.py new file mode 100644 index 0000000..7f5f695 --- /dev/null +++ b/leetcode_py/cli/main.py @@ -0,0 +1,32 @@ +from importlib.metadata import version + +import typer + +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") + + +def show_version(): + typer.echo(f"lcpy version {version('leetcode-py-sdk')}") + raise typer.Exit() + + +@app.callback(invoke_without_command=True) +def main_callback( + ctx: typer.Context, + version: bool = typer.Option(False, "--version", "-V", help="Show version and exit"), +): + if version: + show_version() + + if ctx.invoked_subcommand is None: + typer.echo(ctx.get_help()) + raise typer.Exit() + + +app.command(name="gen")(generate) +app.command(name="scrape")(scrape) +app.command(name="list")(list_problems) diff --git a/.templates/leetcode/cookiecutter.json b/leetcode_py/cli/resources/leetcode/cookiecutter.json similarity index 100% rename from .templates/leetcode/cookiecutter.json rename to leetcode_py/cli/resources/leetcode/cookiecutter.json diff --git a/.templates/leetcode/examples/example.json5 b/leetcode_py/cli/resources/leetcode/examples/example.json5 similarity index 100% rename from .templates/leetcode/examples/example.json5 rename to leetcode_py/cli/resources/leetcode/examples/example.json5 diff --git a/.templates/leetcode/json/accounts_merge.json b/leetcode_py/cli/resources/leetcode/json/problems/accounts_merge.json similarity index 100% rename from .templates/leetcode/json/accounts_merge.json rename to leetcode_py/cli/resources/leetcode/json/problems/accounts_merge.json diff --git a/.templates/leetcode/json/add_binary.json b/leetcode_py/cli/resources/leetcode/json/problems/add_binary.json similarity index 100% rename from .templates/leetcode/json/add_binary.json rename to leetcode_py/cli/resources/leetcode/json/problems/add_binary.json diff --git a/.templates/leetcode/json/balanced_binary_tree.json b/leetcode_py/cli/resources/leetcode/json/problems/balanced_binary_tree.json similarity index 100% rename from .templates/leetcode/json/balanced_binary_tree.json rename to leetcode_py/cli/resources/leetcode/json/problems/balanced_binary_tree.json diff --git a/.templates/leetcode/json/basic_calculator.json b/leetcode_py/cli/resources/leetcode/json/problems/basic_calculator.json similarity index 100% rename from .templates/leetcode/json/basic_calculator.json rename to leetcode_py/cli/resources/leetcode/json/problems/basic_calculator.json diff --git a/.templates/leetcode/json/best_time_to_buy_and_sell_stock.json b/leetcode_py/cli/resources/leetcode/json/problems/best_time_to_buy_and_sell_stock.json similarity index 100% rename from .templates/leetcode/json/best_time_to_buy_and_sell_stock.json rename to leetcode_py/cli/resources/leetcode/json/problems/best_time_to_buy_and_sell_stock.json diff --git a/.templates/leetcode/json/binary_search.json b/leetcode_py/cli/resources/leetcode/json/problems/binary_search.json similarity index 100% rename from .templates/leetcode/json/binary_search.json rename to leetcode_py/cli/resources/leetcode/json/problems/binary_search.json diff --git a/.templates/leetcode/json/binary_tree_level_order_traversal.json b/leetcode_py/cli/resources/leetcode/json/problems/binary_tree_level_order_traversal.json similarity index 100% rename from .templates/leetcode/json/binary_tree_level_order_traversal.json rename to leetcode_py/cli/resources/leetcode/json/problems/binary_tree_level_order_traversal.json diff --git a/.templates/leetcode/json/binary_tree_right_side_view.json b/leetcode_py/cli/resources/leetcode/json/problems/binary_tree_right_side_view.json similarity index 100% rename from .templates/leetcode/json/binary_tree_right_side_view.json rename to leetcode_py/cli/resources/leetcode/json/problems/binary_tree_right_side_view.json diff --git a/.templates/leetcode/json/climbing_stairs.json b/leetcode_py/cli/resources/leetcode/json/problems/climbing_stairs.json similarity index 100% rename from .templates/leetcode/json/climbing_stairs.json rename to leetcode_py/cli/resources/leetcode/json/problems/climbing_stairs.json diff --git a/.templates/leetcode/json/clone_graph.json b/leetcode_py/cli/resources/leetcode/json/problems/clone_graph.json similarity index 100% rename from .templates/leetcode/json/clone_graph.json rename to leetcode_py/cli/resources/leetcode/json/problems/clone_graph.json diff --git a/.templates/leetcode/json/coin_change.json b/leetcode_py/cli/resources/leetcode/json/problems/coin_change.json similarity index 100% rename from .templates/leetcode/json/coin_change.json rename to leetcode_py/cli/resources/leetcode/json/problems/coin_change.json diff --git a/.templates/leetcode/json/combination_sum.json b/leetcode_py/cli/resources/leetcode/json/problems/combination_sum.json similarity index 100% rename from .templates/leetcode/json/combination_sum.json rename to leetcode_py/cli/resources/leetcode/json/problems/combination_sum.json diff --git a/.templates/leetcode/json/construct_binary_tree_from_preorder_and_inorder_traversal.json b/leetcode_py/cli/resources/leetcode/json/problems/construct_binary_tree_from_preorder_and_inorder_traversal.json similarity index 100% rename from .templates/leetcode/json/construct_binary_tree_from_preorder_and_inorder_traversal.json rename to leetcode_py/cli/resources/leetcode/json/problems/construct_binary_tree_from_preorder_and_inorder_traversal.json diff --git a/.templates/leetcode/json/container_with_most_water.json b/leetcode_py/cli/resources/leetcode/json/problems/container_with_most_water.json similarity index 100% rename from .templates/leetcode/json/container_with_most_water.json rename to leetcode_py/cli/resources/leetcode/json/problems/container_with_most_water.json diff --git a/.templates/leetcode/json/contains_duplicate.json b/leetcode_py/cli/resources/leetcode/json/problems/contains_duplicate.json similarity index 100% rename from .templates/leetcode/json/contains_duplicate.json rename to leetcode_py/cli/resources/leetcode/json/problems/contains_duplicate.json diff --git a/.templates/leetcode/json/course_schedule.json b/leetcode_py/cli/resources/leetcode/json/problems/course_schedule.json similarity index 100% rename from .templates/leetcode/json/course_schedule.json rename to leetcode_py/cli/resources/leetcode/json/problems/course_schedule.json diff --git a/.templates/leetcode/json/diagonal_traverse.json b/leetcode_py/cli/resources/leetcode/json/problems/diagonal_traverse.json similarity index 100% rename from .templates/leetcode/json/diagonal_traverse.json rename to leetcode_py/cli/resources/leetcode/json/problems/diagonal_traverse.json diff --git a/.templates/leetcode/json/diameter_of_binary_tree.json b/leetcode_py/cli/resources/leetcode/json/problems/diameter_of_binary_tree.json similarity index 100% rename from .templates/leetcode/json/diameter_of_binary_tree.json rename to leetcode_py/cli/resources/leetcode/json/problems/diameter_of_binary_tree.json diff --git a/.templates/leetcode/json/evaluate_reverse_polish_notation.json b/leetcode_py/cli/resources/leetcode/json/problems/evaluate_reverse_polish_notation.json similarity index 100% rename from .templates/leetcode/json/evaluate_reverse_polish_notation.json rename to leetcode_py/cli/resources/leetcode/json/problems/evaluate_reverse_polish_notation.json diff --git a/.templates/leetcode/json/find_all_anagrams_in_a_string.json b/leetcode_py/cli/resources/leetcode/json/problems/find_all_anagrams_in_a_string.json similarity index 100% rename from .templates/leetcode/json/find_all_anagrams_in_a_string.json rename to leetcode_py/cli/resources/leetcode/json/problems/find_all_anagrams_in_a_string.json diff --git a/.templates/leetcode/json/find_median_from_data_stream.json b/leetcode_py/cli/resources/leetcode/json/problems/find_median_from_data_stream.json similarity index 100% rename from .templates/leetcode/json/find_median_from_data_stream.json rename to leetcode_py/cli/resources/leetcode/json/problems/find_median_from_data_stream.json diff --git a/.templates/leetcode/json/first_bad_version.json b/leetcode_py/cli/resources/leetcode/json/problems/first_bad_version.json similarity index 100% rename from .templates/leetcode/json/first_bad_version.json rename to leetcode_py/cli/resources/leetcode/json/problems/first_bad_version.json diff --git a/.templates/leetcode/json/flood_fill.json b/leetcode_py/cli/resources/leetcode/json/problems/flood_fill.json similarity index 100% rename from .templates/leetcode/json/flood_fill.json rename to leetcode_py/cli/resources/leetcode/json/problems/flood_fill.json diff --git a/.templates/leetcode/json/implement_queue_using_stacks.json b/leetcode_py/cli/resources/leetcode/json/problems/implement_queue_using_stacks.json similarity index 100% rename from .templates/leetcode/json/implement_queue_using_stacks.json rename to leetcode_py/cli/resources/leetcode/json/problems/implement_queue_using_stacks.json diff --git a/.templates/leetcode/json/implement_trie_prefix_tree.json b/leetcode_py/cli/resources/leetcode/json/problems/implement_trie_prefix_tree.json similarity index 100% rename from .templates/leetcode/json/implement_trie_prefix_tree.json rename to leetcode_py/cli/resources/leetcode/json/problems/implement_trie_prefix_tree.json diff --git a/.templates/leetcode/json/insert_interval.json b/leetcode_py/cli/resources/leetcode/json/problems/insert_interval.json similarity index 100% rename from .templates/leetcode/json/insert_interval.json rename to leetcode_py/cli/resources/leetcode/json/problems/insert_interval.json diff --git a/.templates/leetcode/json/invert_binary_tree.json b/leetcode_py/cli/resources/leetcode/json/problems/invert_binary_tree.json similarity index 100% rename from .templates/leetcode/json/invert_binary_tree.json rename to leetcode_py/cli/resources/leetcode/json/problems/invert_binary_tree.json diff --git a/.templates/leetcode/json/k_closest_points_to_origin.json b/leetcode_py/cli/resources/leetcode/json/problems/k_closest_points_to_origin.json similarity index 100% rename from .templates/leetcode/json/k_closest_points_to_origin.json rename to leetcode_py/cli/resources/leetcode/json/problems/k_closest_points_to_origin.json diff --git a/.templates/leetcode/json/kth_smallest_element_in_a_bst.json b/leetcode_py/cli/resources/leetcode/json/problems/kth_smallest_element_in_a_bst.json similarity index 100% rename from .templates/leetcode/json/kth_smallest_element_in_a_bst.json rename to leetcode_py/cli/resources/leetcode/json/problems/kth_smallest_element_in_a_bst.json diff --git a/.templates/leetcode/json/largest_rectangle_in_histogram.json b/leetcode_py/cli/resources/leetcode/json/problems/largest_rectangle_in_histogram.json similarity index 100% rename from .templates/leetcode/json/largest_rectangle_in_histogram.json rename to leetcode_py/cli/resources/leetcode/json/problems/largest_rectangle_in_histogram.json diff --git a/.templates/leetcode/json/letter_combinations_of_a_phone_number.json b/leetcode_py/cli/resources/leetcode/json/problems/letter_combinations_of_a_phone_number.json similarity index 100% rename from .templates/leetcode/json/letter_combinations_of_a_phone_number.json rename to leetcode_py/cli/resources/leetcode/json/problems/letter_combinations_of_a_phone_number.json diff --git a/.templates/leetcode/json/linked_list_cycle.json b/leetcode_py/cli/resources/leetcode/json/problems/linked_list_cycle.json similarity index 100% rename from .templates/leetcode/json/linked_list_cycle.json rename to leetcode_py/cli/resources/leetcode/json/problems/linked_list_cycle.json diff --git a/.templates/leetcode/json/longest_palindrome.json b/leetcode_py/cli/resources/leetcode/json/problems/longest_palindrome.json similarity index 100% rename from .templates/leetcode/json/longest_palindrome.json rename to leetcode_py/cli/resources/leetcode/json/problems/longest_palindrome.json diff --git a/.templates/leetcode/json/longest_palindromic_substring.json b/leetcode_py/cli/resources/leetcode/json/problems/longest_palindromic_substring.json similarity index 100% rename from .templates/leetcode/json/longest_palindromic_substring.json rename to leetcode_py/cli/resources/leetcode/json/problems/longest_palindromic_substring.json diff --git a/.templates/leetcode/json/longest_substring_without_repeating_characters.json b/leetcode_py/cli/resources/leetcode/json/problems/longest_substring_without_repeating_characters.json similarity index 100% rename from .templates/leetcode/json/longest_substring_without_repeating_characters.json rename to leetcode_py/cli/resources/leetcode/json/problems/longest_substring_without_repeating_characters.json diff --git a/.templates/leetcode/json/lowest_common_ancestor_of_a_binary_search_tree.json b/leetcode_py/cli/resources/leetcode/json/problems/lowest_common_ancestor_of_a_binary_search_tree.json similarity index 100% rename from .templates/leetcode/json/lowest_common_ancestor_of_a_binary_search_tree.json rename to leetcode_py/cli/resources/leetcode/json/problems/lowest_common_ancestor_of_a_binary_search_tree.json diff --git a/.templates/leetcode/json/lowest_common_ancestor_of_a_binary_tree.json b/leetcode_py/cli/resources/leetcode/json/problems/lowest_common_ancestor_of_a_binary_tree.json similarity index 100% rename from .templates/leetcode/json/lowest_common_ancestor_of_a_binary_tree.json rename to leetcode_py/cli/resources/leetcode/json/problems/lowest_common_ancestor_of_a_binary_tree.json diff --git a/.templates/leetcode/json/lru_cache.json b/leetcode_py/cli/resources/leetcode/json/problems/lru_cache.json similarity index 100% rename from .templates/leetcode/json/lru_cache.json rename to leetcode_py/cli/resources/leetcode/json/problems/lru_cache.json diff --git a/.templates/leetcode/json/majority_element.json b/leetcode_py/cli/resources/leetcode/json/problems/majority_element.json similarity index 100% rename from .templates/leetcode/json/majority_element.json rename to leetcode_py/cli/resources/leetcode/json/problems/majority_element.json diff --git a/.templates/leetcode/json/maximum_depth_of_binary_tree.json b/leetcode_py/cli/resources/leetcode/json/problems/maximum_depth_of_binary_tree.json similarity index 100% rename from .templates/leetcode/json/maximum_depth_of_binary_tree.json rename to leetcode_py/cli/resources/leetcode/json/problems/maximum_depth_of_binary_tree.json diff --git a/.templates/leetcode/json/maximum_profit_in_job_scheduling.json b/leetcode_py/cli/resources/leetcode/json/problems/maximum_profit_in_job_scheduling.json similarity index 100% rename from .templates/leetcode/json/maximum_profit_in_job_scheduling.json rename to leetcode_py/cli/resources/leetcode/json/problems/maximum_profit_in_job_scheduling.json diff --git a/.templates/leetcode/json/maximum_subarray.json b/leetcode_py/cli/resources/leetcode/json/problems/maximum_subarray.json similarity index 100% rename from .templates/leetcode/json/maximum_subarray.json rename to leetcode_py/cli/resources/leetcode/json/problems/maximum_subarray.json diff --git a/.templates/leetcode/json/merge_intervals.json b/leetcode_py/cli/resources/leetcode/json/problems/merge_intervals.json similarity index 100% rename from .templates/leetcode/json/merge_intervals.json rename to leetcode_py/cli/resources/leetcode/json/problems/merge_intervals.json diff --git a/.templates/leetcode/json/merge_k_sorted_lists.json b/leetcode_py/cli/resources/leetcode/json/problems/merge_k_sorted_lists.json similarity index 100% rename from .templates/leetcode/json/merge_k_sorted_lists.json rename to leetcode_py/cli/resources/leetcode/json/problems/merge_k_sorted_lists.json diff --git a/.templates/leetcode/json/merge_two_sorted_lists.json b/leetcode_py/cli/resources/leetcode/json/problems/merge_two_sorted_lists.json similarity index 100% rename from .templates/leetcode/json/merge_two_sorted_lists.json rename to leetcode_py/cli/resources/leetcode/json/problems/merge_two_sorted_lists.json diff --git a/.templates/leetcode/json/middle_of_the_linked_list.json b/leetcode_py/cli/resources/leetcode/json/problems/middle_of_the_linked_list.json similarity index 100% rename from .templates/leetcode/json/middle_of_the_linked_list.json rename to leetcode_py/cli/resources/leetcode/json/problems/middle_of_the_linked_list.json diff --git a/.templates/leetcode/json/min_stack.json b/leetcode_py/cli/resources/leetcode/json/problems/min_stack.json similarity index 100% rename from .templates/leetcode/json/min_stack.json rename to leetcode_py/cli/resources/leetcode/json/problems/min_stack.json diff --git a/.templates/leetcode/json/minimum_height_trees.json b/leetcode_py/cli/resources/leetcode/json/problems/minimum_height_trees.json similarity index 100% rename from .templates/leetcode/json/minimum_height_trees.json rename to leetcode_py/cli/resources/leetcode/json/problems/minimum_height_trees.json diff --git a/.templates/leetcode/json/minimum_window_substring.json b/leetcode_py/cli/resources/leetcode/json/problems/minimum_window_substring.json similarity index 100% rename from .templates/leetcode/json/minimum_window_substring.json rename to leetcode_py/cli/resources/leetcode/json/problems/minimum_window_substring.json diff --git a/.templates/leetcode/json/number_of_islands.json b/leetcode_py/cli/resources/leetcode/json/problems/number_of_islands.json similarity index 100% rename from .templates/leetcode/json/number_of_islands.json rename to leetcode_py/cli/resources/leetcode/json/problems/number_of_islands.json diff --git a/.templates/leetcode/json/partition_equal_subset_sum.json b/leetcode_py/cli/resources/leetcode/json/problems/partition_equal_subset_sum.json similarity index 100% rename from .templates/leetcode/json/partition_equal_subset_sum.json rename to leetcode_py/cli/resources/leetcode/json/problems/partition_equal_subset_sum.json diff --git a/.templates/leetcode/json/permutations.json b/leetcode_py/cli/resources/leetcode/json/problems/permutations.json similarity index 100% rename from .templates/leetcode/json/permutations.json rename to leetcode_py/cli/resources/leetcode/json/problems/permutations.json diff --git a/.templates/leetcode/json/product_of_array_except_self.json b/leetcode_py/cli/resources/leetcode/json/problems/product_of_array_except_self.json similarity index 100% rename from .templates/leetcode/json/product_of_array_except_self.json rename to leetcode_py/cli/resources/leetcode/json/problems/product_of_array_except_self.json diff --git a/.templates/leetcode/json/ransom_note.json b/leetcode_py/cli/resources/leetcode/json/problems/ransom_note.json similarity index 100% rename from .templates/leetcode/json/ransom_note.json rename to leetcode_py/cli/resources/leetcode/json/problems/ransom_note.json diff --git a/.templates/leetcode/json/reverse_linked_list.json b/leetcode_py/cli/resources/leetcode/json/problems/reverse_linked_list.json similarity index 100% rename from .templates/leetcode/json/reverse_linked_list.json rename to leetcode_py/cli/resources/leetcode/json/problems/reverse_linked_list.json diff --git a/.templates/leetcode/json/reverse_linked_list_ii.json b/leetcode_py/cli/resources/leetcode/json/problems/reverse_linked_list_ii.json similarity index 100% rename from .templates/leetcode/json/reverse_linked_list_ii.json rename to leetcode_py/cli/resources/leetcode/json/problems/reverse_linked_list_ii.json diff --git a/.templates/leetcode/json/rotting_oranges.json b/leetcode_py/cli/resources/leetcode/json/problems/rotting_oranges.json similarity index 100% rename from .templates/leetcode/json/rotting_oranges.json rename to leetcode_py/cli/resources/leetcode/json/problems/rotting_oranges.json diff --git a/.templates/leetcode/json/search_in_rotated_sorted_array.json b/leetcode_py/cli/resources/leetcode/json/problems/search_in_rotated_sorted_array.json similarity index 100% rename from .templates/leetcode/json/search_in_rotated_sorted_array.json rename to leetcode_py/cli/resources/leetcode/json/problems/search_in_rotated_sorted_array.json diff --git a/.templates/leetcode/json/serialize_and_deserialize_binary_tree.json b/leetcode_py/cli/resources/leetcode/json/problems/serialize_and_deserialize_binary_tree.json similarity index 100% rename from .templates/leetcode/json/serialize_and_deserialize_binary_tree.json rename to leetcode_py/cli/resources/leetcode/json/problems/serialize_and_deserialize_binary_tree.json diff --git a/.templates/leetcode/json/sort_colors.json b/leetcode_py/cli/resources/leetcode/json/problems/sort_colors.json similarity index 100% rename from .templates/leetcode/json/sort_colors.json rename to leetcode_py/cli/resources/leetcode/json/problems/sort_colors.json diff --git a/.templates/leetcode/json/spiral_matrix.json b/leetcode_py/cli/resources/leetcode/json/problems/spiral_matrix.json similarity index 100% rename from .templates/leetcode/json/spiral_matrix.json rename to leetcode_py/cli/resources/leetcode/json/problems/spiral_matrix.json diff --git a/.templates/leetcode/json/string_to_integer_atoi.json b/leetcode_py/cli/resources/leetcode/json/problems/string_to_integer_atoi.json similarity index 100% rename from .templates/leetcode/json/string_to_integer_atoi.json rename to leetcode_py/cli/resources/leetcode/json/problems/string_to_integer_atoi.json diff --git a/.templates/leetcode/json/subsets.json b/leetcode_py/cli/resources/leetcode/json/problems/subsets.json similarity index 100% rename from .templates/leetcode/json/subsets.json rename to leetcode_py/cli/resources/leetcode/json/problems/subsets.json diff --git a/.templates/leetcode/json/task_scheduler.json b/leetcode_py/cli/resources/leetcode/json/problems/task_scheduler.json similarity index 100% rename from .templates/leetcode/json/task_scheduler.json rename to leetcode_py/cli/resources/leetcode/json/problems/task_scheduler.json diff --git a/.templates/leetcode/json/three_sum.json b/leetcode_py/cli/resources/leetcode/json/problems/three_sum.json similarity index 100% rename from .templates/leetcode/json/three_sum.json rename to leetcode_py/cli/resources/leetcode/json/problems/three_sum.json diff --git a/.templates/leetcode/json/time_based_key_value_store.json b/leetcode_py/cli/resources/leetcode/json/problems/time_based_key_value_store.json similarity index 100% rename from .templates/leetcode/json/time_based_key_value_store.json rename to leetcode_py/cli/resources/leetcode/json/problems/time_based_key_value_store.json diff --git a/.templates/leetcode/json/trapping_rain_water.json b/leetcode_py/cli/resources/leetcode/json/problems/trapping_rain_water.json similarity index 100% rename from .templates/leetcode/json/trapping_rain_water.json rename to leetcode_py/cli/resources/leetcode/json/problems/trapping_rain_water.json diff --git a/.templates/leetcode/json/two_sum.json b/leetcode_py/cli/resources/leetcode/json/problems/two_sum.json similarity index 100% rename from .templates/leetcode/json/two_sum.json rename to leetcode_py/cli/resources/leetcode/json/problems/two_sum.json diff --git a/.templates/leetcode/json/unique_paths.json b/leetcode_py/cli/resources/leetcode/json/problems/unique_paths.json similarity index 100% rename from .templates/leetcode/json/unique_paths.json rename to leetcode_py/cli/resources/leetcode/json/problems/unique_paths.json diff --git a/.templates/leetcode/json/valid_anagram.json b/leetcode_py/cli/resources/leetcode/json/problems/valid_anagram.json similarity index 100% rename from .templates/leetcode/json/valid_anagram.json rename to leetcode_py/cli/resources/leetcode/json/problems/valid_anagram.json diff --git a/.templates/leetcode/json/valid_palindrome.json b/leetcode_py/cli/resources/leetcode/json/problems/valid_palindrome.json similarity index 100% rename from .templates/leetcode/json/valid_palindrome.json rename to leetcode_py/cli/resources/leetcode/json/problems/valid_palindrome.json diff --git a/.templates/leetcode/json/valid_parentheses.json b/leetcode_py/cli/resources/leetcode/json/problems/valid_parentheses.json similarity index 100% rename from .templates/leetcode/json/valid_parentheses.json rename to leetcode_py/cli/resources/leetcode/json/problems/valid_parentheses.json diff --git a/.templates/leetcode/json/validate_binary_search_tree.json b/leetcode_py/cli/resources/leetcode/json/problems/validate_binary_search_tree.json similarity index 100% rename from .templates/leetcode/json/validate_binary_search_tree.json rename to leetcode_py/cli/resources/leetcode/json/problems/validate_binary_search_tree.json diff --git a/.templates/leetcode/json/word_break.json b/leetcode_py/cli/resources/leetcode/json/problems/word_break.json similarity index 100% rename from .templates/leetcode/json/word_break.json rename to leetcode_py/cli/resources/leetcode/json/problems/word_break.json diff --git a/.templates/leetcode/json/word_ladder.json b/leetcode_py/cli/resources/leetcode/json/problems/word_ladder.json similarity index 100% rename from .templates/leetcode/json/word_ladder.json rename to leetcode_py/cli/resources/leetcode/json/problems/word_ladder.json diff --git a/.templates/leetcode/json/word_search.json b/leetcode_py/cli/resources/leetcode/json/problems/word_search.json similarity index 100% rename from .templates/leetcode/json/word_search.json rename to leetcode_py/cli/resources/leetcode/json/problems/word_search.json diff --git a/.templates/leetcode/json/zero_one_matrix.json b/leetcode_py/cli/resources/leetcode/json/problems/zero_one_matrix.json similarity index 100% rename from .templates/leetcode/json/zero_one_matrix.json rename to leetcode_py/cli/resources/leetcode/json/problems/zero_one_matrix.json diff --git a/leetcode_py/cli/resources/leetcode/json/tags.json5 b/leetcode_py/cli/resources/leetcode/json/tags.json5 new file mode 100644 index 0000000..ac0d614 --- /dev/null +++ b/leetcode_py/cli/resources/leetcode/json/tags.json5 @@ -0,0 +1,87 @@ +{ + // Grind 75 - extracted from actual problem JSON files + "grind-75": [ + "accounts_merge", + "add_binary", + "balanced_binary_tree", + "basic_calculator", + "best_time_to_buy_and_sell_stock", + "binary_search", + "binary_tree_level_order_traversal", + "binary_tree_right_side_view", + "climbing_stairs", + "clone_graph", + "coin_change", + "combination_sum", + "construct_binary_tree_from_preorder_and_inorder_traversal", + "container_with_most_water", + "contains_duplicate", + "course_schedule", + "diameter_of_binary_tree", + "evaluate_reverse_polish_notation", + "find_all_anagrams_in_a_string", + "find_median_from_data_stream", + "first_bad_version", + "flood_fill", + "implement_queue_using_stacks", + "implement_trie_prefix_tree", + "insert_interval", + "invert_binary_tree", + "k_closest_points_to_origin", + "kth_smallest_element_in_a_bst", + "largest_rectangle_in_histogram", + "letter_combinations_of_a_phone_number", + "linked_list_cycle", + "longest_palindrome", + "longest_palindromic_substring", + "longest_substring_without_repeating_characters", + "lowest_common_ancestor_of_a_binary_search_tree", + "lowest_common_ancestor_of_a_binary_tree", + "lru_cache", + "majority_element", + "maximum_depth_of_binary_tree", + "maximum_profit_in_job_scheduling", + "maximum_subarray", + "merge_intervals", + "merge_k_sorted_lists", + "merge_two_sorted_lists", + "middle_of_the_linked_list", + "min_stack", + "minimum_height_trees", + "minimum_window_substring", + "number_of_islands", + "partition_equal_subset_sum", + "permutations", + "product_of_array_except_self", + "ransom_note", + "reverse_linked_list", + "rotting_oranges", + "search_in_rotated_sorted_array", + "serialize_and_deserialize_binary_tree", + "sort_colors", + "spiral_matrix", + "string_to_integer_atoi", + "subsets", + "task_scheduler", + "three_sum", + "time_based_key_value_store", + "trapping_rain_water", + "two_sum", + "unique_paths", + "valid_anagram", + "valid_palindrome", + "valid_parentheses", + "validate_binary_search_tree", + "word_break", + "word_ladder", + "word_search", + "zero_one_matrix" + ], + + // Test tag for development and testing + "test": [ + "two_sum", + "valid_palindrome", + "binary_search" + ] +} diff --git a/.templates/leetcode/{{cookiecutter.problem_name}}/README.md b/leetcode_py/cli/resources/leetcode/{{cookiecutter.problem_name}}/README.md similarity index 100% rename from .templates/leetcode/{{cookiecutter.problem_name}}/README.md rename to leetcode_py/cli/resources/leetcode/{{cookiecutter.problem_name}}/README.md diff --git a/leetcode_py/cli/resources/leetcode/{{cookiecutter.problem_name}}/__init__.py b/leetcode_py/cli/resources/leetcode/{{cookiecutter.problem_name}}/__init__.py new file mode 100644 index 0000000..e69de29 diff --git a/.templates/leetcode/{{cookiecutter.problem_name}}/helpers.py b/leetcode_py/cli/resources/leetcode/{{cookiecutter.problem_name}}/helpers.py similarity index 100% rename from .templates/leetcode/{{cookiecutter.problem_name}}/helpers.py rename to leetcode_py/cli/resources/leetcode/{{cookiecutter.problem_name}}/helpers.py diff --git a/.templates/leetcode/{{cookiecutter.problem_name}}/playground.ipynb b/leetcode_py/cli/resources/leetcode/{{cookiecutter.problem_name}}/playground.ipynb similarity index 100% rename from .templates/leetcode/{{cookiecutter.problem_name}}/playground.ipynb rename to leetcode_py/cli/resources/leetcode/{{cookiecutter.problem_name}}/playground.ipynb diff --git a/.templates/leetcode/{{cookiecutter.problem_name}}/solution.py b/leetcode_py/cli/resources/leetcode/{{cookiecutter.problem_name}}/solution.py similarity index 100% rename from .templates/leetcode/{{cookiecutter.problem_name}}/solution.py rename to leetcode_py/cli/resources/leetcode/{{cookiecutter.problem_name}}/solution.py diff --git a/.templates/leetcode/{{cookiecutter.problem_name}}/test_solution.py b/leetcode_py/cli/resources/leetcode/{{cookiecutter.problem_name}}/test_solution.py similarity index 100% rename from .templates/leetcode/{{cookiecutter.problem_name}}/test_solution.py rename to leetcode_py/cli/resources/leetcode/{{cookiecutter.problem_name}}/test_solution.py diff --git a/leetcode_py/cli/utils/__init__.py b/leetcode_py/cli/utils/__init__.py new file mode 100644 index 0000000..e69de29 diff --git a/leetcode_py/cli/utils/problem_finder.py b/leetcode_py/cli/utils/problem_finder.py new file mode 100644 index 0000000..5943b5c --- /dev/null +++ b/leetcode_py/cli/utils/problem_finder.py @@ -0,0 +1,78 @@ +import json +from functools import lru_cache +from pathlib import Path + +import json5 + +from .resources import get_problems_json_path, get_tags_path + + +def find_problems_by_tag(tag: str) -> list[str]: + tags_file = get_tags_path() + + try: + with open(tags_file) as f: + tags_data = json5.load(f) + return tags_data.get(tag, []) + except (ValueError, OSError, KeyError): + return [] + + +def get_problem_json_path(problem_name: str) -> Path: + json_path = get_problems_json_path() + return json_path / f"{problem_name}.json" + + +@lru_cache(maxsize=1) +def _build_problem_number_cache() -> dict[int, str]: + json_path = get_problems_json_path() + number_to_name_map: dict[int, str] = {} + + for json_file in json_path.glob("*.json"): + try: + with open(json_file) as f: + data = json.load(f) + problem_number = data.get("problem_number") + if problem_number and problem_number.isdigit(): + number_to_name_map[int(problem_number)] = data.get("problem_name", json_file.stem) + except (json.JSONDecodeError, KeyError, OSError): + continue + + return number_to_name_map + + +def find_problem_by_number(number: int) -> str | None: + cache = _build_problem_number_cache() + return cache.get(number) + + +def get_all_problems() -> list[str]: + json_path = get_problems_json_path() + return [json_file.stem for json_file in json_path.glob("*.json")] + + +@lru_cache(maxsize=1) +def _build_problem_tags_cache() -> dict[str, list[str]]: + tags_file = get_tags_path() + problem_tags_map: dict[str, list[str]] = {} + + try: + with open(tags_file) as f: + tags_data = json5.load(f) + + # Build reverse mapping: problem -> list of tags + for tag_name, problems in tags_data.items(): + if isinstance(problems, list): + for problem_name in problems: + if problem_name not in problem_tags_map: + problem_tags_map[problem_name] = [] + problem_tags_map[problem_name].append(tag_name) + + return problem_tags_map + except (ValueError, OSError, KeyError): + return {} + + +def get_tags_for_problem(problem_name: str) -> list[str]: + cache = _build_problem_tags_cache() + return cache.get(problem_name, []) diff --git a/leetcode_py/cli/utils/resources.py b/leetcode_py/cli/utils/resources.py new file mode 100644 index 0000000..2c61086 --- /dev/null +++ b/leetcode_py/cli/utils/resources.py @@ -0,0 +1,19 @@ +from pathlib import Path + + +def get_template_path() -> Path: + current_file = Path(__file__) + resources_path = current_file.parent.parent / "resources" / "leetcode" + + if resources_path.exists(): + return resources_path + + raise FileNotFoundError(f"Template resources not found at {resources_path}.") + + +def get_problems_json_path() -> Path: + return get_template_path() / "json" / "problems" + + +def get_tags_path() -> Path: + return get_template_path() / "json" / "tags.json5" diff --git a/leetcode_py/tools/__init__.py b/leetcode_py/tools/__init__.py index 51fc3e4..2a590ba 100644 --- a/leetcode_py/tools/__init__.py +++ b/leetcode_py/tools/__init__.py @@ -1,7 +1,7 @@ """LeetCode tools package for scraping and template generation.""" -from .generator import TemplateGenerator +from .generator import generate_problem from .parser import HTMLParser from .scraper import LeetCodeScraper -__all__ = ["LeetCodeScraper", "HTMLParser", "TemplateGenerator"] +__all__ = ["LeetCodeScraper", "HTMLParser", "generate_problem"] diff --git a/leetcode_py/tools/check_test_cases.py b/leetcode_py/tools/check_test_cases.py new file mode 100644 index 0000000..fbbad79 --- /dev/null +++ b/leetcode_py/tools/check_test_cases.py @@ -0,0 +1,81 @@ +#!/usr/bin/env python3 + +import ast +import json +from typing import Any + +import typer + +from leetcode_py.cli.utils.resources import get_problems_json_path + + +def count_test_cases_for_problem(json_data: dict[str, Any]) -> int: + """Count total test cases across all test methods for a problem.""" + total = 0 + + # Handle both direct test_methods and nested _test_methods.list + test_methods = json_data.get("test_methods", []) + if not test_methods and "_test_methods" in json_data: + test_methods = json_data["_test_methods"].get("list", []) + + for method in test_methods: + test_cases = method.get("test_cases", "") + if test_cases.strip(): + # Parse Python list literal using ast.literal_eval + cases_list = ast.literal_eval(test_cases) + total += len(cases_list) + return total + + +def check_test_cases( + threshold: int = typer.Option( + 10, "--threshold", "-t", help="Show problems with test cases <= threshold" + ), + max_results: str = typer.Option( + "10", "--max", "-m", help="Maximum number of results to show ('none' for no limit)" + ), +) -> None: + """Check test case counts in LeetCode problems.""" + problems_dir = get_problems_json_path() + all_problems: list[tuple[str, int]] = [] + + for problem_file in problems_dir.glob("*.json"): + try: + with open(problem_file) as f: + data = json.load(f) + + test_count = count_test_cases_for_problem(data) + all_problems.append((problem_file.name, test_count)) + except Exception as e: + typer.echo(f"Error reading problem {problem_file.name}: {e}", err=True) + + # Sort by test count + all_problems.sort(key=lambda x: x[1]) + + # Filter by threshold + filtered_problems = [p for p in all_problems if p[1] <= threshold] + + # Apply max results limit + if max_results.lower() not in ["none", "null", "-1"]: + try: + max_count = int(max_results) + if max_count > 0: + filtered_problems = filtered_problems[:max_count] + except ValueError: + typer.echo(f"Invalid max_results value: {max_results}", err=True) + raise typer.Exit(1) + + typer.echo(f"Problems with ≤{threshold} test cases ({len(filtered_problems)} total):") + for problem_name, count in filtered_problems: + typer.echo(f"{problem_name}: {count} test cases") + + # Exit with non-zero code if any problems found + if filtered_problems: + raise typer.Exit(1) + + +app = typer.Typer() +app.command()(check_test_cases) + +if __name__ == "__main__": + app() diff --git a/leetcode_py/tools/generator.py b/leetcode_py/tools/generator.py index b18c4d1..4474cb9 100644 --- a/leetcode_py/tools/generator.py +++ b/leetcode_py/tools/generator.py @@ -1,216 +1,69 @@ -"""Template generation utilities for LeetCode problems.""" - import json -import sys from pathlib import Path -from typing import Any, Dict, Protocol +import black import typer from cookiecutter.main import cookiecutter -class FileOperations(Protocol): - """Protocol for file operations to enable testing.""" - - def read_json(self, path: Path) -> Dict[str, Any]: - """Read JSON from file.""" - ... - - def write_json(self, path: Path, data: Dict[str, Any]) -> None: - """Write JSON to file.""" - ... +def load_json_data(json_path: Path) -> dict: + if not json_path.exists(): + typer.echo(f"Error: {json_path} not found", err=True) + raise typer.Exit(1) - def exists(self, path: Path) -> bool: - """Check if path exists.""" - ... + try: + with open(json_path) as f: + return json.load(f) + except (json.JSONDecodeError, OSError) as e: + typer.echo(f"Error reading {json_path}: {e}", err=True) + raise typer.Exit(1) -class DefaultFileOperations: - """Default file operations implementation.""" - - def read_json(self, path: Path) -> Dict[str, Any]: - """Read JSON from file.""" - try: - with open(path) as f: - return json.load(f) - except (json.JSONDecodeError, OSError) as e: - typer.echo(f"Error reading {path}: {e}", err=True) - raise typer.Exit(1) - - def write_json(self, path: Path, data: Dict[str, Any]) -> None: - """Write JSON to file.""" - try: - with open(path, "w") as f: - json.dump(data, f) - except OSError as e: - typer.echo(f"Error writing {path}: {e}", err=True) +def check_problem_exists(problem_name: str, output_dir: Path, force: bool) -> None: + if not force: + problem_dir = output_dir / problem_name + if problem_dir.exists(): + typer.echo( + f"Error: Problem '{problem_name}' already exists. Use --force to overwrite.", err=True + ) raise typer.Exit(1) - def exists(self, path: Path) -> bool: - """Check if path exists.""" - return path.exists() - -class TemplateGenerator: - """Generator for LeetCode problem templates using cookiecutter.""" +def format_python_files(problem_dir: Path) -> None: + if not problem_dir.exists(): + return - def __init__(self, file_ops: FileOperations | None = None): - self.common_tags = ["grind-75", "blind-75", "neetcode-150", "top-interview"] - self.file_ops = file_ops or DefaultFileOperations() - - def check_and_prompt_tags(self, data: Dict[str, Any]) -> Dict[str, Any]: - """Check and prompt for tags if empty.""" - if self._should_prompt_for_tags(data) and sys.stdin.isatty(): - selected_tags = self._prompt_for_tags() - data["tags"] = selected_tags - self._display_tags_result(selected_tags) - return data - - def _should_prompt_for_tags(self, data: Dict[str, Any]) -> bool: - """Check if we should prompt for tags.""" - return "tags" in data and (not data["tags"] or data["tags"] == []) - - def _prompt_for_tags(self) -> list[str]: - """Prompt user for tag selection.""" - self._display_tag_options() - choices_input = typer.prompt("Select options (comma-separated, e.g. '1,2' or '0' to skip)") - return self._process_tag_choices(choices_input) - - def _display_tag_options(self) -> None: - """Display available tag options.""" - typer.echo("\n📋 No tags specified. Would you like to add any common tags?") - typer.echo("Available options:") - for i, tag in enumerate(self.common_tags, 1): - typer.echo(f" {i}. {tag}") - typer.echo(" 0. Skip (no tags)") - - def _process_tag_choices(self, choices_input: str) -> list[str]: - """Process user's tag choices.""" + py_files = list(problem_dir.glob("*.py")) + for py_file in py_files: try: - choices = [int(x.strip()) for x in choices_input.split(",")] - return self._build_selected_tags(choices) - except ValueError: - typer.echo("⚠️ Invalid input, skipping tags") - return [] - - def _build_selected_tags(self, choices: list[int]) -> list[str]: - """Build list of selected tags from choices.""" - selected_tags: list[str] = [] - for choice in choices: - if choice == 0: - return [] - if 1 <= choice <= len(self.common_tags): - tag = self.common_tags[choice - 1] - if tag not in selected_tags: - selected_tags.append(tag) - return selected_tags - - def _display_tags_result(self, selected_tags: list[str]) -> None: - """Display the result of tag selection.""" - if selected_tags: - typer.echo(f"✅ Added tags: {', '.join(selected_tags)}") - else: - typer.echo("✅ No tags added") - - def auto_set_dummy_return(self, data: Dict[str, Any]) -> Dict[str, Any]: - """Auto-set dummy_return based on return_type.""" - if "dummy_return" not in data and "return_type" in data: - return_type = data["return_type"] - dummy_map = {"bool": "False", "int": "0", "str": '""', "float": "0.0", "None": "None"} - - if return_type in dummy_map: - data["dummy_return"] = dummy_map[return_type] - elif return_type.startswith("list["): - data["dummy_return"] = "[]" - elif return_type.startswith("dict["): - data["dummy_return"] = "{}" - elif return_type.startswith("set["): - data["dummy_return"] = "set()" - elif return_type.startswith("tuple["): - data["dummy_return"] = "()" - else: - data["dummy_return"] = "None" - - return data - - def convert_arrays_to_nested(self, data: Dict[str, Any]) -> Dict[str, Any]: - """Convert arrays to cookiecutter-friendly nested format.""" - extra_context = data.copy() - array_fields = [ - "tags", - "readme_examples", - "solution_methods", - "test_helper_methods", - "test_methods", - ] - for field in array_fields: - if field in data and isinstance(data[field], list): - extra_context[f"_{field}"] = {"list": data[field]} - del extra_context[field] - return extra_context - - def check_overwrite_permission(self, problem_name: str, force: bool, output_dir: Path) -> None: - """Check if problem exists and get overwrite permission.""" - if force: - return - - problem_dir = output_dir / problem_name - - if not self.file_ops.exists(problem_dir): - return - - typer.echo( - f"⚠️ Warning: Problem '{problem_name}' already exists in {output_dir.name}/", err=True + content = py_file.read_text() + formatted = black.format_str(content, mode=black.FileMode()) + py_file.write_text(formatted) + except Exception: + # Silently continue if formatting fails + pass + + +def generate_from_template(data: dict, template_dir: Path, output_dir: Path) -> None: + """Generate problem files using cookiecutter template.""" + try: + cookiecutter( + str(template_dir), + extra_context=data, + no_input=True, + overwrite_if_exists=True, + output_dir=str(output_dir), ) - typer.echo("This will overwrite existing files. Use --force to skip this check.", err=True) - - if sys.stdin.isatty(): # Interactive terminal - confirm = typer.confirm("Continue?") - if not confirm: - typer.echo("Cancelled.") - raise typer.Exit(1) - else: # Non-interactive mode - typer.echo("Non-interactive mode: use --force to overwrite.", err=True) - raise typer.Exit(1) - - def generate_problem( - self, json_file: str, template_dir: Path, output_dir: Path, force: bool = False - ) -> None: - """Generate problem from JSON using cookiecutter.""" - json_path = Path(json_file) - if not self.file_ops.exists(json_path): - typer.echo(f"Error: {json_file} not found", err=True) - raise typer.Exit(1) - - # Load JSON data - data = self.file_ops.read_json(json_path) - - # Process data - data = self.check_and_prompt_tags(data) - data = self.auto_set_dummy_return(data) - - # Save updated data back to JSON file - self.file_ops.write_json(json_path, data) - - # Convert arrays to cookiecutter-friendly nested format - extra_context = self.convert_arrays_to_nested(data) - - # Check if problem already exists - problem_name = extra_context.get("problem_name", "unknown") - - self.check_overwrite_permission(problem_name, force, output_dir) + problem_name = data.get("problem_name", "unknown") + format_python_files(output_dir / problem_name) + typer.echo(f"✅ Generated problem: {problem_name}") + except Exception as e: + typer.echo(f"Error generating template: {e}", err=True) + raise typer.Exit(1) - # Generate project using cookiecutter - try: - cookiecutter( - str(template_dir), - extra_context=extra_context, - no_input=True, - overwrite_if_exists=True, - output_dir=str(output_dir), - ) - except Exception as e: - typer.echo(f"Error generating template: {e}", err=True) - raise typer.Exit(1) - typer.echo(f"✅ Generated problem: {problem_name}") +def generate_problem(json_path: Path, template_dir: Path, output_dir: Path, force: bool = False) -> None: + data = load_json_data(json_path) + problem_name = data.get("problem_name", "unknown") + check_problem_exists(problem_name, output_dir, force) + generate_from_template(data, template_dir, output_dir) diff --git a/leetcode_py/tools/parser.py b/leetcode_py/tools/parser.py index 0aa8024..8fb8c2c 100644 --- a/leetcode_py/tools/parser.py +++ b/leetcode_py/tools/parser.py @@ -1,7 +1,7 @@ """HTML parsing utilities for LeetCode problem content.""" import re -from typing import Any, Dict, List +from typing import Any class HTMLParser: @@ -13,7 +13,7 @@ def clean_html(text: str) -> str: return re.sub(r"<[^>]+>", "", text).strip() @staticmethod - def parse_content(html_content: str) -> Dict[str, Any]: + def parse_content(html_content: str) -> dict[str, Any]: """Parse HTML content to extract description, examples, and constraints.""" # Extract description (everything before first example) desc_match = re.search( @@ -43,7 +43,7 @@ def parse_content(html_content: str) -> Dict[str, Any]: return {"description": description, "examples": examples, "constraints": constraints} @staticmethod - def parse_test_cases(test_cases_str: str) -> List[List[str]]: + def parse_test_cases(test_cases_str: str) -> list[list[str]]: """Parse test cases from the exampleTestcases string.""" if not test_cases_str: return [] diff --git a/leetcode_py/tools/scraper.py b/leetcode_py/tools/scraper.py index 8d6cfa5..05418bc 100644 --- a/leetcode_py/tools/scraper.py +++ b/leetcode_py/tools/scraper.py @@ -1,24 +1,38 @@ """LeetCode GraphQL API scraper to fetch problem information.""" -from typing import Any, Dict, Optional +from typing import Any import requests from .parser import HTMLParser +GRAPHQL_URL = "https://leetcode.com/graphql" +ALGORITHMS_API_URL = "https://leetcode.com/api/problems/algorithms/" +USER_AGENT = "Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/537.36" + +COMMON_SLUGS = { + 1: "two-sum", + 2: "add-two-numbers", + 3: "longest-substring-without-repeating-characters", + 15: "3sum", + 20: "valid-parentheses", + 21: "merge-two-sorted-lists", + 53: "maximum-subarray", + 121: "best-time-to-buy-and-sell-stock", + 125: "valid-palindrome", + 226: "invert-binary-tree", +} -class LeetCodeScraper: - """Scraper for LeetCode problem information using GraphQL API.""" +class LeetCodeScraper: def __init__(self): - self.base_url = "https://leetcode.com/graphql" + self.base_url = GRAPHQL_URL self.headers = { "Content-Type": "application/json", - "User-Agent": "Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/537.36", + "User-Agent": USER_AGENT, } - def get_problem_by_slug(self, problem_slug: str) -> Optional[Dict[str, Any]]: - """Get problem info by problem slug (e.g., 'two-sum').""" + def get_problem_by_slug(self, problem_slug: str) -> dict[str, Any] | None: query = """ query questionData($titleSlug: String!) { question(titleSlug: $titleSlug) { @@ -51,8 +65,7 @@ def get_problem_by_slug(self, problem_slug: str) -> Optional[Dict[str, Any]]: return data.get("data", {}).get("question") return None - def get_problem_by_number(self, problem_number: int) -> Optional[Dict[str, Any]]: - """Get problem info by problem number (e.g., 1 for Two Sum).""" + def get_problem_by_number(self, problem_number: int) -> dict[str, Any] | None: # First try to get slug from algorithms API slug = self._get_slug_by_number(problem_number) if slug: @@ -60,13 +73,9 @@ def get_problem_by_number(self, problem_number: int) -> Optional[Dict[str, Any]] return self._try_common_slugs(problem_number) - def _get_slug_by_number(self, problem_number: int) -> Optional[str]: - """Get problem slug by number using the algorithms API.""" + def _get_slug_by_number(self, problem_number: int) -> str | None: try: - response = requests.get( - "https://leetcode.com/api/problems/algorithms/", headers=self.headers - ) - + response = requests.get(ALGORITHMS_API_URL, headers=self.headers) if response.status_code == 200: data = response.json() for problem in data.get("stat_status_pairs", []): @@ -74,31 +83,14 @@ def _get_slug_by_number(self, problem_number: int) -> Optional[str]: return problem["stat"]["question__title_slug"] except Exception: pass - return None - def _try_common_slugs(self, problem_number: int) -> Optional[Dict[str, Any]]: - """Try common slug patterns for well-known problems.""" - common_slugs = { - 1: "two-sum", - 2: "add-two-numbers", - 3: "longest-substring-without-repeating-characters", - 15: "3sum", - 20: "valid-parentheses", - 21: "merge-two-sorted-lists", - 53: "maximum-subarray", - 121: "best-time-to-buy-and-sell-stock", - 125: "valid-palindrome", - 226: "invert-binary-tree", - } - - if problem_number in common_slugs: - return self.get_problem_by_slug(common_slugs[problem_number]) - + def _try_common_slugs(self, problem_number: int) -> dict[str, Any] | None: + if problem_number in COMMON_SLUGS: + return self.get_problem_by_slug(COMMON_SLUGS[problem_number]) return None - def get_python_code(self, problem_info: Dict[str, Any]) -> Optional[str]: - """Extract Python code snippet from problem info.""" + def get_python_code(self, problem_info: dict[str, Any]) -> str | None: if not problem_info or "codeSnippets" not in problem_info: return None @@ -107,8 +99,7 @@ def get_python_code(self, problem_info: Dict[str, Any]) -> Optional[str]: return snippet.get("code") return None - def format_problem_info(self, problem_info: Dict[str, Any]) -> Dict[str, Any]: - """Format problem info into a clean structure.""" + def format_problem_info(self, problem_info: dict[str, Any]) -> dict[str, Any]: if not problem_info: return {} diff --git a/poetry.lock b/poetry.lock index 2598c1b..c88ef01 100644 --- a/poetry.lock +++ b/poetry.lock @@ -1,4 +1,4 @@ -# This file is automatically @generated by Poetry 2.1.4 and should not be changed by hand. +# This file is automatically @generated by Poetry 2.2.0 and should not be changed by hand. [[package]] name = "anytree" @@ -6,7 +6,7 @@ version = "2.13.0" description = "Powerful and Lightweight Python Tree Data Structure with various plugins" optional = false python-versions = "<4.0,>=3.9.2" -groups = ["base"] +groups = ["main"] files = [ {file = "anytree-2.13.0-py3-none-any.whl", hash = "sha256:4cbcf10df36b1f1cba131b7e487ff3edafc9d6e932a3c70071b5b768bab901ff"}, {file = "anytree-2.13.0.tar.gz", hash = "sha256:c9d3aa6825fdd06af7ebb05b4ef291d2db63e62bb1f9b7d9b71354be9d362714"}, @@ -31,7 +31,7 @@ version = "1.3.0" description = "Better dates & times for Python" optional = false python-versions = ">=3.8" -groups = ["dev"] +groups = ["main"] files = [ {file = "arrow-1.3.0-py3-none-any.whl", hash = "sha256:c728b120ebc00eb84e01882a6f5e7927a53960aa990ce7dd2b10f39005a67f80"}, {file = "arrow-1.3.0.tar.gz", hash = "sha256:d4540617648cb5f895730f1ad8c82a65f2dad0166f57b75f3ca54759c4d67a85"}, @@ -102,7 +102,7 @@ version = "0.4.4" description = "Ultra-lightweight pure Python package to check if a file is binary or text." optional = false python-versions = "*" -groups = ["dev"] +groups = ["main"] files = [ {file = "binaryornot-0.4.4-py2.py3-none-any.whl", hash = "sha256:b8b71173c917bddcd2c16070412e369c3ed7f0528926f70cac18a6c97fd563e4"}, {file = "binaryornot-0.4.4.tar.gz", hash = "sha256:359501dfc9d40632edc9fac890e19542db1a287bbcfa58175b66658392018061"}, @@ -117,7 +117,7 @@ version = "25.1.0" description = "The uncompromising code formatter." optional = false python-versions = ">=3.9" -groups = ["dev"] +groups = ["main"] files = [ {file = "black-25.1.0-cp310-cp310-macosx_10_9_x86_64.whl", hash = "sha256:759e7ec1e050a15f89b770cefbf91ebee8917aac5c20483bc2d80a6c3a04df32"}, {file = "black-25.1.0-cp310-cp310-macosx_11_0_arm64.whl", hash = "sha256:0e519ecf93120f34243e6b0054db49c00a35f84f195d5bce7e9f5cfc578fc2da"}, @@ -162,7 +162,7 @@ version = "2025.8.3" description = "Python package for providing Mozilla's CA Bundle." optional = false python-versions = ">=3.7" -groups = ["main", "dev"] +groups = ["main"] files = [ {file = "certifi-2025.8.3-py3-none-any.whl", hash = "sha256:f6c12493cfb1b06ba2ff328595af9350c65d6644968e5d3a2ffd78699af217a5"}, {file = "certifi-2025.8.3.tar.gz", hash = "sha256:e564105f78ded564e3ae7c923924435e1daa7463faeab5bb932bc53ffae63407"}, @@ -284,7 +284,7 @@ version = "5.2.0" description = "Universal encoding detector for Python 3" optional = false python-versions = ">=3.7" -groups = ["dev"] +groups = ["main"] files = [ {file = "chardet-5.2.0-py3-none-any.whl", hash = "sha256:e1cf59446890a00105fe7b7912492ea04b6e6f06d4b742b2c788469e34c82970"}, {file = "chardet-5.2.0.tar.gz", hash = "sha256:1b3b6ff479a8c414bc3fa2c0852995695c4a026dcd6d0633b2dd092ca39c1cf7"}, @@ -296,7 +296,7 @@ version = "3.4.3" description = "The Real First Universal Charset Detector. Open, modern and actively maintained alternative to Chardet." optional = false python-versions = ">=3.7" -groups = ["main", "dev"] +groups = ["main"] files = [ {file = "charset_normalizer-3.4.3-cp310-cp310-macosx_10_9_universal2.whl", hash = "sha256:fb7f67a1bfa6e40b438170ebdc8158b78dc465a5a67b6dde178a46987b244a72"}, {file = "charset_normalizer-3.4.3-cp310-cp310-manylinux2014_aarch64.manylinux_2_17_aarch64.manylinux_2_28_aarch64.whl", hash = "sha256:cc9370a2da1ac13f0153780040f465839e6cccb4a1e44810124b4e22483c93fe"}, @@ -385,7 +385,7 @@ version = "8.2.1" description = "Composable command line interface toolkit" optional = false python-versions = ">=3.10" -groups = ["main", "dev"] +groups = ["main"] files = [ {file = "click-8.2.1-py3-none-any.whl", hash = "sha256:61a3265b914e850b85317d0b3109c7f8cd35a670f963866005d6ef1d5175a12b"}, {file = "click-8.2.1.tar.gz", hash = "sha256:27c491cc05d968d271d5a1db13e3b5a184636d9d930f148c50b038f0d0646202"}, @@ -405,7 +405,7 @@ files = [ {file = "colorama-0.4.6-py2.py3-none-any.whl", hash = "sha256:4f1d9991f5acc0ca119f9d443620b77f9d6b33703e51011c16baf57afb285fc6"}, {file = "colorama-0.4.6.tar.gz", hash = "sha256:08695f5cb7ed6e0531a20572697297273c47b8cae5a63ffc6d6ed5c201be6e44"}, ] -markers = {main = "platform_system == \"Windows\"", base = "sys_platform == \"win32\"", dev = "platform_system == \"Windows\" or sys_platform == \"win32\""} +markers = {main = "platform_system == \"Windows\"", base = "sys_platform == \"win32\"", dev = "sys_platform == \"win32\""} [[package]] name = "comm" @@ -428,7 +428,7 @@ version = "2.6.0" description = "A command-line utility that creates projects from project templates, e.g. creating a Python package project from a Python package project template." optional = false python-versions = ">=3.7" -groups = ["dev"] +groups = ["main"] files = [ {file = "cookiecutter-2.6.0-py3-none-any.whl", hash = "sha256:a54a8e37995e4ed963b3e82831072d1ad4b005af736bb17b99c2cbd9d41b6e2d"}, {file = "cookiecutter-2.6.0.tar.gz", hash = "sha256:db21f8169ea4f4fdc2408d48ca44859349de2647fbe494a9d6c3edfc0542c21c"}, @@ -685,7 +685,7 @@ version = "3.10" description = "Internationalized Domain Names in Applications (IDNA)" optional = false python-versions = ">=3.6" -groups = ["main", "dev"] +groups = ["main"] files = [ {file = "idna-3.10-py3-none-any.whl", hash = "sha256:946d195a0d259cbba61165e88e65941f16e9b36ea6ddb97f00452bae8b1287d3"}, {file = "idna-3.10.tar.gz", hash = "sha256:12f65c9b470abda6dc35cf8e63cc574b1c52b11df2c86030af0ac09b01b13ea9"}, @@ -829,7 +829,7 @@ version = "3.1.6" description = "A very fast and expressive template engine." optional = false python-versions = ">=3.7" -groups = ["dev"] +groups = ["main"] files = [ {file = "jinja2-3.1.6-py3-none-any.whl", hash = "sha256:85ece4451f492d0c13c5dd7c13a64681a86afae63a5f347908daf103ce6d2f67"}, {file = "jinja2-3.1.6.tar.gz", hash = "sha256:0137fb05990d35f1275a587e9aee6d56da821fc83491a0fb838183be43f66d6d"}, @@ -841,6 +841,21 @@ MarkupSafe = ">=2.0" [package.extras] i18n = ["Babel (>=2.7)"] +[[package]] +name = "json5" +version = "0.12.1" +description = "A Python implementation of the JSON5 data format." +optional = false +python-versions = ">=3.8.0" +groups = ["main"] +files = [ + {file = "json5-0.12.1-py3-none-any.whl", hash = "sha256:d9c9b3bc34a5f54d43c35e11ef7cb87d8bdd098c6ace87117a7b7e83e705c1d5"}, + {file = "json5-0.12.1.tar.gz", hash = "sha256:b2743e77b3242f8d03c143dd975a6ec7c52e2f2afe76ed934e53503dd4ad4990"}, +] + +[package.extras] +dev = ["build (==1.2.2.post1)", "coverage (==7.5.4) ; python_version < \"3.9\"", "coverage (==7.8.0) ; python_version >= \"3.9\"", "mypy (==1.14.1) ; python_version < \"3.9\"", "mypy (==1.15.0) ; python_version >= \"3.9\"", "pip (==25.0.1)", "pylint (==3.2.7) ; python_version < \"3.9\"", "pylint (==3.3.6) ; python_version >= \"3.9\"", "ruff (==0.11.2)", "twine (==6.1.0)", "uv (==0.6.11)"] + [[package]] name = "jsonschema" version = "4.25.1" @@ -1000,7 +1015,7 @@ version = "3.0.2" description = "Safely add untrusted strings to HTML/XML markup." optional = false python-versions = ">=3.9" -groups = ["dev"] +groups = ["main"] files = [ {file = "MarkupSafe-3.0.2-cp310-cp310-macosx_10_9_universal2.whl", hash = "sha256:7e94c425039cde14257288fd61dcfb01963e658efbc0ff54f5306b06054700f8"}, {file = "MarkupSafe-3.0.2-cp310-cp310-macosx_11_0_arm64.whl", hash = "sha256:9e2d922824181480953426608b81967de705c3cef4d1af983af849d7bd619158"}, @@ -1178,7 +1193,7 @@ version = "1.1.0" description = "Type system extensions for programs checked with the mypy type checker." optional = false python-versions = ">=3.8" -groups = ["dev"] +groups = ["main", "dev"] files = [ {file = "mypy_extensions-1.1.0-py3-none-any.whl", hash = "sha256:1be4cccdb0f2482337c4743e60421de3a356cd97508abadd57d47403e94f5505"}, {file = "mypy_extensions-1.1.0.tar.gz", hash = "sha256:52e68efc3284861e772bbcd66823fde5ae21fd2fdb51c62a211403730b916558"}, @@ -1257,7 +1272,7 @@ version = "25.0" description = "Core utilities for Python packages" optional = false python-versions = ">=3.8" -groups = ["dev"] +groups = ["main", "dev"] files = [ {file = "packaging-25.0-py3-none-any.whl", hash = "sha256:29572ef2b1f17581046b3a2227d5c611fb25ec70ca1ba8554b24b0e69331a484"}, {file = "packaging-25.0.tar.gz", hash = "sha256:d443872c98d677bf60f6a1f2f8c1cb748e8fe762d2bf9d3148b5599295b0fc4f"}, @@ -1285,7 +1300,7 @@ version = "0.12.1" description = "Utility library for gitignore style pattern matching of file paths." optional = false python-versions = ">=3.8" -groups = ["dev"] +groups = ["main", "dev"] files = [ {file = "pathspec-0.12.1-py3-none-any.whl", hash = "sha256:a0d503e138a4c123b27490a4f7beda6a01c6f288df0e4a8b79c7eb0dc7b4cc08"}, {file = "pathspec-0.12.1.tar.gz", hash = "sha256:a482d51503a1ab33b1c67a6c3813a26953dbdc71c31dacaef9a838c4e29f5712"}, @@ -1313,7 +1328,7 @@ version = "4.4.0" description = "A small Python package for determining appropriate platform-specific dirs, e.g. a `user data dir`." optional = false python-versions = ">=3.9" -groups = ["dev"] +groups = ["main", "dev"] files = [ {file = "platformdirs-4.4.0-py3-none-any.whl", hash = "sha256:abd01743f24e5287cd7a5db3752faf1a2d65353f38ec26d98e25a6db65958c85"}, {file = "platformdirs-4.4.0.tar.gz", hash = "sha256:ca753cf4d81dc309bc67b0ea38fd15dc97bc30ce419a7f58d13eb3bf14c4febf"}, @@ -1490,23 +1505,23 @@ dev = ["argcomplete", "attrs (>=19.2)", "hypothesis (>=3.56)", "mock", "requests [[package]] name = "pytest-cov" -version = "6.3.0" +version = "7.0.0" description = "Pytest plugin for measuring coverage." optional = false python-versions = ">=3.9" groups = ["dev"] files = [ - {file = "pytest_cov-6.3.0-py3-none-any.whl", hash = "sha256:440db28156d2468cafc0415b4f8e50856a0d11faefa38f30906048fe490f1749"}, - {file = "pytest_cov-6.3.0.tar.gz", hash = "sha256:35c580e7800f87ce892e687461166e1ac2bcb8fb9e13aea79032518d6e503ff2"}, + {file = "pytest_cov-7.0.0-py3-none-any.whl", hash = "sha256:3b8e9558b16cc1479da72058bdecf8073661c7f57f7d3c5f22a1c23507f2d861"}, + {file = "pytest_cov-7.0.0.tar.gz", hash = "sha256:33c97eda2e049a0c5298e91f519302a1334c26ac65c1a483d6206fd458361af1"}, ] [package.dependencies] -coverage = {version = ">=7.5", extras = ["toml"]} +coverage = {version = ">=7.10.6", extras = ["toml"]} pluggy = ">=1.2" -pytest = ">=6.2.5" +pytest = ">=7" [package.extras] -testing = ["fields", "hunter", "process-tests", "pytest-xdist", "virtualenv"] +testing = ["process-tests", "pytest-xdist", "virtualenv"] [[package]] name = "python-dateutil" @@ -1514,7 +1529,7 @@ version = "2.9.0.post0" description = "Extensions to the standard Python datetime module" optional = false python-versions = "!=3.0.*,!=3.1.*,!=3.2.*,>=2.7" -groups = ["dev"] +groups = ["main", "dev"] files = [ {file = "python-dateutil-2.9.0.post0.tar.gz", hash = "sha256:37dd54208da7e1cd875388217d5e00ebd4179249f90fb72437e91a35459a0ad3"}, {file = "python_dateutil-2.9.0.post0-py2.py3-none-any.whl", hash = "sha256:a8b2bc7bffae282281c8140a97d3aa9c14da0b136dfe83f850eea9a5f7470427"}, @@ -1529,7 +1544,7 @@ version = "8.0.4" description = "A Python slugify application that also handles Unicode" optional = false python-versions = ">=3.7" -groups = ["dev"] +groups = ["main"] files = [ {file = "python-slugify-8.0.4.tar.gz", hash = "sha256:59202371d1d05b54a9e7720c5e038f928f45daaffe41dd10822f3907b937c856"}, {file = "python_slugify-8.0.4-py2.py3-none-any.whl", hash = "sha256:276540b79961052b66b7d116620b36518847f52d5fd9e3a70164fc8c50faa6b8"}, @@ -1578,7 +1593,7 @@ version = "6.0.2" description = "YAML parser and emitter for Python" optional = false python-versions = ">=3.8" -groups = ["dev"] +groups = ["main", "dev"] files = [ {file = "PyYAML-6.0.2-cp310-cp310-macosx_10_9_x86_64.whl", hash = "sha256:0a9a2848a5b7feac301353437eb7d5957887edbf81d56e903999a75a3d743086"}, {file = "PyYAML-6.0.2-cp310-cp310-macosx_11_0_arm64.whl", hash = "sha256:29717114e51c84ddfba879543fb232a6ed60086602313ca38cce623c1d62cfbf"}, @@ -1762,7 +1777,7 @@ version = "2.32.5" description = "Python HTTP for Humans." optional = false python-versions = ">=3.9" -groups = ["main", "dev"] +groups = ["main"] files = [ {file = "requests-2.32.5-py3-none-any.whl", hash = "sha256:2462f94637a34fd532264295e186976db0f5d453d1cdd31473c85a6a161affb6"}, {file = "requests-2.32.5.tar.gz", hash = "sha256:dbba0bac56e100853db0ea71b82b4dfd5fe2bf6d3754a8893c3af500cec7d7cf"}, @@ -1784,7 +1799,7 @@ version = "14.1.0" description = "Render rich text, tables, progress bars, syntax highlighting, markdown and more to the terminal" optional = false python-versions = ">=3.8.0" -groups = ["main", "dev"] +groups = ["main"] files = [ {file = "rich-14.1.0-py3-none-any.whl", hash = "sha256:536f5f1785986d6dbdea3c75205c473f970777b4a0d6c6dd1b696aa05a3fa04f"}, {file = "rich-14.1.0.tar.gz", hash = "sha256:e497a48b844b0320d45007cdebfeaeed8db2a4f4bcf49f15e455cfc4af11eaa8"}, @@ -2009,7 +2024,7 @@ version = "1.17.0" description = "Python 2 and 3 compatibility utilities" optional = false python-versions = "!=3.0.*,!=3.1.*,!=3.2.*,>=2.7" -groups = ["dev"] +groups = ["main", "dev"] files = [ {file = "six-1.17.0-py2.py3-none-any.whl", hash = "sha256:4721f391ed90541fddacab5acf947aa0d3dc7d27b2e1e8eda2be8970586c3274"}, {file = "six-1.17.0.tar.gz", hash = "sha256:ff70335d468e7eb6ec65b95b99d3a2836546063f63acc5171de367e834932a81"}, @@ -2041,7 +2056,7 @@ version = "1.3" description = "The most basic Text::Unidecode port" optional = false python-versions = "*" -groups = ["dev"] +groups = ["main"] files = [ {file = "text-unidecode-1.3.tar.gz", hash = "sha256:bad6603bb14d279193107714b288be206cac565dfa49aa5b105294dd5c4aab93"}, {file = "text_unidecode-1.3-py2.py3-none-any.whl", hash = "sha256:1311f10e8b895935241623731c2ba64f4c455287888b18189350b67134a822e8"}, @@ -2163,7 +2178,7 @@ version = "2.9.0.20250822" description = "Typing stubs for python-dateutil" optional = false python-versions = ">=3.9" -groups = ["dev"] +groups = ["main"] files = [ {file = "types_python_dateutil-2.9.0.20250822-py3-none-any.whl", hash = "sha256:849d52b737e10a6dc6621d2bd7940ec7c65fcb69e6aa2882acf4e56b2b508ddc"}, {file = "types_python_dateutil-2.9.0.20250822.tar.gz", hash = "sha256:84c92c34bd8e68b117bff742bc00b692a1e8531262d4507b33afcc9f7716cd53"}, @@ -2187,7 +2202,7 @@ version = "2.5.0" description = "HTTP library with thread-safe connection pooling, file post, and more." optional = false python-versions = ">=3.9" -groups = ["main", "dev"] +groups = ["main"] files = [ {file = "urllib3-2.5.0-py3-none-any.whl", hash = "sha256:e6b01673c0fa6a13e374b50871808eb3bf7046c4b125b216f6bf1cc604cff0dc"}, {file = "urllib3-2.5.0.tar.gz", hash = "sha256:3fc47733c7e419d4bc3f6b3dc2b4f890bb743906a30d56ba4a5bfa4bbff92760"}, @@ -2251,4 +2266,4 @@ dev = ["black (>=19.3b0) ; python_version >= \"3.6\"", "pytest (>=4.6.2)"] [metadata] lock-version = "2.1" python-versions = "^3.13" -content-hash = "e8769741fb13e346d2f8b7a6bc97b1a3042f1b2a0cfafbaa2125279ab454c9af" +content-hash = "11af98f38dd5768ebe54804d96677bc209cd0927a64f14c2110dde92d9496301" diff --git a/pyproject.toml b/pyproject.toml index 68c5bab..28663d1 100644 --- a/pyproject.toml +++ b/pyproject.toml @@ -19,20 +19,26 @@ classifiers = [ "Programming Language :: Python :: 3.13", ] packages = [{include = "leetcode_py"}] +include = ["leetcode_py/cli/resources/**/*"] + +[tool.poetry.scripts] +lcpy = "leetcode_py.cli.main:app" [tool.poetry.dependencies] python = "^3.13" +anytree = "^2.13.0" +black = "^25.1.0" +cookiecutter = "^2.6.0" graphviz = "^0.21" +json5 = "^0.12.1" requests = "^2.32.5" +rich = "^14.1.0" typer = "^0.17.0" [tool.poetry.group.base.dependencies] -anytree = "^2.13.0" loguru = "^0.7.3" [tool.poetry.group.dev.dependencies] -black = "^25.1.0" -cookiecutter = "^2.6.0" ipykernel = "^6.30.1" isort = "^6.0.1" jupytext = "^1.16.6" @@ -40,7 +46,7 @@ mypy = "^1.17.1" nbqa = "^1.9.1" pre-commit = "^4.3.0" pytest = "^8.4.1" -pytest-cov = "^6.2.1" +pytest-cov = "^7.0.0" ruff = "^0.13.0" [build-system] @@ -56,7 +62,7 @@ target-version = ['py312'] include = '.*\.(py|ipynb)$' # All .py and .ipynb files extend-exclude = ''' /( - .templates + leetcode_py/cli/resources )/ ''' @@ -68,12 +74,12 @@ force_grid_wrap = 0 combine_as_imports = true use_parentheses = true ensure_newline_before_comments = true -extend_skip_glob = [".templates/*"] +extend_skip_glob = ["leetcode_py/cli/resources/*"] [tool.ruff] line-length = 105 target-version = 'py312' -extend-exclude = [".templates"] +extend-exclude = ["leetcode_py/cli/resources"] [tool.ruff.lint.pydocstyle] convention = "numpy" @@ -83,7 +89,7 @@ files = '**/*.py' warn_unused_configs = true ignore_missing_imports = true disable_error_code = ["return", "no-redef"] -exclude = [".templates"] +exclude = ["leetcode_py/cli/resources"] [tool.pytest.ini_options] testpaths = ["leetcode", "tests"] @@ -91,6 +97,7 @@ python_files = ["tests.py", "test_*.py"] python_classes = ["Test*"] python_functions = ["test_*"] addopts = "-v --tb=short" +norecursedirs = ["leetcode_py/cli/resources"] [tool.coverage.run] omit = ["**/playground.py"] diff --git a/tests/cli/__init__.py b/tests/cli/__init__.py new file mode 100644 index 0000000..e69de29 diff --git a/tests/cli/test_gen.py b/tests/cli/test_gen.py new file mode 100644 index 0000000..6fe2728 --- /dev/null +++ b/tests/cli/test_gen.py @@ -0,0 +1,161 @@ +import re +import tempfile +from pathlib import Path + +import pytest +from typer.testing import CliRunner + +from leetcode_py.cli.main import app + +runner = CliRunner() + + +def test_gen_help(): + result = runner.invoke(app, ["gen", "--help"]) + assert result.exit_code == 0 + # Remove ANSI color codes for reliable string matching + clean_output = re.sub(r"\x1b\[[0-9;]*m", "", result.stdout) + assert "--problem-num" in clean_output + assert "--problem-slug" in clean_output + assert "--problem-tag" in clean_output + assert "--difficulty" in clean_output + assert "--all" in clean_output + + +def test_gen_no_options(): + result = runner.invoke(app, ["gen"]) + assert result.exit_code == 1 + assert ( + "Exactly one of --problem-num, --problem-slug, --problem-tag, or --all is required" + in result.stderr + ) + + +@pytest.mark.parametrize( + "args", + [ + ["-n", "1", "-s", "two-sum"], + ["-n", "1", "-t", "test"], + ["-s", "two-sum", "-t", "test"], + ["-n", "1", "--all"], + ], +) +def test_gen_multiple_options(args): + result = runner.invoke(app, ["gen"] + args) + assert result.exit_code == 1 + assert ( + "Exactly one of --problem-num, --problem-slug, --problem-tag, or --all is required" + in result.stderr + ) + + +@pytest.mark.parametrize( + "args,expected_problems,expected_count", + [ + (["-n", "1"], ["two_sum"], "1 successful, 0 failed"), + (["-n", "1", "-n", "125"], ["two_sum", "valid_palindrome"], "2 successful, 0 failed"), + ], +) +def test_gen_by_numbers(args, expected_problems, expected_count): + with tempfile.TemporaryDirectory() as temp_dir: + result = runner.invoke(app, ["gen"] + args + ["-o", temp_dir, "--force"]) + assert result.exit_code == 0 + + for problem in expected_problems: + assert f"Generated problem: {problem}" in result.stdout + problem_dir = Path(temp_dir) / problem + assert problem_dir.exists() + assert (problem_dir / "solution.py").exists() + + assert f"Completed: {expected_count}" in result.stdout + + +@pytest.mark.parametrize( + "args,expected_problems,expected_count", + [ + (["-s", "valid_palindrome"], ["valid_palindrome"], "1 successful, 0 failed"), + ( + ["-s", "two_sum", "-s", "valid_palindrome"], + ["two_sum", "valid_palindrome"], + "2 successful, 0 failed", + ), + ], +) +def test_gen_by_slugs(args, expected_problems, expected_count): + with tempfile.TemporaryDirectory() as temp_dir: + result = runner.invoke(app, ["gen"] + args + ["-o", temp_dir, "--force"]) + assert result.exit_code == 0 + + for problem in expected_problems: + assert f"Generated problem: {problem}" in result.stdout + problem_dir = Path(temp_dir) / problem + assert problem_dir.exists() + assert (problem_dir / "solution.py").exists() + + assert f"Completed: {expected_count}" in result.stdout + + +def test_gen_by_tag(): + with tempfile.TemporaryDirectory() as temp_dir: + result = runner.invoke(app, ["gen", "-t", "test", "-o", temp_dir, "--force"]) + assert result.exit_code == 0 + assert "Found" in result.stdout + assert "problems with tag 'test'" in result.stdout + assert "Generated problem:" in result.stdout + assert "successful" in result.stdout + + +def test_gen_with_difficulty_filter(): + with tempfile.TemporaryDirectory() as temp_dir: + result = runner.invoke(app, ["gen", "-t", "test", "-d", "Easy", "-o", temp_dir, "--force"]) + assert result.exit_code == 0 + assert "Found" in result.stdout + assert "Filtered to" in result.stdout + assert "problems with difficulty 'Easy'" in result.stdout + + +@pytest.mark.parametrize( + "args,expected_error", + [ + (["-n", "99999"], "Problem number 99999 not found"), + (["-t", "nonexistent"], "No problems found with tag 'nonexistent'"), + ], +) +def test_gen_invalid_inputs(args, expected_error): + result = runner.invoke(app, ["gen"] + args) + assert result.exit_code == 1 + assert expected_error in result.stderr + + +def test_gen_existing_problem_without_force(): + with tempfile.TemporaryDirectory() as temp_dir: + # First generation should succeed + result1 = runner.invoke(app, ["gen", "-n", "1", "-o", temp_dir, "--force"]) + assert result1.exit_code == 0 + + # Second generation without --force should fail + result2 = runner.invoke(app, ["gen", "-n", "1", "-o", temp_dir]) + assert result2.exit_code == 1 + assert "already exists" in result2.stderr + assert "Completed: 0 successful, 1 failed" in result2.stdout + + +def test_gen_mixed_success_failure(): + with tempfile.TemporaryDirectory() as temp_dir: + # Create one problem first + runner.invoke(app, ["gen", "-n", "1", "-o", temp_dir, "--force"]) + + # Try to generate existing + new problem without force + result = runner.invoke(app, ["gen", "-n", "1", "-n", "125", "-o", temp_dir]) + assert result.exit_code == 1 + assert "already exists" in result.stderr + assert "Generated problem: valid_palindrome" in result.stdout + assert "Completed: 1 successful, 1 failed" in result.stdout + + +def test_gen_default_output_directory(): + # Test that default output is current directory + result = runner.invoke(app, ["gen", "--help"]) + assert result.exit_code == 0 + # The help should show the default value + assert "Output directory" in result.stdout diff --git a/tests/cli/test_list.py b/tests/cli/test_list.py new file mode 100644 index 0000000..74a8bcd --- /dev/null +++ b/tests/cli/test_list.py @@ -0,0 +1,53 @@ +import re + +from typer.testing import CliRunner + +from leetcode_py.cli.main import app + +runner = CliRunner() + + +def test_list_help(): + result = runner.invoke(app, ["list", "--help"]) + assert result.exit_code == 0 + # Remove ANSI color codes for reliable string matching + clean_output = re.sub(r"\x1b\[[0-9;]*m", "", result.stdout) + assert "--tag" in clean_output + assert "--difficulty" in clean_output + + +def test_list_all_problems(): + result = runner.invoke(app, ["list"]) + assert result.exit_code == 0 + assert "LeetCode Problems" in result.stdout + assert "Number" in result.stdout + assert "Title" in result.stdout + assert "Difficulty" in result.stdout + + +def test_list_by_tag(): + result = runner.invoke(app, ["list", "-t", "grind-75"]) + assert result.exit_code == 0 + assert "LeetCode Problems" in result.stdout + assert "Two Sum" in result.stdout + + +def test_list_by_difficulty(): + result = runner.invoke(app, ["list", "-d", "Easy"]) + assert result.exit_code == 0 + assert "LeetCode Problems" in result.stdout + assert "Easy" in result.stdout + assert "Two Sum" in result.stdout + + +def test_list_invalid_tag(): + result = runner.invoke(app, ["list", "-t", "nonexistent-tag"]) + assert result.exit_code == 1 + assert "No problems found with tag 'nonexistent-tag'" in result.stderr + + +def test_list_combined_filters(): + result = runner.invoke(app, ["list", "-t", "grind-75", "-d", "Easy"]) + assert result.exit_code == 0 + assert "LeetCode Problems" in result.stdout + assert "Two Sum" in result.stdout diff --git a/tests/cli/test_main.py b/tests/cli/test_main.py new file mode 100644 index 0000000..e581e4e --- /dev/null +++ b/tests/cli/test_main.py @@ -0,0 +1,68 @@ +import pytest +from typer.testing import CliRunner + +from leetcode_py.cli.main import app + +runner = CliRunner() + + +def test_cli_help(): + result = runner.invoke(app, ["--help"]) + assert result.exit_code == 0 + assert "LeetCode problem generator" in result.stdout + assert "gen" in result.stdout + assert "scrape" in result.stdout + assert "list" in result.stdout + + +def test_cli_version(): + result = runner.invoke(app, ["--version"]) + assert result.exit_code == 0 + assert "lcpy version" in result.stdout + + +def test_cli_version_short(): + result = runner.invoke(app, ["-V"]) + assert result.exit_code == 0 + assert "lcpy version" in result.stdout + + +@pytest.mark.parametrize("command", ["gen", "scrape", "list"]) +def test_command_help(command): + result = runner.invoke(app, [command, "--help"]) + assert result.exit_code == 0 + assert "Usage:" in result.stdout + + +def test_invalid_command(): + result = runner.invoke(app, ["invalid"]) + assert result.exit_code != 0 + + +def test_no_args_shows_help(): + result = runner.invoke(app, []) + assert result.exit_code == 0 + assert "LeetCode problem generator" in result.stdout + assert "Commands" in result.stdout + + +def test_cli_structure(): + """Test that all expected commands are available.""" + result = runner.invoke(app, ["--help"]) + assert result.exit_code == 0 + + # Check all main commands are listed + commands = ["gen", "scrape", "list"] + for cmd in commands: + assert cmd in result.stdout + + +def test_version_format(): + """Test version output format.""" + result = runner.invoke(app, ["--version"]) + assert result.exit_code == 0 + + # Should contain version info + output = result.stdout.strip() + assert output.startswith("lcpy version") + assert len(output.split()) >= 3 # "lcpy version X.Y.Z" diff --git a/tests/cli/test_problem_finder.py b/tests/cli/test_problem_finder.py new file mode 100644 index 0000000..d84dcfc --- /dev/null +++ b/tests/cli/test_problem_finder.py @@ -0,0 +1,106 @@ +import pytest + +from leetcode_py.cli.utils.problem_finder import ( + find_problem_by_number, + find_problems_by_tag, + get_all_problems, + get_tags_for_problem, +) + + +def test_find_problem_by_number(): + # Test existing problem + result = find_problem_by_number(1) + assert result == "two_sum" + + # Test another existing problem + result = find_problem_by_number(125) + assert result == "valid_palindrome" + + +def test_find_problem_by_number_not_found(): + result = find_problem_by_number(99999) + assert result is None + + +def test_find_problems_by_tag(): + # Test existing tag + result = find_problems_by_tag("test") + assert isinstance(result, list) + assert len(result) > 0 + + # Test grind-75 tag (should have many problems) + result = find_problems_by_tag("grind-75") + assert isinstance(result, list) + assert len(result) > 10 # Should have many problems + + +def test_find_problems_by_tag_not_found(): + result = find_problems_by_tag("nonexistent") + assert result == [] + + +def test_get_all_problems(): + result = get_all_problems() + assert isinstance(result, list) + assert len(result) > 0 + + # Should contain known problems + assert "two_sum" in result + assert "valid_palindrome" in result + + +def test_get_tags_for_problem(): + # Test problem with known tags + result = get_tags_for_problem("two_sum") + assert isinstance(result, list) + assert "grind-75" in result + + # Test problem that might not have tags + result = get_tags_for_problem("nonexistent_problem") + assert result == [] + + +@pytest.mark.parametrize( + "number,expected", + [ + (1, "two_sum"), + (125, "valid_palindrome"), + (99999, None), + ], +) +def test_find_problem_by_number_parametrized(number, expected): + result = find_problem_by_number(number) + assert result == expected + + +@pytest.mark.parametrize( + "tag,should_exist", + [ + ("grind-75", True), + ("test", True), + ("nonexistent", False), + ], +) +def test_find_problems_by_tag_parametrized(tag, should_exist): + result = find_problems_by_tag(tag) + if should_exist: + assert len(result) > 0 + else: + assert len(result) == 0 + + +def test_problem_finder_consistency(): + """Test that problem finder functions are consistent with each other.""" + all_problems = get_all_problems() + + # Test that problems found by number are in all_problems + for number in [1, 125]: + problem = find_problem_by_number(number) + if problem: + assert problem in all_problems + + # Test that problems found by tag are in all_problems + test_problems = find_problems_by_tag("test") + for problem in test_problems: + assert problem in all_problems diff --git a/tests/cli/test_resources.py b/tests/cli/test_resources.py new file mode 100644 index 0000000..f75344e --- /dev/null +++ b/tests/cli/test_resources.py @@ -0,0 +1,92 @@ +import inspect +from pathlib import Path + +from leetcode_py.cli.utils.resources import get_problems_json_path, get_tags_path, get_template_path + + +def test_get_template_path_development(): + result = get_template_path() + assert isinstance(result, Path) + assert result.name == "leetcode" + assert result.exists() + assert result.is_absolute() + + +def test_get_template_path_structure(): + template_path = get_template_path() + + # Check expected subdirectories exist + assert (template_path / "json").exists() + assert (template_path / "json" / "problems").exists() + assert (template_path / "json" / "tags.json5").exists() + assert (template_path / "{{cookiecutter.problem_name}}").exists() + + +def test_get_problems_json_path(): + result = get_problems_json_path() + assert isinstance(result, Path) + assert result.parts[-2:] == ("json", "problems") + assert result.exists() + + # Check it contains JSON files + json_files = list(result.glob("*.json")) + assert len(json_files) > 0 + assert any(f.name == "two_sum.json" for f in json_files) + + +def test_get_tags_path(): + result = get_tags_path() + assert isinstance(result, Path) + assert result.name == "tags.json5" + assert result.exists() + assert result.suffix == ".json5" + + +def test_get_template_path_relative_resolution(): + """Test that template path is resolved relative to __file__.""" + template_path = get_template_path() + + # Should be: leetcode_py/cli/resources/leetcode + expected_parts = ("leetcode_py", "cli", "resources", "leetcode") + assert template_path.parts[-4:] == expected_parts + + +def test_get_template_path_uses_relative_path(): + source = inspect.getsource(get_template_path) + assert "__file__" in source + assert "parent.parent" in source + assert "resources" in source + + +def test_get_template_path_error_handling(): + source = inspect.getsource(get_template_path) + assert "FileNotFoundError" in source + assert "not found" in source.lower() + + +def test_path_functions_consistency(): + template_path = get_template_path() + json_path = get_problems_json_path() + tags_path = get_tags_path() + + # JSON path should be under template path + assert str(json_path).startswith(str(template_path)) + + # Tags path should be under template path + assert str(tags_path).startswith(str(template_path)) + + # Tags should be sibling to problems directory + assert tags_path.parent == json_path.parent + + +def test_cookiecutter_template_exists(): + template_path = get_template_path() + cookiecutter_dir = template_path / "{{cookiecutter.problem_name}}" + + assert cookiecutter_dir.exists() + assert cookiecutter_dir.is_dir() + + # Check for expected template files + expected_files = ["solution.py", "test_solution.py", "README.md", "helpers.py"] + for filename in expected_files: + assert (cookiecutter_dir / filename).exists(), f"Missing template file: {filename}" diff --git a/tests/cli/test_scrape.py b/tests/cli/test_scrape.py new file mode 100644 index 0000000..bd61638 --- /dev/null +++ b/tests/cli/test_scrape.py @@ -0,0 +1,76 @@ +import json +import re + +import pytest +from typer.testing import CliRunner + +from leetcode_py.cli.main import app + +runner = CliRunner() + + +def test_scrape_help(): + result = runner.invoke(app, ["scrape", "--help"]) + assert result.exit_code == 0 + # Remove ANSI color codes for reliable string matching + clean_output = re.sub(r"\x1b\[[0-9;]*m", "", result.stdout) + assert "--problem-num" in clean_output + assert "--problem-slug" in clean_output + + +def test_scrape_no_options(): + result = runner.invoke(app, ["scrape"]) + assert result.exit_code == 1 + assert "Exactly one of --problem-num or --problem-slug is required" in result.stderr + + +def test_scrape_multiple_options(): + result = runner.invoke(app, ["scrape", "-n", "1", "-s", "two-sum"]) + assert result.exit_code == 1 + assert "Exactly one of --problem-num or --problem-slug is required" in result.stderr + + +@pytest.mark.parametrize( + "args, expected_number, expected_title, expected_slug, expected_difficulty", + [ + (["-n", "1"], "1", "Two Sum", "two-sum", "Easy"), + (["-s", "two-sum"], "1", "Two Sum", "two-sum", "Easy"), + ], +) +def test_scrape_success_real_api( + args, expected_number, expected_title, expected_slug, expected_difficulty +): + result = runner.invoke(app, ["scrape"] + args) + + assert result.exit_code == 0 + + # Parse JSON output + data = json.loads(result.stdout) + + # Verify problem data + assert data["number"] == expected_number + assert data["title"] == expected_title + assert data["slug"] == expected_slug + assert data["difficulty"] == expected_difficulty + + # Verify structure for number-based test only + if "-n" in args: + assert "Array" in data["topics"] + assert "Hash Table" in data["topics"] + assert data["description"] # Should have description + assert data["examples"] # Should have examples + assert data["constraints"] # Should have constraints + + +@pytest.mark.parametrize( + "args, expected_error", + [ + (["-n", "999999"], "Problem number 999999 not found"), + (["-s", "nonexistent-problem"], "Problem slug 'nonexistent-problem' not found"), + ], +) +def test_scrape_not_found_real_api(args, expected_error): + result = runner.invoke(app, ["scrape"] + args) + + assert result.exit_code == 1 + assert expected_error in result.stderr diff --git a/tests/test_dict_tree.py b/tests/data_structures/test_dict_tree.py similarity index 100% rename from tests/test_dict_tree.py rename to tests/data_structures/test_dict_tree.py diff --git a/tests/tools/test_check_test_cases.py b/tests/tools/test_check_test_cases.py new file mode 100644 index 0000000..6034fe4 --- /dev/null +++ b/tests/tools/test_check_test_cases.py @@ -0,0 +1,149 @@ +from unittest.mock import Mock, mock_open, patch + +import pytest +from typer.testing import CliRunner + +from leetcode_py.tools.check_test_cases import app, count_test_cases_for_problem + + +class TestCountTestCasesForProblem: + @pytest.mark.parametrize( + "json_data, expected", + [ + ( + {"test_methods": [{"test_cases": "[(1, 2, 3), (4, 5, 6)]"}, {"test_cases": "[(7, 8)]"}]}, + 3, + ), + ( + { + "_test_methods": { + "list": [ + {"test_cases": "[(1, 2), (3, 4), (5, 6)]"}, + {"test_cases": "[(7, 8, 9)]"}, + ] + } + }, + 4, + ), + ({"test_methods": [{"test_cases": "[]"}, {"test_cases": ""}, {"test_cases": " "}]}, 0), + ({}, 0), + ( + { + "test_methods": [ + {"test_cases": "[([1, 2], 'hello', True), ([3, 4], 'world', False)]"}, + {"test_cases": "[([], '', None)]"}, + ] + }, + 3, + ), + ], + ) + def test_count_test_cases(self, json_data, expected): + assert count_test_cases_for_problem(json_data) == expected + + def test_invalid_test_cases_raises_error(self): + json_data = {"test_methods": [{"test_cases": "invalid python literal"}]} + with pytest.raises((ValueError, SyntaxError)): + count_test_cases_for_problem(json_data) + + +class TestCheckTestCases: + def setup_method(self): + self.runner = CliRunner() + + @patch("leetcode_py.tools.check_test_cases.get_problems_json_path") + def test_check_with_no_problems_found(self, mock_get_path): + mock_path = Mock() + mock_path.glob.return_value = [] + mock_get_path.return_value = mock_path + + result = self.runner.invoke(app, ["--threshold", "10"]) + + assert result.exit_code == 0 + assert "Problems with ≤10 test cases (0 total):" in result.stdout + + @pytest.mark.parametrize( + "filename, json_data, expected_exit_code, expected_output", + [ + ( + "test_problem.json", + { + "test_methods": [ + {"test_cases": "[(1, 2), (3, 4), (5, 6), (7, 8), (9, 10)]"}, + {"test_cases": "[(11, 12), (13, 14), (15, 16), (17, 18), (19, 20)]"}, + {"test_cases": "[(21, 22), (23, 24), (25, 26), (27, 28), (29, 30)]"}, + ] + }, + 0, + "Problems with ≤10 test cases (0 total):", + ), + ( + "small_problem.json", + {"test_methods": [{"test_cases": "[(1, 2), (3, 4), (5, 6), (7, 8), (9, 10)]"}]}, + 1, + "Problems with ≤10 test cases (1 total):", + ), + ], + ) + @patch("leetcode_py.tools.check_test_cases.get_problems_json_path") + @patch("builtins.open", new_callable=mock_open) + def test_check_with_threshold( + self, mock_file, mock_get_path, filename, json_data, expected_exit_code, expected_output + ): + mock_problem_file = Mock() + mock_problem_file.name = filename + mock_path = Mock() + mock_path.glob.return_value = [mock_problem_file] + mock_get_path.return_value = mock_path + mock_file.return_value.read.return_value = "" + + with patch("json.load", return_value=json_data): + result = self.runner.invoke(app, ["--threshold", "10"]) + + assert result.exit_code == expected_exit_code + assert expected_output in result.stdout + + @patch("leetcode_py.tools.check_test_cases.get_problems_json_path") + @patch("builtins.open", new_callable=mock_open) + def test_check_with_max_results_limit(self, mock_file, mock_get_path): + mock_files = [Mock(name=f"problem_{i}.json") for i in range(5)] + mock_path = Mock() + mock_path.glob.return_value = mock_files + mock_get_path.return_value = mock_path + json_data = {"test_methods": [{"test_cases": "[(1, 2), (3, 4)]"}]} + mock_file.return_value.read.return_value = "" + + with patch("json.load", return_value=json_data): + result = self.runner.invoke(app, ["--threshold", "10", "--max", "2"]) + + assert result.exit_code == 1 + assert "Problems with ≤10 test cases (2 total):" in result.stdout + + @pytest.mark.parametrize( + "args, expected_exit_code, expected_output, output_stream", + [ + (["--max", "invalid"], 1, "Invalid max_results value: invalid", "stderr"), + ], + ) + def test_invalid_inputs(self, args, expected_exit_code, expected_output, output_stream): + result = self.runner.invoke(app, args) + assert result.exit_code == expected_exit_code + output = getattr(result, output_stream) + assert expected_output in output + + def test_real_json_integration(self): + """Integration test with real JSON files - should fail if any problems have ≤threshold test cases.""" + threshold = 10 + result = self.runner.invoke(app, ["--threshold", str(threshold), "--max", "-1"]) + + # Extract count from output like "Problems with ≤10 test cases (X total):" + import re + + match = re.search(rf"Problems with ≤{threshold} test cases \((\d+) total\):", result.stdout) + assert match, f"Could not parse output: {result.stdout}" + + count = int(match.group(1)) + if count > 0: + pytest.fail( + f"Found {count} problems with ≤{threshold} test cases. All problems should have >{threshold} test cases." + ) diff --git a/tests/tools/test_generator.py b/tests/tools/test_generator.py index 9dd62ec..b132bf8 100644 --- a/tests/tools/test_generator.py +++ b/tests/tools/test_generator.py @@ -1,238 +1,108 @@ +import json +import shutil +import tempfile from pathlib import Path -from typing import Any - -from leetcode_py.tools.generator import TemplateGenerator - - -class TestTemplateGenerator: - """Test cases for TemplateGenerator.""" - - def setup_method(self): - """Set up test fixtures.""" - self.generator = TemplateGenerator() - - def test_init(self): - """Test generator initialization.""" - assert "grind-75" in self.generator.common_tags - assert "blind-75" in self.generator.common_tags - - def test_auto_set_dummy_return_bool(self): - """Test auto-setting dummy return for bool type.""" - data: dict[str, Any] = {"return_type": "bool"} - result = self.generator.auto_set_dummy_return(data) - assert result["dummy_return"] == "False" - - def test_auto_set_dummy_return_list(self): - """Test auto-setting dummy return for list type.""" - data: dict[str, Any] = {"return_type": "list[int]"} - result = self.generator.auto_set_dummy_return(data) - assert result["dummy_return"] == "[]" - - def test_auto_set_dummy_return_existing(self): - """Test that existing dummy_return is not overwritten.""" - data: dict[str, Any] = {"return_type": "bool", "dummy_return": "True"} - result = self.generator.auto_set_dummy_return(data) - assert result["dummy_return"] == "True" - - def test_auto_set_dummy_return_all_types(self): - """Test auto_set_dummy_return for all supported types.""" - test_cases = [ - ("int", "0"), - ("str", '""'), - ("float", "0.0"), - ("None", "None"), - ("dict[str, int]", "{}"), - ("set[int]", "set()"), - ("tuple[int, str]", "()"), - ("CustomType", "None"), # Unknown type defaults to None - ] - - for return_type, expected_dummy in test_cases: - data: dict[str, Any] = {"return_type": return_type} - result = self.generator.auto_set_dummy_return(data) - assert result["dummy_return"] == expected_dummy - - def test_auto_set_dummy_return_no_return_type(self): - """Test auto_set_dummy_return when no return_type is provided.""" - data: dict[str, Any] = {"problem_name": "test"} - result = self.generator.auto_set_dummy_return(data) - assert "dummy_return" not in result - - def test_convert_arrays_to_nested(self): - """Test converting arrays to nested format.""" - data: dict[str, Any] = { - "readme_examples": [{"content": "test"}], - "tags": ["grind-75"], - "other_field": "value", - } - - result = self.generator.convert_arrays_to_nested(data) - - assert "_readme_examples" in result - assert result["_readme_examples"] == {"list": [{"content": "test"}]} - assert "_tags" in result - assert result["_tags"] == {"list": ["grind-75"]} - assert "readme_examples" not in result - assert "tags" not in result - assert result["other_field"] == "value" - - def test_convert_arrays_to_nested_partial_arrays(self): - """Test converting only some arrays to nested format.""" - data: dict[str, Any] = { - "solution_methods": [{"name": "test"}], - "test_methods": [[1, 2, 3]], - "other_list": ["not", "converted"], # Not in array_fields - "string_field": "value", - } - - result = self.generator.convert_arrays_to_nested(data) - - assert "_solution_methods" in result - assert "_test_methods" in result - assert "other_list" in result # Should remain unchanged - assert result["other_list"] == ["not", "converted"] - assert result["string_field"] == "value" - - def test_convert_arrays_to_nested_non_list_values(self): - """Test converting arrays when field exists but is not a list.""" - data: dict[str, Any] = {"readme_examples": "not a list", "tags": None, "solution_methods": 123} - - result = self.generator.convert_arrays_to_nested(data) - - # Non-list values should remain unchanged - assert result["readme_examples"] == "not a list" - assert result["tags"] is None - assert result["solution_methods"] == 123 - - def test_check_overwrite_permission_force(self): - """Test overwrite permission with force flag.""" - output_dir = Path("/fake/output") - # Should not raise exception with force=True - self.generator.check_overwrite_permission("test_problem", True, output_dir) - - def test_check_overwrite_permission_nonexistent_problem(self): - """Test overwrite permission when problem doesn't exist.""" - output_dir = Path("/nonexistent/output") - # Should not raise exception when problem doesn't exist - self.generator.check_overwrite_permission("nonexistent_problem", False, output_dir) - - def test_check_and_prompt_tags_with_existing_tags(self): - """Test check_and_prompt_tags when tags already exist.""" - data: dict[str, Any] = {"tags": ["existing-tag"]} - result = self.generator.check_and_prompt_tags(data) - assert result["tags"] == ["existing-tag"] # Should remain unchanged - - def test_check_and_prompt_tags_no_tags_field(self): - """Test check_and_prompt_tags when no tags field exists.""" - data: dict[str, Any] = {"problem_name": "test"} - result = self.generator.check_and_prompt_tags(data) - assert result == data # Should remain unchanged - - def test_check_and_prompt_tags_non_interactive(self): - """Test check_and_prompt_tags in non-interactive mode.""" - import io - import sys - - # Simulate non-interactive terminal - original_stdin = sys.stdin - sys.stdin = io.StringIO() # Empty stdin - - try: - data: dict[str, Any] = {"tags": []} - result = self.generator.check_and_prompt_tags(data) - assert result["tags"] == [] # Should remain empty - finally: - sys.stdin = original_stdin - - def test_generate_problem_components(self): - """Test individual components of problem generation.""" - # Test data processing - data: dict[str, Any] = {"problem_name": "test", "return_type": "bool", "tags": []} - - # Test auto_set_dummy_return - processed_data = self.generator.auto_set_dummy_return(data) - assert processed_data["dummy_return"] == "False" - - # Test convert_arrays_to_nested - nested_data = self.generator.convert_arrays_to_nested(processed_data) - assert "_tags" in nested_data - assert nested_data["_tags"] == {"list": []} - - def test_file_operations_injection(self): - """Test that file operations can be injected for testing.""" - from unittest.mock import Mock - - from leetcode_py.tools.generator import FileOperations - - mock_file_ops = Mock(spec=FileOperations) - generator = TemplateGenerator(file_ops=mock_file_ops) - assert generator.file_ops is mock_file_ops - - def test_check_and_prompt_tags_interactive_valid_choices(self): - """Test interactive tag selection with valid choices.""" - from unittest.mock import patch - - data: dict[str, Any] = {"tags": []} - - with ( - patch("sys.stdin.isatty", return_value=True), - patch("typer.prompt", return_value="1,2"), - patch("typer.echo"), - ): - result = self.generator.check_and_prompt_tags(data) - assert "grind-75" in result["tags"] - assert "blind-75" in result["tags"] - - def test_check_and_prompt_tags_interactive_skip(self): - """Test interactive tag selection with skip option.""" - from unittest.mock import patch - - data: dict[str, Any] = {"tags": []} - - with ( - patch("sys.stdin.isatty", return_value=True), - patch("typer.prompt", return_value="0"), - patch("typer.echo"), - ): - result = self.generator.check_and_prompt_tags(data) - assert result["tags"] == [] - - def test_check_and_prompt_tags_interactive_invalid_input(self): - """Test interactive tag selection with invalid input.""" - from unittest.mock import patch - - data: dict[str, Any] = {"tags": []} - - with ( - patch("sys.stdin.isatty", return_value=True), - patch("typer.prompt", return_value="invalid"), - patch("typer.echo"), - ): - result = self.generator.check_and_prompt_tags(data) - assert result["tags"] == [] - - def test_generate_problem_success(self): - """Test successful problem generation.""" - from unittest.mock import Mock, patch - - from leetcode_py.tools.generator import FileOperations - - mock_file_ops = Mock(spec=FileOperations) - mock_file_ops.exists.side_effect = lambda path: str(path).endswith("test.json") - mock_file_ops.read_json.return_value = { - "problem_name": "test_problem", - "return_type": "bool", - "tags": [], - } - - generator = TemplateGenerator(file_ops=mock_file_ops) - - template_dir = Path("/test/template") - output_dir = Path("/test/output") - - with patch("leetcode_py.tools.generator.cookiecutter", return_value=None) as mock_cookiecutter: - generator.generate_problem("test.json", template_dir, output_dir, force=True) - - mock_file_ops.read_json.assert_called_once() - mock_file_ops.write_json.assert_called_once() - mock_cookiecutter.assert_called_once() + +import pytest +import typer + +from leetcode_py.cli.utils.resources import get_problems_json_path, get_template_path +from leetcode_py.tools.generator import check_problem_exists, generate_problem, load_json_data + + +class TestGenerator: + + def test_load_json_data_success(self): + with tempfile.NamedTemporaryFile(mode="w", suffix=".json", delete=True) as f: + json.dump({"problem_name": "test"}, f) + f.flush() + json_path = Path(f.name) + + data = load_json_data(json_path) + assert data == {"problem_name": "test"} + + def test_load_json_data_real_file(self): + real_json_path = get_problems_json_path() / "two_sum.json" + + data = load_json_data(real_json_path) + + assert data["problem_name"] == "two_sum" + assert data["solution_class_name"] == "Solution" + assert data["problem_number"] == "1" + assert data["problem_title"] == "Two Sum" + + def test_load_json_data_file_not_found(self): + with pytest.raises(typer.Exit): + load_json_data(Path("/nonexistent/file.json")) + + def test_load_json_data_invalid_json(self): + with tempfile.NamedTemporaryFile(mode="w", suffix=".json", delete=True) as f: + f.write("invalid json") + f.flush() + json_path = Path(f.name) + + with pytest.raises(typer.Exit): + load_json_data(json_path) + + def test_check_problem_exists_force_true(self): + with tempfile.TemporaryDirectory() as temp_dir: + output_dir = Path(temp_dir) + problem_dir = output_dir / "test_problem" + problem_dir.mkdir() + + # Should not raise with force=True + check_problem_exists("test_problem", output_dir, force=True) + + def test_check_problem_exists_no_conflict(self): + with tempfile.TemporaryDirectory() as temp_dir: + output_dir = Path(temp_dir) + + # Should not raise when problem doesn't exist + check_problem_exists("nonexistent_problem", output_dir, force=False) + + def test_check_problem_exists_conflict(self): + with tempfile.TemporaryDirectory() as temp_dir: + output_dir = Path(temp_dir) + problem_dir = output_dir / "test_problem" + problem_dir.mkdir() + + with pytest.raises(typer.Exit): + check_problem_exists("test_problem", output_dir, force=False) + + def test_generate_problem_real_integration(self): + # Use real paths from the project + real_json_path = get_problems_json_path() / "two_sum.json" + real_template_path = get_template_path() + + with tempfile.TemporaryDirectory() as temp_dir: + # Copy real JSON to temp location + temp_json = Path(temp_dir) / "two_sum.json" + shutil.copy2(real_json_path, temp_json) + + # Copy entire template directory (including cookiecutter.json) + temp_template = Path(temp_dir) / "template" + shutil.copytree(real_template_path, temp_template) + + output_dir = Path(temp_dir) / "output" + output_dir.mkdir() + + # Generate problem + generate_problem(temp_json, temp_template, output_dir, force=True) + + # Assert files were created + problem_dir = output_dir / "two_sum" + assert problem_dir.exists() + assert (problem_dir / "README.md").exists() + assert (problem_dir / "solution.py").exists() + assert (problem_dir / "test_solution.py").exists() + assert (problem_dir / "helpers.py").exists() + assert (problem_dir / "__init__.py").exists() + + # Assert content is correct + solution_content = (problem_dir / "solution.py").read_text() + assert "class Solution:" in solution_content + assert "def two_sum(self, nums: list[int], target: int) -> list[int]:" in solution_content + + readme_content = (problem_dir / "README.md").read_text() + assert "# Two Sum" in readme_content + assert "Given an array of integers" in readme_content diff --git a/tests/tools/test_generator_file_ops.py b/tests/tools/test_generator_file_ops.py deleted file mode 100644 index 5a05fff..0000000 --- a/tests/tools/test_generator_file_ops.py +++ /dev/null @@ -1,137 +0,0 @@ -"""Tests for TemplateGenerator file operations.""" - -from pathlib import Path -from unittest.mock import Mock - -import pytest -import typer - -from leetcode_py.tools.generator import FileOperations, TemplateGenerator - - -class TestTemplateGeneratorFileOps: - """Test cases for file operations in TemplateGenerator.""" - - def setup_method(self): - """Set up test fixtures.""" - self.generator = TemplateGenerator() - - def test_generate_problem_file_not_found(self): - """Test generate_problem when JSON file doesn't exist.""" - mock_file_ops = Mock(spec=FileOperations) - mock_file_ops.exists.return_value = False - generator = TemplateGenerator(file_ops=mock_file_ops) - - template_dir = Path("/test/template") - output_dir = Path("/test/output") - - with pytest.raises(typer.Exit): - generator.generate_problem("nonexistent.json", template_dir, output_dir, False) - - def test_auto_set_dummy_return_comprehensive(self): - """Test all branches of auto_set_dummy_return.""" - # Test when dummy_return already exists - data_with_dummy = {"return_type": "bool", "dummy_return": "existing"} - result = self.generator.auto_set_dummy_return(data_with_dummy) - assert result["dummy_return"] == "existing" - - # Test when no return_type exists - data_no_return_type = {"problem_name": "test"} - result = self.generator.auto_set_dummy_return(data_no_return_type) - assert "dummy_return" not in result - - # Test all type mappings - type_mappings = {"bool": "False", "int": "0", "str": '""', "float": "0.0", "None": "None"} - - for return_type, expected in type_mappings.items(): - data = {"return_type": return_type} - result = self.generator.auto_set_dummy_return(data) - assert result["dummy_return"] == expected - - # Test container types - container_types = [ - ("list[int]", "[]"), - ("dict[str, int]", "{}"), - ("set[str]", "set()"), - ("tuple[int, str]", "()"), - ] - - for return_type, expected in container_types: - data = {"return_type": return_type} - result = self.generator.auto_set_dummy_return(data) - assert result["dummy_return"] == expected - - # Test unknown type - data_unknown = {"return_type": "UnknownType"} - result = self.generator.auto_set_dummy_return(data_unknown) - assert result["dummy_return"] == "None" - - def test_default_file_operations_read_json_success(self): - """Test DefaultFileOperations read_json success.""" - import json - import tempfile - - from leetcode_py.tools.generator import DefaultFileOperations - - file_ops = DefaultFileOperations() - - with tempfile.NamedTemporaryFile(mode="w", suffix=".json", delete=False) as f: - test_data = {"test": "data"} - json.dump(test_data, f) - f.flush() - - result = file_ops.read_json(Path(f.name)) - assert result == test_data - - Path(f.name).unlink() # Clean up - - def test_default_file_operations_read_json_error(self): - """Test DefaultFileOperations read_json with invalid JSON.""" - import tempfile - - from leetcode_py.tools.generator import DefaultFileOperations - - file_ops = DefaultFileOperations() - - with tempfile.NamedTemporaryFile(mode="w", suffix=".json", delete=False) as f: - f.write("invalid json") - f.flush() - - with pytest.raises(typer.Exit): - file_ops.read_json(Path(f.name)) - - Path(f.name).unlink() # Clean up - - def test_default_file_operations_write_json_success(self): - """Test DefaultFileOperations write_json success.""" - import json - import tempfile - - from leetcode_py.tools.generator import DefaultFileOperations - - file_ops = DefaultFileOperations() - - with tempfile.NamedTemporaryFile(mode="w", suffix=".json", delete=False) as f: - test_data = {"test": "data"} - file_ops.write_json(Path(f.name), test_data) - - # Verify the file was written correctly - with open(f.name) as read_f: - result = json.load(read_f) - assert result == test_data - - Path(f.name).unlink() # Clean up - - def test_default_file_operations_exists(self): - """Test DefaultFileOperations exists method.""" - import tempfile - - from leetcode_py.tools.generator import DefaultFileOperations - - file_ops = DefaultFileOperations() - - with tempfile.NamedTemporaryFile(delete=False) as f: - assert file_ops.exists(Path(f.name)) is True - - Path(f.name).unlink() - assert file_ops.exists(Path(f.name)) is False From 9080a8210eb63efcd9ad23d842c0bbbf24ad0729 Mon Sep 17 00:00:00 2001 From: Wisaroot <66859294+wisarootl@users.noreply.github.com> Date: Tue, 16 Sep 2025 21:47:52 +0700 Subject: [PATCH 12/57] feat: use tags.json5 when generate problems (#46) - use tags.json5 when generate problems - move logged_test - add sort_tags.py --- .amazonq/rules/problem-creation.md | 9 +- .github/workflows/ci-test.yml | 13 +- Makefile | 3 +- leetcode/accounts_merge/test_solution.py | 2 +- leetcode/add_binary/test_solution.py | 2 +- .../balanced_binary_tree/test_solution.py | 2 +- leetcode/basic_calculator/test_solution.py | 2 +- .../test_solution.py | 2 +- leetcode/binary_search/test_solution.py | 2 +- .../test_solution.py | 2 +- .../test_solution.py | 2 +- leetcode/climbing_stairs/test_solution.py | 2 +- leetcode/clone_graph/test_solution.py | 2 +- leetcode/coin_change/test_solution.py | 2 +- leetcode/combination_sum/test_solution.py | 2 +- .../test_solution.py | 2 +- .../test_solution.py | 2 +- leetcode/contains_duplicate/test_solution.py | 2 +- leetcode/course_schedule/test_solution.py | 2 +- leetcode/daily_temperatures/README.md | 46 +++ leetcode/daily_temperatures/__init__.py | 0 leetcode/daily_temperatures/helpers.py | 8 + leetcode/daily_temperatures/playground.py | 29 ++ leetcode/daily_temperatures/solution.py | 15 + leetcode/daily_temperatures/test_solution.py | 56 +++ leetcode/diagonal_traverse/test_solution.py | 2 +- .../diameter_of_binary_tree/test_solution.py | 2 +- .../test_solution.py | 2 +- .../test_solution.py | 2 +- .../test_solution.py | 2 +- leetcode/first_bad_version/test_solution.py | 2 +- leetcode/flood_fill/test_solution.py | 2 +- .../test_solution.py | 2 +- .../test_solution.py | 2 +- leetcode/insert_interval/test_solution.py | 2 +- leetcode/invert_binary_tree/test_solution.py | 2 +- .../test_solution.py | 2 +- .../test_solution.py | 2 +- .../test_solution.py | 2 +- .../test_solution.py | 2 +- leetcode/linked_list_cycle/test_solution.py | 2 +- leetcode/longest_palindrome/test_solution.py | 2 +- .../test_solution.py | 2 +- .../test_solution.py | 2 +- .../test_solution.py | 2 +- .../test_solution.py | 2 +- leetcode/lru_cache/test_solution.py | 2 +- leetcode/majority_element/test_solution.py | 2 +- .../test_solution.py | 2 +- .../test_solution.py | 2 +- leetcode/maximum_subarray/test_solution.py | 2 +- leetcode/merge_intervals/test_solution.py | 2 +- .../merge_k_sorted_lists/test_solution.py | 2 +- .../merge_two_sorted_lists/test_solution.py | 2 +- .../test_solution.py | 2 +- leetcode/min_stack/test_solution.py | 2 +- .../minimum_height_trees/test_solution.py | 2 +- .../minimum_window_substring/test_solution.py | 2 +- leetcode/number_of_islands/test_solution.py | 2 +- .../test_solution.py | 2 +- leetcode/permutations/test_solution.py | 2 +- .../test_solution.py | 2 +- leetcode/ransom_note/test_solution.py | 2 +- leetcode/reverse_linked_list/test_solution.py | 2 +- .../reverse_linked_list_ii/test_solution.py | 2 +- leetcode/rotting_oranges/test_solution.py | 2 +- .../test_solution.py | 2 +- .../test_solution.py | 2 +- leetcode/sort_colors/test_solution.py | 2 +- leetcode/spiral_matrix/test_solution.py | 2 +- .../string_to_integer_atoi/test_solution.py | 2 +- leetcode/subsets/test_solution.py | 2 +- leetcode/task_scheduler/test_solution.py | 2 +- leetcode/three_sum/test_solution.py | 2 +- .../test_solution.py | 2 +- leetcode/trapping_rain_water/test_solution.py | 2 +- leetcode/two_sum/test_solution.py | 2 +- leetcode/unique_paths/test_solution.py | 2 +- leetcode/valid_anagram/test_solution.py | 2 +- leetcode/valid_palindrome/test_solution.py | 2 +- leetcode/valid_parentheses/test_solution.py | 2 +- .../test_solution.py | 2 +- leetcode/word_break/test_solution.py | 2 +- leetcode/word_ladder/test_solution.py | 2 +- leetcode/word_search/test_solution.py | 2 +- leetcode/zero_one_matrix/test_solution.py | 2 +- leetcode_py/__init__.py | 3 +- .../cli/resources/leetcode/cookiecutter.json | 4 +- .../resources/leetcode/examples/example.json5 | 368 +++++++++--------- .../json/problems/accounts_merge.json | 2 +- .../leetcode/json/problems/add_binary.json | 2 +- .../json/problems/balanced_binary_tree.json | 2 +- .../json/problems/basic_calculator.json | 2 +- .../best_time_to_buy_and_sell_stock.json | 2 +- .../leetcode/json/problems/binary_search.json | 2 +- .../binary_tree_level_order_traversal.json | 2 +- .../problems/binary_tree_right_side_view.json | 2 +- .../json/problems/climbing_stairs.json | 2 +- .../leetcode/json/problems/clone_graph.json | 2 +- .../leetcode/json/problems/coin_change.json | 2 +- .../json/problems/combination_sum.json | 2 +- ...e_from_preorder_and_inorder_traversal.json | 2 +- .../problems/container_with_most_water.json | 2 +- .../json/problems/contains_duplicate.json | 2 +- .../json/problems/course_schedule.json | 2 +- .../json/problems/daily_temperatures.json | 63 +++ .../json/problems/diagonal_traverse.json | 2 +- .../problems/diameter_of_binary_tree.json | 2 +- .../evaluate_reverse_polish_notation.json | 2 +- .../find_all_anagrams_in_a_string.json | 2 +- .../find_median_from_data_stream.json | 2 +- .../json/problems/first_bad_version.json | 2 +- .../leetcode/json/problems/flood_fill.json | 2 +- .../implement_queue_using_stacks.json | 2 +- .../problems/implement_trie_prefix_tree.json | 2 +- .../json/problems/insert_interval.json | 2 +- .../json/problems/invert_binary_tree.json | 2 +- .../problems/k_closest_points_to_origin.json | 2 +- .../kth_smallest_element_in_a_bst.json | 2 +- .../largest_rectangle_in_histogram.json | 2 +- ...letter_combinations_of_a_phone_number.json | 2 +- .../json/problems/linked_list_cycle.json | 2 +- .../json/problems/longest_palindrome.json | 2 +- .../longest_palindromic_substring.json | 2 +- ...ubstring_without_repeating_characters.json | 2 +- ...mmon_ancestor_of_a_binary_search_tree.json | 2 +- ...west_common_ancestor_of_a_binary_tree.json | 2 +- .../leetcode/json/problems/lru_cache.json | 2 +- .../json/problems/majority_element.json | 2 +- .../maximum_depth_of_binary_tree.json | 2 +- .../maximum_profit_in_job_scheduling.json | 2 +- .../json/problems/maximum_subarray.json | 2 +- .../json/problems/merge_intervals.json | 2 +- .../json/problems/merge_k_sorted_lists.json | 2 +- .../json/problems/merge_two_sorted_lists.json | 2 +- .../problems/middle_of_the_linked_list.json | 2 +- .../leetcode/json/problems/min_stack.json | 2 +- .../json/problems/minimum_height_trees.json | 2 +- .../problems/minimum_window_substring.json | 2 +- .../json/problems/number_of_islands.json | 2 +- .../problems/partition_equal_subset_sum.json | 2 +- .../leetcode/json/problems/permutations.json | 2 +- .../product_of_array_except_self.json | 2 +- .../leetcode/json/problems/ransom_note.json | 2 +- .../json/problems/reverse_linked_list.json | 2 +- .../json/problems/reverse_linked_list_ii.json | 2 +- .../json/problems/rotting_oranges.json | 2 +- .../search_in_rotated_sorted_array.json | 2 +- ...serialize_and_deserialize_binary_tree.json | 2 +- .../leetcode/json/problems/sort_colors.json | 2 +- .../leetcode/json/problems/spiral_matrix.json | 2 +- .../json/problems/string_to_integer_atoi.json | 2 +- .../leetcode/json/problems/subsets.json | 2 +- .../json/problems/task_scheduler.json | 2 +- .../leetcode/json/problems/three_sum.json | 2 +- .../problems/time_based_key_value_store.json | 2 +- .../json/problems/trapping_rain_water.json | 2 +- .../leetcode/json/problems/two_sum.json | 2 +- .../leetcode/json/problems/unique_paths.json | 2 +- .../leetcode/json/problems/valid_anagram.json | 2 +- .../json/problems/valid_palindrome.json | 2 +- .../json/problems/valid_parentheses.json | 2 +- .../problems/validate_binary_search_tree.json | 2 +- .../leetcode/json/problems/word_break.json | 2 +- .../leetcode/json/problems/word_ladder.json | 2 +- .../leetcode/json/problems/word_search.json | 2 +- .../json/problems/zero_one_matrix.json | 2 +- .../cli/resources/leetcode/json/tags.json5 | 10 +- leetcode_py/cli/utils/problem_finder.py | 39 +- leetcode_py/tools/generator.py | 27 ++ .../{test_utils.py => tools/logged_test.py} | 0 poetry.lock | 78 ++-- pyproject.toml | 9 +- scripts/sort_tags.py | 30 ++ tests/test_problem_finder.py | 25 ++ tests/test_test_utils.py | 2 +- 176 files changed, 753 insertions(+), 392 deletions(-) create mode 100644 leetcode/daily_temperatures/README.md create mode 100644 leetcode/daily_temperatures/__init__.py create mode 100644 leetcode/daily_temperatures/helpers.py create mode 100644 leetcode/daily_temperatures/playground.py create mode 100644 leetcode/daily_temperatures/solution.py create mode 100644 leetcode/daily_temperatures/test_solution.py create mode 100644 leetcode_py/cli/resources/leetcode/json/problems/daily_temperatures.json rename leetcode_py/{test_utils.py => tools/logged_test.py} (100%) create mode 100644 scripts/sort_tags.py create mode 100644 tests/test_problem_finder.py diff --git a/.amazonq/rules/problem-creation.md b/.amazonq/rules/problem-creation.md index a262244..9249475 100644 --- a/.amazonq/rules/problem-creation.md +++ b/.amazonq/rules/problem-creation.md @@ -13,10 +13,11 @@ When user requests a problem by **number** or **name/slug**, the assistant will: - Images provide crucial visual context, especially for tree and graph problems - Always verify images are included in `readme_examples` and accessible 4. **Create** JSON file in `leetcode_py/cli/resources/leetcode/json/problems/{problem_name}.json` -5. **Update** Makefile with `PROBLEM ?= {problem_name}` -6. **Generate** problem structure using `make p-gen` -7. **Verify** with `make p-lint` - fix template issues in JSON if possible, or manually fix generated files if template limitations -8. **Iterate** if JSON fixes: re-run `make p-gen PROBLEM={problem_name} FORCE=1` and `make p-lint` until passes to ensure reproducibility +5. **Update tags.json5** - If user specifies tags, manually add problem name to corresponding tag arrays in `leetcode_py/cli/resources/leetcode/json/tags.json5` +6. **Update** Makefile with `PROBLEM ?= {problem_name}` +7. **Generate** problem structure using `make p-gen` +8. **Verify** with `make p-lint` - fix template issues in JSON if possible, or manually fix generated files if template limitations +9. **Iterate** if JSON fixes: re-run `make p-gen PROBLEM={problem_name} FORCE=1` and `make p-lint` until passes to ensure reproducibility ## Scraping Commands diff --git a/.github/workflows/ci-test.yml b/.github/workflows/ci-test.yml index 6365946..7116769 100644 --- a/.github/workflows/ci-test.yml +++ b/.github/workflows/ci-test.yml @@ -6,9 +6,16 @@ on: pull_request: types: [opened, synchronize, reopened] +env: + TARGET_PYTHON_VERSION: "3.13" + jobs: test: runs-on: ubuntu-latest + strategy: + fail-fast: false + matrix: + python-version: ["3.10", "3.11", "3.12", "3.13"] steps: - uses: actions/checkout@08c6903cd8c0fde910a37f88322edcfb5dd907a8 # v5.0.0 @@ -16,7 +23,7 @@ jobs: - name: Set up Python uses: actions/setup-python@e797f83bcb11b83ae66e0230d6156d7c80228e7c # v6.0.0 with: - python-version: "3.13" + python-version: ${{ matrix.python-version }} - name: Install Poetry uses: snok/install-poetry@76e04a911780d5b312d89783f7b1cd627778900a # v1.4.1 @@ -30,7 +37,7 @@ jobs: uses: actions/cache@0400d5f644dc74513175e3cd8d07132dd4860809 # v4.2.4 with: path: .venv - key: venv-${{ runner.os }}-${{ steps.setup-python.outputs.python-version }}-${{ hashFiles('**/poetry.lock') }} + key: venv-${{ runner.os }}-${{ matrix.python-version }}-${{ hashFiles('**/poetry.lock') }} - name: Install dependencies run: | @@ -67,11 +74,13 @@ jobs: run: make test - name: SonarQube Scan + if: matrix.python-version == env.TARGET_PYTHON_VERSION uses: SonarSource/sonarqube-scan-action@1a6d90ebcb0e6a6b1d87e37ba693fe453195ae25 # v5.3.1 env: SONAR_TOKEN: ${{ secrets.SONAR_TOKEN }} - name: Upload coverage reports to Codecov + if: matrix.python-version == env.TARGET_PYTHON_VERSION uses: codecov/codecov-action@5a1091511ad55cbe89839c7260b706298ca349f7 # v5.5.1 with: fail_ci_if_error: true diff --git a/Makefile b/Makefile index 1849e62..83be5a8 100644 --- a/Makefile +++ b/Makefile @@ -1,5 +1,5 @@ PYTHON_VERSION = 3.13 -PROBLEM ?= find_all_anagrams_in_a_string +PROBLEM ?= daily_temperatures FORCE ?= 0 COMMA := , @@ -42,6 +42,7 @@ define lint_target endef lint: + poetry run python scripts/sort_tags.py poetry sort npx prettier --write "**/*.{ts,tsx,css,json,yaml,yml,md}" $(call lint_target,.) diff --git a/leetcode/accounts_merge/test_solution.py b/leetcode/accounts_merge/test_solution.py index 8f18c66..0667cab 100644 --- a/leetcode/accounts_merge/test_solution.py +++ b/leetcode/accounts_merge/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_accounts_merge, run_accounts_merge from .solution import Solution diff --git a/leetcode/add_binary/test_solution.py b/leetcode/add_binary/test_solution.py index 585a246..bfdf6a7 100644 --- a/leetcode/add_binary/test_solution.py +++ b/leetcode/add_binary/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_add_binary, run_add_binary from .solution import Solution diff --git a/leetcode/balanced_binary_tree/test_solution.py b/leetcode/balanced_binary_tree/test_solution.py index 97000d1..9d7a061 100644 --- a/leetcode/balanced_binary_tree/test_solution.py +++ b/leetcode/balanced_binary_tree/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_is_balanced, run_is_balanced from .solution import Solution diff --git a/leetcode/basic_calculator/test_solution.py b/leetcode/basic_calculator/test_solution.py index 8a67479..6bbc871 100644 --- a/leetcode/basic_calculator/test_solution.py +++ b/leetcode/basic_calculator/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_calculate, run_calculate from .solution import Solution diff --git a/leetcode/best_time_to_buy_and_sell_stock/test_solution.py b/leetcode/best_time_to_buy_and_sell_stock/test_solution.py index 4ed9be5..4100e9f 100644 --- a/leetcode/best_time_to_buy_and_sell_stock/test_solution.py +++ b/leetcode/best_time_to_buy_and_sell_stock/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_max_profit, run_max_profit from .solution import Solution diff --git a/leetcode/binary_search/test_solution.py b/leetcode/binary_search/test_solution.py index 5ed0cee..f56195c 100644 --- a/leetcode/binary_search/test_solution.py +++ b/leetcode/binary_search/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_search, run_search from .solution import Solution diff --git a/leetcode/binary_tree_level_order_traversal/test_solution.py b/leetcode/binary_tree_level_order_traversal/test_solution.py index ccb041a..ee7f511 100644 --- a/leetcode/binary_tree_level_order_traversal/test_solution.py +++ b/leetcode/binary_tree_level_order_traversal/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_level_order, run_level_order from .solution import Solution diff --git a/leetcode/binary_tree_right_side_view/test_solution.py b/leetcode/binary_tree_right_side_view/test_solution.py index 871ecef..260e71b 100644 --- a/leetcode/binary_tree_right_side_view/test_solution.py +++ b/leetcode/binary_tree_right_side_view/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_right_side_view, run_right_side_view from .solution import Solution, SolutionBFS, SolutionDFS diff --git a/leetcode/climbing_stairs/test_solution.py b/leetcode/climbing_stairs/test_solution.py index a141b4e..a41eff7 100644 --- a/leetcode/climbing_stairs/test_solution.py +++ b/leetcode/climbing_stairs/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_climb_stairs, run_climb_stairs from .solution import Solution diff --git a/leetcode/clone_graph/test_solution.py b/leetcode/clone_graph/test_solution.py index 95bb87f..4bc8818 100644 --- a/leetcode/clone_graph/test_solution.py +++ b/leetcode/clone_graph/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_clone_graph, run_clone_graph from .solution import Solution, SolutionBFS, SolutionDFS diff --git a/leetcode/coin_change/test_solution.py b/leetcode/coin_change/test_solution.py index 62eede4..b5013d4 100644 --- a/leetcode/coin_change/test_solution.py +++ b/leetcode/coin_change/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_coin_change, run_coin_change from .solution import Solution diff --git a/leetcode/combination_sum/test_solution.py b/leetcode/combination_sum/test_solution.py index de34df9..e168a02 100644 --- a/leetcode/combination_sum/test_solution.py +++ b/leetcode/combination_sum/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_combination_sum, run_combination_sum from .solution import Solution diff --git a/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/test_solution.py b/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/test_solution.py index 5f08fe6..88f7534 100644 --- a/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/test_solution.py +++ b/leetcode/construct_binary_tree_from_preorder_and_inorder_traversal/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_build_tree, run_build_tree from .solution import Solution diff --git a/leetcode/container_with_most_water/test_solution.py b/leetcode/container_with_most_water/test_solution.py index c2bf0e1..edee77b 100644 --- a/leetcode/container_with_most_water/test_solution.py +++ b/leetcode/container_with_most_water/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_max_area, run_max_area from .solution import Solution diff --git a/leetcode/contains_duplicate/test_solution.py b/leetcode/contains_duplicate/test_solution.py index e8c2c7e..02178b9 100644 --- a/leetcode/contains_duplicate/test_solution.py +++ b/leetcode/contains_duplicate/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_contains_duplicate, run_contains_duplicate from .solution import Solution diff --git a/leetcode/course_schedule/test_solution.py b/leetcode/course_schedule/test_solution.py index 35aae35..85e5235 100644 --- a/leetcode/course_schedule/test_solution.py +++ b/leetcode/course_schedule/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_can_finish, run_can_finish from .solution import Solution diff --git a/leetcode/daily_temperatures/README.md b/leetcode/daily_temperatures/README.md new file mode 100644 index 0000000..ce4e11f --- /dev/null +++ b/leetcode/daily_temperatures/README.md @@ -0,0 +1,46 @@ +# Daily Temperatures + +**Difficulty:** Medium +**Topics:** Array, Stack, Monotonic Stack +**Tags:** grind + +**LeetCode:** [Problem 739](https://leetcode.com/problems/daily-temperatures/description/) + +## Problem Description + +Given an array of integers `temperatures` represents the daily temperatures, return an array `answer` such that `answer[i]` is the number of days you have to wait after the `ith` day to get a warmer temperature. If there is no future day for which this is possible, keep `answer[i] == 0` instead. + +## Examples + +### Example 1: + +``` +Input: temperatures = [73,74,75,71,69,72,76,73] +Output: [1,1,4,2,1,1,0,0] +``` + +**Explanation:** + +- For input `[73,74,75,71,69,72,76,73]`, the output should be `[1,1,4,2,1,1,0,0]`. +- For example, the first temperature is 73. The next warmer temperature is 74, which is 1 day later, so we put 1. +- The second temperature is 74. The next warmer temperature is 75, which is 1 day later, so we put 1. +- The third temperature is 75. The next warmer temperature is 76, which is 4 days later, so we put 4. + +### Example 2: + +``` +Input: temperatures = [30,40,50,60] +Output: [1,1,1,0] +``` + +### Example 3: + +``` +Input: temperatures = [30,60,90] +Output: [1,1,0] +``` + +## Constraints + +- `1 <= temperatures.length <= 10^5` +- `30 <= temperatures[i] <= 100` diff --git a/leetcode/daily_temperatures/__init__.py b/leetcode/daily_temperatures/__init__.py new file mode 100644 index 0000000..e69de29 diff --git a/leetcode/daily_temperatures/helpers.py b/leetcode/daily_temperatures/helpers.py new file mode 100644 index 0000000..dfef547 --- /dev/null +++ b/leetcode/daily_temperatures/helpers.py @@ -0,0 +1,8 @@ +def run_daily_temperatures(solution_class: type, temperatures: list[int]): + implementation = solution_class() + return implementation.daily_temperatures(temperatures) + + +def assert_daily_temperatures(result: list[int], expected: list[int]) -> bool: + assert result == expected + return True diff --git a/leetcode/daily_temperatures/playground.py b/leetcode/daily_temperatures/playground.py new file mode 100644 index 0000000..18c07bf --- /dev/null +++ b/leetcode/daily_temperatures/playground.py @@ -0,0 +1,29 @@ +# --- +# jupyter: +# jupytext: +# text_representation: +# extension: .py +# format_name: percent +# format_version: '1.3' +# jupytext_version: 1.17.3 +# kernelspec: +# display_name: leetcode-py-py3.13 +# language: python +# name: python3 +# --- + +# %% +from helpers import assert_daily_temperatures, run_daily_temperatures +from solution import Solution + +# %% +# Example test case +temperatures = [73, 74, 75, 71, 69, 72, 76, 73] +expected = [1, 1, 4, 2, 1, 1, 0, 0] + +# %% +result = run_daily_temperatures(Solution, temperatures) +result + +# %% +assert_daily_temperatures(result, expected) diff --git a/leetcode/daily_temperatures/solution.py b/leetcode/daily_temperatures/solution.py new file mode 100644 index 0000000..93002d9 --- /dev/null +++ b/leetcode/daily_temperatures/solution.py @@ -0,0 +1,15 @@ +class Solution: + + # Time: O(n) + # Space: O(n) + def daily_temperatures(self, temperatures: list[int]) -> list[int]: + result = [0] * len(temperatures) + stack: list[int] = [] + + for i, temp in enumerate(temperatures): + while stack and temperatures[stack[-1]] < temp: + prev_index = stack.pop() + result[prev_index] = i - prev_index + stack.append(i) + + return result diff --git a/leetcode/daily_temperatures/test_solution.py b/leetcode/daily_temperatures/test_solution.py new file mode 100644 index 0000000..3a50fc7 --- /dev/null +++ b/leetcode/daily_temperatures/test_solution.py @@ -0,0 +1,56 @@ +import pytest + +from leetcode_py import logged_test + +from .helpers import assert_daily_temperatures, run_daily_temperatures +from .solution import Solution + + +class TestDailyTemperatures: + def setup_method(self): + self.solution = Solution() + + @logged_test + @pytest.mark.parametrize( + "temperatures, expected", + [ + ([73, 74, 75, 71, 69, 72, 76, 73], [1, 1, 4, 2, 1, 1, 0, 0]), + ([30, 40, 50, 60], [1, 1, 1, 0]), + ([30, 60, 90], [1, 1, 0]), + ([89, 62, 70, 58, 47, 47, 46, 76, 100, 70], [8, 1, 5, 4, 3, 2, 1, 1, 0, 0]), + ([55, 38, 53, 81, 61, 93, 97, 32, 43, 78], [3, 1, 1, 2, 1, 1, 0, 1, 1, 0]), + ([34, 80, 80, 34, 34, 80, 80, 80, 80, 34], [1, 0, 0, 2, 1, 0, 0, 0, 0, 0]), + ([73], [0]), + ([100], [0]), + ([30, 31, 32, 33, 34], [1, 1, 1, 1, 0]), + ([90, 80, 70, 60, 50], [0, 0, 0, 0, 0]), + ([50, 50, 50, 50], [0, 0, 0, 0]), + ([30, 100, 30, 100], [1, 0, 1, 0]), + ([75, 71, 69, 72, 76], [4, 2, 1, 1, 0]), + ([40, 35, 32, 37, 50], [4, 2, 1, 1, 0]), + ([30, 40, 50, 60, 70, 80, 90, 100], [1, 1, 1, 1, 1, 1, 1, 0]), + ([30, 30], [0, 0]), + ([100, 100], [0, 0]), + ([30, 100], [1, 0]), + ([100, 30], [0, 0]), + ([30, 31, 100], [1, 1, 0]), + ([30, 99, 100], [1, 1, 0]), + ([50, 40, 60, 30, 70], [2, 1, 2, 1, 0]), + ([60, 50, 70, 40, 80], [2, 1, 2, 1, 0]), + ([40, 50, 60, 50, 40], [1, 1, 0, 0, 0]), + ([30, 40, 50, 40, 30], [1, 1, 0, 0, 0]), + ([60, 50, 40, 50, 60], [0, 3, 1, 1, 0]), + ([70, 60, 50, 60, 70], [0, 3, 1, 1, 0]), + ([45, 50, 40, 60, 55, 65], [1, 2, 1, 2, 1, 0]), + ([35, 45, 30, 50, 40, 60], [1, 2, 1, 2, 1, 0]), + ([30, 31, 32, 33, 34, 35, 36, 37, 38, 39], [1, 1, 1, 1, 1, 1, 1, 1, 1, 0]), + ([50, 49, 48, 47, 46, 45, 44, 43, 42, 41], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]), + ([40, 40, 50, 50, 60, 60], [2, 1, 2, 1, 0, 0]), + ([60, 60, 50, 50, 40, 40], [0, 0, 0, 0, 0, 0]), + ([30, 31, 30, 32], [1, 2, 1, 0]), + ([99, 100, 99, 100], [1, 0, 1, 0]), + ], + ) + def test_daily_temperatures(self, temperatures: list[int], expected: list[int]): + result = run_daily_temperatures(Solution, temperatures) + assert_daily_temperatures(result, expected) diff --git a/leetcode/diagonal_traverse/test_solution.py b/leetcode/diagonal_traverse/test_solution.py index a57c110..2cec862 100644 --- a/leetcode/diagonal_traverse/test_solution.py +++ b/leetcode/diagonal_traverse/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_find_diagonal_order, run_find_diagonal_order from .solution import Solution, SolutionRowShift diff --git a/leetcode/diameter_of_binary_tree/test_solution.py b/leetcode/diameter_of_binary_tree/test_solution.py index 11468a0..8a3bffc 100644 --- a/leetcode/diameter_of_binary_tree/test_solution.py +++ b/leetcode/diameter_of_binary_tree/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_diameter_of_binary_tree, run_diameter_of_binary_tree from .solution import Solution diff --git a/leetcode/evaluate_reverse_polish_notation/test_solution.py b/leetcode/evaluate_reverse_polish_notation/test_solution.py index 244730f..e11cc5b 100644 --- a/leetcode/evaluate_reverse_polish_notation/test_solution.py +++ b/leetcode/evaluate_reverse_polish_notation/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_eval_rpn, run_eval_rpn from .solution import Solution diff --git a/leetcode/find_all_anagrams_in_a_string/test_solution.py b/leetcode/find_all_anagrams_in_a_string/test_solution.py index 3782888..d16ca19 100644 --- a/leetcode/find_all_anagrams_in_a_string/test_solution.py +++ b/leetcode/find_all_anagrams_in_a_string/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_find_anagrams, run_find_anagrams from .solution import Solution diff --git a/leetcode/find_median_from_data_stream/test_solution.py b/leetcode/find_median_from_data_stream/test_solution.py index 25ec573..823bd07 100644 --- a/leetcode/find_median_from_data_stream/test_solution.py +++ b/leetcode/find_median_from_data_stream/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_median_finder, run_median_finder from .solution import MedianFinder, MedianFinderHybrid diff --git a/leetcode/first_bad_version/test_solution.py b/leetcode/first_bad_version/test_solution.py index 3ea5446..916fb2c 100644 --- a/leetcode/first_bad_version/test_solution.py +++ b/leetcode/first_bad_version/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_first_bad_version, run_first_bad_version from .solution import Solution diff --git a/leetcode/flood_fill/test_solution.py b/leetcode/flood_fill/test_solution.py index c9703c3..cf1b8ab 100644 --- a/leetcode/flood_fill/test_solution.py +++ b/leetcode/flood_fill/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_flood_fill, run_flood_fill from .solution import Solution diff --git a/leetcode/implement_queue_using_stacks/test_solution.py b/leetcode/implement_queue_using_stacks/test_solution.py index 24520ea..8094d30 100644 --- a/leetcode/implement_queue_using_stacks/test_solution.py +++ b/leetcode/implement_queue_using_stacks/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_my_queue, run_my_queue from .solution import MyQueue diff --git a/leetcode/implement_trie_prefix_tree/test_solution.py b/leetcode/implement_trie_prefix_tree/test_solution.py index 272e9bd..8a53b20 100644 --- a/leetcode/implement_trie_prefix_tree/test_solution.py +++ b/leetcode/implement_trie_prefix_tree/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_trie_operations, run_trie_operations from .solution import Trie diff --git a/leetcode/insert_interval/test_solution.py b/leetcode/insert_interval/test_solution.py index a7ab73d..0901983 100644 --- a/leetcode/insert_interval/test_solution.py +++ b/leetcode/insert_interval/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_insert, run_insert from .solution import Solution diff --git a/leetcode/invert_binary_tree/test_solution.py b/leetcode/invert_binary_tree/test_solution.py index 9e40afb..c86cc48 100644 --- a/leetcode/invert_binary_tree/test_solution.py +++ b/leetcode/invert_binary_tree/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_invert_tree, run_invert_tree from .solution import Solution, SolutionBFS, SolutionDFS diff --git a/leetcode/k_closest_points_to_origin/test_solution.py b/leetcode/k_closest_points_to_origin/test_solution.py index df391c0..7faa99d 100644 --- a/leetcode/k_closest_points_to_origin/test_solution.py +++ b/leetcode/k_closest_points_to_origin/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_k_closest, run_k_closest from .solution import Solution diff --git a/leetcode/kth_smallest_element_in_a_bst/test_solution.py b/leetcode/kth_smallest_element_in_a_bst/test_solution.py index be3683e..f12abdb 100644 --- a/leetcode/kth_smallest_element_in_a_bst/test_solution.py +++ b/leetcode/kth_smallest_element_in_a_bst/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_kth_smallest, run_kth_smallest from .solution import Solution diff --git a/leetcode/largest_rectangle_in_histogram/test_solution.py b/leetcode/largest_rectangle_in_histogram/test_solution.py index 2ac5ee6..66965c5 100644 --- a/leetcode/largest_rectangle_in_histogram/test_solution.py +++ b/leetcode/largest_rectangle_in_histogram/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_largest_rectangle_area, run_largest_rectangle_area from .solution import Solution diff --git a/leetcode/letter_combinations_of_a_phone_number/test_solution.py b/leetcode/letter_combinations_of_a_phone_number/test_solution.py index c28498c..28c1e2b 100644 --- a/leetcode/letter_combinations_of_a_phone_number/test_solution.py +++ b/leetcode/letter_combinations_of_a_phone_number/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_letter_combinations, run_letter_combinations from .solution import Solution diff --git a/leetcode/linked_list_cycle/test_solution.py b/leetcode/linked_list_cycle/test_solution.py index 25f3780..c302c6d 100644 --- a/leetcode/linked_list_cycle/test_solution.py +++ b/leetcode/linked_list_cycle/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_has_cycle, run_has_cycle from .solution import Solution diff --git a/leetcode/longest_palindrome/test_solution.py b/leetcode/longest_palindrome/test_solution.py index 5c8e279..dfdfcce 100644 --- a/leetcode/longest_palindrome/test_solution.py +++ b/leetcode/longest_palindrome/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_longest_palindrome, run_longest_palindrome from .solution import Solution diff --git a/leetcode/longest_palindromic_substring/test_solution.py b/leetcode/longest_palindromic_substring/test_solution.py index 0cd1994..5751e25 100644 --- a/leetcode/longest_palindromic_substring/test_solution.py +++ b/leetcode/longest_palindromic_substring/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_longest_palindrome, run_longest_palindrome from .solution import Solution, SolutionManacher diff --git a/leetcode/longest_substring_without_repeating_characters/test_solution.py b/leetcode/longest_substring_without_repeating_characters/test_solution.py index 3193ea9..289a132 100644 --- a/leetcode/longest_substring_without_repeating_characters/test_solution.py +++ b/leetcode/longest_substring_without_repeating_characters/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_length_of_longest_substring, run_length_of_longest_substring from .solution import Solution diff --git a/leetcode/lowest_common_ancestor_of_a_binary_search_tree/test_solution.py b/leetcode/lowest_common_ancestor_of_a_binary_search_tree/test_solution.py index fd2cede..47dc07b 100644 --- a/leetcode/lowest_common_ancestor_of_a_binary_search_tree/test_solution.py +++ b/leetcode/lowest_common_ancestor_of_a_binary_search_tree/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_lowest_common_ancestor, run_lowest_common_ancestor from .solution import Solution diff --git a/leetcode/lowest_common_ancestor_of_a_binary_tree/test_solution.py b/leetcode/lowest_common_ancestor_of_a_binary_tree/test_solution.py index 3d28a96..6b01c21 100644 --- a/leetcode/lowest_common_ancestor_of_a_binary_tree/test_solution.py +++ b/leetcode/lowest_common_ancestor_of_a_binary_tree/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_lowest_common_ancestor, run_lowest_common_ancestor from .solution import Solution diff --git a/leetcode/lru_cache/test_solution.py b/leetcode/lru_cache/test_solution.py index db70723..3a3c15f 100644 --- a/leetcode/lru_cache/test_solution.py +++ b/leetcode/lru_cache/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_lru_cache, run_lru_cache from .solution import LRUCache, LRUCacheWithDoublyList diff --git a/leetcode/majority_element/test_solution.py b/leetcode/majority_element/test_solution.py index ef73961..eaa2b55 100644 --- a/leetcode/majority_element/test_solution.py +++ b/leetcode/majority_element/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_majority_element, run_majority_element from .solution import Solution diff --git a/leetcode/maximum_depth_of_binary_tree/test_solution.py b/leetcode/maximum_depth_of_binary_tree/test_solution.py index e86979c..285a10a 100644 --- a/leetcode/maximum_depth_of_binary_tree/test_solution.py +++ b/leetcode/maximum_depth_of_binary_tree/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_max_depth, run_max_depth from .solution import Solution diff --git a/leetcode/maximum_profit_in_job_scheduling/test_solution.py b/leetcode/maximum_profit_in_job_scheduling/test_solution.py index 8e17451..ec132a6 100644 --- a/leetcode/maximum_profit_in_job_scheduling/test_solution.py +++ b/leetcode/maximum_profit_in_job_scheduling/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_job_scheduling, run_job_scheduling from .solution import Solution diff --git a/leetcode/maximum_subarray/test_solution.py b/leetcode/maximum_subarray/test_solution.py index ddb4d89..841b14b 100644 --- a/leetcode/maximum_subarray/test_solution.py +++ b/leetcode/maximum_subarray/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_max_sub_array, run_max_sub_array from .solution import Solution diff --git a/leetcode/merge_intervals/test_solution.py b/leetcode/merge_intervals/test_solution.py index 195cced..b8d86f6 100644 --- a/leetcode/merge_intervals/test_solution.py +++ b/leetcode/merge_intervals/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_merge, run_merge from .solution import Solution diff --git a/leetcode/merge_k_sorted_lists/test_solution.py b/leetcode/merge_k_sorted_lists/test_solution.py index e9d9cfc..15d491c 100644 --- a/leetcode/merge_k_sorted_lists/test_solution.py +++ b/leetcode/merge_k_sorted_lists/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_merge_k_lists, run_merge_k_lists from .solution import Solution diff --git a/leetcode/merge_two_sorted_lists/test_solution.py b/leetcode/merge_two_sorted_lists/test_solution.py index 58b2887..1f04409 100644 --- a/leetcode/merge_two_sorted_lists/test_solution.py +++ b/leetcode/merge_two_sorted_lists/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_merge_two_lists, run_merge_two_lists from .solution import Solution diff --git a/leetcode/middle_of_the_linked_list/test_solution.py b/leetcode/middle_of_the_linked_list/test_solution.py index 0cdfdd0..ae85cfb 100644 --- a/leetcode/middle_of_the_linked_list/test_solution.py +++ b/leetcode/middle_of_the_linked_list/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_middle_node, run_middle_node from .solution import Solution diff --git a/leetcode/min_stack/test_solution.py b/leetcode/min_stack/test_solution.py index fd75d51..4e781e2 100644 --- a/leetcode/min_stack/test_solution.py +++ b/leetcode/min_stack/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_min_stack_operations, run_min_stack_operations from .solution import MinStack diff --git a/leetcode/minimum_height_trees/test_solution.py b/leetcode/minimum_height_trees/test_solution.py index 74cd63c..b03370a 100644 --- a/leetcode/minimum_height_trees/test_solution.py +++ b/leetcode/minimum_height_trees/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_find_min_height_trees, run_find_min_height_trees from .solution import Solution diff --git a/leetcode/minimum_window_substring/test_solution.py b/leetcode/minimum_window_substring/test_solution.py index a76fe7a..2e33210 100644 --- a/leetcode/minimum_window_substring/test_solution.py +++ b/leetcode/minimum_window_substring/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_min_window, run_min_window from .solution import Solution diff --git a/leetcode/number_of_islands/test_solution.py b/leetcode/number_of_islands/test_solution.py index 2b37d2d..44a247e 100644 --- a/leetcode/number_of_islands/test_solution.py +++ b/leetcode/number_of_islands/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_num_islands, run_num_islands from .solution import Solution diff --git a/leetcode/partition_equal_subset_sum/test_solution.py b/leetcode/partition_equal_subset_sum/test_solution.py index a480df5..0a983dc 100644 --- a/leetcode/partition_equal_subset_sum/test_solution.py +++ b/leetcode/partition_equal_subset_sum/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_can_partition, run_can_partition from .solution import Solution, SolutionBitset diff --git a/leetcode/permutations/test_solution.py b/leetcode/permutations/test_solution.py index d8d1bce..92237b9 100644 --- a/leetcode/permutations/test_solution.py +++ b/leetcode/permutations/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_permute, run_permute from .solution import Solution diff --git a/leetcode/product_of_array_except_self/test_solution.py b/leetcode/product_of_array_except_self/test_solution.py index 84013ac..fe69a3c 100644 --- a/leetcode/product_of_array_except_self/test_solution.py +++ b/leetcode/product_of_array_except_self/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_product_except_self, run_product_except_self from .solution import Solution diff --git a/leetcode/ransom_note/test_solution.py b/leetcode/ransom_note/test_solution.py index 429913a..d5613e0 100644 --- a/leetcode/ransom_note/test_solution.py +++ b/leetcode/ransom_note/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_can_construct, run_can_construct from .solution import Solution diff --git a/leetcode/reverse_linked_list/test_solution.py b/leetcode/reverse_linked_list/test_solution.py index 8f8198e..8a8c4d0 100644 --- a/leetcode/reverse_linked_list/test_solution.py +++ b/leetcode/reverse_linked_list/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_reverse_list, run_reverse_list from .solution import Solution diff --git a/leetcode/reverse_linked_list_ii/test_solution.py b/leetcode/reverse_linked_list_ii/test_solution.py index 5964711..56770a1 100644 --- a/leetcode/reverse_linked_list_ii/test_solution.py +++ b/leetcode/reverse_linked_list_ii/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_reverse_between, run_reverse_between from .solution import Solution diff --git a/leetcode/rotting_oranges/test_solution.py b/leetcode/rotting_oranges/test_solution.py index 9710fb8..571852a 100644 --- a/leetcode/rotting_oranges/test_solution.py +++ b/leetcode/rotting_oranges/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_oranges_rotting, run_oranges_rotting from .solution import Solution diff --git a/leetcode/search_in_rotated_sorted_array/test_solution.py b/leetcode/search_in_rotated_sorted_array/test_solution.py index a227711..29303eb 100644 --- a/leetcode/search_in_rotated_sorted_array/test_solution.py +++ b/leetcode/search_in_rotated_sorted_array/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_search, run_search from .solution import Solution diff --git a/leetcode/serialize_and_deserialize_binary_tree/test_solution.py b/leetcode/serialize_and_deserialize_binary_tree/test_solution.py index 8f67b6e..056ca2f 100644 --- a/leetcode/serialize_and_deserialize_binary_tree/test_solution.py +++ b/leetcode/serialize_and_deserialize_binary_tree/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_serialize_deserialize, run_serialize_deserialize from .solution import Codec diff --git a/leetcode/sort_colors/test_solution.py b/leetcode/sort_colors/test_solution.py index 43f6085..a9aaa03 100644 --- a/leetcode/sort_colors/test_solution.py +++ b/leetcode/sort_colors/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_sort_colors, run_sort_colors from .solution import Solution diff --git a/leetcode/spiral_matrix/test_solution.py b/leetcode/spiral_matrix/test_solution.py index 22bda84..d79d8ab 100644 --- a/leetcode/spiral_matrix/test_solution.py +++ b/leetcode/spiral_matrix/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_spiral_order, run_spiral_order from .solution import Solution diff --git a/leetcode/string_to_integer_atoi/test_solution.py b/leetcode/string_to_integer_atoi/test_solution.py index d09898c..e73c34a 100644 --- a/leetcode/string_to_integer_atoi/test_solution.py +++ b/leetcode/string_to_integer_atoi/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_my_atoi, run_my_atoi from .solution import Solution diff --git a/leetcode/subsets/test_solution.py b/leetcode/subsets/test_solution.py index 6efd136..e16ab8c 100644 --- a/leetcode/subsets/test_solution.py +++ b/leetcode/subsets/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_subsets, run_subsets from .solution import Solution diff --git a/leetcode/task_scheduler/test_solution.py b/leetcode/task_scheduler/test_solution.py index 85794ce..441fa58 100644 --- a/leetcode/task_scheduler/test_solution.py +++ b/leetcode/task_scheduler/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_least_interval, run_least_interval from .solution import Solution diff --git a/leetcode/three_sum/test_solution.py b/leetcode/three_sum/test_solution.py index 2bba573..46d0263 100644 --- a/leetcode/three_sum/test_solution.py +++ b/leetcode/three_sum/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_three_sum, run_three_sum from .solution import Solution diff --git a/leetcode/time_based_key_value_store/test_solution.py b/leetcode/time_based_key_value_store/test_solution.py index c0c16ff..fb955f7 100644 --- a/leetcode/time_based_key_value_store/test_solution.py +++ b/leetcode/time_based_key_value_store/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_time_map_operations, run_time_map_operations from .solution import TimeMap diff --git a/leetcode/trapping_rain_water/test_solution.py b/leetcode/trapping_rain_water/test_solution.py index c35bb3f..ab8cd90 100644 --- a/leetcode/trapping_rain_water/test_solution.py +++ b/leetcode/trapping_rain_water/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_trap, run_trap from .solution import Solution diff --git a/leetcode/two_sum/test_solution.py b/leetcode/two_sum/test_solution.py index 75cb3f3..a251146 100644 --- a/leetcode/two_sum/test_solution.py +++ b/leetcode/two_sum/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_two_sum, run_two_sum from .solution import Solution diff --git a/leetcode/unique_paths/test_solution.py b/leetcode/unique_paths/test_solution.py index b66ad67..1e9be3c 100644 --- a/leetcode/unique_paths/test_solution.py +++ b/leetcode/unique_paths/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_unique_paths, run_unique_paths from .solution import Solution, SolutionMath diff --git a/leetcode/valid_anagram/test_solution.py b/leetcode/valid_anagram/test_solution.py index 8a46646..0acd896 100644 --- a/leetcode/valid_anagram/test_solution.py +++ b/leetcode/valid_anagram/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_is_anagram, run_is_anagram from .solution import Solution diff --git a/leetcode/valid_palindrome/test_solution.py b/leetcode/valid_palindrome/test_solution.py index 83b4362..7804ca5 100644 --- a/leetcode/valid_palindrome/test_solution.py +++ b/leetcode/valid_palindrome/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_is_palindrome, run_is_palindrome from .solution import Solution diff --git a/leetcode/valid_parentheses/test_solution.py b/leetcode/valid_parentheses/test_solution.py index 7e4c8b2..78f33d3 100644 --- a/leetcode/valid_parentheses/test_solution.py +++ b/leetcode/valid_parentheses/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_is_valid, run_is_valid from .solution import Solution diff --git a/leetcode/validate_binary_search_tree/test_solution.py b/leetcode/validate_binary_search_tree/test_solution.py index 2491911..e71dd32 100644 --- a/leetcode/validate_binary_search_tree/test_solution.py +++ b/leetcode/validate_binary_search_tree/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_is_valid_bst, run_is_valid_bst from .solution import Solution, SolutionBFS, SolutionDFS diff --git a/leetcode/word_break/test_solution.py b/leetcode/word_break/test_solution.py index 97a2619..7463d00 100644 --- a/leetcode/word_break/test_solution.py +++ b/leetcode/word_break/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_word_break, run_word_break from .solution import Solution diff --git a/leetcode/word_ladder/test_solution.py b/leetcode/word_ladder/test_solution.py index 94008a8..2239150 100644 --- a/leetcode/word_ladder/test_solution.py +++ b/leetcode/word_ladder/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_ladder_length, run_ladder_length from .solution import Solution diff --git a/leetcode/word_search/test_solution.py b/leetcode/word_search/test_solution.py index 5e1151d..32f041c 100644 --- a/leetcode/word_search/test_solution.py +++ b/leetcode/word_search/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_exist, run_exist from .solution import Solution diff --git a/leetcode/zero_one_matrix/test_solution.py b/leetcode/zero_one_matrix/test_solution.py index 4129b47..d7823c0 100644 --- a/leetcode/zero_one_matrix/test_solution.py +++ b/leetcode/zero_one_matrix/test_solution.py @@ -1,6 +1,6 @@ import pytest -from leetcode_py.test_utils import logged_test +from leetcode_py import logged_test from .helpers import assert_update_matrix, run_update_matrix from .solution import Solution diff --git a/leetcode_py/__init__.py b/leetcode_py/__init__.py index 0300fc0..8134f11 100644 --- a/leetcode_py/__init__.py +++ b/leetcode_py/__init__.py @@ -1,5 +1,6 @@ from leetcode_py.data_structures.graph_node import GraphNode from leetcode_py.data_structures.list_node import ListNode from leetcode_py.data_structures.tree_node import TreeNode +from leetcode_py.tools.logged_test import logged_test -__all__ = ["GraphNode", "ListNode", "TreeNode"] +__all__ = ["GraphNode", "ListNode", "TreeNode", "logged_test"] diff --git a/leetcode_py/cli/resources/leetcode/cookiecutter.json b/leetcode_py/cli/resources/leetcode/cookiecutter.json index 4287ea1..e8175f0 100644 --- a/leetcode_py/cli/resources/leetcode/cookiecutter.json +++ b/leetcode_py/cli/resources/leetcode/cookiecutter.json @@ -18,7 +18,7 @@ "readme_constraints": "- 2 <= nums.length <= 10^4\n- -10^9 <= nums[i] <= 10^9\n- -10^9 <= target <= 10^9\n- Only one valid answer exists.", "readme_additional": "", - "helpers_imports": "import pytest\nfrom leetcode_py.test_utils import logged_test\nfrom .solution import Solution", + "helpers_imports": "import pytest\nfrom leetcode_py import logged_test\nfrom .solution import Solution", "helpers_content": "", "helpers_run_name": "two_sum", "helpers_run_signature": "(solution_class: type, nums: list[int], target: int)", @@ -31,7 +31,7 @@ "solution_contents": "", "solution_class_content": "", - "test_imports": "import pytest\nfrom leetcode_py.test_utils import logged_test\nfrom .helpers import assert_two_sum, run_two_sum\nfrom .solution import Solution", + "test_imports": "import pytest\nfrom leetcode_py import logged_test\nfrom .helpers import assert_two_sum, run_two_sum\nfrom .solution import Solution", "test_content": "", "test_class_name": "TwoSum", "test_class_content": " def setup_method(self):\n self.solution = Solution()", diff --git a/leetcode_py/cli/resources/leetcode/examples/example.json5 b/leetcode_py/cli/resources/leetcode/examples/example.json5 index 09c1c24..57d4159 100644 --- a/leetcode_py/cli/resources/leetcode/examples/example.json5 +++ b/leetcode_py/cli/resources/leetcode/examples/example.json5 @@ -1,196 +1,200 @@ { - // ============================================================================ - // COMPREHENSIVE LEETCODE TEMPLATE EXAMPLE - // ============================================================================ - // This example demonstrates ALL template patterns using valid_anagram as base - // with comprehensive comments showing variations for different problem types. - // - // REFERENCE PROBLEMS (see .templates/leetcode/json/ for complete examples): - // 1. valid_anagram - Basic: string parameters, boolean return - // 2. invert_binary_tree - Tree: TreeNode imports/parameters - // 3. merge_two_sorted_lists - LinkedList: ListNode imports/parameters - // 4. lru_cache - Design: custom class, multiple methods, operations - // 5. implement_trie_prefix_tree - Trie: DictTree inheritance - // ============================================================================ + // ============================================================================ + // COMPREHENSIVE LEETCODE TEMPLATE EXAMPLE + // ============================================================================ + // This example demonstrates ALL template patterns using valid_anagram as base + // with comprehensive comments showing variations for different problem types. + // + // REFERENCE PROBLEMS (see .templates/leetcode/json/ for complete examples): + // 1. valid_anagram - Basic: string parameters, boolean return + // 2. invert_binary_tree - Tree: TreeNode imports/parameters + // 3. merge_two_sorted_lists - LinkedList: ListNode imports/parameters + // 4. lru_cache - Design: custom class, multiple methods, operations + // 5. implement_trie_prefix_tree - Trie: DictTree inheritance + // ============================================================================ - // === PROBLEM IDENTIFICATION === - "problem_name": "valid_anagram", // snake_case: used for directory/file names - "solution_class_name": "Solution", // "Solution" for basic problems - // "LRUCache" for design problems - // "Trie(DictTree[str])" for inheritance - "problem_number": "242", // LeetCode problem number as string - "problem_title": "Valid Anagram", // Exact title from LeetCode - "difficulty": "Easy", // Easy, Medium, Hard - "topics": "Hash Table, String, Sorting", // Comma-separated topics from LeetCode - "_tags": { "list": ["grind-75"] }, // Optional: common problem set tags - // Use _tags wrapper for cookiecutter lists + // === PROBLEM IDENTIFICATION === + problem_name: "valid_anagram", // snake_case: used for directory/file names + solution_class_name: "Solution", // "Solution" for basic problems + // "LRUCache" for design problems + // "Trie(DictTree[str])" for inheritance + problem_number: "242", // LeetCode problem number as string + problem_title: "Valid Anagram", // Exact title from LeetCode + difficulty: "Easy", // Easy, Medium, Hard + topics: "Hash Table, String, Sorting", // Comma-separated topics from LeetCode + _tags: { list: ["grind-75"] }, // Optional: common problem set tags + // Use _tags wrapper for cookiecutter lists - // === README CONTENT === - // IMPORTANT: Preserve rich HTML content from LeetCode including: - // - Code snippets with backticks: `code` - // - Bold text: **bold** or bold - // - Italic text: *italic* or italic - // - Images: ![Example](https://assets.leetcode.com/uploads/...) - // - HTML formatting:

,
,