/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 vote193 views1 answer
Read a number Print Fibonacci sequence up to the given number Python
Python
0 vote188 views3 answers
Draw circle opencv
Python
0 vote201 views1 answer
Inline if statement python return
Python
0 vote194 views1 answer
Get value of 1 field in model django
Python
7 votes217 views2 answers
Python remove html tags
Python
0 vote179 views1 answer
Django versatileimagefield
Python
-1 vote177 views1 answer
Lasso regression implementation python
Python
5 votes272 views1 answer
Add bearer token in python request
Python
0 vote183 views1 answer
Use of numpy matrix in tkinter python 3
Python
-1 vote176 views2 answers
Python selenium find element by text
Python