Maximum-Length Subset of Words with Disjoint Characters

meta

Problem

Given a list of words, select a subset such that no character appears in more than one selected word. Maximize the total number of characters in the selected words.

A word containing a re...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: