Company: Mathworks_7Oct
Difficulty: medium
Minimum Complexity Level Problem Description Alex is attending a software engineering conference in which various lectures are presented. The subject matter of each lecture has a certain complexity. Alex has planned the order of lectures they would like to attend, but now they need to schedule these into several days. Their goal is to attend at least one lecture every day and to plan the lectures in a way that minimizes the overall complexity of the conference. (Each day's complexity is defined as the complexity of the most complex lecture attended that day.) Given the complexity levels of the lectures, as well as how many days the conference is being held, what is the overall minimum complexity that can be achieved with optimal planning? The function is expected to return an INTEGER. The function accepts the following parameters: INTEGER_ARRAY complexity : an array of integers denoting the order and complexity of the lectures INTEGER days : the number of days the conference is being h