285. Maximum Product of Three Numbers

Given an integer array nums, find three numbers whose product is maximum and return the maximum product.

Example 1:

Input: nums = [1, 2, 3]

Output: 6

Explanation: 1 × 2 × 3 = 6

Example 2:

Input: nums = [1, 2, 3, 4]

Output: 24

Explanation: 2 × 3 × 4 = 24

Now Your Turn!

Pick the correct output for the given input

Input: nums = [-1, -2, -3]

Still unsure what the problem is asking ?

Let’s go through a few more examples, step by step, to make it clearer.

Constraints:

  • 3 <= nums.length <= 104
  • -1000 <= nums[i] <= 1000
0
class Solution {
public:
int maximumProduct(vector<int>& nums) {
// Your code goes here
}
};
Test Case

Input:

Nums
to save your code