1class Solution:2 def numTilePossibilities(self, tiles: str) -> int:3 n = len(tiles)4 tiles = list(tiles)5 s1 = set()6 for i in range(1, n + 1):7 s1.update(permutations(tiles, i))8 return len(s1)
WPM •0 •0
ACC •0 •0
TIME •0