de Brujin sequence

A De Brujin sequence of order $n$ on an alphabet $A$ of size $k$ is a cyclic sequence with all possible length-$n$ string on $A$. This can be useful in a stack buffer overflow attack as it can help determine the offset of the stored instruction pointer. Tools like pwntools (in particular, the cyclic command/function) can generate De Brujin sequences.