Divide array into 3 lots with minimum difference
Filed under Shree Partners
The question
Given an array of n numbers, divide the array into 3 lots such that the difference between the lots is minimized.
No write-up yet. Related questions below have one.
Related Shree Partners questions
Collected from public candidate posts and coding forums. Updated Nov 2026.