Problem 54. Maximum running product for a string of numbers

Created by Cody Team

Solve Later

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

Solve

Solution Stats

3497 Solutions
2162 Solvers

Last Solution submitted on Nov 25, 2024

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

David Young on 31 Jan 2012

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.

Rik on 14 Jan 2021

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 comments

Problem Recent Solvers2162

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 54. Maximum running product for a string of numbers

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers2162

Suggested Problems

More from this Author96

Problem Tags

Community Treasure Hunt

Problem 54. Maximum running product for a string of numbers

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers2162

Suggested Problems

More from this Author96

Problem Tags

Community Treasure Hunt

Players