Letter Tile Possibilities
time limit per test: 2 secondsmemory limit per test: 256 megabytes
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: 8
Explanation: The possible sequences are "A", "B", "AA", "AB", "BA", "AAB", "ABA", "BAA".
Example 2:
Input: tiles = "AAABBC"
Output: 188
Example 3:
Input: tiles = "V"
Output: 1
Constraints:
1 <= tiles.length <= 7
tiles
consists of uppercase English letters.
Date | Status | Language | Runtime | Memory |
---|
You don't have any Submissions yet.
Input: AAB
Expected Output: 8
Input: AAABBC
Expected Output: 188
Input: V
Expected Output: 1