/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 vote200 views1 answer
How to implement nfa in python
Python
14 votes226 views3 answers
Python int to bytes
Python
0 vote206 views1 answer
Overlapping xtick labels pyplot
Python
0 vote206 views1 answer
Python svg viewing
Python
0 vote323 views1 answer
Dicionario python
Python
0 vote164 views1 answer
Timeit command line
Python
2 votes218 views1 answer
Python sort two key
Python
18 votes224 views2 answers
Get columns by type pandas
Python
4 votes203 views2 answers
Plot distribution seaborn
Python
1 vote198 views1 answer
Python tkinter getting labels
Python