Check whether string can be created by keep repeating one substring.
Given a non-empty string check if it can be constructed by taking a substring of it and appending multiple copies of the substring together. You may assume the given string consists of lowercase English letters only and its length will not exceed 10000.
Input: "abab" Output: True
Explanation: It’s the substring “ab” twice.
Input: "aba" Output: False
Input: "abcabcabcabc" Output: True
Explanation: It’s the substring “abc” four times. (And the substring “abcabc” twice.)
Credits To: leetcode.com
Leave me comments, if you have better ways to solve.
## Blog link: https://code.dennyzhang.com/repeated-substring-pattern class Solution: def repeatedSubstringPattern(self, s): """ :type s: str :rtype: bool """ if len(s) == 0: return False return s in (s+s)[1:-1]