/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 vote205 views1 answer
Pandas loop through unique values
Python
0 vote215 views4 answers
Randome Word generator from consonant, vowel and specific string
Python
0 vote242 views1 answer
Difference between changing values of variable and list inside function in python
Python
0 vote215 views1 answer
Start virtualenv with python version
Python
-1 vote196 views1 answer
Ipywidgets pip
Python
11 votes212 views6 answers
Python merge dict
Python
0 vote215 views1 answer
"not equal to" python symbol
Python
0 vote231 views1 answer
Iterating over tuples in python
Python
0 vote227 views1 answer
What if init migrations run two times or by pass this migrate
Python
0 vote199 views1 answer
Transformers bert
Python