Skip to content
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

" Maximum Length of a Concatenated String with Unique Characters (LeetCode Problem)" #2542

Open
wants to merge 1 commit into
base: main
Choose a base branch
from

Conversation

Aishu-ladha
Copy link

@Aishu-ladha Aishu-ladha commented Jan 23, 2024

Description

Fixes #1

Added a C++ solution for the LeetCode problem "Maximum Length of a Concatenated String with Unique Characters". The implementation ensures that the concatenated string has the maximum possible length with unique characters.

Dependencies:

  • None

Type of change

  • Bug fix
  • New feature
  • Breaking change
  • This change requires a documentation update
  • Documentation Update

Checklist:

  • My code follows the style guidelines (Clean Code) of this project
  • I have performed a self-review of my own code
  • I have commented my code, particularly in hard-to-understand areas
  • I have created a helpful and easy-to-understand README.md
  • I have made corresponding changes to the documentation
  • My changes generate no new warnings
  • I have added tests that prove my fix is effective or that my feature works

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

Add more questions related to strings linked list
1 participant