< Summary

Information
Class: LeetCode.Algorithms.TupleWithSameProduct.TupleWithSameProductDictionary
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\TupleWithSameProduct\TupleWithSameProductDictionary.cs
Line coverage
100%
Covered lines: 17
Uncovered lines: 0
Coverable lines: 17
Total lines: 48
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
TupleSameProduct(...)100%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\TupleWithSameProduct\TupleWithSameProductDictionary.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.TupleWithSameProduct;
 13
 14/// <inheritdoc />
 15public class TupleWithSameProductDictionary : ITupleWithSameProduct
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n^2)
 19    ///     Space complexity - O(n^2)
 20    /// </summary>
 21    /// <param name="nums"></param>
 22    /// <returns></returns>
 23    public int TupleSameProduct(int[] nums)
 324    {
 325        var count = 0;
 26
 327        var frequencyDictionary = new Dictionary<int, int>();
 28
 3029        for (var i = 0; i < nums.Length - 1; i++)
 1230        {
 8631            for (var j = i + 1; j < nums.Length; j++)
 3132            {
 3133                var product = nums[i] * nums[j];
 34
 3135                if (frequencyDictionary.TryAdd(product, 1))
 2436                {
 2437                    continue;
 38                }
 39
 740                count += frequencyDictionary[product] * 8;
 41
 742                frequencyDictionary[product]++;
 743            }
 1244        }
 45
 346        return count;
 347    }
 48}