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

Question

I am currently going through a task on Code Signal where I have to multiply numbers in a list that would yield the largest product within the list of numbers. Thing is, I do