Question
Given a list of lowercase words, choose a group in which no letter repeats, either inside a single word or across words, and report the largest total number of letters such a group can contain. ```python def solve(raw: str) -> str: ... ``` ## Requirements - Line 1 holds the number of words. Line 2 holds exactly that many space-separated lowercase words. - A word may join the group only if all of its own letters are different. - No letter may be shared by two chosen words, so each of the 26 letters appears at most once in the whole group. - Words may be skipped, and selecting no words is allowed. - Maximize the total character count across the chosen words. - Return that maximum as a decimal string, using `"0"` when no word qualifies. - `run_case(case: dict)` reads `case["stdin"]` and returns the string produced by `solve`. - Do not append a trailing newline to the returned string; return the value exactly once.