LeetCode: Maximum Product of Three Numbers Solution

Approach

Sorting any direction (in the post, direction is ascending)

Take product of 3 largest numbers

But there are also negative numbers, so also consider product of 2 lowest numbers

Implementation

1var maximumProduct = function (nums) {
2  nums = nums.sort((a, b) => (a > b ? 1 : -1))
3  return Math.max(
4    nums[0] * nums[1] * nums[nums.length - 1],
5    nums[nums.length - 1] * nums[nums.length - 2] * nums[nums.length - 3]
6  )
7}