100% easy || Maximum Product of Three Numbers || C++ Solution
\nclass Solution {\npublic:\n    int maximumProduct(vector<int>& nums) {\n       sort(nums.begin(),nums.end());\n        int a=nums[nums.size()-1]*nums[nums.siz
```\nclass Solution {\npublic:\n    int maximumProduct(vector<int>& nums) {\n       sort(nums.begin(),nums.end());\n        int a=nums[nums.size()-1]*nums[nums.size()-2]*nums[nums.size()-3];\n        int b=nums[0]*nums[1]*nums[nums.size()-1];\n        return max(a,b);\n    }\n    \n};\n```
['C', 'C++']