# https://leetcode.com/problems/repeated-substring-pattern/
#
# 459. Repeated Substring Pattern
#
# Given a string s, check if it can be constructed by taking a substring of
# it and appending multiple copies of the substring together.

# Example 1:
#
# Input: s = "abab"
# Output: true
# Explanation: It is the substring "ab" twice.
#
# Example 2:
#
# Input: s = "aba"
# Output: false
#
# Example 3:
#
# Input: s = "abcabcabcabc"
# Output: true
# Explanation: It is the substring "abc" four times or the substring "abcabc" twice.


def repeatedSubstringPattern(s: str) -> bool:
    for n_chars in range(1, len(s) + 1):
        if n_chars == len(s):
            continue
        if s.count(s[0:n_chars]) * len(s[0:n_chars]) == len(s):
            return True
    return False