Problem 54. Maximum running product for a string of numbers

Like (4)

Solve Later

Solution 2301094

Submitted on 20 May 2020 by Haoyu Dai

Size: 85
Leading solution size is 7.

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Solve This Problem View on Solution Map

1 Comment

1 Comment

Haoyu Dai on 20 May 2020

function i = running_product(s)
L=length(s);
L1=L-4;
tmp=0;
i=0;
for j=1:L1
m=str2num(s(j))*str2num(s(j+1))*str2num(s(j+2))*str2num(s(j+3))*str2num(s(j+4));
if m>tmp
tmp=m;
i=j;
end
end
end

Test Suite

Test	Status	Code Input and Output
1	Pass	s = '123454321'; i_correct = 3; assert(isequal(running_product(s),i_correct))
2	Pass	s = '5820974944592307816406286208998628034825342117067'; i_correct = 28; assert(isequal(running_product(s),i_correct))
3	Pass	s = '141592653589793238462643383279502884197169399399999'; i_correct = 47; assert(isequal(running_product(s),i_correct))
4	Pass	s = '7831652712019091456485669234603486104543266482133936072602'; i_correct = 21; assert(isequal(running_product(s),i_correct))
5	Pass	s = '70066063155881748815209209628292540917153643678925903600113305305488'; i_correct = 44; assert(isequal(running_product(s),i_correct))
6	Pass	s = '11111'; i_correct = 1; assert(isequal(running_product(s),i_correct))

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

Test Suite

Suggested Problems

More from this Author95

Community Treasure Hunt

Problem 54. Maximum running product for a string of numbers

Test Suite

Suggested Problems

More from this Author95

Community Treasure Hunt

Players