/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 vote122 views2 answers
Zip django template
Python Django
7 votes101 views3 answers
Print variable in sentence python
Python
0 vote110 views1 answer
Sns regplot make the line and confidence interval thicker
Python
0 vote105 views1 answer
Jinja if or
Python
0 vote101 views1 answer
Tensorflow Dense layer activatity leaklyrelu
Python
8 votes100 views6 answers
Spanish to english
Python
5 votes131 views4 answers
Xticks and yticks matplotlib
Python
0 vote115 views1 answer
Copy model keras
Python
12 votes156 views2 answers
Pil get image size
Python
0 vote130 views1 answer
Django insert bulk data
Python Django