Python: Create non-repeated combinations of Cartesian product of three list
Python Itertools: Exercise-30 with Solution
Write a Python program to create non-repeated combinations of the Cartesian product of a given list of four numbers.
Sample Solution:
Python Code:
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))
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.
It will be nice if you may share this link in any developer community or anywhere else, from where other developers may find this content. Thanks.
https://198.211.115.131/python-exercises/itertools/python-itertools-exercise-30.php
- Weekly Trends and Language Statistics
- Weekly Trends and Language Statistics