< Summary

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

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
MinimumIndex(...)100%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MinimumCapacityBox\MinimumCapacityBoxIterative.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.MinimumCapacityBox;
 13
 14/// <inheritdoc />
 15public sealed class MinimumCapacityBoxIterative : IMinimumCapacityBox
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="capacities"></param>
 22    /// <param name="itemSize"></param>
 23    /// <returns></returns>
 24    public int MinimumIndex(int[] capacities, int itemSize)
 325    {
 326        var minCapacity = int.MaxValue;
 27
 328        var result = -1;
 29
 2430        for (var i = 0; i < capacities.Length; i++)
 931        {
 932            var capacity = capacities[i];
 33
 934            if (capacity < itemSize || capacity >= minCapacity)
 635            {
 636                continue;
 37            }
 38
 339            minCapacity = capacity;
 40
 341            result = i;
 342        }
 43
 344        return result;
 345    }
 46}