Problem 54. Maximum running product for a string of numbers
Given a string s representing a list of numbers, find the five consecutive numbers that multiply to form the largest number. Specifically, given s return the index i to the first of those five numbers. You can assume the maximum product is unique.
Example:
Input s = '123454321' Output i = 3
since the product of [3 4 5 4 3] is larger than any of the alternatives.
Inspired by Problem 8 from Project Euler
Solution Stats
Problem Comments
-
2 Comments
It's a pity the test set does not include a case such that the largest running sum is not also the largest running product. Some solutions, including my solution of size 23, should fail because they take the sum, not the product.
I would suggest adding '9909911111' as a test case. That would weed out all people who took a shortcut by using a moving sum, instead of a moving product.
Solution Comments
Show commentsProblem Recent Solvers2152
Suggested Problems
-
Find state names that end with the letter A
1173 Solvers
-
Flip the main diagonal of a matrix
791 Solvers
-
Find nearest prime number less than input number
702 Solvers
-
544 Solvers
-
Convert from Fahrenheit to Celsius
22892 Solvers
More from this Author96
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!