D. J.:

- Added the leetcode problem and solution for 3190

Author: nobodyPerfecZ

README.md

@@ -3,7 +3,7 @@
         <p>
             <img src="docs/images/logo_dark.png", alt="Logo", width="300" height="300" />
         </p>
-        💡 Awesome Python Leetcode 
+        💡 Awesome Python Leetcode
         <br>
         <span style="font-size: large">
             Awesome Leetcode problems and solutions written in Python!
@@ -307,6 +307,7 @@
 - [2799 Count Complete Subarrays in an Array](https://leetcode.com/problems/count-complete-subarrays-in-an-array/description/)
 - [3005 Count Elements With Maximum Frequency](https://leetcode.com/problems/count-elements-with-maximum-frequency/description/)
 - [3136 Valid Word](https://leetcode.com/problems/valid-word/description/)
+- [3190 Find Minimum Operations to Make All Elements Divisible by Three](https://leetcode.com/problems/find-minimum-operations-to-make-all-elements-divisible-by-three/description/)
 - [3202 Find the Maximum Length of Valid Subsequence II](https://leetcode.com/problems/find-the-maximum-length-of-valid-subsequence-ii/description/)
 - [3318 Find X-Sum of All K-Long Subarrays I](https://leetcode.com/problems/find-x-sum-of-all-k-long-subarrays-i/description/)
 - [3392 Count Subarrays of Length Three With a Condition](https://leetcode.com/problems/count-subarrays-of-length-three-with-a-condition/description/)

awesome_python_leetcode/_3190_find_minimum_operations_to_make_all_elements_divisible_by_three.py

@@ -0,0 +1,23 @@
+from typing import List
+
+
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def minimumOperations(self, nums: List[int]) -> int:
+        """
+        You are given an integer array nums. In one operation, you can add or subtract
+        1 from any element of nums.
+
+        Return the minimum number of operations to make all elements of nums divisible
+        by 3.
+        """
+        # Time Complexity: O(n)
+        # Space Complexity: O(1)
+        num_ops = 0
+        k = 3
+        for num in nums:
+            if num % k:
+                remain = num % k
+                num_ops += min(remain, k - remain)
+        return num_ops

tests/test_3190_find_minimum_operations_to_make_all_elements_divisible_by_three.py

@@ -0,0 +1,20 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._3190_find_minimum_operations_to_make_all_elements_divisible_by_three import (  # noqa: E501
+    Solution,
+)
+
+
+@pytest.mark.parametrize(
+    argnames=["nums", "expected"],
+    argvalues=[
+        ([1, 2, 3, 4], 3),
+        ([3, 6, 9], 0),
+    ],
+)
+def test_func(nums: List[int], expected: int):
+    """Tests the solution of a LeetCode problem."""
+    min_ops = Solution().minimumOperations(nums)
+    assert min_ops == expected