<p>Today's daily problem is not suit for F# so I solved another problem.</p>
<h3 id="heading-url">URL</h3>
<p><a href="https://leetcode.com/problems/partition-array-according-to-given-pivot/" class="autolinkedURL autolinkedURL-url" target="_blank">leetcode.com/problems/partition-array-accor..</a></p>
<h3 id="heading-code">Code</h3>
<p><a href="https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/2161/main.fsx" class="autolinkedURL autolinkedURL-url" target="_blank">github.com/syohex/dotnet-study/blob/master/..</a></p>
<pre><code class="lang-fsharp">let pivotArray (nums: int list) (pivot: int) : int list =
    let pivotCount =
        nums |&gt; List.filter ((=) pivot) |&gt; List.length

    let lows = nums |&gt; List.filter (fun n -&gt; n &lt; pivot)
    let highs = nums |&gt; List.filter (fun n -&gt; n &gt; pivot)
    let pivots = List.init pivotCount (fun _ -&gt; pivot)
    lows @ pivots @ highs
</code></pre>


Today's daily problem is not suit for F# so I solved another problem.

### URL

https://leetcode.com/problems/partition-array-according-to-given-pivot/

### Code

https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/2161/main.fsx

```fsharp
let pivotArray (nums: int list) (pivot: int) : int list =
    let pivotCount =
        nums |> List.filter ((=) pivot) |> List.length

    let lows = nums |> List.filter (fun n -> n < pivot)
    let highs = nums |> List.filter (fun n -> n > pivot)
    let pivots = List.init pivotCount (fun _ -> pivot)
    lows @ pivots @ highs
```

LeetCode 2161. Partition Array According to Given Pivot in F#

URL

Code