< Summary

Information
Class: LeetCode.Algorithms.FindAllKDistantIndicesInAnArray.FindAllKDistantIndicesInAnArrayBruteForce
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FindAllKDistantIndicesInAnArray\FindAllKDistantIndicesInAnArrayBruteForce.cs
Line coverage
100%
Covered lines: 14
Uncovered lines: 0
Coverable lines: 14
Total lines: 46
Line coverage: 100%
Branch coverage
100%
Covered branches: 8
Total branches: 8
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
FindKDistantIndices(...)100%88100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FindAllKDistantIndicesInAnArray\FindAllKDistantIndicesInAnArrayBruteForce.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.FindAllKDistantIndicesInAnArray;
 13
 14/// <inheritdoc />
 15public class FindAllKDistantIndicesInAnArrayBruteForce : IFindAllKDistantIndicesInAnArray
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n^2)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="nums"></param>
 22    /// <param name="key"></param>
 23    /// <param name="k"></param>
 24    /// <returns></returns>
 25    public IList<int> FindKDistantIndices(int[] nums, int key, int k)
 226    {
 227        var result = new List<int>();
 28
 2829        for (var i = 0; i < nums.Length; ++i)
 1230        {
 8631            for (var j = 0; j < nums.Length; ++j)
 4232            {
 4233                if (nums[j] != key || Math.Abs(i - j) > k)
 3134                {
 3135                    continue;
 36                }
 37
 1138                result.Add(i);
 39
 1140                break;
 41            }
 1242        }
 43
 244        return result;
 245    }
 46}