/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 vote240 views2 answers
Python requests json backslash
Python
0 vote213 views1 answer
Plot multiplr linear regression model python
Python
0 vote240 views1 answer
Python install minio
Python
-1 vote200 views1 answer
Python command not found
Python
0 vote226 views10 answers
C++ to python converter online
Python
0 vote232 views1 answer
Values django
Python Django
0 vote229 views1 answer
First and last name generator python
Python
0 vote195 views1 answer
Pyplot aera
Python
0 vote216 views1 answer
Ipython and virtualenvs
Python
58 votes215 views7 answers
Pi
Python