mathusanm6 · mathusanm6 · Oct 27, 2024 · Oct 27, 2024 · Oct 27, 2024 · Oct 27, 2024
diff --git a/.github/workflows/python-package-conda.yml b/.github/workflows/python-package-conda.yml
@@ -1,34 +1,35 @@
-name: Python CI (conda)
+name: Python Lint & Test
 
 on: [push]
 
 jobs:
-  build-linux:
+  build-python:
     runs-on: ubuntu-latest
     strategy:
-      max-parallel: 5
+      matrix:
+        python-version: ["3.10"]
 
     steps:
-    - uses: actions/checkout@v3
-    - name: Set up Python 3.10
-      uses: actions/setup-python@v3
-      with:
-        python-version: '3.10'
-    - name: Add conda to system path
-      run: |
-        # $CONDA is an environment variable pointing to the root of the miniconda directory
-        echo $CONDA/bin >> $GITHUB_PATH
-    - name: Install dependencies
-      run: |
-        conda update -n base -c defaults conda
-    - name: Lint with flake8
-      run: |
-        conda install -y flake8
-        # stop the build if there are Python syntax errors or undefined names
-        flake8 . --count --select=E9,F63,F7,F82 --show-source --statistics
-        # exit-zero treats all errors as warnings. The GitHub editor is 127 chars wide
-        flake8 . --count --exit-zero --max-complexity=10 --max-line-length=127 --statistics
-    - name: Test with pytest
-      run: |
-        conda install -y pytest
-        pytest
+      - uses: actions/checkout@v4
+      - name: Set up Python ${{ matrix.python-version }}
+        uses: actions/setup-python@v5
+        with:
+          python-version: ${{ matrix.python-version }}
+          cache: "pip"
+
+      - name: Install dependencies
+        run: |
+          python -m pip install --upgrade pip
+          pip install -r python/requirements.txt
+
+      - name: Lint code with Ruff
+        run: ruff check python --output-format=github --target-version=py310
+
+      - name: Check code formatting with Ruff
+        run: ruff format python --diff --target-version=py310
+        continue-on-error: true
+
+      - name: Test with pytest
+        run: |
+          pip install pytest pytest-cov
+          pytest python --doctest-modules --junitxml=junit/test-results.xml --cov=python --cov-report=xml --cov-report=html
diff --git a/problems/medium/container_with_most_water.py b/problems/medium/container_with_most_water.py
diff --git a/problems/medium/three_sum.py b/problems/medium/three_sum.py
diff --git a/.gitignore → python/.gitignore b/.gitignore → python/.gitignore
@@ -1,3 +1,6 @@
+# Environment
+*_env/
+
 # Byte-compiled / optimized / DLL files
 __pycache__/
 *.py[cod]

diff --git a/helpers/list.py → python/helpers/list.py b/helpers/list.py → python/helpers/list.py
diff --git a/problems/__init__.py → python/problems/__init__.py b/problems/__init__.py → python/problems/__init__.py
diff --git a/problems/easy/__init__.py → python/problems/easy/__init__.py b/problems/easy/__init__.py → python/problems/easy/__init__.py
diff --git a/...s/easy/best_time_to_buy_and_sell_stock.py → ...s/easy/best_time_to_buy_and_sell_stock.py b/...s/easy/best_time_to_buy_and_sell_stock.py → ...s/easy/best_time_to_buy_and_sell_stock.py
diff --git a/problems/easy/contains_duplicate.py → python/problems/easy/contains_duplicate.py b/problems/easy/contains_duplicate.py → python/problems/easy/contains_duplicate.py
diff --git a/problems/easy/linked_list_cycle.py → python/problems/easy/linked_list_cycle.py b/problems/easy/linked_list_cycle.py → python/problems/easy/linked_list_cycle.py
diff --git a/...lems/easy/maximum_depth_of_binary_tree.py → ...lems/easy/maximum_depth_of_binary_tree.py b/...lems/easy/maximum_depth_of_binary_tree.py → ...lems/easy/maximum_depth_of_binary_tree.py
diff --git a/problems/easy/merge_sorted_array.py → python/problems/easy/merge_sorted_array.py b/problems/easy/merge_sorted_array.py → python/problems/easy/merge_sorted_array.py
diff --git a/...asy/minimum_absolute_difference_in_bst.py → ...asy/minimum_absolute_difference_in_bst.py b/...asy/minimum_absolute_difference_in_bst.py → ...asy/minimum_absolute_difference_in_bst.py
diff --git a/problems/easy/ransom_note.py → python/problems/easy/ransom_note.py b/problems/easy/ransom_note.py → python/problems/easy/ransom_note.py
diff --git a/problems/easy/summary_ranges.py → python/problems/easy/summary_ranges.py b/problems/easy/summary_ranges.py → python/problems/easy/summary_ranges.py
diff --git a/problems/easy/two_sum.py → python/problems/easy/two_sum.py b/problems/easy/two_sum.py → python/problems/easy/two_sum.py
diff --git a/problems/easy/valid_anagram.py → python/problems/easy/valid_anagram.py b/problems/easy/valid_anagram.py → python/problems/easy/valid_anagram.py
diff --git a/problems/easy/valid_palindrome.py → python/problems/easy/valid_palindrome.py b/problems/easy/valid_palindrome.py → python/problems/easy/valid_palindrome.py
@@ -14,20 +14,20 @@ def isAlnumChar(c):
                 return True
             return False
 
-        l, r = 0, len(s) - 1
+        left, right = 0, len(s) - 1
         s = s.lower()
 
-        while l < r:
-            s_l, s_r = s[l], s[r]
+        while left < right:
+            s_l, s_r = s[left], s[right]
             if not isAlnumChar(s_l):
-                l += 1
+                left += 1
                 continue
             if not isAlnumChar(s_r):
-                r -= 1
+                right -= 1
                 continue
 
             if s_l != s_r:
                 return False
-            l += 1
-            r -= 1
+            left += 1
+            right -= 1
         return True
diff --git a/problems/easy/valid_parentheses.py → python/problems/easy/valid_parentheses.py b/problems/easy/valid_parentheses.py → python/problems/easy/valid_parentheses.py
@@ -11,7 +11,7 @@ def correspondingBracket(c):
                 if close[i] == c:
                     return open_[i]
             return None
-    
+
         stack = []
         for c in s:
             if isOpenBracket(c):

diff --git a/problems/hard/__init__.py → python/problems/hard/__init__.py b/problems/hard/__init__.py → python/problems/hard/__init__.py
diff --git a/problems/hard/candy.py → python/problems/hard/candy.py b/problems/hard/candy.py → python/problems/hard/candy.py
@@ -20,12 +20,12 @@ def slope(i):
 
         candies = [1] * n
 
-        for l in range(n - 1):
-            if steep_arr[l] == 1 and candies[l + 1] <= candies[l]:
-                candies[l + 1] = candies[l] + 1
+        for left in range(n - 1):
+            if steep_arr[left] == 1 and candies[left + 1] <= candies[left]:
+                candies[left + 1] = candies[left] + 1
 
-        for r in range(n - 1, 0, -1):
-            if steep_arr[r - 1] == -1 and candies[r] >= candies[r - 1]:
-                candies[r - 1] = candies[r] + 1
+        for right in range(n - 1, 0, -1):
+            if steep_arr[right - 1] == -1 and candies[right] >= candies[right - 1]:
+                candies[right - 1] = candies[right] + 1
 
         return sum(candies)
diff --git a/problems/hard/minimum_window_substring.py → ...problems/hard/minimum_window_substring.py b/problems/hard/minimum_window_substring.py → ...problems/hard/minimum_window_substring.py
diff --git a/problems/hard/sliding_window_maximum.py → ...n/problems/hard/sliding_window_maximum.py b/problems/hard/sliding_window_maximum.py → ...n/problems/hard/sliding_window_maximum.py
diff --git a/problems/hard/trapping_rain_water_o_1.py → .../problems/hard/trapping_rain_water_o_1.py b/problems/hard/trapping_rain_water_o_1.py → .../problems/hard/trapping_rain_water_o_1.py
@@ -5,7 +5,7 @@ class Solution:
     def trap(self, height: List[int]) -> int:
         n = len(height)
 
-        leftMax = height[0]     # O(1) space
+        leftMax = height[0]  # O(1) space
         rightMax = height[n - 1]
 
         left = 1

diff --git a/problems/hard/trapping_rain_water_o_n.py → .../problems/hard/trapping_rain_water_o_n.py b/problems/hard/trapping_rain_water_o_n.py → .../problems/hard/trapping_rain_water_o_n.py
@@ -5,7 +5,7 @@ class Solution:
     def trap(self, height: List[int]) -> int:
         n = len(height)
 
-        leftmost = [0] * n      # O(n) space
+        leftmost = [0] * n  # O(n) space
         rightmost = [0] * n
 
         for i in range(1, n):

diff --git a/problems/medium/__init__.py → python/problems/medium/__init__.py b/problems/medium/__init__.py → python/problems/medium/__init__.py
diff --git a/...ems/medium/binary_tree_right_side_view.py → ...ems/medium/binary_tree_right_side_view.py b/...ems/medium/binary_tree_right_side_view.py → ...ems/medium/binary_tree_right_side_view.py
diff --git a/python/problems/medium/container_with_most_water.py b/python/problems/medium/container_with_most_water.py
@@ -0,0 +1,15 @@
+from typing import List
+
+
+class Solution:
+    def maxArea(self, height: List[int]) -> int:
+        n = len(height)
+        left, right = 0, n - 1
+        ans = 0
+        while left < right:
+            ans = max(ans, min(height[right], height[left]) * (right - left))
+            if height[right] < height[left]:
+                right -= 1
+            else:
+                left += 1
+        return ans
diff --git a/problems/medium/encode_and_decode_strings.py → ...blems/medium/encode_and_decode_strings.py b/problems/medium/encode_and_decode_strings.py → ...blems/medium/encode_and_decode_strings.py
diff --git a/...edium/evaluate_reverse_polish_notation.py → ...edium/evaluate_reverse_polish_notation.py b/...edium/evaluate_reverse_polish_notation.py → ...edium/evaluate_reverse_polish_notation.py
diff --git a/problems/medium/generate_parentheses.py → ...n/problems/medium/generate_parentheses.py b/problems/medium/generate_parentheses.py → ...n/problems/medium/generate_parentheses.py
diff --git a/problems/medium/group_anagrams.py → python/problems/medium/group_anagrams.py b/problems/medium/group_anagrams.py → python/problems/medium/group_anagrams.py
diff --git a/...ms/medium/longest_consecutive_sequence.py → ...ms/medium/longest_consecutive_sequence.py b/...ms/medium/longest_consecutive_sequence.py → ...ms/medium/longest_consecutive_sequence.py
diff --git a/...ongest_repeating_character_replacement.py → ...ongest_repeating_character_replacement.py b/...ongest_repeating_character_replacement.py → ...ongest_repeating_character_replacement.py
diff --git a/...substring_without_repeating_characters.py → ...substring_without_repeating_characters.py b/...substring_without_repeating_characters.py → ...substring_without_repeating_characters.py
@@ -3,15 +3,15 @@
 
 class Solution:
     def lengthOfLongestSubstring(self, s: str) -> int:
-        l = 0
+        left = 0
         count_map = collections.defaultdict(int)
         max_length = 0
 
         for r, c in enumerate(s):
             count_map[c] += 1
             while count_map[c] > 1:
-                count_map[s[l]] -= 1
-                l += 1
-            max_length = max(max_length, r - l + 1)
+                count_map[s[left]] -= 1
+                left += 1
+            max_length = max(max_length, r - left + 1)
 
         return max_length
diff --git a/problems/medium/min_stack.py → python/problems/medium/min_stack.py b/problems/medium/min_stack.py → python/problems/medium/min_stack.py
@@ -1,5 +1,4 @@
 class MinStack:
-
     def __init__(self):
         self.stack = []
 

diff --git a/problems/medium/minimum_size_subarray_sum.py → ...blems/medium/minimum_size_subarray_sum.py b/problems/medium/minimum_size_subarray_sum.py → ...blems/medium/minimum_size_subarray_sum.py
@@ -10,18 +10,18 @@ def minSubArrayLen(self, target, nums):
             return 0
 
         n = len(nums)
-        l, r = 0, 1
+        left, right = 0, 1
         min_len = float("inf")
         sub_sum = nums[0]
-        while r <= n:
+        while right <= n:
             if sub_sum < target:
-                if r < n:
-                    sub_sum += nums[r]
-                r += 1
+                if right < n:
+                    sub_sum += nums[right]
+                right += 1
             else:
-                diff = r - l
+                diff = right - left
                 if diff < min_len:
                     min_len = min(diff, min_len)
-                sub_sum -= nums[l]
-                l += 1
+                sub_sum -= nums[left]
+                left += 1
         return 0 if min_len == float("inf") else min_len
diff --git a/problems/medium/number_of_islands.py → python/problems/medium/number_of_islands.py b/problems/medium/number_of_islands.py → python/problems/medium/number_of_islands.py
diff --git a/problems/medium/permutation_in_string.py → .../problems/medium/permutation_in_string.py b/problems/medium/permutation_in_string.py → .../problems/medium/permutation_in_string.py
diff --git a/...ms/medium/product_of_array_except_self.py → ...ms/medium/product_of_array_except_self.py b/...ms/medium/product_of_array_except_self.py → ...ms/medium/product_of_array_except_self.py
diff --git a/problems/medium/snakes_and_ladders.py → python/problems/medium/snakes_and_ladders.py b/problems/medium/snakes_and_ladders.py → python/problems/medium/snakes_and_ladders.py
diff --git a/python/problems/medium/three_sum.py b/python/problems/medium/three_sum.py
@@ -0,0 +1,24 @@
+from typing import List
+
+
+class Solution:
+    def threeSum(self, nums: List[int]) -> List[List[int]]:
+        nums.sort()
+        n = len(nums)
+        res = []
+        for i in range(n - 2):
+            if i > 0 and nums[i] == nums[i - 1]:
+                continue
+            left, right = i + 1, n - 1
+            while left < right:
+                three_sum = nums[i] + nums[left] + nums[right]
+                if three_sum == 0:
+                    res.append([nums[i], nums[left], nums[right]])
+                    left += 1
+                    while nums[left] == nums[left - 1] and left < right:
+                        left += 1
+                elif three_sum < 0:
+                    left += 1
+                else:
+                    right -= 1
+        return res
diff --git a/problems/medium/top_k_frequent_elements.py → ...roblems/medium/top_k_frequent_elements.py b/problems/medium/top_k_frequent_elements.py → ...roblems/medium/top_k_frequent_elements.py
diff --git a/...edium/two_sum_ii_input_array_is_sorted.py → ...edium/two_sum_ii_input_array_is_sorted.py b/...edium/two_sum_ii_input_array_is_sorted.py → ...edium/two_sum_ii_input_array_is_sorted.py
@@ -3,13 +3,13 @@
 
 class Solution:
     def twoSum(self, numbers: List[int], target: int) -> List[int]:
-        l, r = 0, len(numbers) - 1
-        while l < r:
-            tmp_sum = numbers[l] + numbers[r]
+        left, right = 0, len(numbers) - 1
+        while left < right:
+            tmp_sum = numbers[left] + numbers[right]
             if tmp_sum == target:
-                return [l + 1, r + 1]
+                return [left + 1, right + 1]
             elif tmp_sum < target:
-                l += 1
+                left += 1
             else:
-                r -= 1
+                right -= 1
         return [-1, -1]
diff --git a/problems/medium/valid_sudoku.py → python/problems/medium/valid_sudoku.py b/problems/medium/valid_sudoku.py → python/problems/medium/valid_sudoku.py
diff --git a/python/requirements.txt b/python/requirements.txt
@@ -0,0 +1,9 @@
+# Upgrade pip to avoid compatibility issues
+pip>=21.0
+
+# Linting and formatting tools
+ruff
+
+# Testing tools
+pytest
+pytest-cov
diff --git a/tests/__init__.py → python/tests/__init__.py b/tests/__init__.py → python/tests/__init__.py
diff --git a/...s/test_best_time_to_buy_and_sell_stock.py → ...s/test_best_time_to_buy_and_sell_stock.py b/...s/test_best_time_to_buy_and_sell_stock.py → ...s/test_best_time_to_buy_and_sell_stock.py
diff --git a/tests/test_binary_tree_right_side_view.py → ...tests/test_binary_tree_right_side_view.py b/tests/test_binary_tree_right_side_view.py → ...tests/test_binary_tree_right_side_view.py
diff --git a/tests/test_candy.py → python/tests/test_candy.py b/tests/test_candy.py → python/tests/test_candy.py
diff --git a/tests/test_container_with_most_water.py → ...n/tests/test_container_with_most_water.py b/tests/test_container_with_most_water.py → ...n/tests/test_container_with_most_water.py
diff --git a/tests/test_contains_duplicate.py → python/tests/test_contains_duplicate.py b/tests/test_contains_duplicate.py → python/tests/test_contains_duplicate.py
@@ -2,14 +2,17 @@
 
 solution = Solution()
 
+
 def test_one_duplicate():
     sample = [1, 2, 3, 1]
-    assert solution.containsDuplicate(sample) == True
+    assert solution.containsDuplicate(sample)
+
 
 def test_no_duplicates():
     sample = [1, 2, 3, 4]
-    assert solution.containsDuplicate(sample) == False
+    assert not solution.containsDuplicate(sample)
+
 
 def test_empty_array():
     sample = []
-    assert solution.containsDuplicate(sample) == False
+    assert not solution.containsDuplicate(sample)
diff --git a/tests/test_encode_and_decode_strings.py → ...n/tests/test_encode_and_decode_strings.py b/tests/test_encode_and_decode_strings.py → ...n/tests/test_encode_and_decode_strings.py
diff --git a/.../test_evaluate_reverse_polish_notation.py → .../test_evaluate_reverse_polish_notation.py b/.../test_evaluate_reverse_polish_notation.py → .../test_evaluate_reverse_polish_notation.py
diff --git a/tests/test_generate_parentheses.py → python/tests/test_generate_parentheses.py b/tests/test_generate_parentheses.py → python/tests/test_generate_parentheses.py
diff --git a/tests/test_group_anagrams.py → python/tests/test_group_anagrams.py b/tests/test_group_anagrams.py → python/tests/test_group_anagrams.py
diff --git a/tests/test_linked_list_cycle.py → python/tests/test_linked_list_cycle.py b/tests/test_linked_list_cycle.py → python/tests/test_linked_list_cycle.py
diff --git a/tests/test_longest_consecutive_sequence.py → ...ests/test_longest_consecutive_sequence.py b/tests/test_longest_consecutive_sequence.py → ...ests/test_longest_consecutive_sequence.py
diff --git a/...ongest_repeating_character_replacement.py → ...ongest_repeating_character_replacement.py b/...ongest_repeating_character_replacement.py → ...ongest_repeating_character_replacement.py
diff --git a/...substring_without_repeating_characters.py → ...substring_without_repeating_characters.py b/...substring_without_repeating_characters.py → ...substring_without_repeating_characters.py
@@ -2,14 +2,17 @@
 
 solution = Solution()
 
+
 def test_sample_one():
     s = "abcabcbb"
     assert solution.lengthOfLongestSubstring(s) == 3
 
+
 def test_sample_two():
     s = "bbbbb"
     assert solution.lengthOfLongestSubstring(s) == 1
 
+
 def test_sample_three():
     s = "pwwkew"
-    assert solution.lengthOfLongestSubstring(s) == 3
+    assert solution.lengthOfLongestSubstring(s) == 3
diff --git a/tests/test_maximum_depth_of_binary_tree.py → ...ests/test_maximum_depth_of_binary_tree.py b/tests/test_maximum_depth_of_binary_tree.py → ...ests/test_maximum_depth_of_binary_tree.py
diff --git a/tests/test_merge_sorted_array.py → python/tests/test_merge_sorted_array.py b/tests/test_merge_sorted_array.py → python/tests/test_merge_sorted_array.py
diff --git a/tests/test_min_stack.py → python/tests/test_min_stack.py b/tests/test_min_stack.py → python/tests/test_min_stack.py
diff --git a/...est_minimum_absolute_difference_in_bst.py → ...est_minimum_absolute_difference_in_bst.py b/...est_minimum_absolute_difference_in_bst.py → ...est_minimum_absolute_difference_in_bst.py
diff --git a/tests/test_minimum_size_subarray_sum.py → ...n/tests/test_minimum_size_subarray_sum.py b/tests/test_minimum_size_subarray_sum.py → ...n/tests/test_minimum_size_subarray_sum.py
diff --git a/tests/test_minimum_window_substring.py → ...on/tests/test_minimum_window_substring.py b/tests/test_minimum_window_substring.py → ...on/tests/test_minimum_window_substring.py
diff --git a/tests/test_number_of_islands.py → python/tests/test_number_of_islands.py b/tests/test_number_of_islands.py → python/tests/test_number_of_islands.py
diff --git a/tests/test_permutation_in_string.py → python/tests/test_permutation_in_string.py b/tests/test_permutation_in_string.py → python/tests/test_permutation_in_string.py
diff --git a/tests/test_product_of_array_except_self.py → ...ests/test_product_of_array_except_self.py b/tests/test_product_of_array_except_self.py → ...ests/test_product_of_array_except_self.py
diff --git a/tests/test_ransom_note.py → python/tests/test_ransom_note.py b/tests/test_ransom_note.py → python/tests/test_ransom_note.py
diff --git a/tests/test_sliding_window_maximum.py → python/tests/test_sliding_window_maximum.py b/tests/test_sliding_window_maximum.py → python/tests/test_sliding_window_maximum.py
diff --git a/tests/test_snakes_and_ladders.py → python/tests/test_snakes_and_ladders.py b/tests/test_snakes_and_ladders.py → python/tests/test_snakes_and_ladders.py
diff --git a/tests/test_summary_ranges.py → python/tests/test_summary_ranges.py b/tests/test_summary_ranges.py → python/tests/test_summary_ranges.py
diff --git a/tests/test_three_sum.py → python/tests/test_three_sum.py b/tests/test_three_sum.py → python/tests/test_three_sum.py
diff --git a/tests/test_top_k_frequent_elements.py → python/tests/test_top_k_frequent_elements.py b/tests/test_top_k_frequent_elements.py → python/tests/test_top_k_frequent_elements.py
diff --git a/tests/test_trapping_rain_water.py → python/tests/test_trapping_rain_water.py b/tests/test_trapping_rain_water.py → python/tests/test_trapping_rain_water.py
@@ -3,7 +3,6 @@
 
 
 def test_trapping_rain_water():
-
     # Test Case 1
     height = [0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1]
     assert trap_o_n().trap(height) == 6

diff --git a/tests/test_two_sum.py → python/tests/test_two_sum.py b/tests/test_two_sum.py → python/tests/test_two_sum.py
@@ -20,6 +20,7 @@ def test_sample_three():
     target = 6
     assert solution.twoSum(nums, target) == [0, 1]
 
+
 def test_sample_four():
     nums = [-3, 1, 2, 3]
     target = 0

diff --git a/.../test_two_sum_ii_input_array_is_sorted.py → .../test_two_sum_ii_input_array_is_sorted.py b/.../test_two_sum_ii_input_array_is_sorted.py → .../test_two_sum_ii_input_array_is_sorted.py
diff --git a/tests/test_valid_anagram.py → python/tests/test_valid_anagram.py b/tests/test_valid_anagram.py → python/tests/test_valid_anagram.py
@@ -2,22 +2,26 @@
 
 solution = Solution()
 
+
 def test_anagram():
     s = "anagram"
     t = "nagaram"
-    assert solution.isAnagram(s, t) == True
+    assert solution.isAnagram(s, t)
+
 
 def test_not_anagram():
     s = "rat"
     t = "car"
-    assert solution.isAnagram(s, t) == False
+    assert not solution.isAnagram(s, t)
+
 
 def test_empty_strings():
     s = ""
     t = ""
-    assert solution.isAnagram(s, t) == True
+    assert solution.isAnagram(s, t)
+
 
 def test_one_empty_string():
     s = ""
     t = "a"
-    assert solution.isAnagram(s, t) == False
+    assert not solution.isAnagram(s, t)
diff --git a/tests/test_valid_palindrome.py → python/tests/test_valid_palindrome.py b/tests/test_valid_palindrome.py → python/tests/test_valid_palindrome.py
diff --git a/tests/test_valid_parentheses.py → python/tests/test_valid_parentheses.py b/tests/test_valid_parentheses.py → python/tests/test_valid_parentheses.py