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

Given a string S, find the largest substring with no repetition i.e. largest substring which contain all unique characters. #11

Open
anmolrishi opened this issue Oct 25, 2018 · 1 comment
Labels
algorithms hacktoberfest Contribute with this issue to participate in hacktoberfest. https://hacktoberfest.digitalocean.com/ strings

Comments

@anmolrishi
Copy link
Owner

No description provided.

@anmolrishi anmolrishi added hacktoberfest Contribute with this issue to participate in hacktoberfest. https://hacktoberfest.digitalocean.com/ algorithms strings labels Oct 25, 2018
@Peng-Qu
Copy link

Peng-Qu commented Oct 26, 2018

I want to try this.

somiljain7 added a commit to somiljain7/ProgrammingHub that referenced this issue Oct 27, 2018
anmolrishi#11 
to find largest sub string with no repetition
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
algorithms hacktoberfest Contribute with this issue to participate in hacktoberfest. https://hacktoberfest.digitalocean.com/ strings
Projects
None yet
Development

No branches or pull requests

2 participants