##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
CSES 1692 - Construct the sequence.
Problem: Given , construct a minimum-length bit string that contains every -bit string as a substring.
Link: CSES 1692
Constraints:
Output: A bit string of length (the De Bruijn sequence).
Example: For , output "" (length ). Build a directed graph where nodes are -bit strings and edges represent -bit strings. Find an Euler circuit on this graph.
