D. J.:

- Added the leetcode problem and solution for 1304

Author: nobodyPerfecZ

README.md

@@ -281,6 +281,7 @@
 - [1137 N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/description/)
 - [1143 Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/description/)
 - [1218 Longest Arithmetic Subsequence of Given Difference](https://leetcode.com/problems/longest-arithmetic-subsequence-of-given-difference/description/)
+- [1304 Find N Unique Integers Sum up to Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/description/)
 - [1312 Minimum Insertion Steps to Make a String Palindrome](https://leetcode.com/problems/minimum-insertion-steps-to-make-a-string-palindrome/description/)
 - [1329 Sort the Matrix Diagonally](https://leetcode.com/problems/sort-the-matrix-diagonally/description/)
 - [1456 Maximum Number of Vowels in a Substring of Given Length](https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length/description/)

awesome_python_leetcode/_1304_find_n_unique_integers_sum_up_to_zero.py

@@ -0,0 +1,21 @@
+from typing import List
+
+
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def sumZero(self, n: int) -> List[int]:
+        """
+        Given an integer n, return any array containing n unique integers such that
+        they add up to 0.
+        """
+        res = []
+
+        if n % 2:
+            res.append(0)
+
+        for i in range(1, n // 2 + 1):
+            res.append(-i)
+            res.append(i)
+
+        return res

tests/test_1304_find_n_unique_integers_sum_up_to_zero.py

@@ -0,0 +1,19 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._1304_find_n_unique_integers_sum_up_to_zero import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["n", "expected"],
+    argvalues=[
+        (5, [0, -1, 1, -2, 2]),
+        (3, [0, -1, 1]),
+        (1, [0]),
+    ],
+)
+def test_func(n: int, expected: List[int]):
+    """Tests the solution of a LeetCode problem."""
+    sum_zero = Solution().sumZero(n)
+    assert sum_zero == expected