Adjacent Elements Product codesignal solution

adjacentElementsProduct Codesignal Solution

Given an array of integers, find the pair of adjacent elements that has the largest product and return that product.

Example

For inputArray = [3, 6, -2, -5, 7, 3], the output should be
adjacentElementsProduct(inputArray) = 21.

7 and 3 produce the largest product.

Input/Output

• [execution time limit] 4 seconds (go)

• [input] array.integer inputArray

  An array of integers containing at least two elements.

  Guaranteed constraints:
  2 ≤ inputArray.length ≤ 10,
  -1000 ≤ inputArray[i] ≤ 1000.

• [output] integer

  The largest product of adjacent elements.

 

Solution using Go:

func adjacentElementsProduct(inputArray []int) int {

largestNum := -10000000

for i:=0; i<len(inputArray)-1; i++{

tempMul := inputArray[i] * inputArray[i+1]

if tempMul > largestNum{

largestNum = tempMul

}

}

return largestNum

}