Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Recursive solution in Creative category for Digits Doublets by Juge_Ti
# migrated from python 2.7
def f(l,c,u):
if l[-1]in c:return c
s=[f(l,c+[x],u|{x})for x in set(l)-u if sum(repr(c[-1])[i]==repr(x)[i]for i in(0,1,2))==2]
return min(s,key=len)if s else[1]*99
checkio=lambda l:f(l,[l[0]],{l[0]})
Sept. 11, 2014