Coding (Algo)

Keep the Largest Batch Values

Algorithm: Bounded heap Difficulty: Medium Time: 35 minutes

Goal

Return the largest min(k,n) values in descending numeric order while retaining duplicate occurrences and using only bounded extra storage.

What this task practices

Keep the Largest Batch Values is a coding (algo) interview exercise that trains prompt interpretation, explicit assumptions, a concrete response, and a clear explanation of tradeoffs. The catalog marks it as medium difficulty. It focuses on Technical Reasoning, Testing, Validation. The signed-in workspace provides the tools for the round and evaluates the attempt against task-specific criteria. Reference solutions, hidden checks, evaluator instructions, and candidate work remain private.