Coding (Algo)

Minimize Repeated Merge Work

Algorithm: Priority queue Difficulty: Medium Time: 35 minutes

Goal

Return the minimum total cost needed to combine all supplied batch lengths into one by repeatedly merging exactly two batches.

What this task practices

Minimize Repeated Merge Work 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.