Restricted category To view older posts, you must first submit an approved post in that category

Apple ICT3 technical interview questions

Here are two technical questions I remember/wrote down during my technical interviews for you all to practice with:

Return a tree and all associated paths. Do not use a global variable.

Given an array which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays. Write an algorithm to minimize the largest sum among these m subarrays.
Note:
If n is the length of array, assume the following constraints are satisfied:
1 ≤ n ≤ 1000
1 ≤ m ≤ min(50, n)
Examples:
Input:
nums = [7,2,5,10,8]
m = 2
Output:
18

Thanks for sharing with the community :grin: