w3resource

Python: Create non-repeated combinations of Cartesian product of three list


30. Non-repeated Cartesian Combinations

Write a Python program to create non-repeated combinations of the Cartesian product of a given list of four numbers.

Sample Solution:

import itertools as it
mums1 = [1, 2, 3, 4]
mums2 = [5, 6, 7, 8]
mums3 = [9, 10, 11, 12]
mums4 = [13, 14, 15, 16]
print("Original lists:")
print(mums1)
print(mums2)
print(mums3)
print(mums4)
print("\nSum of the specified range:")
for i in it.product([tuple(mums1)], it.permutations(mums2), it.permutations(mums3), it.permutations(mums4)):
    print(i)

Sample Output:

Original lists:
[1, 2, 3, 4]
[5, 6, 7, 8]
[9, 10, 11, 12]
[13, 14, 15, 16]

Sum of the specified range:
((1, 2, 3, 4), (5, 6, 7, 8), (9, 10, 11, 12), (13, 14, 15, 16))
((1, 2, 3, 4), (5, 6, 7, 8), (9, 10, 11, 12), (13, 14, 16, 15))

For more Practice: Solve these Related Problems:

  • Write a Python program to compute the Cartesian product of a given list of four numbers and then filter out combinations with repeated digits.
  • Write a Python program to generate non-repeated combinations from the Cartesian product of a list and then sort them in ascending order.
  • Write a Python program to use itertools.product on a list of numbers and then remove tuples that contain duplicate elements.
  • Write a Python program to generate the Cartesian product of a list and then filter out any combinations where the first and last elements are equal.

Python Code Editor:


Have another way to solve this solution? Contribute your code (and comments) through Disqus.

Previous: Write a Python program to interleave multiple lists of the same length. Use itertools module.
Next: Write a Python program to count the frequency of consecutive duplicate elements in a given list of numbers. Use itertools module.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.



Follow us on Facebook and Twitter for latest update.