0

Pairs at every distance
Given a list x of 2 or more integers, output whether there exists a pair of equal integers in x separated by exactly n elements for all n such that 0 =< n < length(x)-2.
For example: [1, 1, 3, 2, 3, 1, 2, 1] will return truthy, because
[1, x, x, x, x, x, x, 1]
These 1s are...