Search
⌘K

Leetcode 1079. Letter Tile Possibilities

Given up to 7 letter tiles (with possible duplicates), count how many distinct non-empty sequences you can form using each tile at most once. The core challenge is enumerating all unique permutations of every subset of a multiset while avoiding overcounting due to repeated letters.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.