< Summary

Information
Class: LeetCode.Algorithms.CheckIfNumberIsSumOfPowersOfThree.CheckIfNumberIsSumOfPowersOfThreeIterative
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\CheckIfNumberIsSumOfPowersOfThree\CheckIfNumberIsSumOfPowersOfThreeIterative.cs
Line coverage
100%
Covered lines: 11
Uncovered lines: 0
Coverable lines: 11
Total lines: 37
Line coverage: 100%
Branch coverage
100%
Covered branches: 4
Total branches: 4
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
CheckPowersOfThree(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\CheckIfNumberIsSumOfPowersOfThree\CheckIfNumberIsSumOfPowersOfThreeIterative.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.CheckIfNumberIsSumOfPowersOfThree;
 13
 14/// <inheritdoc />
 15public class CheckIfNumberIsSumOfPowersOfThreeIterative : ICheckIfNumberIsSumOfPowersOfThree
 16{
 17    /// <summary>
 18    ///     Time complexity - O(1)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="n"></param>
 22    /// <returns></returns>
 23    public bool CheckPowersOfThree(int n)
 324    {
 9625        for (var i = 14; i >= 0; i--)
 4526        {
 4527            var pow = (int)Math.Pow(3, i);
 28
 4529            if (n - pow >= 0)
 830            {
 831                n -= pow;
 832            }
 4533        }
 34
 335        return n == 0;
 336    }
 37}