Split Array Largest Sum at MathWorks
Hard59.8% acceptance
This problem has 50.0% frequency at MathWorks.
Problem Description
Given an integer array `nums` and an integer `k`, split `nums` into `k` non-empty subarrays such that the largest sum of any subarray is **minimized**. Return _the minimized largest sum of the split_. A **subarray** is a contiguous part of the array.
Read full problem and hintsTopics
Also asked at 19 companies
More MathWorks Questions
Maximum Number of AlloysMediumReshape the MatrixEasyMaximum Palindromes After OperationsMediumTotal Cost to Hire K WorkersMediumSell Diminishing-Valued Colored BallsMedium
View all MathWorks questions