I would like to have a Python function made that will take a list of items and return all the permutations of that list in every possible group size of X items.
def permutations_in_groups(items: List, x: int):
ie; permutations_in_groups([1,2,3,4,5,6,7,8,9,10], 10) -> Would return every possible combination of the list grouped in 10. This would return [1,2,3,4,5,6,7,8,9,10], but if 11 was added there would a lot more.
Please use standard libraries like iteration to the fullest to make it easy to use for others.
17 freelancers are bidding on average $108 for this job
I am a data scientist and analyst with more than 4 years of programming experience in Python. I have understood your requirements of creating combinations and can finish the task asap.
I can do this task as i have pretty good knowledge about this. I have experience of more than 3 years which will be efficient for my clients too. Kindly reply so we can proceed.