/Python/Find all unique substring permutations of a string of a specific length python

Find all unique substring permutations of a string of a specific length python

import itertools

x = "some string"

# aList contains all permutations of all lengths of string x
aList = [each for eachpermut in [''.join(l) for i in range(len(x)) for l in itertools.combinations(x, i+1)] for each in [''.join(eachpermut) for eachpermut in list(itertools.permutations(eachpermut))]]

# aSet only contains unique permutations of aList of varying lengths
aSet = set(aList))

Similar codes

0 vote108 views1 answer
Python continue inner for loop
Python
0 vote112 views1 answer
Series distict
Python
1 vote127 views1 answer
Adding variable in python
Python
7 votes116 views2 answers
Take input from clipboard python
Python
0 vote119 views3 answers
Interface, abstract python?
Python
1 vote108 views1 answer
Create a generator from a list
Python
0 vote114 views1 answer
QuizListView login required django
Python
10 votes115 views3 answers
Logarithmic regression python
Python
1 vote124 views2 answers
Python - How To Count Occurrences of a Character in a String
Python
1 vote116 views1 answer
Def dft(self, array): stack = Stack() visited = set() stack.append(self) while len(stack) > 0 and while len(visited) >= 0: current = stack.pop() array.append(current) visited.add(current) return array
Python