Maximum Characters in a Unique-Letter Word Subset
Asked at Meta · Coding Questions · Difficulty: Medium · Last asked Nov 10, 2026
You are given a list of lowercase words. Choose any subset of them (possibly none) and join the chosen words together. The result is valid only if no letter appears more than once in it. Find the largest possible length of a valid result.
Loading the problem…
More Meta interview questions
- LLM conceptual questions
- Implement a Two-Hidden-Layer MLP with Backpropagation in NumPy
- Dot Product with Run-Length Encoded Vectors
- Count Lakes Wrapped by a Given Island
- Minimum Remove to Make Valid Parentheses
- LLM with Beam Search and Nucleus Sampling (Meta MSL)