< Summary

Information
Class: LeetCode.Algorithms.RemoveSubFoldersFromTheFilesystem.RemoveSubFoldersFromTheFilesystemHashSet
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\RemoveSubFoldersFromTheFilesystem\RemoveSubFoldersFromTheFilesystemHashSet.cs
Line coverage
100%
Covered lines: 22
Uncovered lines: 0
Coverable lines: 22
Total lines: 54
Line coverage: 100%
Branch coverage
100%
Covered branches: 10
Total branches: 10
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
RemoveSubfolders(...)100%1010100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\RemoveSubFoldersFromTheFilesystem\RemoveSubFoldersFromTheFilesystemHashSet.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.RemoveSubFoldersFromTheFilesystem;
 13
 14/// <inheritdoc />
 15public class RemoveSubFoldersFromTheFilesystemHashSet : IRemoveSubFoldersFromTheFilesystem
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n * m^2)
 19    ///     Space complexity - O(n)
 20    /// </summary>
 21    /// <param name="folders"></param>
 22    /// <returns></returns>
 23    public IList<string> RemoveSubfolders(string[] folders)
 424    {
 425        var result = new List<string>();
 26
 427        var foldersHashSet = new HashSet<string>(folders);
 28
 4629        foreach (var folder in folders)
 1730        {
 1731            var i = 1;
 1732            var add = true;
 33
 5934            while (i < folder.Length)
 4935            {
 4936                if (folder[i] is '/' && foldersHashSet.Contains(folder[..i]))
 737                {
 738                    add = false;
 39
 740                    break;
 41                }
 42
 4243                i++;
 4244            }
 45
 1746            if (add)
 1047            {
 1048                result.Add(folder);
 1049            }
 1750        }
 51
 452        return result;
 453    }
 54}