Cycles · Application: Genome Assembly and de Bruijn Graphs
Lesson 9
Programming problem. Write a program that takes an integer \(2 \le n \le 10\) as input and outputs the shortest string that contains all binary strings of length \(n\) as substrings.
Public samples
Input
2
Expected output
01100