Given an array of integers jobDifficulty and an integer d. The difficulty of the i-th job is jobDifficulty[i]. Return the minimum difficulty of a job schedule. If you cannot find a schedule for the jobs return -
Returnthe minimum difficultyof a job schedule. If you cannot find a schedule for the jobs return-1. Example 1: Input: jobDifficulty = [6,5,4,3,2,1], d = 2 Output: 7 Explanation: First day you can finish the first 5 jobs, total difficulty = 6. Second day you can finish the la...
Given an array of integersjobDifficultyandan integer d. Thedifficultyof the i-thjobisjobDifficulty[i].Return the minimumdifficultyof ajobschedule.If you cannot find aschedulefor thejobsreturn -1. Example Input:jobDifficulty= [6,5,4,3,2,1], d =2Output:7Explanation:First day you can finis...