public void prepare()Within the preparation of this problem all
candidatesless than 1000 are collected using a
Sieve. The found candidates are saved as
public java.lang.String solve()This method solves the given problem by checking every
candidateif it is a permutation of one other candidate. All permutations are stored in a list. Afterwards every list is checked if there are elements that have the same distance between each other.
- the second 3-element-list as concatinated string
- See Also: