< Summary

Information
Class: LeetCode.Algorithms.RepeatedSubstringPattern.RepeatedSubstringPatternIterative
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\RepeatedSubstringPattern\RepeatedSubstringPatternIterative.cs
Line coverage
100%
Covered lines: 12
Uncovered lines: 0
Coverable lines: 12
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
RepeatedSubstringPattern(...)100%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\RepeatedSubstringPattern\RepeatedSubstringPatternIterative.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.RepeatedSubstringPattern;
 13
 14/// <inheritdoc />
 15public class RepeatedSubstringPatternIterative : IRepeatedSubstringPattern
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n^2)
 19    ///     Space complexity - O(n)
 20    /// </summary>
 21    /// <param name="s"></param>
 22    /// <returns></returns>
 23    public bool RepeatedSubstringPattern(string s)
 324    {
 1625        for (var i = 1; i < s.Length; i++)
 726        {
 727            if (s.Length % i != 0)
 128            {
 129                continue;
 30            }
 31
 3132            if (s.Where((t, j) => t != s[..i][j % i]).Any())
 433            {
 434                continue;
 35            }
 36
 237            return true;
 38        }
 39
 140        return false;
 341    }
 42}