Community Problem

Split Array Largest Sum

Difficulty: Hard

Split a non-negative integer array into k contiguous parts that minimize the maximum part sum, via binary search on the answer plus a greedy feasibility check.

Split Array Largest Sum

Split a non-negative integer array into k contiguous parts that minimize the maximum part sum, via binary search on the answer plus a greedy feasibility check.

HARD
$9.99
binary-search
arrays
greedy
chidiweber

By @chidiweber

April 1, 2026

·

Updated May 18, 2026

914 views

8

Rate

Problem statement is locked. Purchase this item to view the full content.

Solution

Starter code, test cases, and solutions are locked.

Purchase this item to access the full workspace.

All Problems