Skip to content

Create LongestSubstringWithoutRepeatingCharacters.py #83

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.

Sign up for GitHub

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

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
+33 −0
Open

Create LongestSubstringWithoutRepeatingCharacters.py #83

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
33 changes: 33 additions & 0 deletions GeeksforGeeks/Algorithm/DP/LongestSubstringWithoutRepeatingCharacters.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,33 @@
'''
Given a string S, find the length of its longest substring that does not have any repeating characters.

Example 1:

Input:
S = geeksforgeeks
Output: 7
Explanation: The longest substring
without repeated characters is "ksforge".
Example 2:

Input:
S = abbcdb
Output: 3
Explanation: The longest substring is
"bcd". Here "abcd" is not a substring
of the given string.
'''


def SubsequenceLength(s):
v={}
l=0
maxlen=0
for i in range(len(s)):
if s[i] in v and l<=v[s[i]]:
l=v[s[i]]+1
else:
maxlen=max(maxlen,i-l+1)
v[s[i]]=i
return maxlen