Longest Substring Without Repeating Characters
Suppose given input is "abacb", then the length of the longest substring without repeating characters will be 3 ("acb").
Each input contains a single line which contains the string 'S', Where 'S' denotes the input string containing english letters ( both UpperCase and LowerCase), digits, symbols, and spaces.
Print a single integer denoting the length of the longest substring without repeating characters.
You do not need to print anything, it has already been taken care of. Just implement the given function.
0 <= L <= 10^5 Time limit: 1 sec
Can you solve this problem in O(L) time and space complexity?
Find The Single Element
Search In A Sorted 2D Matrix
Fake Coin Problem