it's not that hard as it looks like:

1) sort;
2) calculate delta different between current element & its immediate predecessor
3) count the longest sequence with the same delta.

code here: