## Question

Asked By – Ben

I have a list with 15 numbers in, and I need to write some code that produces all 32,768 combinations of those numbers.

I’ve found some code (by Googling) that apparently does what I’m looking for, but I found the code fairly opaque and am wary of using it. Plus I have a feeling there must be a more elegant solution.

The only thing that occurs to me would be to just loop through the decimal integers 1–32768 and convert those to binary, and use the binary representation as a filter to pick out the appropriate numbers.

Does anyone know of a better way? Using `map()`

, maybe?

**Now we will see solution for issue: How to get all possible combinations of a list’s elements? **

## Answer

Have a look at itertools.combinations:

`itertools.combinations(iterable, r)`

Return r length subsequences of elements from

the input iterable.Combinations are emitted in lexicographic sort order. So, if the

input iterable is sorted, the

combination tuples will be produced in

sorted order.

Since 2.6, batteries are included!

This question is answered By – James Brady

**This answer is collected from stackoverflow and reviewed by FixPython community admins, is licensed under cc by-sa 2.5 , cc by-sa 3.0 and cc by-sa 4.0 **