Max Heap is the wrong approach "we are asking the smallest". my solution

  def findKthSmallestNumber(self, nums, k):
    
    min_heap = []
    for item in nums:
      heappush(min_heap, item)
    
    for i in range(k):
      out = heappop(min_heap)
      if i == k - 1:
        return out