Get Minimum Cost

Problem Overview

• Insert exactly one integer into a 0-based array of positive integers to minimize the array’s defined cost; return the minimum possible cost.
• Input: arr[n]; Constraints: 2 ≤ n ≤ 10^4, 1 ≤ arr[i] ≤ 10^5; Output: long_int minimum cost.
• Domain: array optimization and cost minimization in sequences for practical data processing.
• From Ibm interviews: a coding interview problem and interview question; complete getMinimumCost(arr).