/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 vote174 views1 answer
Remove cog in discord.py
Python
1 vote124 views1 answer
Filter dataframe columns vy a list of columns
Python
2 votes147 views5 answers
Torch.stack
Python
0 vote138 views1 answer
Replace one row with another in python
Python
0 vote172 views1 answer
Django extract array from post matrix
Python Django
1 vote148 views1 answer
Python psycopg2 utf8
Python
1 vote146 views1 answer
How to add a fuction in python
Python
3 votes157 views2 answers
Jupyter print full dataframe
Python
0 vote227 views1 answer
How to check local endianness with Python ?
Python
0 vote133 views1 answer
Is plaindrome python
Python