Without Multiplication Solution
\n# Complexity\n- Time complexity: O(n)\n- Space complexity: O(1)\n Add your space complexity here, e.g. O(n) \n\n# Code\n\nclass Solution {\npublic:\n    int a
\n# Complexity\n- Time complexity: $$O(n)$$\n- Space complexity: $$O(1)$$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int arraySign(vector<int>& nums) {\n        int count = 0;\n        for(auto i: nums){\n            if(i == 0)\n                return 0; // if 0 is part of array then product is 0\n            else if(i < 0)\n                count++;\n        }  \n        if(count%2 == 0) // even no. of negative integers then product is postive\n            return 1;\n        return -1; // odd no. of negative integers then product is negative\n    }\n};\n```
['C++']