Jane Street
Interview Question
Assistant Trader Interview
Jane Street
Suppose you have a sequence of 36 integers consisting only of 1's and 0's (e.g., 010101..., 10000100...). Can you construct a sequence where every subsequence of length 5 is unique? Assume the sequence starts with 00000. How would you construct such a sequence? For example, if you start with 00000100001..., it is not valid because it contains two identical subsequences (00001, 00001) of length 5.
Unlock the Full Solution
Enter your email to get instant access to the complete solution, explanation, and similar practice problems.

