Skip to content

Practice Maximum Length of a Concatenated String with Unique Characters

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#1239
LeetCode Problem

Maximum Length of a Concatenated String with Unique Characters

Problem Statement

You are given an array of strings arr. A string s is formed by the concatenation of a subsequence of arr that has unique characters. Return the maximum possible length of s. A subsequence is an array that can be derived from another array by deleting some or no elements without changing the order of the remaining elements.

Source: Maximum Length of a Concatenated String with Unique Characters on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
arr = ["un","iq","ue"]
Output
4

# Example 2

Input
arr = ["cha","r","act","ers"]
Output
6

# Example 3

Input
arr = ["abcdefghijklmnopqrstuvwxyz"]
Output
26

Constraints

1 <= arr.length <= 16
1 <= arr[i].length <= 26
arr[i] contains only lowercase English letters.

Related LeetCode Problems

Practice more problems similar to Maximum Length of a Concatenated String with Unique Characters.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.