D. J.:

- Added the leetcode problem and solution for 1679

Author: nobodyPerfecZ

README.md

@@ -258,6 +258,7 @@
 - [1218 Longest Arithmetic Subsequence of Given Difference](https://leetcode.com/problems/longest-arithmetic-subsequence-of-given-difference/description/)
 - [1312 Minimum Insertion Steps to Make a String Palindrome](https://leetcode.com/problems/minimum-insertion-steps-to-make-a-string-palindrome/description/)
 - [1534 Count Good Triplets](https://leetcode.com/problems/count-good-triplets/description/)
+- [1679 Max Number of K-Sum Pairs](https://leetcode.com/problems/max-number-of-k-sum-pairs/description/)
 - [1732 Find the Highest Altitude](https://leetcode.com/problems/find-the-highest-altitude/description/)
 - [1991 Find the Middle Index in Array](https://leetcode.com/problems/find-the-middle-index-in-array/description/)
 - [1922 Count Good Numbers](https://leetcode.com/problems/count-good-numbers/description/)

awesome_python_leetcode/_1679_max_number_of_k_sum_pairs.py

@@ -0,0 +1,31 @@
+import collections
+from typing import List
+
+
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def maxOperations(self, nums: List[int], k: int) -> int:
+        """
+        You are given an integer array nums and an integer k.
+
+        In one operation, you can pick two numbers from the array whose sum equals k
+        and remove them from the array.
+
+        Return the maximum number of operations you can perform on the array.
+        """
+        # Time Complexity: O(n)
+        # Space Complexity: O(n)
+        values = collections.defaultdict(int)
+        count = 0
+        for n in nums:
+            diff = k - n
+            if diff in values:
+                count += 1
+                if values[diff] == 1:
+                    del values[diff]
+                else:
+                    values[diff] -= 1
+            else:
+                values[n] += 1
+        return count

tests/test_1679_max_number_of_k_sum_pairs.py

@@ -0,0 +1,19 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._1679_max_number_of_k_sum_pairs import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["nums", "k", "expected"],
+    argvalues=[
+        ([1, 2, 3, 4], 5, 2),
+        ([3, 1, 3, 4, 3], 6, 1),
+        ([2, 5, 4, 4, 1, 3, 4, 4, 1, 4, 4, 1, 2, 1, 2, 2, 3, 2, 4, 2], 3, 4),
+    ],
+)
+def test_func(nums: List[int], k: int, expected: int):
+    """Tests the solution of a LeetCode problem."""
+    max_operations = Solution().maxOperations(nums, k)
+    assert max_operations == expected