de Bruijn Sequence

A cyclic sequence in combinatorics in which every substring of length k appears exactly once. In computer science, it is commonly used for perfect hash mapping in bit manipulation operations, such as efficient implementations of count trailing zeros (CTZ).