let's assume you have a sequence of 36 integers consisting of just 1's and 0's (i.e. 01010101..., 10000100... ). Can you construct a sequence such that every subsequence of length 5 is unique? Let's assume that you start with 00000. How would you construct it? (For instance, if you start with 00000100001..., then it's not valid since you have two subsequences (00001, 00001) of length 5 that are identical).