← Arrays

Kth Largest Element

Medium
Python
def find_kth_largest(nums,k):
    nums.sort(reverse=True)
    return nums[k-1]
Java
public int findKthLargest(int[] nums,int k){
    Arrays.sort(nums);
    return nums[nums.length-k];
}

Key Insight

Python reverse=True vs Java ascending sort + length-k index.

Python → Java Differences

  • sort(reverse=True) descending
  • Java ascending index from back
  • reverse=True named parameter Python
Python
def find_kth_largest(nums,k):
    nums.sort(reverse=True)
    return nums[k-1]
Java
public int findKthLargest(int[] nums,int k){
    Arrays.sort(nums);
    return nums[nums.length-k];
}

Algorithm Steps

1. Sort descending
2. Return index k-1
← Previous All Arrays Next →