Substring Without Repeating Characters :
Difficulty Level : Medium
Submissions : 235
Asked In :
Marks :30
: 3 | : 0
Given a string $$$s$$$, find the length of the longest substring without repeating characters.
Input
The first line contains an integer $$$n$$$ denoting the length of the string. The second line contains a string $$$s$$$ consisting of English letters, digits, and symbols.$$$(1\le n \le 5 \cdot 10^4).$$$
Output
Output the longest substring without repeating characters
Examples
Input
9 abcgracse
Output
6
Input
4 okuo
Output
3
Input
8 abcAacbB
Output
5
Input
5 bbbbb
Output
1
Input
6 $dgr$4
Output
5
