python - Find product of any subset of elements from a list

Question

what is the best way to find the product of any number of elements from a list?

e.g if I have [a,b,c] as the input, i should get [a,b,c,a*b,a*c,b*c,a*b*c] as the output (order of elements for output doesn't matter.)

PS: Can we do it recursively? (e.g you just need the product of a*b and c to get the product a*b*c.

Any idea or suggestion is welcome. Thanks in advance!

Answer 1

Here you go:

from itertools import combinations

l = [2, 3, 5]

result = []
for i in range(1, len(l) + 1):
    result += list(combinations(l, i))

multiplied_result = [reduce(lambda x, y: x*y, lst) for lst in result]

Now if we print the result, we get

>>> print listmap
[2, 3, 5, 6, 10, 15, 30]