Back to Questions

Split Array Largest Sum

143K views•Asked at Microsoft•
Hard

Question Explain

Given an array `nums` and an integer $k$, split `nums` into $k$ non-empty contiguous subarrays such that the largest sum among these $k$ subarrays is minimized. Use Binary Search on the answer.

Start Trying This Question Simulation

Practice answering orally or with text to get instant AI feedback.

Practice with This Question

Other interview questions like this

Two Sum

104.4K views

Longest Substring Without Repeating Characters

62.2K views

Median of Two Sorted Arrays

107.8K views
Split Array Largest Sum - Interview Question