← Oracle questions
CodingReported in a candidate post, Jul 2025

Split array into K subarrays minimising the maximum sum

Filed under Oracle

Given an array of positive integers and an integer k, split the array into k non-empty contiguous subarrays so that the largest subarray sum is as small as possible. Return that minimum possible…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Oracle questions

Collected from public candidate posts and coding forums. Updated Nov 2026.