<p>Given an integer array <code>nums</code> and an integer <code>k</code>, return <em>the</em> <code>k<sup>th</sup></code> <em>largest element in the array</em>.</p>

<p>Note that it is the <code>k<sup>th</sup></code> largest element in the sorted order, not the <code>k<sup>th</sup></code> distinct element.</p>

<p>Can you solve it without sorting?</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> nums = [3,2,1,5,6,4], k = 2
<strong>Output:</strong> 5
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> nums = [3,2,3,1,2,4,5,5,6], k = 4
<strong>Output:</strong> 4
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= k &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>-10<sup>4</sup> &lt;= nums[i] &lt;= 10<sup>4</sup></code></li>
</ul>

'''  Test cases 
 nums = [1,1,1,2,2,3]
 k  = 1, output = 3
 k  = 2, output = 2
 k  = 3, output = 2
'''
from collections import Counter
import heapq

class Solution:
    def findKthLargest(self, nums: List[int], k: int) -> int:
        #Start with a hashmap to store numbers and its ocurrences
        counter = Counter(nums)
        heap = []

        #Iterate in it inserting the items into a heap
        for key,value in counter.items():
            heap.append((-key,value))
        
        heapq.heapify(heap)
        
        # searching for the k largest by poping the element in the heap
        while(k > 0):
            key,value = heapq.heappop(heap)
            k -= value
        
        #return k largest
        return -key
        
        
        
        
30937