/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

3 votes243 views2 answers
How to format a file in python
Python
3 votes269 views2 answers
Python generators
Python
0 vote254 views1 answer
Module level import not at top of file
Python
0 vote260 views1 answer
Nearest neighbors imputation
Python
0 vote251 views1 answer
How to set conditionlally keys in python
Python
0 vote219 views1 answer
Time df.apply() python
Python
15 votes261 views4 answers
Check pip version
Python
0 vote265 views1 answer
Creating fake instagram accounts with python
Python
6 votes271 views3 answers
Django models filter
Python
-1 vote221 views1 answer
Datetime am pm python
Python