Solution (leetcode-in-java 1.23 API)

java.lang.Object
- g0001_0100.s0003_longest_substring_without_repeating_characters.Solution

```
public class Solution
extends Object
```
3 - Longest Substring Without Repeating Characters.
Medium

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.

Example 4:

Input: s = ""

Output: 0

Constraints:
- 0 <= s.length <= 5 * 10⁴
- s consists of English letters, digits, symbols and spaces.

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int lengthOfLongestSubstring(String s)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

lengthOfLongestSubstring

public int lengthOfLongestSubstring(String s)