/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 vote184 views1 answer
Python two while loops at same time
Python
1 vote199 views1 answer
Django foreign key field on delete do nothing
Python
0 vote178 views1 answer
Eval how
Python
4 votes186 views2 answers
Python sort dictionary alphabetically by key
Python
0 vote190 views1 answer
Create virtual environments python
Python
0 vote249 views1 answer
How to make it so we can give unlimited parameters in python function
Python
0 vote737 views1 answer
Which of the following statements is used to create an empty set in python?
Python
8 votes195 views2 answers
How do I set Conda to activate the base environment by default?
Python
1 vote218 views1 answer
Sort python dictionary by date
Python
2 votes193 views3 answers
Find difference between two pandas dataframes
Python