Grokking LinkedIn Coding Interview

0% completed

​
Hidden Document
Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content

.....

.....

.....

Like the course? Get enrolled and start learning!
Mohammed Dh Abbas

Mohammed Dh Abbas

· 2 years ago

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
Show 1 reply