-
Notifications
You must be signed in to change notification settings - Fork 49
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Day-27 q1: 1239. Maximum Length of a Concatenated String with Unique Characters #482
Comments
@bh-g @karishma-2020 @kratika-Jangid pls merge the question #481 thanks :) |
please assign this to me :) @bh-g |
Please assign this ques to me.. @bh-g |
Please assign it to me @bh-g |
Pls assign this issue for python solution @bh-g |
@bh-g pls this issue assign to me |
please assign this issue to me. |
Please assign this issue to me @bh-g . |
@bh-g @karishma-2020 @kratika-Jangid pls merge the solution. Thanks :) #564 |
kratika-Jangid
assigned kratika-Jangid, SonaVarshney, Tech-neophyte, Shubh-Krishna and avanimathur and unassigned kratika-Jangid
Jan 27, 2024
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Maximum Length of a Concatenated String with Unique Characters
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.
Example 1:
Input
: arr = ["un","iq","ue"]Output
: 4Explanation
: All the valid concatenations are:Maximum length is 4.
Example 2:
Input
: arr = ["cha","r","act","ers"]Output
: 6Explanation
: Possible longest valid concatenations are "chaers" ("cha" + "ers") and "acters" ("act" + "ers").Example 3:
Input
: arr = ["abcdefghijklmnopqrstuvwxyz"]Output
: 26Explanation
: The only string in arr has all 26 characters.Constraints:
The text was updated successfully, but these errors were encountered: