/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 vote312 views1 answer
Noninspection access to protected member
Python
0 vote352 views2 answers
Python fork error
Python
0 vote346 views1 answer
AttributeError: module 'pyarrow' has no attribute 'parquet'
Python
0 vote319 views1 answer
How to find xpath by contained text
Python
11 votes315 views4 answers
Python create environment variable
Python
2 votes340 views1 answer
How do I mock an uploaded file in django?
Python Django
2 votes322 views2 answers
Python list to string without brackets
Python
2 votes374 views1 answer
How to make a python program to count from 1 to 100
Python
0 vote292 views1 answer
Truthy falsy python
Python
3 votes329 views4 answers
Install tensorflow gpu
Python