827. Allocate Mailboxes — DP on Sorted Array

HardRecursionRecursion

Given houses and k mailboxes, find min total distance. Input: JSON {houses,k}.

Input: JSON {houses,k}.

Output: Integer.

Examples

Example 1
Input: {"houses":[1,4,8,10,20],"k":3}
Output: 5
Explanation: Optimal 3 mailboxes.
Example 2
Input: {"houses":[2,3,5,12,18],"k":2}
Output: 9
Explanation: Optimal 2 mailboxes.
Example 3
Input: {"houses":[1],"k":1}
Output: 0
Explanation: One house.

Constraints

Asked by

AmazonGoogleMicrosoftMetaAdobe
Solve this problem in the editor →