<h2 id="heading-url">URL</h2>
<p><a target="_blank" href="https://leetcode.com/problems/palindrome-partitioning/description/">https://leetcode.com/problems/palindrome-partitioning/description/</a></p>
<h2 id="heading-code">Code</h2>
<p><a target="_blank" href="https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/0131/main.fsx">https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/0131/main.fsx</a></p>
<pre><code class="lang-plaintext">let partition (s: string) : string list list =
    let isPalindrome (s: char list) : bool = s = List.rev s

    let rec partition' (cs: char list) (acc: char list list) (ret: string list list) =
        match cs with
        | [] -&gt;
            let strs =
                acc
                |&gt; List.rev
                |&gt; List.map (fun c -&gt; System.String.Concat(Array.ofList c))

            strs :: ret
        | _ -&gt;
            seq { 1 .. cs.Length }
            |&gt; Seq.map (fun n -&gt; List.take n cs, List.skip n cs)
            |&gt; Seq.filter (fun (head, _) -&gt; isPalindrome head)
            |&gt; Seq.fold (fun ret' (head, rest) -&gt; partition' rest (head :: acc) ret') ret

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


## URL

[https://leetcode.com/problems/palindrome-partitioning/description/](https://leetcode.com/problems/palindrome-partitioning/description/)

## Code

[https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/0131/main.fsx](https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/0131/main.fsx)

```plaintext
let partition (s: string) : string list list =
    let isPalindrome (s: char list) : bool = s = List.rev s

    let rec partition' (cs: char list) (acc: char list list) (ret: string list list) =
        match cs with
        | [] ->
            let strs =
                acc
                |> List.rev
                |> List.map (fun c -> System.String.Concat(Array.ofList c))

            strs :: ret
        | _ ->
            seq { 1 .. cs.Length }
            |> Seq.map (fun n -> List.take n cs, List.skip n cs)
            |> Seq.filter (fun (head, _) -> isPalindrome head)
            |> Seq.fold (fun ret' (head, rest) -> partition' rest (head :: acc) ret') ret

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

LeetCode 131. Palindrome Partitioning in F#

URL

Code