< Summary

Information
Class: LeetCode.Algorithms.RestoreFinishingOrder.RestoreFinishingOrderHashSet
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\RestoreFinishingOrder\RestoreFinishingOrderHashSet.cs
Line coverage
100%
Covered lines: 15
Uncovered lines: 0
Coverable lines: 15
Total lines: 47
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
RecoverOrder(...)100%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\RestoreFinishingOrder\RestoreFinishingOrderHashSet.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.RestoreFinishingOrder;
 13
 14/// <inheritdoc />
 15public class RestoreFinishingOrderHashSet : IRestoreFinishingOrder
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(n)
 20    /// </summary>
 21    /// <param name="orders"></param>
 22    /// <param name="friends"></param>
 23    /// <returns></returns>
 24    public int[] RecoverOrder(int[] orders, int[] friends)
 225    {
 226        var friendsHashSet = new HashSet<int>(friends);
 27
 228        var friendsIndex = 0;
 29
 2430        foreach (var order in orders)
 1031        {
 1032            if (!friendsHashSet.Contains(order))
 533            {
 534                continue;
 35            }
 36
 537            friends[friendsIndex++] = order;
 38
 539            if (friendsIndex == friends.Length)
 240            {
 241                break;
 42            }
 343        }
 44
 245        return friends;
 246    }
 47}