Given a string S, find the length of the longest substring without repeating characters.

Example 1:

Input: s = "abcabcbb"
Output: 3
Explanation: The answer is "abc", with the length of 3.


Example 2:

Input: s = "bbbbb"
Output: 1
Explanation: The answer is "b", with the length of 1.


Example 3:

Input: s = "pwwkew"
Output: 3
Explanation: The answer is "wke", with the length of 3.

Notice that the answer must be a substring, "pwke" is a subsequence and not a substring.

Python Solution

class Solution(object):
    def lengthOfLongestSubstring(self, s):
        """
        :type s: str
        :rtype: int
        """
        if(len(s)==0):
            return 0
        listSize=[]
        temp=""
        for i in range(len(s)):
            temp=""
            for j in range(i,len(s)):
                #if element present in string break
                if s[j] in temp:
                    break
                else:
                    temp=temp+s[j]
            listSize.append(len(temp))
        if len(listSize)>=1:
            return max(listSize)
        return len(s)
        

Happy

0 0 %

Sad

0 0 %

Excited

0 0 %

Sleepy

0 0 %

Angry

0 0 %

Surprise

1 100 %