Merge pull request #5 from codewithme-py/feat/add-two-numbers-0002

added new automatization structure && problem solution & test 0002

Author: codewithme-py

.pre-commit-config.yaml

@@ -0,0 +1,16 @@
+repos:
+  - repo: https://github.com/astral-sh/ruff-pre-commit
+    rev: v0.9.4
+    hooks:
+      - id: ruff
+        args: [--fix, --exit-non-zero-on-fix]
+
+  - repo: local
+    hooks:
+      - id: pytest
+        name: pytest
+        entry: pytest
+        language: system
+        pass_filenames: false
+        always_run: true
+        args: [tests/]

Makefile

@@ -0,0 +1,7 @@
+.PHONY: problem
+problem:
+	@if [ -z '$(filter-out problem,$(MAKECMDGOALS))']; then \
+		echo 'Usage: make problem <problem_number>'; \
+		exit 1; \
+	fi
+	@python scripts/create_problem.py $(filter-out problem,$(MAKECMDGOALS))

README.md

@@ -35,8 +35,7 @@ My clean, typed, and tested solutions to LeetCode problems (Python 3.10+).
 
 ### 💡 Что получает клонировавший:
 - ✅ Все решения на **Python ^3.10** с type hints
-- ✅ Тесты для каждой задачи (`pytest`)
-- ✅ Автоматическая проверка стиля (`ruff`)
+- ✅ Пре-коммит-хук для запуска тестов (`pytest`) & (`ruff`)
 - ✅ Автоматическое создание /feat ветки, файлов проблемы и теста
 - ✅ Генерация файлов с контентом: условие задачи, сниппеты кода и примеры тестов (fetch from LeetCode API)
 - ✅ Автообновляемый `README.md` с прогрессом и ссылками
@@ -53,11 +52,12 @@ My clean, typed, and tested solutions to LeetCode problems (Python 3.10+).
 
 This repo provides a production-grade setup for LeetCode practice:
 - Typed, tested Python 3.10+ solutions
+- Pre-commit hook for running tests (`pytest`) & (`ruff`)
 - Automated README generation with progress bars
 - Automated creation of /feat branch, problem and test files
 - Automated generation of files with content: problem statement, code snippets, and test examples (fetch from LeetCode API)
 - Smart cache management: automatic weekly refresh or on-demand
-- Preconfigured CI (tests + linter) and CD (auto-update)
+- Preconfigured CI and CD (auto-update)
 - No manual work — just solve, commit, PR
 
 ⚠️ For proper README generation, internet access is required (to query LeetCode 'API' on first run).
@@ -78,7 +78,7 @@ cd LeetCode_solutions
 
 #### 2. Создай и активируй виртуальное окружение
 ```bash
-python -m venv .venv
+python3 -m venv .venv
 ```
 Linux/Mac
 ```bash
@@ -101,11 +101,11 @@ pytest && ruff check .
 
 #### 5. Используй скрипт обновления README (опционально)
 ```bash
-python scripts/update_readme.py
+python3 scripts/update_readme.py
 ```
 Для принудительного обновления кэша задач используйте флаг `--force-refresh-cache`:
 ```bash
-python scripts/update_readme.py --force-refresh-cache
+python3 scripts/update_readme.py --force-refresh-cache
 ```
 
 - Кэш задач обновляется автоматически раз в неделю (от даты изменения файла problems_cache.json). Для принудительного обновления кэша задач используйте флаг --force-refresh-cache:
@@ -118,7 +118,7 @@ python scripts/update_readme.py --force-refresh-cache
 #### 7. Используй скрипт → Решай новую задачу → делай push → PR → merge в main → CI/CD сделает всё остальное автоматически!
 
 ```bash
-python3 scripts/create_problem.py <номер_задачи>
+make problem <номер_задачи>
 ```
 
 1) Скрипт создает новую **/feat** ветку, а так же файлы решения и тестов минимизируя рутину

build/lib/solutions/__init__.py

@@ -0,0 +1,28 @@
+try:
+    ListNode
+except NameError:
+    class ListNode:
+        def __init__(self, val=0, next=None):
+            self.val = val
+            self.next = next
+
+class Solution:
+    def addTwoNumbers(
+        self, l1: ListNode | None, l2: ListNode | None
+        ) -> ListNode | None:
+        """Add two numbers represented by linked lists."""
+        dummy_head = ListNode(0)
+        current = dummy_head
+        carry = 0
+        while l1 or l2 or carry:
+            val1 = l1.val if l1 else 0
+            val2 = l2.val if l2 else 0
+            sum_val = val1 + val2 + carry
+            carry = sum_val // 10
+            current.next = ListNode(sum_val % 10)
+            current = current.next
+            if l1:
+                l1 = l1.next
+            if l2:
+                l2 = l2.next
+        return dummy_head.next

build/lib/solutions/add_two_numbers_0002.py

@@ -0,0 +1,20 @@
+class Solution:
+    def intToRoman(self, num: int) -> str:
+        """Convert integer to Roman numeral.
+        Uses greedy algorithm with predefined value-symbol pairs including
+        subtractive forms (IV, IX, XL, XC, CD, CM).
+        Args:
+            num: Integer in [1, 3999]
+        Returns:
+            Roman numeral string
+        """
+        roman_pairs = [
+            (1000, 'M'), (900, 'CM'), (500, 'D'), (400, 'CD'), (100, 'C'),
+            (90, 'XC'), (50, 'L'), (40, 'XL'), (10, 'X'),
+            (9, 'IX'), (5, 'V'), (4, 'IV'), (1, 'I')
+        ]
+        result = []
+        for value, symbol in roman_pairs:
+            count, num = divmod(num, value)
+            result.append(symbol * count)
+        return ''.join(result)

build/lib/solutions/integer_to_roman_0012.py

@@ -0,0 +1,15 @@
+class Solution:
+    def longestCommonPrefix(self, strs: list[str]) -> str:
+        """Find the longest common prefix string
+        amongst an array of strings.
+        """
+        if not strs:
+            return ""
+
+        prefix = strs[0]
+        for s in strs[1:]:
+            while not s.startswith(prefix):
+                prefix = prefix[:-1]
+                if not prefix:
+                    return ""
+        return prefix

build/lib/solutions/longest_common_prefix_0014.py

@@ -0,0 +1,17 @@
+class Solution:
+    def isPalindrome(self, x: int) -> bool:
+        """Check if integer is a palindrome without string conversion.
+        Negative numbers and trailing-zero numbers (except 0) are non-palindromic.
+        Uses O(1) space by reversing half the number.
+        Args:
+            x: Integer in [-2^31, 2^31 - 1]
+        Returns:
+            True if x is palindrome, False otherwise
+        """
+        if x < 0 or (x % 10 == 0 and x != 0):
+            return False
+        reversed_half = 0
+        while x > reversed_half:
+            reversed_half = reversed_half * 10 + (x % 10)
+            x //= 10
+        return x == reversed_half or x == reversed_half // 10

build/lib/solutions/palindrome_number_0009.py

@@ -0,0 +1,20 @@
+class ListNode:
+    def __init__(self, val: int = 0, next: 'ListNode | None' = None):
+        self.val = val
+        self.next = next
+
+
+class Solution:
+    def deleteDuplicates(self, head: ListNode | None) -> ListNode | None:
+        """Remove all duplicates from a sorted linked list
+        (keep only one occurrence).
+        """
+        if not head:
+            return None
+        curr = head
+        while curr.next:
+            if curr.val == curr.next.val:
+                curr.next = curr.next.next
+            else:
+                curr = curr.next
+        return head

build/lib/solutions/remove_duplicates_from_sorted_list_0083.py

@@ -0,0 +1,26 @@
+class Solution:
+    def romanToInt(self, s: str) -> int:
+        """Convert Roman numeral to integer.
+        Handles subtractive notation (e.g. IV=4, IX=9).
+        Assumes valid input per LeetCode constraints.
+        Args:
+            s: Roman numeral string (I, V, X, L, C, D, M)
+        Returns:
+            Integer value (1 to 3999)
+        """
+        roman_values = {
+            'I': 1,
+            'V': 5,
+            'X': 10,
+            'L': 50,
+            'C': 100,
+            'D': 500,
+            'M': 1000
+        }
+        total = 0
+        for i in range(len(s)):
+            if i + 1 < len(s) and roman_values[s[i]] < roman_values[s[i + 1]]:
+                total -= roman_values[s[i]]
+            else:
+                total += roman_values[s[i]]
+        return total