Sometimes, we might have a problem in which we require to get the maximum product of 2 numbers from list but with a constraint of having the numbers in successions. This type of problem can occur while competitive programming. Let’s discuss certain ways in which this problem can be solved.
Method #1 : Using
max() + zip() + list comprehension
This problem can be solved using the combination of above three function in which max function can be used to get the maximum value, zip and list comprehension doing the task of extending the logic to the whole list.
The original string : 2312231223124565128998 The maximum consecutive product is : 81
Method #2 : Using
max() + map() + operator.mul
The above problem can also be solved using yet another combination of functions. In this combination, map functions performs the task of extending the logic to whole list and mul operator is used to perform the multiplication.
The original string : 6543452345456987653234 The maximum consecutive product is : 72
- Python | Get first element with maximum value in list of tuples
- Python | Maximum and minimum element's position in a list
- Python | N consecutive Odd or Even Numbers
- Python | Slicing list from Kth element to last element
- Python | Remove consecutive duplicates from list
- Python | Consecutive elements pairing in list
- Python | Check if list contains consecutive numbers
- Python | Check if there are K consecutive 1's in a binary number
- Python | Split string in groups of n consecutive characters
- Python | Average of each n-length consecutive segment in a list
- Python groupby method to remove all consecutive duplicates
- Python | Find longest consecutive letter and digit substring
- Python Program to Count number of binary strings without consecutive 1's
- Python Map | Length of the Longest Consecutive 1's in Binary Representation of a given integer
- Python | Pandas Series.product()
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.