Uber | Onsite | Split array into k subarrays with min abs diff

Given an array arr of non-negative integers. You need to split it into k contiguous subarrays such that the absolute difference between max sum and min sum is the smallest...