Question

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

Answer 1

Answer:

I have a solution

Explanation:

//Python programming

def adjacentElementsProduct(inputArray):

for i in range(0, len(inputArray)-1):

lis=(inputArray[i]*inputArray[i+1])

print(lis)