Given an array, and a number K, you need to sl¡plit that array in K parts and return the sum of the smallest subarray.
It’s Chocolate sweetness problem solvable using binary search.
My Java solution: https://leetcode.com/playground/pYJTfHZa
Given an array, and a number K, you need to sl¡plit that array in K parts and return the sum of the smallest subarray.
It’s Chocolate sweetness problem solvable using binary search.
My Java solution: https://leetcode.com/playground/pYJTfHZa