< Summary

Information
Class: LeetCode.Algorithms.FindAllNumbersDisappearedInArray.FindAllNumbersDisappearedInArrayHashSet
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FindAllNumbersDisappearedInArray\FindAllNumbersDisappearedInArrayHashSet.cs
Line coverage
100%
Covered lines: 12
Uncovered lines: 0
Coverable lines: 12
Total lines: 39
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
FindDisappearedNumbers(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FindAllNumbersDisappearedInArray\FindAllNumbersDisappearedInArrayHashSet.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.FindAllNumbersDisappearedInArray;
 13
 14/// <inheritdoc />
 15public class FindAllNumbersDisappearedInArrayHashSet : IFindAllNumbersDisappearedInArray
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(n)
 20    /// </summary>
 21    /// <param name="nums"></param>
 22    /// <returns></returns>
 23    public IList<int> FindDisappearedNumbers(int[] nums)
 224    {
 225        var hashSet = new HashSet<int>(nums);
 26
 227        var result = new List<int>();
 28
 2429        for (var i = 1; i <= nums.Length; i++)
 1030        {
 1031            if (!hashSet.Contains(i))
 332            {
 333                result.Add(i);
 334            }
 1035        }
 36
 237        return result;
 238    }
 39}