Identifying the quickselect pattern

There are many problems where we need to find the top or bottom k elements in a dataset based on some complex scoring criteria. These are generally medium or hard problems where we need to define a scoring function to rank elements in a dataset. The scoring function may be stateless or stateful, depending on the complexity of the problem, and the goal is to find the elements with the top k or the bottom k scores.

If the problem statement or its solution follows the generic template below, it can be solved using the generic quickselect algorithm.