index.test.js

const {
  getProductArrayExceptSelfBruteForce,
  getProductArrayExceptSelf
} = require('.');

/**
 * Given an integer array nums, return an array answer such that answer[i] 
 * is equal to the product of all the elements of nums except nums[i].
 * The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer.
 * You must write an algorithm that runs in O(n) time and without using the division operation.

Example 1:

Input: nums = [1,2,3,4]
Output: [24,12,8,6]
Example 2:

Input: nums = [-1,1,0,-3,3]
Output: [0,0,9,0,0]

More info: https://leetcode.com/problems/product-of-array-except-self/
*/

test('product array except self on brute force solution', () => {
  const nums = [1, 2, 3, 4];

  const result = getProductArrayExceptSelfBruteForce(nums);

  expect(result).toEqual([24, 12, 8, 6]);
});

test('product array except self on linear solution', () => {
  const nums = [1, 2, 3, 4];

  const result = getProductArrayExceptSelf(nums);

  expect(result).toEqual([24, 12, 8, 6]);
});