Link to the description of the task: https://leetcode.com/problems/longest-substring-without-repeating-characters/
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| public class Solution | |
| { | |
| public int LengthOfLongestSubstring(string s) | |
| { | |
| var given = s.ToCharArray(); | |
| var charsPositions = new Dictionary<char, int>(); | |
| int startPosition = 0, maxLength = 0; | |
| for (var endPosition = 0; endPosition < given.Count(); endPosition++) | |
| { | |
| var ch = given[endPosition]; | |
| if (!charsPositions.ContainsKey(ch)) | |
| { | |
| charsPositions.Add(ch, endPosition); | |
| maxLength = Math.Max(maxLength, charsPositions.Count); | |
| } | |
| else | |
| { | |
| var prevCharPosition = charsPositions[ch]; | |
| foreach (var charToRemove in given[startPosition..prevCharPosition]) | |
| { | |
| charsPositions.Remove(charToRemove); | |
| } | |
| charsPositions[ch] = endPosition; | |
| startPosition = prevCharPosition + 1; | |
| } | |
| } | |
| return maxLength; | |
| } | |
| } |
by