Company: citadel_1aug
Difficulty: medium
Image Processing Cost Problem Description Devise a strategy to minimize the costs of processing N images, where each image requires specific filters applied for a defined time frame, and the cost to apply filters to the i-th image is filterCost[i] . Each image must be processed from startDay[i] to endDay[i] (inclusive). Additionally, there is an exclusive offer to apply a filter to all N images at a discounted rate of discountPrice per day. Your goal is to create an efficient image processing plan that adheres to time constraints and budget considerations, and return the minimum cost modulo (10 9 + 7). Complete the function getMinProcessingCost that takes the following parameters: int filterCost[i] : the cost of filtering each image i. int startDay[i] : the first day each image should be processed. int endDay[i] : the last day each image should be processed. int discountPrice : the discounted rate at which filters can be applied to all the images on one day. Returns: int : the minimum