# Maximum Length Of A Concatenated String With Unique Characters: Explained
Maximum Length Of A Concatenated String With Unique Characters shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Each word is a bitmask of its characters (discard words with internal duplicates). DP or DFS over subsets ORs compatible masks and tracks the popcount.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (bitmasks, backtracking with pruning, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(2^n * 26).
## Common mistake
Concatenating greedily in input order, which can miss a longer compatible subset.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at here.