<h2 id="heading-url">URL</h2>
<p><a target="_blank" href="https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks/description/">https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks/description/</a></p>
<h2 id="heading-code">Code</h2>
<p><a target="_blank" href="https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/challenge/202301/minimum_rounds_to_complete_all_tasks/main.fsx">https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/challenge/202301/minimum_rounds_to_complete_all_tasks/main.fsx</a></p>
<pre><code class="lang-plaintext">let minimumRounds (tasks: int list) : int =
    let rec minimumRounds' values acc =
        match values with
        | [] -&gt; acc
        | h :: t -&gt;
            if h = 1 then
                -1
            else
                minimumRounds'
                    t
                    (acc
                     + (System.Math.Ceiling((double h) / 3.0) |&gt; int))

    let freq =
        tasks
        |&gt; List.fold
            (fun acc n -&gt;
                match Map.tryFind n acc with
                | Some (v) -&gt; Map.add n (v + 1) acc
                | None -&gt; Map.add n 1 acc)
            Map.empty

    minimumRounds' (Map.values freq |&gt; Seq.toList) 0
</code></pre>


## URL

[https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks/description/](https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks/description/)

## Code

[https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/challenge/202301/minimum\_rounds\_to\_complete\_all\_tasks/main.fsx](https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/challenge/202301/minimum_rounds_to_complete_all_tasks/main.fsx)

```plaintext
let minimumRounds (tasks: int list) : int =
    let rec minimumRounds' values acc =
        match values with
        | [] -> acc
        | h :: t ->
            if h = 1 then
                -1
            else
                minimumRounds'
                    t
                    (acc
                     + (System.Math.Ceiling((double h) / 3.0) |> int))

    let freq =
        tasks
        |> List.fold
            (fun acc n ->
                match Map.tryFind n acc with
                | Some (v) -> Map.add n (v + 1) acc
                | None -> Map.add n 1 acc)
            Map.empty

    minimumRounds' (Map.values freq |> Seq.toList) 0
```

LeetCode 2244. Minimum Rounds to Complete All Tasks in F#

URL

Code