C++ Simple and clean solution for Beginners || Brute force
Please Upvote if it helped you !!!\nHappy Coding :) \n \n \n\nint maximumProduct(vector<int>& nums) \n    {\n        sort(nums.begin(),nums.end());\n        int
Please Upvote if it helped you !!!\nHappy Coding :) \n \n \n```\nint maximumProduct(vector<int>& nums) \n    {\n        sort(nums.begin(),nums.end());\n        int n=nums.size();\n        int max= nums[n-1]*nums[n-2]*nums[n-3];\n        if(max >  nums[0]*nums[1]*nums[n-1])\n            return max;\n        return nums[0]*nums[1]*nums[n-1];\n    }\n```\t
['C']