Use sorting or heap data structure to find the kth largest element in the array.

• Sort the array in descending order and return the element at index k-1.

• Use a max heap to store the elements and pop k-1 ...read more