tomatocream
1dec88aaf2
Add populate-notes.mjs that fetches problem descriptions and Python/C++ code stubs from LeetCode's GraphQL API. Populated all 197 NeetCode 150 note files with: - Problem description (examples, constraints) - Python code stub (function signature) - C++ code stub (function signature + includes) API responses cached in leetcode/.cache/leetcode/ for instant re-runs.
1.1 KiB
1.1 KiB
TODO 1079. Letter Tile Possibilities 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: 8
Explanation: The possible sequences are "A", "B", "AA", "AB", "BA", "AAB", "ABA", "BAA".Example 2:
Input: tiles = "AAABBC"
Output: 188Example 3:
Input: tiles = "V"
Output: 1Constraints:
1 <= tiles.length <= 7tilesconsists of uppercase English letters.
TODO Approach
Write your approach here.
TODO Python
class Solution:
def numTilePossibilities(self, tiles: str) -> int:TODO C++
class Solution {
public:
int numTilePossibilities(string tiles) {
}
};