Create Longest_Substring_Without_Repeating_Characters.cpp #12
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Added a new solution file Longest_Substring_Without_Repeating_Characters.cpp, which implements a C++ program to find the length of the longest substring without repeating characters in a given string. This program uses a sliding window approach along with a hash map to store the last seen index of each character, allowing for efficient tracking of unique substrings. The code takes user input for the string and outputs the maximum length of any substring without duplicate characters. Comments and an example are included for clarity.
|
👋 @RohithaAiswarya16 |
iamwatchdogs
requested changes
Nov 1, 2024
Contributor
iamwatchdogs
left a comment
iamwatchdogs
left a comment
There was a problem hiding this comment.
Please make the required changes so that linting checks would pass.
...st_Substring_Without_Repeating_Characters/Longest_Substring_Without_Repeating_Characters.cpp
Show resolved
Hide resolved
…/Longest_Substring_Without_Repeating_Characters.cpp Co-authored-by: Shamith <[email protected]>
Contributor
Author
|
Thank you for the updated code! I’ve applied all the suggested changes and pushed the updates. Please review and let me know if further adjustments are needed. |
iamwatchdogs
approved these changes
Nov 1, 2024
Contributor
iamwatchdogs
left a comment
iamwatchdogs
left a comment
There was a problem hiding this comment.
Reviewed and Approved by @iamwatchdogs.
|
Thank you for contributing @RohithaAiswarya16. Make sure to check your contribution on GitHub Pages. |
iamwatchdogs
added
the
hacktoberfest-accepted
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Added a new solution file Longest_Substring_Without_Repeating_Characters.cpp, which implements a C++ program to find the length of the longest substring without repeating characters in a given string. This program uses a sliding window approach along with a hash map to store the last seen index of each character, allowing for efficient tracking of unique substrings.
The code takes user input for the string and outputs the maximum length of any substring without duplicate characters. Comments and an example are included for clarity.