You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Good morning! Here's your coding interview problem for today.
This problem was asked by Etsy.
Given an array of numbers N and an integer k, your task is to split N into k partitions such that the maximum sum of any partition is minimized. Return this sum.
For example, given N = [5, 1, 2, 7, 3, 4] and k = 3, you should return 8, since the optimal partition is [5, 1, 2], [7], [3, 4].
The text was updated successfully, but these errors were encountered:
Good morning! Here's your coding interview problem for today.
This problem was asked by Etsy.
Given an array of numbers
N
and an integerk
, your task is to splitN
intok
partitions such that the maximum sum of any partition is minimized. Return this sum.For example, given
N = [5, 1, 2, 7, 3, 4]
andk = 3
, you should return8
, since the optimal partition is[5, 1, 2], [7], [3, 4]
.The text was updated successfully, but these errors were encountered: