Divide list elements into sub-lists of unique combinations

Question

I need all the possible unique combinations of the elements of a list when divided into two sublists.

For example - if I have a list: [1, 2, 3] and I wanna divide it into two sublists, like the following:

[1], [2,3]

[1,2], [3]

[2], [1,3]

Now how would I find out all these unique combinations, Also, the order of the elements is neglected here.

Looks like duplicate of https://stackoverflow.com/questions/40709488/all-possibilities-to-split-a-list-into-two-lists — Pitirus, Aug 21 '19 at 10:51
@Pitirus Thanks, that's pretty much it. except it has the same values repeated, just in different order — Muhammad Nahid, Aug 21 '19 at 11:03

score 0 · Answer 1 · answered Aug 21 '19 at 10:49

You can use itertools.permutations()

from itertools import permutations

# Get all permutations of [1, 2, 3]
perm = permutations([1, 2, 3])

# Print the obtained permutations
for i in list(perm):
    print (list(i[:1]),list(i[1:]))
    print (list(i[:2]),list(i[2:]))

output:

[1] [2, 3]
[1, 2] [3]
[1] [3, 2]
[1, 3] [2]
[2] [1, 3]
[2, 1] [3]
[2] [3, 1]
[2, 3] [1]
[3] [1, 2]
[3, 1] [2]
[3] [2, 1]
[3, 2] [1]

Divide list elements into sub-lists of unique combinations

1 Answers1