ayyo rama it was this :D
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    int maximumProduct(vector<int>& nums) {\n        vector<int> pos;\n        vector<int> neg;\n\n        for(int i = 0; i < nums.size(); i++) {\n            if(nums[i] < 0)\n                neg.push_back(nums[i]);\n            else \n                pos.push_back(nums[i]);\n        }\n\n        sort(pos.begin(), pos.end(), greater<int>());\n        sort(neg.begin(), neg.end());\n\n        int maxProduct = INT_MIN;\n\n        if (pos.size() >= 3) {\n            maxProduct = max(maxProduct, pos[0] * pos[1] * pos[2]);\n        }\n\n        if (pos.size() >= 1 && neg.size() >= 2) {\n            maxProduct = max(maxProduct, neg[0] * neg[1] * pos[0]);\n        }\n\n        if(neg.size()>=3&&pos.size()==0)\n        {\n\n            maxProduct=neg[neg.size()-1]*neg[neg.size()-2]*neg[neg.size()-3];\n        }\n\n        return maxProduct;\n    }\n};\n\n```
['C++']