/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 vote221 views1 answer
How to take out every even number from a list in python
Python
0 vote224 views1 answer
12
Python
1 vote234 views1 answer
Get video length python
Python
1 vote216 views1 answer
Python second to last element in list
Python
2 votes229 views3 answers
Scatter plot actual vs predicted python
Python
0 vote266 views1 answer
Python randomly chose user agent
Python
0 vote190 views1 answer
Loop through words in a string python
Python
0 vote213 views1 answer
Align a text python
Python
1 vote255 views1 answer
Calculate pointbiseral correlation scipy
Python
1 vote241 views1 answer
Running setup.py bdist_wheel for opencv-python: still running...
Python