Find the Kth smallest number using a heap

Medium

Consider an unsorted array of numbers and an integer k, find the kth smallest number in the array.

For example, if you're given the following inputs:

arr = [8, 2, 9, 4]
k = 3

Your function should return the third smallest number 8.

def kth_smallest(arr: list[int], k: int) -> int:
    # implement kth_smallest
    return 0

1def kth_smallest(arr: list[int], k: int) -> int:
2    # implement kth_smallest
3    return 0
4

Solution

Master Trees & Graphs by trying the coding challenges below.

Stack Bash helps new and veteran software engineers master data structures and algorithms for technical interviews.