Maximize Unique Characters from Word List
Given a list of words, find a subset that maximizes the total number of unique characters used, ensuring no character appears more than once across all selected words.
Asked at:
Meta
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Mid December, 2025
Meta
Manager
Given a list of words, your task is to find a subset of words which uses as many characters as possible, but never uses the same letter twice. You are given a word list, where each entry is a string drawn from a fixed alphabet. For example, the list may consist of all five-letter words accepted by Wordle using the letters a–z, or a list of the first 1,000 prime numbers represented as strings using the digits 0–9.
Your account is free and you can post anonymously if you choose.