Check if a string is entirely made of the same substring

Question

This is taken from this question (with permission ofcourse). I'll quote:

Create a function which takes a string, and it should return true or false based on whether the input consists of only a repeated character sequence. The length of given string is always greater than 1 and the character sequence must have at least one repetition.

Some examples:

'aa' //true
'aaa' //true
'abcabcabc' //true
'aba' //false
'ababa' //false
'weqweqweqweqweqw' // false

Specifically, the check for a string strictly composed of repeating substrings (Update) can output any true or false representation, but no error output please. Strictly alphhanumeric strings. Otherwise standard code golf rules. This is Code Golf, so shortest answer in bytes for each language wins.

Answer 1

Brachylog, 4 3 bytes

ġ=Ṁ

Try it online!

Explanation

ġ=Ṁ    Implicit input, say "abcabc"
ġ      Split into chunks of equal lengths (except maybe the last one): ["abc","abc"]
 =     Apply the constraint that all of the chunks are equal,
  Ṁ    and that there are multiple of them.

The program prints true. if the constraints can be satisfied, and false. if not.

Answer 2

JavaScript (ES6), 22 bytes

Returns a Boolean value.

s=>/^(.*)\1+$/.test(s)

Try it online!

---

Without a regular expression,  33  29 bytes

Returns either null (falsy) or an object (truthy).

s=>(s+s).slice(1,-1).match(s)

Try it online!

NB: Technically, \$s\$ is converted to a regular expression for match(), so the above title is a lie.

Answer 3

grep, 19

grep -qxE '(.+)\1+'

Test

while read; do 
  <<<"$REPLY" grep -qxE '(.+)\1+' && t="true" || t="false"
  echo "$REPLY: $t"
done < infile 

Output:

aa: true
aaa: true
abcabcabc: true
aba: false
ababa: false
weqweqweqweqweqw: false

Answer 4

Japt, 6 bytes

²é ¤øU

Saved one byte thanks to @Shaggy

Try it online!

        Implicit input, stored in variable 'U'
²       U+U, "abcabc" -> "abcabcabcabc"
 é      Rotate 1 char to the right "abcabcabcabc" -> "cabcabcabcab"
   ¤    Remove first two chars, "cabcabcabcab" -> "bcabcabcab"
    øU  Check if U is in the above

Answer 5

Java, 25 24 bytes

-1 byte thanks to Olivier Grégoire!
Boring regex answer

s->s.matches("(.+)\\1+")

Try it online!

It's just 1 byte longer than the python answer aaaaa I'm tied now :)

Answer 6

Excel, 26 bytes

=FIND(A1,A1&A1,2)<=LEN(A1)

Inputs from A1, outputs to whatever cell you put this formula.

Answer 7

R, 28 bytes

grepl("(.+)\\1+$",scan(,''))

Try it online!

Simple Regex version. R is (sometimes) very similar to Python, so this is similar to TFeld's Python 2 regex answer, albeit shorter!

Question (if anyone knows the answer)

I am still confused why this works, as the substring can be any length and will always work, and still works when I add a letter to the front of a valid string, like "cABABABABAB". If I personally read the regex, I see (.+), which captures any group of any length. And then \\1+$ which repeats the captured group any number of times until the end.

So why doesn't it capture just "AB" and find that it is repeated until the end of the string, especially since there is no restriction specified as to where the substring can start?

Answer 8

Retina 0.8.2, 9 bytes

^(.+)\1+$

Try it online! Link includes test cases.

Answer 9

Jelly,  5  4 bytes

I see now that the optimal way is to follow xnor's method!

Ḋ;Ṗw

A monadic Link that accepts a list of characters and outputs an integer - the shortest possible length of a repeating slice or zero if none exists. Note that zero is falsey while non-zero numbers are truthy in Jelly.

Try it online!

How?

Ḋ;Ṗw - Link: list of characters, S   e.g. "abcabcabc"   or "abababa"
Ḋ    - dequeue S                           "bcabcabc"       "bababa"
  Ṗ  - pop from S                         "abcabcab"       "ababab"
 ;   - concatenate                "bcabcabcabcabcab"       "bababaababab"
   w - first index of sublist     3  ^---here!             0  (not found)

Answer 10

Python 2, 24 bytes

lambda s:s in(s*2)[1:-1]

Try it online!

Shamelessly stolen from xnor's answer to the original question.

---

More intuitive version:

Python 2, 59 55 53 bytes

lambda s:s in[len(s)/i*s[:i]for i in range(1,len(s))]

Try it online!

---

Boring regex version:

Python 2, 44 bytes

lambda s:re.match(r'(.+)\1+$',s)>0
import re

Try it online!

Answer 11

Perl 5 -p, 14 bytes

$_=/^(.*)\1+$/

Try it online!

Answer 12

Pyke, 4 bytes

+tO{

Try it here!

+    -    input+input
 t   -   ^[1:]
  O  -  ^[:-1]
   { - input in ^

Answer 13

Wolfram Language (Mathematica), 24 23 bytes

StringMatchQ[x__..~~x_]

Try it online!

StringMatchQ[           (*a function that checks if its input (string) matches:*)
             x__..      (*a sequence of one or more characters, repeated one or more times*)
                  ~~x_] (*and one more time*)

Answer 14

J, ^{26 25 15} 14 bytes

Using xnor method

+./@E.}:@}.@,~

Try it online!

original (two different approaches)

J, 25 bytes

1<1#.(#%#\)=<\+/@E.&:>"{]

Try it online!

J, 26 bytes

1<1#.-@#\([:(-:##{.)<\)"{]

Try it online!

Answer 15

PowerShell, 23 24 bytes

+1 byte to fully match rules

"$args"-match"^(.+)\1+$"

Try it online!

Pretty boring. Based on the other Regex answers. Luckily PowerShell doesn't use \ as an escape character!

Answer 16

05AB1E, 5 bytes

xnor's method from the previous question appears to be optimal in 05AB1E as well.

«¦¨så

Try it online! or as a Test Suite

Explanation

«       # append input to input
 ¦¨     # remove the first and last character of the resulting string
   så   # check if the input is in this string

Answer 17

C# (Visual C# Interactive Compiler), 70 bytes

xnor's shameless adaptation (46 bytes)

s=>(s+s).Substring(1,s.Length*2-2).Contains(s)

My non Regex Solution:

s=>s.Select((x,y)=>y).Count(z=>s.Replace(s.Substring(0,z+1),"")=="")>1

Explanation:

Replace every possible substring that starts at index 0 with an empty string. If the result is an empty string, the string is entirely made of that substring. Since this includes evaluating the entire string with itself, the amount of expected results must be greater than 1.

Example: abcabc

Possible substrings starting at index 0:

'a', 'ab', 'abc', 'abca', 'abcab', 'abcabc'

If we replace them with empty strings

Substring          Result

'a'         =>     'bcbc'
'ab'        =>     'cc'
'abc'       =>     ''
'abca'      =>     'bc'
'abcab'     =>     'c'
'abcabc'    =>     ''

Since there is a substring other than 'abcabc' that returns an empty string, the string is entirely made of another substring ('abc')

Try it online!

Answer 18

Python 3, 62 60 56 54 bytes

-4 bytes thanx to ArBo

lambda s:s in(len(s)//l*s[:l]for l in range(1,len(s)))

1. Iterate over all possible prefixes in the string.
2. Try to build the string out of the prefix.
3. Return whether this succeeds with any prefix at all.

Try it online!

Answer 19

Japt, 10 bytes

Returns a positive number if truthy and 0 if falsey. If you want a bool output just add -¡ flag

å+ k@rXÃÊÉ

---

å+ k@rXÃÊÉ      Full program. Implicit input U.
                    e.g: U = "abcabcabc"
å+              Take all prefixes 
                         U = ["a","ab","abc","abca","abcab","abcabc","abcabca","abcabcab","abcabcabc"]
   k@           Filter U by:
     rXÃ        Values that return false (empty string)
                when replacing each prefix in U
                e.g: ["bcbcbc","ccc","","bcabc","cabc","abc","bc","c",""]
                                take ↑                             and ↑
                     U = ["abc","abcabcabc"]
         ÊÉ     Get U length and subtract 1. Then return the result

Try it online!

Answer 20

Husk, 6 bytes

Ṡ€ȯhtD

Try it online!

I feel like this is one byte more than optimal, but I couldn't find an arrangement that made the explicit composition ȯ unnecessary.

Explanation

Ṡ€      Find the argument in the result of applying the following function to the argument
  ȯhtD  Duplicate the argument, then remove the first and last elements.

Answer 21

Mathematica 11.x, 74 bytes

{}!=StringCases[#,StartOfString~~x__/;(x!=#&&StringReplace[#,x->""]=="")]&

where, throughout, # represents the input string, and

StringCases[#,<pattern>]

finds substrings of the input string matching the pattern

StartOfString~~x__/;(x!=#&&StringReplace[#,x->""]=="") 

This pattern requires matches, x, must start at the start of the string and must satisfy the condition that (1) the match is not the whole input string and (2) if we replace occurrences of the match in the input string with the empty string we obtain the empty string. Finally, comparing the list of matches to the empty list,

{}!=

is True if the list of matches is nonempty and False if the list of matches is empty.

Test cases:

{}!=StringCases[#,StartOfString~~x__/;(x!=#&&StringReplace[#,x->""]=="")]&["aa"]
(*  True  *)
{}!=StringCases[#,StartOfString~~x__/;(x!=#&&StringReplace[#,x->""]=="")]&["aaa"]
(*  True  *)
{}!=StringCases[#,StartOfString~~x__/;(x!=#&&StringReplace[#,x->""]=="")]&["abcabc"]
(*  True  *)

and

{}!=StringCases[#,StartOfString~~x__/;(x!=#&&StringReplace[#,x->""]=="")]&["aba"]
(*  False  *)
{}!=StringCases[#,StartOfString~~x__/;(x!=#&&StringReplace[#,x->""]=="")]&["ababa"]
(*  False  *)
{}!=StringCases[#,StartOfString~~x__/;(x!=#&&StringReplace[#,x->""]=="")]&["weqweqweqweqweqw"]
(*  False  *)

Answer 22

Python 3, 84 bytes

import textwrap
lambda s:any(len(set(textwrap.wrap(s,l)))<2 for l in range(1,len(s)))

Uses textwrap.wrap (thanks to this answer) to split the string into pieces of length n to test each possible length of repeating substring. The split pieces are then compared to each other by adding them to a set. If all of the pieces are equal, and the set is of length 1, then the string must be a repeating string. I used <2 instead of ==1 because it saves a byte, and the length of the input string was guaranteed to be greater than zero.

If there is no n for which repeating substrings of length n make up the entire string, then return false for the whole function.

Answer 23

C++ (gcc), 36 bytes

#define f(x)(x+x).find(x,1)<x.size()

Try it online!

Another port of xnor's solution. Uses a macro to expand the argument into the expression. The argument is assumed to be of type std::string.

Answer 24

Clean, 73 bytes

Doesn't use regex.

import StdEnv,Data.List
$s=or[isPrefixOf s(cycle t)\\t<-tl(tails s)|t>[]]

Try it online!

Defines $ :: [Char] -> Bool.
Checks if the given string is a prefix of the repetition of any sub-string taken from the end.

Answer 25

GNU Bash, 28 bytes

[[ ${1:1}${1::-1} == *$1* ]]

Save the above script into a file, and run bash file.sh "string to test".

Exit code 0 is truthy and non-zero is falsy. (as all Unix shells would interpret)

Answer 26

T-SQL, 47 bytes

Using @Xnor's method:

DECLARE @ varchar(max)='ababab'

PRINT sign(charindex(@,left(@+@,len(@)*2-1),2))

Keeping old answer as it contains some nice golfing(67 bytes):

DECLARE @y varchar(max)='abababa'

,@ INT=0WHILE
replace(@y,left(@y,@),'')>''SET
@+=1PRINT @/len(@y)^1

Explanation: This script is repeatingly trying to replace the input '@y' with the first '@' characters of the input '@y' with nothing, while increasing '@'.

if you replace 'ab' in 'ababab' with nothing you have an empty string

Eventually the result will be empty. If this happens when the loop variable is equal to the length of the varchar, the criteria is false/0 because '@'=len(@y) (there was no repeating varchar).

iif(@=len(@y),0,1)

can be golfed into this

@/len(@y)^1

because the length of '@y' can not be 0 and '@' will never exceed the length @y.

Try it online

Answer 27

QlikView Variable, 27 bytes

This should be defined as a variable, which then allows you to pass parameters, e.g. $1 as your input value.

It returns 0 or -1 (equivalent to QlikView's TRUE() function).

=substringcount($1&$1,$1)>2

Answer 28

Swift, 196 bytes

func r(s:String)->Bool{guard let k=s.dropFirst().firstIndex(where:{$0==s.first}) else{return false};let v=s[...k].dropLast();var w=v;while s.hasPrefix(w) && s.count>=(w+v).count{w+=v};return s==w}

Try it online!

Answer 29

Icon, 46 bytes

procedure f(s);return find(s,(s||s)[2:-1]);end

Try it online!

Another port of xnor's solution.

Answer 30

K (oK), 29 bytes

{0<+/(1=#?:)'(0N,'1_!#x)#\:x}

Try it online!

Answer 31

Red, 72 bytes

func[s][repeat i length? s[parse s[copy t i skip some t end(return 1)]]]

Try it online!

Returns 1 for True

Answer 32

sed, 48

Using the more efficient algorithm described in this answer:

s=abcabc
<<<"$s" sed -nE 's/.*/&\n&&/; /^([^\n]+)\n..*\1.*.$/!q5' \
  && echo true \
  || echo false

Answer 33

TI-BASIC, 14 bytes

length(Ans)>inString(Ans+Ans,Ans,2

Input is a string in Ans.
Output is true (1) or false (0) as requested by the challenge.

Examples:

"HELLO
HELLO
prgmCDGF17
               0
"AB
AB
prgmCDGF17
               0
"ABAB
ABAB
prgmCDGF17
               1

Explanation:

length(Ans)>inString(Ans+Ans,Ans,2   ;full program

            inString(                ;get the index of
                             Ans,    ; the input in
                     Ans+Ans,        ; the input concatenated with itself
                                 2   ; starting at the second character
                                     ; (returns index of concatenated piece
                                     ;  if not found elsewhere)
length(Ans)                          ;and then get the length of the input
           >                         ;is the length greater than the index?
                                     ; result is left in "Ans"
                                     ; 1 if true, 0 if false
                                     ;implicit print of "Ans"

---

Note: TI-BASIC is a tokenized language. Character count does not equal byte count.

Answer 34

C (gcc), 37 bytes

#define f(x)strcmp(strstr(1+x x,x),x)

Try it online!

Yet another port of xnor's solution. Using C macros to create the concatenated string, where the macro assumes the argument is a string literal.

Answer 35

Zsh, 19 bytes

Outputs via error code:

[[ $1$1 = ?*$1*? ]]

Try it online!

However, the challenge did specify "output on stdout":

Zsh, 22 bytes

Outputs an empty string if true, and a non-empty string for false:

<<<${${:-$1$1}/?*$1*?}

If the output must be fixed:

Zsh, 25 bytes

Outputs 0 for true, 1 for false

[[ $1$1 = ?*$1*? ]]
<<<$?

Try it online!

---

The heart of these solutions is ?*$1*?, which is a glob which matches the string in question surrounded by at least one character on each side: * is a string of any length, and ? is a single character. This is an alternate version of xnor's solution, but using globs to match extra characters rather than removing leading and trailing characters.

Answer 36

Perl 6, 14 bytes

{?/^(.+)$0+$/}

Try it online!

Answer 37

Swift 4.2/Xcode 10.2, 123 84 bytes

(1...s.count-1).contains{s==String(repeating:String(s.prefix($0)),count:s.count/$0)}

Try it online!

Answer 38

SmileBASIC 3, 72 bytes

Prints 1 for true and 0 for false.

LINPUT L$W=LEN(L$)FOR I=1TO W/2IF LEFT$(L$,I)*(W/I)==L$THEN?1STOP
NEXT?0

Explained

LINPUT L$       'read line of input
W=LEN(L$)       'store length of input
FOR I=1 TO W/2  'loop over all prefixes
 'if this prefix repeated to length of input equals input, print 1 and stop
 IF LEFT$(L$,I)*(W/I)==L$ THEN ?1 STOP
NEXT
?0              'print 0 because check failed

Answer 39

Perl 6, 14 bytes

*~~/^(.+)$0+$/

Or for the same amount

{m/^(.+)$0+$/}

Much the same as other answers with a simple regex. First one uses Whatever block and a smart matcher to run the regex, and the second does a match on the block input with the implied value. Both return Match objects which are truthy on success, and Nil which is falsey on fairly.

Try it online!

Answer 40

Lua, 50 bytes

Another port of xnor's solution:

s=io.read()t=s..s print(s.find(t.sub(t,2,#t-1),s))

Prints indexes if true, 'nil' otherwise.

Try it online!