< Summary

Information
Class: LeetCode.Algorithms.LongestSubstringWithoutRepeatingCharacters.LongestSubstringWithoutRepeatingCharactersSlidingWindow
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\LongestSubstringWithoutRepeatingCharacters\LongestSubstringWithoutRepeatingCharactersSlidingWindow.cs
Line coverage
100%
Covered lines: 15
Uncovered lines: 0
Coverable lines: 15
Total lines: 44
Line coverage: 100%
Branch coverage
100%
Covered branches: 4
Total branches: 4
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
LengthOfLongestSubstring(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\LongestSubstringWithoutRepeatingCharacters\LongestSubstringWithoutRepeatingCharactersSlidingWindow.cs

#LineLine coverage
 1// --------------------------------------------------------------------------------
 2// Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv).
 3// All Rights Reserved.
 4// --------------------------------------------------------------------------------
 5// This software is the confidential and proprietary information of Eugene Eremeev
 6// (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not
 7// disclose such Confidential Information and shall use it only in accordance with
 8// the terms of the license agreement you entered into with Eugene Eremeev (also
 9// known as Yevhenii Yeriemeieiv).
 10// --------------------------------------------------------------------------------
 11
 12namespace LeetCode.Algorithms.LongestSubstringWithoutRepeatingCharacters;
 13
 14/// <inheritdoc />
 15public class LongestSubstringWithoutRepeatingCharactersSlidingWindow : ILongestSubstringWithoutRepeatingCharacters
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(n)
 20    /// </summary>
 21    /// <param name="s"></param>
 22    /// <returns></returns>
 23    public int LengthOfLongestSubstring(string s)
 524    {
 525        var maxLength = 0;
 26
 527        var left = 0;
 28
 529        var charDictionary = new Dictionary<char, int>();
 30
 7031        for (var right = 0; right < s.Length; right++)
 3032        {
 3033            if (!charDictionary.TryAdd(s[right], right))
 1534            {
 1535                left = Math.Max(left, charDictionary[s[right]] + 1);
 1536            }
 37
 3038            charDictionary[s[right]] = right;
 3039            maxLength = Math.Max(maxLength, right - left + 1);
 3040        }
 41
 542        return maxLength;
 543    }
 44}