D. J.:

- Aded the leetcode problem and solution for 75

Author: nobodyPerfecZ

README.md

@@ -116,6 +116,7 @@
 - [72 Edit Distance](https://leetcode.com/problems/edit-distance/description/)
 - [73 Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/description/)
 - [74 Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/description/)
+- [75 Sort Colors](https://leetcode.com/problems/sort-colors/description/)
 - [76 Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/description/)
 - [77 Combinations](https://leetcode.com/problems/combinations/description/)
 - [79 Word Search](https://leetcode.com/problems/word-search/description/)

awesome_python_leetcode/_75_sort_colors.py

@@ -0,0 +1,65 @@
+from typing import List
+
+
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def sortColorsBS(self, nums: List[int]) -> None:
+        """
+        Given an array nums with n objects colored red, white, or blue, sort them
+        in-place so that objects of the same color are adjacent, with the colors in the
+        order red, white, and blue.
+
+        We will use the integers 0, 1, and 2 to represent the color red, white, and
+        blue, respectively.
+
+        You must solve this problem without using the library's sort function.
+
+        Do not return anything, modify nums in-place instead.
+        """
+        # Bucket Sort Solution
+        # Time Complexity: O(n)
+        # Space Complexity: O(1)
+
+        # Count the number of occurrences of each color
+        count = [0, 0, 0]
+        for i in range(len(nums)):
+            count[nums[i]] += 1
+
+        # Fill the array with the sorted colors
+        j = 0
+        for i in range(len(nums)):
+            while j < len(count) and count[j] == 0:
+                j += 1
+            nums[i] = j
+            count[j] -= 1
+
+    def sortColorsQS(self, nums: List[int]) -> None:
+        """
+        Given an array nums with n objects colored red, white, or blue, sort them
+        in-place so that objects of the same color are adjacent, with the colors in the
+        order red, white, and blue.
+
+        We will use the integers 0, 1, and 2 to represent the color red, white, and
+        blue, respectively.
+
+        You must solve this problem without using the library's sort function.
+
+        Do not return anything, modify nums in-place instead.
+        """
+        # (Simple) Quick Sort Solution
+        # Time Complexity: O(n)
+        # Space Complexity: O(1)
+
+        left, right = 0, len(nums) - 1
+        i = 0
+
+        while i <= right:
+            if nums[i] == 0:
+                nums[left], nums[i] = nums[i], nums[left]
+                left += 1
+            elif nums[i] == 2:
+                nums[i], nums[right] = nums[right], nums[i]
+                right -= 1
+                i -= 1
+            i += 1

tests/test_75_sort_colors.py

@@ -0,0 +1,31 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._75_sort_colors import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["nums", "expected"],
+    argvalues=[
+        ([2, 0, 2, 1, 1, 0], [0, 0, 1, 1, 2, 2]),
+        ([2, 0, 1], [0, 1, 2]),
+    ],
+)
+def test_func_bs(nums: List[int], expected: List[int]):
+    """Tests the solution of a LeetCode problem."""
+    Solution().sortColorsBS(nums)
+    assert nums == expected
+
+
+@pytest.mark.parametrize(
+    argnames=["nums", "expected"],
+    argvalues=[
+        ([2, 0, 2, 1, 1, 0], [0, 0, 1, 1, 2, 2]),
+        ([2, 0, 1], [0, 1, 2]),
+    ],
+)
+def test_func_qs(nums: List[int], expected: List[int]):
+    """Tests the solution of a LeetCode problem."""
+    Solution().sortColorsQS(nums)
+    assert nums == expected