< Summary

Information
Class: LeetCode.Algorithms.MinimumNumberOfArrowsToBurstBalloons.MinimumNumberOfArrowsToBurstBalloonsIterative
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MinimumNumberOfArrowsToBurstBalloons\MinimumNumberOfArrowsToBurstBalloonsIterative.cs
Line coverage
100%
Covered lines: 14
Uncovered lines: 0
Coverable lines: 14
Total lines: 44
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
FindMinArrowShots(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MinimumNumberOfArrowsToBurstBalloons\MinimumNumberOfArrowsToBurstBalloonsIterative.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.MinimumNumberOfArrowsToBurstBalloons;
 13
 14/// <inheritdoc />
 15public class MinimumNumberOfArrowsToBurstBalloonsIterative : IMinimumNumberOfArrowsToBurstBalloons
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n log n)
 19    ///     Space complexity - O(n)
 20    /// </summary>
 21    /// <param name="points"></param>
 22    /// <returns></returns>
 23    public int FindMinArrowShots(int[][] points)
 424    {
 425        var arrowShotsCount = 1;
 26
 2627        var orderedPoints = points.OrderBy(p => p[1]).ToArray();
 28
 429        var previousPoint = orderedPoints[0];
 30
 5631        foreach (var point in orderedPoints)
 2232        {
 2233            if (point[0] <= previousPoint[1])
 1634            {
 1635                continue;
 36            }
 37
 638            arrowShotsCount++;
 639            previousPoint = point;
 640        }
 41
 442        return arrowShotsCount;
 443    }
 44}