Back to all patterns

Quick Select or Min Heap

1 problems • Practice on LeetCode to earn credits

About This Pattern

Master the Quick Select or Min Heap pattern by practicing these problems organized by difficulty.Focus on the Key Signals - these are the indicators that tell you when to use this pattern.

Medium (1)

Kth Largest Element In An Array

Find the kth largest element in an unsorted array.

Key Signals:

Partition around pivotAverage O(n)Or min heap of size k