Algorithm #07 - "Largest Product Of Three"

🇺🇸 Write a function that finds the largest possible product of the highest three numbers from an array.

• Advance : Make your function handle negative numbers.

🇦🇷 Escriba una función que encuentre el producto máximo de los tres números más grandes de una lista de numeros.

• Advance : Haz que tu función pueda lidiar con números negativos.

🇰🇷 배열에서 가장 큰 세 숫자의 가능한 최대 곱수를 찾는 함수를 작성하십시오.

• Advance : 작성된 함수가 음수도 처리할 수 있게 하십시오.

Example:

// Test
const test = largestProductOfThree([2, 1, 3, -4])
// output
console.log(test); // 6

# START [ here ] 🏁

var largestProductOfThree = function(array) {
  // Your CODE
  
};

// Test
largestProductOfThree([2, 1, 3, 7]) // -> 42
largestProductOfThree([2, 5, 13, 7, 11, 3 ]) // -> 1001
largestProductOfThree([7, 5, 3, 2, -11, -13 ]) // -> 105
largestProductOfThree([-31, 34, -37, -17, 41, 19 ]) // -> 40426
largestProductOfThree([40, -50, 20, 5, 30]) // -> 24000

# Javascript solution 🏆

• Run it on your browser console window (F12) 🖥
• Please feel free to add your preference language solution 👩‍👩‍👧‍👦
• Do your best to complete the problem 🎭
• if you can't beat this the solution is below 😱

Solution 👇

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

var largestProductOfThree = function(array) {
  // TODO: everything
  const sorted = array.sort((a, b) => {
    return b - a;
  });
  // variable called "result" with value 1
  let result = 1;
  // if(sorted is not empty)
  // iterate over "sorted", multiply first three element with "result" accumulative
  for (let i = 0; i < 3; i++) {
    if (sorted[i] < 0) {
      // if(sorted[i] is a NEGATIVE number)
      result = result * Math.abs(sorted[i]);
    } else {
      // if(sorted[i] is a POSITIVE number)
      result = result * sorted[i];
    }
  }
  return result;
};