**Job Scheduling to Minimize Difficulty - Amazon Top Interview Questions**

### Problem Statement :

You are given a list of integers jobs and an integer k. You want to finish all jobs in k days. The jobs must be done in order and a job must be done each day. The difficulty of job i is jobs[i] and the difficulty of doing a list of jobs on a day is defined to be the maximum difficulty job performed on that day. Return the minimum sum of the difficulties to perform the jobs over k days. Constraints n ≤ 500 where n is the length of jobs k ≤ 10 Example 1 Input jobs = [1, 2, 3, 5, 2] k = 2 Output 6 Explanation We do [1] the first day and then do [2, 3, 5, 2]. The total difficulty is 1 + max(2, 3, 5, 2) = 6.

### Solution :

` ````
Solution in C++ :
int solve(vector<int>& nums, int k) {
int n = nums.size();
vector<int> dp(n + 1);
fill(dp.begin() + 1, dp.end(), INT_MAX);
dp[0] = 0;
while (k--) {
vector<int> ndp(n + 1, INT_MAX);
for (int i = 0; i < nums.size(); i++) {
if (dp[i] == INT_MAX) continue;
int maxd = 0;
for (int j = i; j < nums.size(); j++) {
maxd = max(maxd, nums[j]);
ndp[j + 1] = min(ndp[j + 1], dp[i] + maxd);
}
}
dp.swap(ndp);
}
return dp[n];
}
```

` ````
Solution in Java :
import java.util.*;
class Solution {
/**
public int solve(int[] jobs, int k) {
if (jobs.length < k) {
return -1;
}
return helper(jobs, k, 0);
}
private int helper(int[] jobs, int k, int start) {
int max = -1;
int ans = Integer.MAX_VALUE;
int end = jobs.length - k;
if (k == 1) {
for (int i = start; i <= end; i++) {
max = Math.max(max, jobs[i]);
}
return max;
} else {
for (int i = start; i <= end; i++) {
max = Math.max(max, jobs[i]);
ans = Math.min(ans, max + helper(jobs, k - 1, i + 1));
}
return ans;
}
}
*/
int[][] m;
public int solve(int[] jobs, int k) {
if (jobs.length < k) {
return -1;
}
m = new int[k + 1][jobs.length];
return helper(jobs, k, 0);
}
private int helper(int[] jobs, int k, int start) {
if (m[k][start] > 0) {
return m[k][start];
}
int max = -1;
int ans = Integer.MAX_VALUE;
int end = jobs.length - k;
if (k == 1) {
for (int i = start; i <= end; i++) {
max = Math.max(max, jobs[i]);
}
m[k][start] = max;
return max;
} else {
for (int i = start; i <= end; i++) {
max = Math.max(max, jobs[i]);
ans = Math.min(ans, max + helper(jobs, k - 1, i + 1));
}
m[k][start] = ans;
return ans;
}
}
}
```

` ````
Solution in Python :
class Solution:
def solve(self, jobs, k):
N = len(jobs)
@lru_cache(None)
def traverse(idx, day, current_max):
if day > k:
return math.inf
if idx == N:
if k == day:
return current_max if current_max != -math.inf else 0
return math.inf
# choice-01 -> Stop the day with the current task and chill. (Lazy :D)
# choice-02: do the next task the same day so that you can chill later. (Eager :|)
val = jobs[idx]
choice_01 = max(current_max, val) + traverse(idx + 1, day + 1, -math.inf)
choice_02 = traverse(idx + 1, day, max(current_max, val))
return min(choice_01, choice_02)
return traverse(0, 0, -math.inf)
```

## View More Similar Problems

## Binary Search Tree : Lowest Common Ancestor

You are given pointer to the root of the binary search tree and two values v1 and v2. You need to return the lowest common ancestor (LCA) of v1 and v2 in the binary search tree. In the diagram above, the lowest common ancestor of the nodes 4 and 6 is the node 3. Node 3 is the lowest node which has nodes and as descendants. Function Description Complete the function lca in the editor b

View Solution →## Swap Nodes [Algo]

A binary tree is a tree which is characterized by one of the following properties: It can be empty (null). It contains a root node only. It contains a root node with a left subtree, a right subtree, or both. These subtrees are also binary trees. In-order traversal is performed as Traverse the left subtree. Visit root. Traverse the right subtree. For this in-order traversal, start from

View Solution →## Kitty's Calculations on a Tree

Kitty has a tree, T , consisting of n nodes where each node is uniquely labeled from 1 to n . Her friend Alex gave her q sets, where each set contains k distinct nodes. Kitty needs to calculate the following expression on each set: where: { u ,v } denotes an unordered pair of nodes belonging to the set. dist(u , v) denotes the number of edges on the unique (shortest) path between nodes a

View Solution →## Is This a Binary Search Tree?

For the purposes of this challenge, we define a binary tree to be a binary search tree with the following ordering requirements: The data value of every node in a node's left subtree is less than the data value of that node. The data value of every node in a node's right subtree is greater than the data value of that node. Given the root node of a binary tree, can you determine if it's also a

View Solution →## Square-Ten Tree

The square-ten tree decomposition of an array is defined as follows: The lowest () level of the square-ten tree consists of single array elements in their natural order. The level (starting from ) of the square-ten tree consists of subsequent array subsegments of length in their natural order. Thus, the level contains subsegments of length , the level contains subsegments of length , the

View Solution →## Balanced Forest

Greg has a tree of nodes containing integer data. He wants to insert a node with some non-zero integer value somewhere into the tree. His goal is to be able to cut two edges and have the values of each of the three new trees sum to the same amount. This is called a balanced forest. Being frugal, the data value he inserts should be minimal. Determine the minimal amount that a new node can have to a

View Solution →