def adjacentElementsProduct(inputArray): for i in range(0, len(inputArray)-1): lis=(inputArray[i]*inputArray[i+1]) print(lis)
maxSoFar
int solution(int[] inputArray) { int maxsofar = 0; for(int i =0; i<inputArray.Length-1; i++) { if((inputArray[i] * inputArray[i+1]) > maxsofar) maxsofar = (inputArray[i] * inputArray[i+1]); } return maxsofar; }
def adjacentElementsProduct(inputArray): lst1 = 0 for i in range(0, len(inputArray)-1): lst2 = inputArray[i] * inputArray[i+1] if lst2 > lst1: lst1 = lst2< return lst1
var
This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)