Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

class Solution { public int findKthLargest(int[] nums, int k) { Arrays.sort(nums); return nums[nums.length-k]; } }

Sure! But your solution is nlog(n), the time complexity can definitely be more optimal if you use the concept of max heap, in which case it won't be a two liner.

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.