< Summary

Information
Class: LeetCode.Algorithms.UncommonWordsFromTwoSentences.UncommonWordsFromTwoSentencesHashSet
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\UncommonWordsFromTwoSentences\UncommonWordsFromTwoSentencesHashSet.cs
Line coverage
100%
Covered lines: 19
Uncovered lines: 0
Coverable lines: 19
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
UncommonFromSentences(...)100%88100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\UncommonWordsFromTwoSentences\UncommonWordsFromTwoSentencesHashSet.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.UncommonWordsFromTwoSentences;
 13
 14/// <inheritdoc />
 15public class UncommonWordsFromTwoSentencesHashSet : IUncommonWordsFromTwoSentences
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n + m)
 19    ///     Space complexity - O(n + m)
 20    /// </summary>
 21    /// <param name="s1"></param>
 22    /// <param name="s2"></param>
 23    /// <returns></returns>
 24    public string[] UncommonFromSentences(string s1, string s2)
 425    {
 426        var once = new HashSet<string>();
 427        var moreThanOnce = new HashSet<string>();
 28
 4229        foreach (var word in s1.Split(' '))
 1530        {
 1531            if (!once.Add(word))
 532            {
 533                moreThanOnce.Add(word);
 534            }
 1535        }
 36
 3437        foreach (var word in s2.Split(' '))
 1138        {
 1139            if (!once.Add(word))
 740            {
 741                moreThanOnce.Add(word);
 742            }
 1143        }
 44
 445        return once.Except(moreThanOnce).ToArray();
 446    }
 47}