<h2 id="heading-url">URL</h2>
<p><a href="https://leetcode.com/problems/kth-largest-element-in-an-array/" class="autolinkedURL autolinkedURL-url" target="_blank">leetcode.com/problems/kth-largest-element-i..</a></p>
<h2 id="heading-code">Code</h2>
<p><a href="https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/0215/main.fsx" class="autolinkedURL autolinkedURL-url" target="_blank">github.com/syohex/dotnet-study/blob/master/..</a></p>
<pre><code class="lang-fsharp">#r "nuget:FSharpx.Collections"

open FSharpx.Collections

let findKthLargest (nums: int list) (k: int) : int =
    let rec findKthLargest' q k =
        if k = 1 then
            PriorityQueue.peek q
        else
            let _, q' = PriorityQueue.pop q
            findKthLargest' q' (k - 1)

    let q =
        nums
        |&gt; List.fold (fun q n -&gt; PriorityQueue.insert n q) (PriorityQueue.empty true)

    findKthLargest' q k
</code></pre>


## URL

https://leetcode.com/problems/kth-largest-element-in-an-array/

## Code

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

```fsharp
#r "nuget:FSharpx.Collections"

open FSharpx.Collections

let findKthLargest (nums: int list) (k: int) : int =
    let rec findKthLargest' q k =
        if k = 1 then
            PriorityQueue.peek q
        else
            let _, q' = PriorityQueue.pop q
            findKthLargest' q' (k - 1)

    let q =
        nums
        |> List.fold (fun q n -> PriorityQueue.insert n q) (PriorityQueue.empty true)

    findKthLargest' q k
```

LeetCode 215. Kth Largest Element in an Array in F#

URL

Code