/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

13 votes176 views6 answers
How to open pickle file
Python
0 vote182 views1 answer
1d random walk in python stack exchange
Python
0 vote171 views1 answer
Multiprocessing in jupyter notebook
Python
0 vote180 views1 answer
Installing intelpython3_core using anaconda
Python
2 votes161 views1 answer
Urlpatterns += static(r'^static/(?P<path>.*)$', 'django.views.static.serve', {'document_root': settings.STATIC_ROOT})
Python
1 vote181 views1 answer
Python numpy array delete multiple columns
Python
19 votes175 views1 answer
Get requests from python
Python
0 vote182 views1 answer
Get key from value dictionary py
Python
0 vote167 views1 answer
Double for in loop python
Python
1 vote170 views2 answers
Save timestamp python
Python