Problem (verbatim):
“Given an integer array and an integer number k. Return the k-th largest element in the array.
Examples:
• array = [5, −3, 9, −1]
• k = 0 ⇒ return: 9
• k = 1 ⇒ return: 5
• k = 3 ⇒ return: −3”
summary (concise approach):
Return the k-th largest (0-indexed) value.
- Simple: sort descending and pick index k (O(n log n)).
- Better: use a min-heap of size k+1 or Quickselect for average O(n).
- Validate k ∈ [0, n−1].
The VOprep team has long accompanied candidates through various major company OAs and VOs, including OpenAI, Google, Amazon, Citadel, SIG, providing real-time voice assistance, remote practice, and interview pacing reminders to help you stay smooth during critical moments. If you are preparing for Stripe or similar engineering-focused companies, you can check out our customized support plans—from coding interviews to system design, we offer full guidance to help you succeed.
