< Summary

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

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MaximumValueOfAnOrderedTriplet1\MaximumValueOfAnOrderedTriplet1BruteForce.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.MaximumValueOfAnOrderedTriplet1;
 13
 14/// <inheritdoc />
 15public class MaximumValueOfAnOrderedTriplet1BruteForce : IMaximumValueOfAnOrderedTriplet1
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n^3)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="nums"></param>
 22    /// <returns></returns>
 23    public long MaximumTripletValue(int[] nums)
 424    {
 425        long maximumTripletValue = 0;
 26
 2427        for (var i = 0; i < nums.Length - 2; i++)
 828        {
 4429            for (var j = i + 1; j < nums.Length - 1; j++)
 1430            {
 7231                for (var k = j + 1; k < nums.Length; k++)
 2232                {
 2233                    var tripletValue = (long)(nums[i] - nums[j]) * nums[k];
 34
 2235                    maximumTripletValue = Math.Max(maximumTripletValue, tripletValue);
 2236                }
 1437            }
 838        }
 39
 440        return maximumTripletValue;
 441    }
 42}