Fastest way to divide numbers into N equal groups that maximizes the mean differences between every two closest groups in Python

Question

Say I have a list of numbers

[1,51,107,3,49,121,5,32,99,2,66,101,1,53,123,7,42,120,0,50,111]

I want to divide them into N=3 groups each with