← Back to questions
HackWithInfy• Prep

Maximum Product of Three Numbers

Difficulty
Easy
Acceptance Rate
45.7%

Problem Statement

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

Example 2:

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

Example 3:

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

 

Constraints:

  • 3 <= nums.length <= 104
  • -1000 <= nums[i] <= 1000

Similar Questions

Maximum Product SubarrayMediumMaximum Product of Three Elements After One ReplacementMedium