< Summary

Information
Class: LeetCode.Algorithms.CheckIfAllOnesAreAtLeastLengthKPlacesAway.CheckIfAllOnesAreAtLeastLengthKPlacesAwayIndexTracking
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\CheckIfAllOnesAreAtLeastLengthKPlacesAway\CheckIfAllOnesAreAtLeastLengthKPlacesAwayIndexTracking.cs
Line coverage
100%
Covered lines: 16
Uncovered lines: 0
Coverable lines: 16
Total lines: 47
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
KLengthApart(...)100%88100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\CheckIfAllOnesAreAtLeastLengthKPlacesAway\CheckIfAllOnesAreAtLeastLengthKPlacesAwayIndexTracking.cs

#LineLine coverage
 1// --------------------------------------------------------------------------------
 2// Copyright (C) 2026 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.CheckIfAllOnesAreAtLeastLengthKPlacesAway;
 13
 14/// <inheritdoc />
 15public sealed class CheckIfAllOnesAreAtLeastLengthKPlacesAwayIndexTracking : ICheckIfAllOnesAreAtLeastLengthKPlacesAway
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="nums"></param>
 22    /// <param name="k"></param>
 23    /// <returns></returns>
 24    public bool KLengthApart(int[] nums, int k)
 225    {
 226        var previousIndex = -1;
 27
 3028        for (var i = 0; i < nums.Length; i++)
 1429        {
 1430            if (nums[i] == 0)
 831            {
 832                continue;
 33            }
 34
 635            if (previousIndex < 0 || i - previousIndex - 1 >= k)
 536            {
 537                previousIndex = i;
 538            }
 39            else
 140            {
 141                return false;
 42            }
 543        }
 44
 145        return true;
 246    }
 47}