Python Fundamental Counting Principle Possible Permutations

Question

If given a list of strings such as arr = ["abc", "efgh", "ij"], I want to know all the combinations starting from the first word to the last using recursion.

so the output will look like this:

aei
aej
afi
afj
agi
...
chj

all the codes I see are just using the permutation of one string.

I've been thinking that the concept is something like the fundamental counting principle like the one in the picture but I can't really put it into code.

What have you tried so far? – IoaTzimas Nov 30 '20 at 14:34 — IoaTzimas, Nov 30 '20 at 14:34
What exactly is your question? – mkrieger1 Nov 30 '20 at 14:34 — mkrieger1, Nov 30 '20 at 14:34

score 0 · Answer 1 · answered Nov 30 '20 at 14:34

0

import itertools
print([''.join(x) for x in itertools.product('abc', 'efgh', 'ij')])

answered Nov 30 '20 at 14:34

oskros

3,101
2
9
28

Or `itertools.product(*arr)` as more generic – IoaTzimas Nov 30 '20 at 14:39

Python Fundamental Counting Principle Possible Permutations

1 Answers1