Cody

# Problem 54. Maximum running product for a string of numbers

Solution 2000358

Submitted on 2 Nov 2019 by Hong Zhang
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Pass
s = '123454321'; i_correct = 3; assert(isequal(running_product(s),i_correct))

i = 2 i = 3 i = 3

2   Pass
s = '5820974944592307816406286208998628034825342117067'; i_correct = 28; assert(isequal(running_product(s),i_correct))

i = 5 i = 28 i = 28

3   Pass
s = '141592653589793238462643383279502884197169399399999'; i_correct = 47; assert(isequal(running_product(s),i_correct))

i = 2 i = 3 i = 4 i = 7 i = 8 i = 9 i = 10 i = 47 i = 47

4   Pass
s = '7831652712019091456485669234603486104543266482133936072602'; i_correct = 21; assert(isequal(running_product(s),i_correct))

i = 15 i = 17 i = 18 i = 19 i = 21 i = 21

5   Pass
s = '70066063155881748815209209628292540917153643678925903600113305305488'; i_correct = 44; assert(isequal(running_product(s),i_correct))

i = 7 i = 8 i = 9 i = 11 i = 42 i = 43 i = 44 i = 44

6   Pass
s = '11111'; i_correct = 1; assert(isequal(running_product(s),i_correct))

i = 1