Minimize Cost

Problem Overview

• Reduce an integer array to a single element by repeatedly combining two elements and paying a cost equal to their sum; find the minimum total cost.
• Input: int array arr[n]; Output: integer minimum cost; constraints not specified.
• Models cost optimization in merging or resource aggregation scenarios.
• This is a coding interview problem from Ibm interviews and a common interview question.