Introduction

In this blog post, we will explore how to solve the LeetCode problem "1304" using AI. LeetCode is a popular platform for preparing for coding interviews, and with the help of AI tools like Chatmagic, we can generate solutions quickly and efficiently - helping you pass the interviews and get the job offer without having to study for months.

Problem Statement

Given an integer n, return any array containing n unique integers such that they add up to 0. Example 1: Input: n = 5 Output: [-7,-1,1,3,4] Explanation: These arrays also are accepted [-5,-1,1,2,3] , [-3,-1,2,-2,4]. Example 2: Input: n = 3 Output: [-1,0,1] Example 3: Input: n = 1 Output: [0] Constraints: 1 <= n <= 1000

Explanation

• Core Idea: Construct the array by pairing positive and negative integers. If n is odd, include 0 in the array to ensure the sum is zero.
  • Pairing: Iterate up to n // 2, adding both i and -i to the result array.
  • Odd n Handling: If n is odd, append 0 to the array.

• Complexity: O(n) runtime, O(n) storage.

Code

    def sum_zero(n: int) -> list[int]:
    """
    Given an integer n, return any array containing n unique integers such that they add up to 0.

    Example 1:
    Input: n = 5
    Output: [-7,-1,1,3,4]
    Explanation: These arrays also are accepted [-5,-1,1,2,3] , [-3,-1,2,-2,4].

    Example 2:
    Input: n = 3
    Output: [-1,0,1]

    Example 3:
    Input: n = 1
    Output: [0]

    Constraints:
    1 <= n <= 1000
    """
    result = []
    for i in range(1, n // 2 + 1):
        result.append(i)
        result.append(-i)
    if n % 2 != 0:
        result.append(0)
    return result