-
Notifications
You must be signed in to change notification settings - Fork 1.6k
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
Length of Longest sub array without repeating characters (Window Sliding) #8699
Open
yellowberard
wants to merge
8
commits into
girlscript:Competitive_Programming
Choose a base branch
from
yellowberard:Competitive_Programming
base: Competitive_Programming
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
Length of Longest sub array without repeating characters (Window Sliding) #8699
yellowberard
wants to merge
8
commits into
girlscript:Competitive_Programming
from
yellowberard:Competitive_Programming
Conversation
This file contains 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
@ravireddy07 Please review my PR. |
ravireddy07
suggested changes
Nov 28, 2021
Comment on lines
+5
to
+9
## Explanation | ||
In this program we are using the concept of Window sliding i.e. Whenever we see repetition, we remove the previous occurrence and slide the window. | ||
A loop is runniig from i=0 to n=sizeof(str). | ||
In side this loop one more loop is running from j=i till n. | ||
We define vector with all the value as false and keep it makin true for the characters that are visited once in the loop. |
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.
Please explain the approach in detail with snippet examples as this is a basic problem.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
Description 📜
To find the Length of Longest sub array without repeating characters by Window Sliding method.
Fixes #1283
Type of change 📝
Domain of Contribution 📊
Checklist ✅