< Summary

Information
Class: LeetCode.Algorithms.KthDistinctStringInAnArray.KthDistinctStringInAnArrayDictionary
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\KthDistinctStringInAnArray\KthDistinctStringInAnArrayDictionary.cs
Line coverage
100%
Covered lines: 21
Uncovered lines: 0
Coverable lines: 21
Total lines: 53
Line coverage: 100%
Branch coverage
100%
Covered branches: 10
Total branches: 10
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
KthDistinct(...)100%1010100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\KthDistinctStringInAnArray\KthDistinctStringInAnArrayDictionary.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.KthDistinctStringInAnArray;
 13
 14/// <inheritdoc />
 15public class KthDistinctStringInAnArrayDictionary : IKthDistinctStringInAnArray
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(n)
 20    /// </summary>
 21    /// <param name="arr"></param>
 22    /// <param name="k"></param>
 23    /// <returns></returns>
 24    public string KthDistinct(string[] arr, int k)
 325    {
 326        var countDictionary = new Dictionary<string, int>();
 27
 3328        foreach (var item in arr)
 1229        {
 1230            if (!countDictionary.TryAdd(item, 1))
 331            {
 332                countDictionary[item]++;
 333            }
 1234        }
 35
 2736        foreach (var item in arr)
 1037        {
 1038            if (countDictionary[item] != 1)
 639            {
 640                continue;
 41            }
 42
 443            k--;
 44
 445            if (k == 0)
 246            {
 247                return item;
 48            }
 249        }
 50
 151        return string.Empty;
 352    }
 53}