Hi, here's your problem today. This problem was recently asked by Twitter:

Find the k-th largest number in a sequence of unsorted numbers.

def findKthLargest(arr, k):

# Fill this in.

print(findKthLargest([8, 7, 2, 3, 4, 1, 5, 6, 9, 0], 3))

# 7

Can you do this in linear time?