[LeetCode] 1079. Letter Tile Possibilities (Python)
·
알고리즘/LeetCode
난이도: Medium문제 설명You have n tiles, where each tile has one letter tiles[i] printed on it. Return the number of possible non-empty sequences of letters you can make using the letters printed on those tiles. 문제 예제Example 1:Input: tiles = "AAB"Output: 8Explanation: The possible sequences are "A", "B", "AA", "AB", "BA", "AAB", "ABA", "BAA".Example 2:Input: tiles = "AAABBC"Output: 188Example 3:Input:..