/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

0 vote325 views1 answer
Request.body django
Python Django
0 vote321 views1 answer
Python how to initialize wikipediaapi
Python
0 vote325 views1 answer
How to make gtts text to speech converter
Python
0 vote287 views1 answer
In np array how to make element as 1 if it exceeds the threshold
Python
0 vote326 views4 answers
How to convert array of arrays into single array with unique values in numpy
Python
2 votes324 views1 answer
How to get all index of a char of a string in python
Python
0 vote346 views1 answer
How to do formatting in python with format function
Python
0 vote322 views1 answer
Installing python 3 to linux
Python
0 vote305 views1 answer
Python struct pack
Python
0 vote305 views1 answer
Standard noramlization
Python