4>adjacentElementsProduct

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.

code>>

int adjacentElementsProduct(std::vector<int> inputArray) {

int max = -1000 * 1000;

for (int i = 0; i < inputArray.size() - 1; i++)

{

int val = inputArray[i] * inputArray[i + 1];

if (max < val)

max = val;

}

return max;

}