Split Array Largest Sum at Tekion

Hard59.8% acceptance

This problem has 75.0% frequency at Tekion.

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 hints

Topics

Array Binary Search Dynamic Programming Greedy Prefix Sum

Also asked at 19 companies

Adobe Amazon Baidu Bloomberg DE Shaw Deloitte Google Infosys MathWorks Meta Microsoft Nutanix Oracle PhonePe Pinterest Salesforce Samsung Uber Zeta

View Full Problem

Problem Description

Topics

Also asked at 19 companies

More Tekion Questions