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

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

What you are looking for is the largest product of two numbers in a list: which means multiplying each pair and comparing each against the previous maximum, not just printing each product.
So try this:
1) Create a variable outside the loop, call it maxSoFar and set it to the product of the first pair.
2) Loop through each element (except the final one)
2.1) Multiply each element by the one after it.
2.2) Compare that value with maxSoFar
2.2.1) If it's larger, set maxSoFar to the new product.
3) Continue with the loop
4) After the loop, print maxSoFar

Simple! But ... this is your homework, so I'll give you no code! Give it a try - this really isn't a difficult task.