Fastest python algorithm to divide a list of numbers into N groups that maximizes the total mean differences of every two closest groups

Question

Say I have a list of integers

[1, 107, 1010, 3, 121, 5, 1024, 118, 101, 1, 123, 1357]

I want to divide them into N=3 groups (not necessarily