/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

7 votes120 views3 answers
Update django
Python
0 vote133 views1 answer
Python list of datetimes as type string
Python
2 votes151 views1 answer
How to convert gb to mb in python
Python
1 vote133 views1 answer
Handle queries in ListView django
Python Django
4 votes131 views3 answers
How to use random tree in python
Python
0 vote122 views1 answer
Comparison of two csv file and output with differences?
Python
3 votes166 views4 answers
Generate fibonacci series in python
Python
1 vote113 views1 answer
Conda python 3.8
Python
2 votes116 views2 answers
Return codecs.charmap_decode(input,self.errors,decoding_table)[0] UnicodeDecodeError: 'charmap' codec can't decode byte 0x8d in position 280: character maps to <undefined>
Python
0 vote136 views1 answer
Python euler
Python