/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

1 vote170 views1 answer
Python .nlargest
Python
0 vote166 views1 answer
Pie chart maptlotlib larger labels
Python
0 vote174 views1 answer
Python lastmonth
Python
0 vote170 views1 answer
Python apt manager
Python
0 vote162 views1 answer
How to incorportate a different language in python code
Python
0 vote166 views1 answer
PyPi module to make your terminal look like hacking
Python
0 vote151 views1 answer
Create matrice 2d whit 3colum panda
Python
36 votes175 views5 answers
Colored text python
Python
1 vote153 views1 answer
Match python 3.10
Python
4 votes162 views2 answers
Check if a string is float python
Python