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
Solution Comments
Show comments
Loading...
Problem Recent Solvers2253
Suggested Problems
-
2523 Solvers
-
The Goldbach Conjecture, Part 2
2413 Solvers
-
306 Solvers
-
Who has power to do everything in this world?
484 Solvers
-
549 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!
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.