< Summary

Information
Class: LeetCode.Algorithms.RichestCustomerWealth.RichestCustomerWealthLinq
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\RichestCustomerWealth\RichestCustomerWealthLinq.cs
Line coverage
100%
Covered lines: 3
Uncovered lines: 0
Coverable lines: 3
Total lines: 27
Line coverage: 100%
Branch coverage
N/A
Covered branches: 0
Total branches: 0
Branch coverage: N/A
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
MaximumWealth(...)100%11100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\RichestCustomerWealth\RichestCustomerWealthLinq.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.RichestCustomerWealth;
 13
 14/// <inheritdoc />
 15public class RichestCustomerWealthLinq : IRichestCustomerWealth
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n * m)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="accounts"></param>
 22    /// <returns></returns>
 23    public int MaximumWealth(int[][] accounts)
 324    {
 1125        return accounts.Select(account => account.Sum()).Max();
 326    }
 27}

Methods/Properties

MaximumWealth(System.Int32[][])