Tracks
/
Rust
Rust
/
Exercises
/
Largest Series Product
Largest Series Product

Largest Series Product

Medium

Instructions

Given a string of digits, calculate the largest product for a contiguous substring of digits of length n.

For example, for the input '1027839564', the largest product for a series of 3 digits is 270 (9 * 5 * 6), and the largest product for a series of 5 digits is 7560 (7 * 8 * 3 * 9 * 5).

Note that these series are only required to occupy adjacent positions in the input; the digits need not be numerically consecutive.

For the input '73167176531330624919225119674426574742355349194934', the largest product for a series of 6 digits is 23520.

Last updated 8 September 2021
Edit via GitHub The link opens in a new window or tab
Rust Exercism

Ready to start Largest Series Product?

Sign up to Exercism to learn and master Rust with 8 concepts, 102 exercises, and real human mentoring, all for free.