Split Array Largest Sum: coding question

Available question text

Split the array into k non-empty contiguous subarrays so that the maximum subarray sum is as small as possible, and return that minimized largest sum. This is a partitioning/optimization problem typically solved with binary search on the answer (or DP) and a greedy feasibility check.

Continue with questions that share topics or the same question type.

Maximum Coins From K Consecutive Bags
Coding · Array · Binary Search · Greedy
Partition Array Into Two Arrays to Minimize Sum Difference
Coding · Array · Binary Search · Bit Manipulation
Minimum Size Subarray Sum
Coding · Array · Binary Search · Prefix Sum
Minimum Sum of Squared Difference
Coding · Array · Binary Search · Greedy

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

Amazon
Leetcode 410. Split Array Largest Sum
Reported Feb 27, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source

LeetCode company tags · 9 records

Amazon
Split Array Largest Sum
Reported date not specified · Source window: 30d
Source snapshot: Oct 20, 2026
Source frequency score: 61.7. This is not an interview probability.
View source
Google
Split Array Largest Sum
Reported date not specified · Source window: 30d
Source snapshot: Oct 20, 2026
Source frequency score: 48.7. This is not an interview probability.
View source
Google
Split Array Largest Sum
Reported date not specified · Source window: 6mo

Split Array Largest Sum

Available question text

Related questions

Split Array Largest Sum

Available question text

Related questions