-
-
Notifications
You must be signed in to change notification settings - Fork 7.4k
Create Longest_Substring_Without_Repeating_Characters.cpp #2761
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
Conversation
* I would like to contribute for sliding window algorithm and this one is one of the famous problem that is asked in interviews. * Thank you!!.
…to sliding-window/Longest_Substring_Without_Repeating_Characters.cpp * This is my contribution towards the sliding window algorithm/s and this is one of the famous problems. * Thank you.
* I would like to contribute towards the sliding window algorithm in which this is one of the famous problem asked in interviews. * Thank you.
* Updated certain changes in documentation, this is my contribution towards sliding window algorithm this is one of the famous interview problem. * Thank you.
* Well documented and tested code for sliding window algorithm. * Thank you.
Unfortunately we dont currently accept leetcode solutions see #2450 |
what if I put these under the other section will that be fine |
yes but use a proper class instead of the solution one you've used |
…to Longest_Substring_Without_Repeating_Characters.cpp * So,I did a small change I added the problem into the others section I think this works fine I guess. * I would be glad if this can be tagged as hackoctoberfest * Thank you.
…to longest_substring_without_repeating_characters.cpp * I hope I have done the required changes.
* Added specific edge cases and tests as void tests() and followed the guidelines.
* I hope I have made the necessary changes required. * If there are any changes to make I can do that. * Thank you.
|
* I have done the required changes for the include part. * Thank you.
|
any updates. |
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
LGTM! Thank you so much for this contribution.
Thank you. |
I would like to help you by adding sliding window algorithms one of them is a famous question asked in interviews that is "Longest Substring Without Repeating Characters".
I hope this helps the community.
Thank you.
Description of Change
Checklist
Notes: