/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

4 votes172 views1 answer
Selenium execute javascript python
Python
2 votes197 views1 answer
Python calling dynamic function on object
Python
0 vote196 views1 answer
Python pillow cut image in half
Python
1 vote184 views2 answers
Print hexadecimal in python
Python
0 vote209 views1 answer
Xtick for axvline
Python
0 vote193 views1 answer
Python hlaf of list
Python
0 vote264 views1 answer
Python find closest value in list to zero
Python
0 vote194 views1 answer
Say something in discord discord.py
Python
25 votes220 views2 answers
Copy text to clipboard python
Python
1 vote208 views1 answer
Maiusculo em python
Python