/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 vote152 views1 answer
Pd sample every class
Python
0 vote138 views1 answer
Save image to file from URL
Python
0 vote153 views1 answer
Python scapy install window
Python
0 vote164 views1 answer
Python fibonacci series (Recursion)
Python
0 vote135 views1 answer
How to use python to download files from the interent
Python
11 votes137 views2 answers
Pickle a dictionary
Python
1 vote151 views1 answer
Each line in a text file into a list in Python
Python
0 vote142 views2 answers
Python sort isdigit
Python
26 votes134 views1 answer
Python gmail
Python
129 votes132 views6 answers
Random.randint
Python