#BlackLivesMatter Support An Initiative

Algorithms: Adjacent Element Products

Hi there :), our question for today is from code signal, and it’s an easy problem.

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


For inputArray = [3, 6, -2, -5, 7, 3], the output should be
adjacentElementsProduct(inputArray) = 21.

7 and 3 produce the largest product.


My way of approcahing this problem is an O(n) solution that loops through the array once with pointers at the current index element and next element (adjacent). We will never really have to check backwards, so increasing our pointers will work for this problem.

Let’s define a left and right pointer. The left pointer will start at position 0 and right will start at left+1; I would also like to set the current maximum adjacent value to -Infinity so we can replace that right away.

Next, let’s check for when the given array has only two elements. We should probably return the product of those two elements so we exit early.

Next we will define our loop through the array (once). While the left pointer is less than the right and right is less than or same as length of the array, if at any point the product of the element at the index of the left pointer and right pointer is greater than our currentLargest, we update currentLargest, and increment our pointers. In the end, we return currentLargest.

As you can see, this is a very easy problem and it will run in O(n) time, and constant space, O(1). Below is the full code;

Do you have a suggestion on better approaches to the problem? Please feel free to share below. Cheers!


Leave a Comment

Your email address will not be published. Required fields are marked *