GoLang Solution For LeetCode Problem: Kth Largest Element in an Array
Solving Kth Largest Element in an Array in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.
Input: [3,2,1,5,6,4] and k = 2 Output: 5
Input: [3,2,3,1,2,4,5,5,6] and k = 4 Output: 4
See the full details of the problem Kth Largest Element in an Array at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go