<h2 id="heading-url">URL</h2>
<p><a href="https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/" class="autolinkedURL autolinkedURL-url" target="_blank">leetcode.com/problems/remove-all-adjacent-d..</a></p>
<h2 id="heading-code">Code</h2>
<p><a href="https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/1209/main.fsx" class="autolinkedURL autolinkedURL-url" target="_blank">github.com/syohex/dotnet-study/blob/master/..</a></p>
<pre><code class="lang-fsharp">open System

let removeDuplicates (s: string) (k: int) : string =
    let rec removeDuplicates' (cs: char list) k (stack: (char * int) list) =
        match cs with
        | [] -&gt;
            stack
            |&gt; List.fold (fun acc (c, n) -&gt; (List.replicate n c) @ acc) []
            |&gt; String.Concat
        | h :: t -&gt;
            match stack with
            | [] -&gt; removeDuplicates' t k ((h, 1) :: stack)
            | (prev, count) :: t2 -&gt;
                if h = prev then
                    if count = k - 1 then
                        removeDuplicates' t k t2
                    else
                        removeDuplicates' t k ((prev, count + 1) :: t2)
                else
                    removeDuplicates' t k ((h, 1) :: stack)

    removeDuplicates' (s |&gt; Seq.toList) k []
</code></pre>


## URL

https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/

## Code

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

```fsharp
open System

let removeDuplicates (s: string) (k: int) : string =
    let rec removeDuplicates' (cs: char list) k (stack: (char * int) list) =
        match cs with
        | [] ->
            stack
            |> List.fold (fun acc (c, n) -> (List.replicate n c) @ acc) []
            |> String.Concat
        | h :: t ->
            match stack with
            | [] -> removeDuplicates' t k ((h, 1) :: stack)
            | (prev, count) :: t2 ->
                if h = prev then
                    if count = k - 1 then
                        removeDuplicates' t k t2
                    else
                        removeDuplicates' t k ((prev, count + 1) :: t2)
                else
                    removeDuplicates' t k ((h, 1) :: stack)

    removeDuplicates' (s |> Seq.toList) k []
```

LeetCode 1209. Remove All Adjacent Duplicates in String II in F#

URL

Code