w3resource

Python: Find the largest product of the pair of adjacent elements from a given list of integers

Python Basic - 1: Exercise-94 with Solution

Write a Python program to find the largest product of a pair of adjacent elements from a given list of integers.

Sample Solution:

Python Code:

def adjacent_num_product(list_nums):
   return max(a*b for a, b in zip(list_nums, list_nums[1:]))
nums = [1,2,3,4,5,6]
print("Original list: ",nums)
print("Largest product of the pair of adjacent elements of the said list:", adjacent_num_product(nums))
nums = [1,2,3,4,5]
print("\nOriginal list: ",nums)
print("Largest product of the pair of adjacent elements of the said list:", adjacent_num_product(nums))
nums = [2,3]
print("\nOriginal list: ",nums)
print("Largest product of the pair of adjacent elements of the said list:", adjacent_num_product(nums))

Sample Output:

Original list:  [1, 2, 3, 4, 5, 6]
Largest product of the pair of adjacent elements of the said list: 30

Original list:  [1, 2, 3, 4, 5]
Largest product of the pair of adjacent elements of the said list: 20

Original list:  [2, 3]
Largest product of the pair of adjacent elements of the said list: 6

Pictorial Presentation:

Python: Find the largest product of the pair of adjacent elements from a given list of integers.

Flowchart:

Flowchart: Python - Find the largest product of the pair of adjacent elements from a given list of integers.

Python Code Editor:

Have another way to solve this solution? Contribute your code (and comments) through Disqus.

Previous: Write a Python program to find the middle character(s) of a given string. If the length of the string is even return the two middle characters. If the length of the string is odd, return the middle character.
Next: Write a Python program to check whether every even index contains an even number and every odd index contains odd number of a given list.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.



Follow us on Facebook and Twitter for latest update.