Adjacent Elements Product
easySave
Array
Given an array of integers, find the pair of adjacent elements that has the largest product and return that product.
Example 1
Input
[ 3, 6, -2, -5, 7, 3 ]
Output
21
Explanation. The pair of adjacent elements with the largest product is 7 and 3, which gives the product 21.
Example 2
Input
[ -1, -2, -3, -4 ]
Output
12
Explanation. The pair of adjacent elements with the largest product is -3 and -4, which gives the product 12.
Example 3
Input
[ 5, 1, 2, 3, 1, 4 ]
Output
6
Explanation. The pair of adjacent elements with the largest product is 2 and 3, which gives the product 6.
Example 4
Input
[ 1, 5, 10, 9, 1 ]
Output
90
Explanation. The pair of adjacent elements with the largest product is 10 and 9, which gives the product 90.
Follow-up: How would you modify your solution if you had to find the smallest adjacent product instead?
Constraints:
The input array will have at least two elements.
- Views
- 3