/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 vote280 views1 answer
How to check if two columns match in pandas
Python
1 vote250 views1 answer
Set and tuple in python
Python
16 votes261 views4 answers
Dataframe find nan rows
Python
1 vote310 views6 answers
Find
Python
62 votes306 views4 answers
Python wait 1 sec
Python
0 vote268 views1 answer
Python generalised eigenvalue problem
Python
0 vote259 views1 answer
Python Command '['latexmk', '--pdf', '--interaction=nonstopmode', % returned non-zero exit status 2.
Python
0 vote262 views1 answer
Holding a function to the code in python
Python
0 vote251 views1 answer
Tranking de perosnas python
Python
3 votes252 views3 answers
Python iterar claves
Python