Leetcode 3: Longest Substring Without Repeating Characters

April 1, 2015

Problem statement:

Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest substring is "b", with the length of 1.

Julia's C# practice 

continue to read blogs, and then, write C# code:

Another practice using C#