Problem 54. Maximum running product for a string of numbers

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

Moving sum of logarithm gives the moving product. Also, to reduce the code size, simply convolves log(+s) with any positive
constant, such as 32 (the ASCII code of space).

By taking log, the moving sum computed via convolution is indeed the moving product.

It's a very good idea!

nice

Goodddd

Interesting idea. But the code can be simplified, as demonstrated in Solution 1373422, which cuts the size by 13.

A case of not enough tests in the Test Suite?

This solution also computes the running sum instead the product. The interesting thing to show here is that convn also works with char input

That's interesting. The documentation says it works only for double and single.

It's only because the test set is inadequate that this solution, which uses the running sum not the running product, works. My size-23 solution exploits the same loophole, but to see it done properly using convolution see my solution 19416, of size 25.

This should not be a solution, because it takes the sum, not the product. 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.

This should use prod, not sum. As for my own solution 19425, the test cases fail to detect this error (at the time of writing).