/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

6 votes268 views2 answers
Python check if value is undefined
Python
0 vote311 views1 answer
General Loop Structure
Python
0 vote274 views1 answer
Python import module from bitbucket
Python
0 vote281 views1 answer
How to use tensorboard
Python
0 vote284 views1 answer
Drawing diff circles with random radius in diff positions .
Python
2 votes282 views1 answer
Clone website
Python
0 vote301 views1 answer
Is python3 enough for react native
Python
0 vote238 views1 answer
Python script to download files from website
Python
8 votes284 views2 answers
How to read excel file in jupyter notebook
Python
40 votes270 views6 answers
Reset index pandas
Python