Detect rotated strings

Question

Read two strings from stdin.
Output Yes if one string is a rotated version of the other.
Otherwise output No

Testcases

Input

CodeGolf GolfCode

Output

Yes

Input

stackexchange changestackex

Output

Yes

Input

stackexchange changestack

Output

No

Input

Hello World

Output

No

Should it really be a rotation or is a combination fine too? eg. what will Stackexchange Stackchangeex return? — jpjacobs, Mar 9 '11 at 12:08
@Eelvex, yes. @jpjacobs, It would return No. The rotation is a shift, like those LED scrolling signs — gnibbler, Mar 9 '11 at 12:19
Are the strings always whitespace-free and separated by whitespace? — Joey, Mar 9 '11 at 15:20
More specifically, what characters are allowed in those strings? — Joey, Mar 9 '11 at 15:48

Chris Kuklewicz · Accepted Answer · 2011-04-15 14:25:40Z

1

Fixed to say Yes/No and improved (91 chars)

import List;f[a,b]|a`elem`[x++y|x<-tails b|y<-inits b]="Yes";f _="No";main=interact$f.words

original Haskell (92 chars) that says True/False

import Data.List;f(a:b:_)=any(a==)$zipWith(++)(tails b)(inits b);main=interact(show.f.words)

edited Apr 15 '11 at 14:25

answered Mar 30 '11 at 18:59

Chris Kuklewicz

1112 bronze badges

\$\begingroup\$ You can save a few characters with import List and also by using $ instead of parens around the argument to interact. But your program outputs True and False instead of the required Yes and No, so that might take a few extra chars to fix. \$\endgroup\$ – user1011 Apr 15 '11 at 3:38

add a comment |

daniero · Accepted Answer · 2012-05-31 23:13:02Z

1

Bash, 70 65 59 55 characters

new approach:

read a b;c=$a$a;[[ ${c/$b/} == $a ]]&&echo yes||echo no

edited May 31 '12 at 23:13

answered May 29 '12 at 21:12

daniero

16.1k5 gold badges39 silver badges73 bronze badges

\$\begingroup\$ solution 2 fails on echo ofofo fofof | bash rotated.sh - doesn't it? Else I would remove even more WS: read a b[[ $a$a =~ $b&&${#a}-eq${#b} ]]&& echo yes||echo no. I had a very similar idea, and think it works. \$\endgroup\$ – user unknown May 30 '12 at 6:21
\$\begingroup\$ You're right, more ws can be removed, and the paratheses! Need a ; after the read tho. \$\endgroup\$ – daniero May 30 '12 at 14:16
\$\begingroup\$ @userunknown - hah, got'cha ;) \$\endgroup\$ – daniero May 31 '12 at 23:13
\$\begingroup\$ You can remove a blank before and one behind ==. \$\endgroup\$ – user unknown Jun 1 '12 at 3:41
1

\$\begingroup\$ I tried, but then it always return 'yes'. \$\endgroup\$ – daniero Jun 7 '12 at 14:46

| show 1 more comment

tristin · Accepted Answer · 2013-10-18 14:37:25Z

1

JavaScript - 66

p=prompt,a=p(),b=p();alert(!b.match(a)&&!!b+b.match(a)?'Yes':'No')

edited Oct 18 '13 at 14:37

answered Oct 18 '13 at 13:37

tristin

1696 bronze badges

\$\begingroup\$ 1) This says True for “foo” and “foot”. 2) The output has to be “Yes” or “No”. The other participants spent great amount of code to produce the required output. Please do so. \$\endgroup\$ – manatwork Oct 18 '13 at 13:46
\$\begingroup\$ Is the problem true/false or that 'foo' is not a rotation of 'foot'? \$\endgroup\$ – tristin Oct 18 '13 at 13:51
\$\begingroup\$ 1) Giving wrong result for “foo” and “foot”, is a bug. 2) Producing different output then required, is just deviation. Many answers fail to conform with the requirements in various degrees – some got downvoted, others not. Is up to you to decide whether you risk some downvotes or correct them. \$\endgroup\$ – manatwork Oct 18 '13 at 14:27
\$\begingroup\$ Should be working now. \$\endgroup\$ – tristin Oct 18 '13 at 14:38
\$\begingroup\$ Much better. It gives “Yes” for “foo” and “.*”, but as the question owner still not replied to the comment about allowed characters, let us suppose that only the character classed used in the samples are allowed. \$\endgroup\$ – manatwork Oct 18 '13 at 15:01

| show 1 more comment

Dennis · Accepted Answer · 2014-05-10 02:46:38Z

GolfScript, 25 bytes

' '/~.2*@/''+='Yes''No'if

How it works

             # STACK: "CodeGolf GolfCode"
' '/         # Split input string by spaces.
             # STACK: [ "CodeGolf" "GolfCode" ]
~            # Dump the array.
             # STACK: "CodeGolf" "GolfCode"
.            # Duplicate the topmost string.
             # STACK: "CodeGolf" "GolfCode" "GolfCode"
2*           # Repeat the topmost string.
             # STACK: "CodeGolf" "GolfCode" "GolfCodeGolfCode"
@            # Rotate the three topmost strings.
             # STACK: "GolfCode" "GolfCodeGolfCode" "CodeGolf"
/            # Split the second topmost string around the topmost one.
             # STACK: "GolfCode" [ "Golf" "Code" ]
''+          # Flatten the array of strings.
             # STACK: "GolfCode" "GolfCode"
=            # Check for equality.
             # STACK: 1
'Yes''No'if  # Push 'Yes' for 1, 'No' for 0.
             # STACK: "Yes"

caird coinheringaahing · Accepted Answer · 2017-12-15 20:07:20Z

Jelly, 17 bytes

ɠṙ-$LÐ¡ɠeị“Yes“No

Try it online!

How it works

ಠ_ಠ 10 bytes for I/O

ɠṙ-$LÐ¡ɠeị“Yes“No - Main link. No arguments
ɠ                 - Take a string from STDIN. Call that A
     Ð¡           - Repeat, collecting the results. Call that C
    L             -   Repetitions: Length of A
 ṙ-$              -   Link: Rotate once to the left
       ɠ          - Take a string from STDIN. Call that B
        e         - Is B in A? Yields 1 or 0
          “Yes“No - Yield ["Yes", "No"]
         ị        - 1-based index into the above list

ბიმო · Accepted Answer · 2017-12-15 20:19:30Z

Husk, 14 bytes

Not sure about the rules here, Husk doesn't do IO at all. The closest alternative is a function:

!w¨Ye∫No¨€U¡ṙ1

Try it online!

Explanation

!w¨Ye∫No¨€U¡ṙ1
           ¡    -- iterate the following for ever:
            ṙ1  --   rotate string by 1
          U     -- only keep the longest prefix with unique elements
         €      -- is the argument in that list?
  ¨Ye∫No¨       -- compressed string: "Yes No"
 w              -- split on space
!               -- modular index (1-based)

DJMcMayhem · Accepted Answer · 2017-12-15 20:25:33Z

Jelly, 16 bytes

ɠJṙ@€ɠe@ị“Yes“No

Try it online!

Many thanks to @cairdcoinheringaahing and @MrXcoder for helping me out in chat.

Explanation:

ɠ                   # The first string
  ṙ@€               # Rotated by...
 J                  #   The indexes of each element in the string
     ɠ              # The second string
      e@            # Exists in that list of strings.
                    # (either '0' or '1')
        ị           # Indexed into the list...
         “Yes“No    # ["yes", "no"]

nyuszika7h · Accepted Answer · 2019-08-12 15:42:01Z

jq -Rn, 62 + 4 = 65 bytes

len('if[inputs|explode|sort|implode]|.[0]==.[1]then"Yes"else"No"end')

As in the accepted answer, the two strings should be on separate lines. -R is used to avoid having to quote the input strings, and -n is used to disable the default input processing because inputs takes care of that.

tmartin · Accepted Answer · 2012-05-30 08:35:34Z

0

K3 / Kona, 28

{:[y _in![;x]'!#x;`Yes;`No]}

edited May 30 '12 at 8:35

answered May 30 '12 at 8:18

tmartin

3,88710 silver badges16 bronze badges

add a comment |

Christopher · Accepted Answer · 2017-12-15 18:24:19Z

0

05AB1E, 20 bytes

Code:

DgFÀD²Qi"Yes",q}}"No

Uses CP-1252 encoding. Try it online!

edited Dec 15 '17 at 18:24

Christopher

2,09811 silver badges50 bronze badges

answered May 10 '16 at 12:15

Adnan

36.4k5 gold badges65 silver badges227 bronze badges

add a comment |

Mnemonic · Accepted Answer · 2017-12-15 20:44:21Z

Pyth, 18 bytes

?}zm.<QdlQ"YES""NO

Try it online

Explanation

?}zm.<QdlQ"YES""NO
   m   dlQ            For each number in [1, ..., len(first input)]...
    .<Q               ... rotate the first input that many characters.
 }z                   Check if the second input is in that list.
?         "YES""NO    Return "YES" or "NO" appropriately.

gastropner · Accepted Answer · 2017-12-16 21:29:09Z

0

C (gcc), 118 bytes

i,l,r;f(s,t)char*s,*t;{for(i=r=0,l=strlen(s);i<l;i++)!strncmp(s+i,t,l-i)&!strncmp(s,t+l-i,i)?r=3:0;puts(r+"No\0Yes");}

Try it online!

answered Dec 16 '17 at 21:29

gastropner

2,6101 gold badge6 silver badges13 bronze badges

add a comment |

Unrelated String · Accepted Answer · 2019-08-12 02:29:43Z

Brachylog, 17 bytes

~c₂ᵐ↔ᵈ∧"Yes"|∧"No

Try it online!

(If the input strictly has to be whitespace-separated, add two bytes to prepend ṇ₁, but note that the input still has to be quoted. Brachylog does not have any sort of direct access to stdin.)

Takes input as a list of two strings, and outputs through the output variable. The actual logic is all in the first six bytes, which succeed if the elements of the input are rotations of each other, and fail if they are not:

   ᵐ      Both strings in the input
~c₂       can be split into two pieces each
    ↔ᵈ    such that one string's two chunks are the other's swapped.

(↔ᵈ could just as well be pᵈ, pᵛ, or oᵛ which is what it was originally before I decided that ↔ᵈ is more to the point.)

Although it would be possible to brute force rotating one of them until it matches, the number of rotations would need to be explicitly bounded, and on top of that just the effort required to separate out the two elements of the input list would be fairly costly. Since it's very easy to brute force partitions in Brachylog, the fact that a rotation is just as much taking one chunk off one end and moving it to the other as it is doing that to single characters however many times saves a lot of bytes.

With very flexible I/O, this could be as short as 5 bytes, taking one string through the input variable and the other through the output variable: ~c₂↔c

recursive · Accepted Answer · 2019-08-12 23:30:59Z

0

Stax, 11 bytes

Ä:∩ö┌┘/YJTI

Run and debug it

This program takes input on two lines.

Unpacked, ungolfed, and commented, it looks like this.

:(      get all rotations
s|#     other input is a member of rotations?
`n!`    "Yes"
.No     "No"
?       (a ? b : c)

Run this one

edited Aug 12 at 23:30

answered Aug 12 at 23:14

recursive

8,02615 silver badges31 bronze badges

add a comment |

Stack Exchange Network

current community

your communities

more stack exchange communities

Detect rotated strings

44 Answers 44

Bash, 70 65 59 55 characters

JavaScript - 66

GolfScript, 25 bytes

How it works

Jelly, 17 bytes

How it works

Husk, 14 bytes

Explanation

Jelly, 16 bytes

jq -Rn, 62 + 4 = 65 bytes

K3 / Kona, 28

05AB1E, 20 bytes

Pyth, 18 bytes

Explanation

C (gcc), 118 bytes

Brachylog, 17 bytes

Stax, 11 bytes

Your Answer

Not the answer you're looking for? Browse other questions tagged code-golf string or ask your own question.

Hot Network Questions

Detect rotated strings

44 Answers 44

Bash, 70 65 59 55 characters

JavaScript - 66

GolfScript, 25 bytes

How it works

Jelly, 17 bytes

How it works

Husk, 14 bytes

Explanation

Jelly, 16 bytes

jq -Rn, 62 + 4 = 65 bytes

K3 / Kona, 28

05AB1E, 20 bytes

Pyth, 18 bytes

Explanation

C (gcc), 118 bytes

Brachylog, 17 bytes

Stax, 11 bytes

Your Answer

Sign up or log in

Post as a guest

Not the answer you're looking for? Browse other questions tagged code-golf string or ask your own question.

Related

Hot Network Questions