Domain 1EasyCORE

Sign of the Product of an Array

The problem requires determining the sign of the product of all elements in an integer array `nums`. The function `signFunc(x)` returns: - `1` if `x` is positive. - `-1` if `x` is negative. - `0` if `x` is equal to `0`.

Domain: Easy•Updated: 2026-08-31
#Algorithms#LeetCode#qwen2.5-coder:14b#Math

1822. Sign of the Product of an Array

Model: qwen2.5-coder:14b
Topics: Math
FAANG asked: 0
Acceptance rate: 67.8%


Problem Breakdown

The problem requires determining the sign of the product of all elements in an integer array nums. The function signFunc(x) returns:

  • 1 if x is positive.
  • -1 if x is negative.
  • 0 if x is equal to 0.

Inputs:

  • An integer array nums with length between 1 and 1000.
  • Each element in the array ranges from -100 to 100.

Outputs:

  • The sign of the product of all elements in the array, determined by the function signFunc.

Implicit Constraints or Tricky Edge Cases:

  • If any element is zero, the product will be zero.
  • Negative numbers affect the sign of the product; an even number of negative numbers results in a positive product, while an odd number results in a negative product.

Intuition

A brute-force approach would involve calculating the actual product of all elements and then determining its sign. However, this is inefficient due to potential overflow issues with large products and unnecessary computation.

The key insight is that we only need to track the sign of the product without computing the actual value. We can do this by:

  1. Initializing a variable sign to 1.
  2. Iterating through each element in the array:
    • If an element is zero, return 0 immediately since the product will be zero.
    • If an element is negative, flip the sign by multiplying sign by -1.

This approach avoids overflow and reduces unnecessary computation.

Approach

We will use a single pass through the array to determine the sign of the product:

  1. Initialize a variable sign to 1.
  2. Iterate through each element in the array:
    • If an element is zero, return 0.
    • If an element is negative, multiply sign by -1.
  3. After iterating through all elements, return the value of sign.

This approach ensures that we only use constant space and linear time relative to the size of the input array.

Complexity Analysis

  • Time Complexity: O(n), where n is the length of the array. We make a single pass through the array.
  • Space Complexity: O(1). We use only a constant amount of extra space for the sign variable.

Solution

def arraySign(nums):
    sign = 1
    for num in nums:
        if num == 0:
            return 0
        elif num < 0:
            sign *= -1
    return sign

Edge Cases Handled

  • Zero Element: If any element is zero, the function returns 0 immediately.
  • Negative Numbers: The sign flips appropriately based on the number of negative elements.
  • Single Element Array: Handles arrays with a single element correctly.
  • All Positive Elements: Returns 1 as expected.
  • All Negative Elements: Returns -1 if the count is odd, and 1 if even.