Jane Street–styleTraderAssistant TraderQuestion #209

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.

Build Your Approach

State the assumptions, try a simple case, then work toward a general solution. Check the result and explain how it changes if an assumption changes.

Try the free diagnostic with worked solutions →

Get Free Interview Prep Resources

Practice the Reasoning Behind the Answer

Bring your target roles and interview timeline to a free quant consult. Discuss your preparation priorities and how Quant Blueprint’s lessons, practice and mock interviews can help.

Book a Free Quant Consult

Your goals · your preparation · your next steps