AI coding assistant for busy programmers

All

JavaScript

How do you find the length of the longest substring without repeating characters in C#

C#

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace ConsoleApplication1
{
    class Program
    {

static void Main(string[] args)
        {

string s = "abcabcbb";

int max = 0, i = 0, j = 0, n = s.Length;

HashSet<char> set = new HashSet<char>();

while (i < n && j < n)

{

if (!set.Contains(s[j]))

{

set.Add(s[j++]);

max = Math.Max(max, j - i);

}

else set.Remove(s[i++]);

} return max;  // 3  abc  bca  cbb   abcabcbb   bbbbbb   pwwkew   dvdf  tmmzuxt  aab   aabaab!bb    aaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaabbbbaaaccccccccccccccccccdddddddddddddddddeeeeeeeeeeeeeeeeeeffffffffffffffffffgggggggggggggggghhhhhhhhhhhhhhhhiiiiiiiiiiiiiijjjjjjjjjjjjjjkkkkkkkkkkkkklllllllllllllmmmmmmmmmmmmmmnnnnnnnnnnnnnoooooooooooooopppppppppppppqqqqqqqqqqqqqrrrrrrrrrrrrrssssssssssssttttttttttttuuuuuuuuuuuvvvvvvvvvvvvwwwwwwwwwwwxxxxxxxxxxyyyyyyyyyyyzzzzzzzzzzzaaaaaaaaaaaabbbbbbbbbbbcdefghijklmnopqrstuvwxyz0123456789!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~ abcdefghijklmnopqrstuvwxyz0123456789!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~ abcdefghijklmnopqrstuvwxyz0123456789!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~ abcdefghijklmnopqrstuvwxyz0123456789!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~ abcdefghijklmnopqrstuvwxyz0123456789!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~ abcdefghijklmnopqrstuvwxyz0123456789!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~ abcdefghijklmnopqrstuvwxyz0123456789!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~ abcdefghijklmnopqrstuvwxyz0123456789!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~ abcdefghijklmnopqrstuvwxyz0123456789!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~ "); // 95  "); // 95  "); // 95  "); // 95  "); // 95  "); // 95  "); // 95  "); // 95  "); // 95   */

🤖 Code Explanation

This code finds the longest substring in a given string s with no repeating characters. It does this by using a HashSet to keep track of the characters seen so far. If a character is seen more than once, it is removed from the HashSet and the left pointer is incremented. If a character is seen for the first time, it is added to the HashSet and the right pointer is incremented. The longest substring is the maximum of the right pointer minus the left pointer.

AI coding assistant for busy programmers

How do you find the length of the longest substring without repeating characters in C#

C#

🤖 Code Explanation

More problems solved in C#