all permutations of a binary sequence x bits long

Question

I would like to find a clean and clever way (in python) to find all permutations of strings of 1s and 0s x chars long. Ideally this would be fast and not require doing too m

Answer 1

You can use itertools.product() for doing this.

import itertools
def binseq(k):
    return [''.join(x) for x in itertools.product('01', repeat=k)]