Get Minimum Changes

Problem Overview

• Determine the minimum number of price changes needed so that the sums of all contiguous subarrays of length k are equal.
• Input: integer array prod_price and positive integer k. Output: integer, the minimum number of changes required.
• Context: inventory pricing; prod_price[i] is a product price; allowed to change any entries to positive integers.
• Source: Amazon interviews; a common coding interview problem and interview question.