Longest Non Repeating SubString

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

For example: For “abcadd” is 4 i.e “abcd”

Latest Source Code:
Github: LongestNonRepeatingSubString.java

Output:

String : hdgikkinyyzxycsekxoev, Longest Non Repeating SubString :7
String : hdgikkinyyzxycsekxoev, Longest Non Repeating SubString :7