Available question text
Given an array of lowercase strings, choose a subsequence (order preserved) whose concatenation contains only unique characters and return the maximum possible length of that concatenation. With arr.length ≤ 16, the problem reduces to exploring subsequences while skipping strings that introduce duplicate characters.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Meta
Leetcode 1239. Maximum Length of a Concatenated String with Unique Characters
Reported Feb 18, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source