< Summary

Information
Class: LeetCode.Algorithms.CircularSentence.CircularSentenceIterative
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\CircularSentence\CircularSentenceIterative.cs
Line coverage
84%
Covered lines: 11
Uncovered lines: 2
Coverable lines: 13
Total lines: 42
Line coverage: 84.6%
Branch coverage
83%
Covered branches: 5
Total branches: 6
Branch coverage: 83.3%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
IsCircularSentence(...)83.33%6684.61%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\CircularSentence\CircularSentenceIterative.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.CircularSentence;
 13
 14/// <inheritdoc />
 15public class CircularSentenceIterative : ICircularSentence
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(m)
 20    /// </summary>
 21    /// <param name="sentence"></param>
 22    /// <returns></returns>
 23    public bool IsCircularSentence(string sentence)
 324    {
 325        var words = sentence.Split(' ');
 26
 327        if (words[0][0] != words[^1][^1])
 128        {
 129            return false;
 30        }
 31
 1032        for (var i = 0; i < words.Length - 1; i++)
 333        {
 334            if (words[i][^1] != words[i + 1][0])
 035            {
 036                return false;
 37            }
 338        }
 39
 240        return true;
 341    }
 42}