Quickselect

The Quickselect technique is applied when tackling problems characterized by specific invariants in the problem state or constraints:

• Core Strategy: Use a partition step (like quicksort) to find the kth largest/smallest element in average O(n) without fully sorting.
• When to use: Look for opportunities where repeated re-computation can be replaced by maintaining monotonic properties, state windows, or relational pointers.
• Interview Signal: Demonstrating this pattern shows mastery of Heap foundations, reducing worst-case algorithmic complexity.