/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 vote137 views1 answer
How to go to previous directory in os python
Python
5 votes121 views1 answer
Shift elements in list python
Python
1 vote122 views1 answer
Python find string in list
Python
0 vote115 views1 answer
Sqlite3 python parameterized query insert into
Python
0 vote127 views1 answer
Python min length list of strings
Python
0 vote129 views1 answer
How to count number from 1 to 10 in python
Python
1 vote130 views1 answer
How do you find the missing number in a given integer array of 1 to 100?
Python
0 vote146 views1 answer
Jupyterlab interactive plot
Python
0 vote168 views1 answer
Flask stream with data/context
Python Flask
0 vote738 views1 answer
Python pyautogui projects
Python