Largest Series Product

Challenge Overview

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

Visit the largest-series-product exercise on Exercism to read the full instructions and download the exercise files.

Community Solutions

View Community Solutions

The following are the top 3 community solutions by stars:

Solution 1 by @Quinze (⭐ 0) — View on Exercism
Solution 2 by @Roald87 (⭐ 0) — View on Exercism
Solution 3 by @festim-deari (⭐ 0) — View on Exercism

Source: Exercism fsharp/largest-series-product

💡 View Solution

module LargestSeriesProduct

let largestProduct (input: string) (seriesLength: int) : int option = 
    if seriesLength < 0 then None
    elif seriesLength = 0 then Some(1)
    elif seriesLength > (String.length input) then None
    else
        try
            [for c in input do c]
            |> List.windowed seriesLength