CodingReported in a candidate post, Mar 2021
Find All Array Partitions Meeting Sum and Size Conditions
Filed under SAP
The question
Given an array, find all ways to divide it into two parts such that their union gives the original array, their intersection is null, the sum of the first part is greater than the second part, and the size of the first part is smaller than the second part.
No write-up yet. Related questions below have one.
Related SAP questions
Collected from public candidate posts and coding forums. Updated Nov 2026.