String rotation - output string repeatedly moving first character to the end

Question

The challenge here is to take a string and output all its rotations, by repeatedly moving the first character to the end, once per character in the string, ending with the original string:

john -> ohnj, hnjo, njoh, john

You may also cycle in the other direction, moving characters from the end:

john -> njoh, hnjo, ohnj, john

You should still output one rotation per letter even if the original word is reached before that:

heehee -> eeheeh, eheehe, heehee, eeheeh, eheehe, heehee

Character arrays are allowed, as long as the result works as shown above.

Shortest answer wins!

If a string like heehee returns to the original order in fewer cycles than its length, do we stop there? I expect this would make a big difference for many answers. — xnor, Commented Dec 8, 2018 at 22:43
I edited the question including your clarifications, feel free to change it if it's not what you intended. — xnor, Commented Dec 8, 2018 at 23:28
@xnor that looks much clearer than my original post, thanks so much! — SimpleGeek, Commented Dec 9, 2018 at 13:38
Are we allowed to input/output character arrays? (The distinction can be important in some languages.) — LegionMammal978, Commented Dec 9, 2018 at 18:09

aketon · Accepted Answer · 2022-11-01 00:56:08Z

2

Vyxal, 3 bytes

(Ǔ…

Explanation:

(   # For each char in the input
 Ǔ  # Rotate left
  … # Print without popping

Try it Online!

answered Nov 1, 2022 at 0:56

aketon

3194 silver badges6 bronze badges

Add a comment |

Ashlin Harris · Accepted Answer · 2023-02-20 21:43:10Z

2

Julia 1.0, 31 bytes

!s=(r=keys(s)).|>i->(s*s)[i.+r]

Try it online!

edited Feb 20, 2023 at 21:43

answered Oct 31, 2022 at 17:40

Ashlin Harris

2,1213 silver badges7 bronze badges

Add a comment |

chunes · Accepted Answer · 2023-06-24 02:47:10Z

2

Arturo, 30 bytes

$->s[0-1map s=>[rotate s<=1+]]

Try it!

answered Jun 24, 2023 at 2:47

chunes

26.8k3 gold badges24 silver badges53 bronze badges

Add a comment |

Fhuvi · Accepted Answer · 2023-06-28 13:10:08Z

JavaScript (Node.js), 41 bytes

Another JS answer, which doesn't beat any of the previous JS ones.
Input is an array of characters (as seen in other answers), and output is an array of strings.
Rotates the string the inverted way, as allowed by OP.

s=>[...s].map(_=>[...s]=s.pop()+s.join``)

Try it online!

Different approach that swaps each character with their corresponding one, obtained via calculation of its index (correct rotation direction, 58 bytes) :

s=>s.map((_,i)=>s.map((_,j)=>s[(i+j+1)%s.length]).join``)

Try it online!

chunes · Accepted Answer · 2024-03-12 17:19:46Z

2

Uiua ^SBCS, 7 bytes

⇌≡↻⇡⊃⧻¤

Try it!

If it is allowed to start with the input rather than end with it, then remove the reverse for -1 byte.

⇌≡↻⇡⊃⧻¤
    ⊃⧻¤  # fix the input and get its length
   ⇡     # range
 ≡↻      # rotate input by each number in the range
⇌        # reverse

answered Mar 12 at 17:19

chunes

26.8k3 gold badges24 silver badges53 bronze badges

Add a comment |

DLosc · Accepted Answer · 2024-03-12 19:46:51Z

2

Brachylog, 8 bytes

l≥ℕ₁;?↺₍

Generator solution: takes a string as input, outputs one rotation at a time when called repeatedly. Try it online!

Explanation

l≥ℕ₁;?↺₍
l          Length of input string
 ≥         Get a number less than or equal to that
  ℕ₁       which is also an integer greater than or equal to 1
    ;?     Put it in a list with the input string
      ↺₍   Rotate the latter the former number of times

answered Mar 12 at 19:46

DLosc

39.2k5 gold badges83 silver badges141 bronze badges

Add a comment |

roblogic · Accepted Answer · 2024-07-11 17:35:55Z

2

Zsh, 35 bytes

for i ({0..$#1})<<<${1:$i}${1:0:$i}

Try it online!

answered Jul 11 at 17:35

roblogic

4,01218 silver badges23 bronze badges

Add a comment |

Themoonisacheese · Accepted Answer · 2024-08-29 07:16:20Z

2

Bash, 44 40 bytes

-4 bytes by roblogic

for((;i++<${#1};)){ echo ${1:i}${1::i}
}

Attempt This Online!

Use as body of a bash function or as a bash script. takes the string as first arg and outputs to stdout.

explanation:

for ((;i<${#1};i++)){ # ${#1} is the length of $1, so this is a for loop counting character positions
echo ${1:$i}${1::$i}  # ${1:x:y} is the substring of $1 starting at position x ending at position y.
}

edited Aug 29 at 7:16

answered Jul 10 at 14:17

Themoonisacheese

9015 silver badges17 bronze badges

\$\begingroup\$ 40 bytes with a few minor golfs. \$\endgroup\$
– roblogic
Commented Aug 28 at 14:36
1

\$\begingroup\$ @roblogic i remember trying to do that and failing, bash being as helpful as always with error messages. good job! \$\endgroup\$
– Themoonisacheese
Commented Aug 29 at 7:17

Add a comment |

Galen Ivanov · Accepted Answer · 2018-12-09 09:15:16Z

1

Red, 49 43 bytes

func[s][forall s[print move head s tail s]]

Try it online!

edited Dec 9, 2018 at 9:15

answered Dec 9, 2018 at 8:42

Galen Ivanov

21.2k3 gold badges24 silver badges61 bronze badges

Add a comment |

david · Accepted Answer · 2018-12-09 18:38:59Z

1

Tcl, 78 bytes

proc R t {time {puts [set t [regsub -all (.?)(.*) $t {\2\1}]]} [string le $t]}

Try it online!

answered Dec 9, 2018 at 18:38

david

6094 silver badges13 bronze badges

Add a comment |

FlipTack · Accepted Answer · 2018-12-09 21:57:49Z

1

Pushy, 4 bytes

L:{"

Try it online!

L:    \ Length of the string times do:
  {   \    Cyclically shift left once
   "  \    Print

answered Dec 9, 2018 at 21:57

FlipTack

14.7k3 gold badges54 silver badges101 bronze badges

Add a comment |

DJMcMayhem · Accepted Answer · 2018-12-10 07:35:28Z

1

V, 8 bytes

ýñx$pÙñd

Try it online!

Hexdump:

00000000: fdf1 7824 70d9 f164                      ..x$p..d

edited Dec 10, 2018 at 7:35

answered Dec 8, 2018 at 22:21

DJMcMayhem

59.6k17 gold badges196 silver badges348 bronze badges

\$\begingroup\$ ýñx$pÙñd gives 8 by removing the need to H tio.run/##K/v///DewxsrVAoOzzy8MeX/f6/8jDwA \$\endgroup\$
– user41805
Commented Dec 9, 2018 at 19:43
\$\begingroup\$ @Cowsquack Even better: ý<M-->ñx$pÙ \$\endgroup\$
– DJMcMayhem
Commented Dec 9, 2018 at 20:54
\$\begingroup\$ Doesn't that repeat the last line? \$\endgroup\$
– user41805
Commented Dec 10, 2018 at 6:18

Add a comment |

mazzy · Accepted Answer · 2018-12-10 09:08:28Z

1

Powershell, 44 bytes

($s=$args|% t*y)|%{$h,$t=$s;-join($s=$t+$h)}

Test script:

$f = {

($s=$args|% t*y)|%{$h,$t=$s;-join($s=$t+$h)}

}

@(
    ,('john', 'ohnj', 'hnjo', 'njoh', 'john')
    ,('heehee', 'eeheeh', 'eheehe', 'heehee', 'eeheeh', 'eheehe', 'heehee')
) | % {
    $s,$expected = $_
    $result = &$f $s
    "$result"-eq"$expected"
    $result
}

output:

True
ohnj
hnjo
njoh
john
True
eeheeh
eheehe
heehee
eeheeh
eheehe
heehee

answered Dec 10, 2018 at 9:08

mazzy

7,1752 gold badges12 silver badges22 bronze badges

Add a comment |

sergiol · Accepted Answer · 2018-12-10 10:54:06Z

1

Tcl, 80 91 bytes

proc P s {time {puts [set s [string ra $s 1 e][string in $s 0]]} [string le $s]}

Try it online!

edited Dec 10, 2018 at 10:54

answered Dec 8, 2018 at 23:50

sergiol

3,4561 gold badge15 silver badges31 bronze badges

\$\begingroup\$ Reassign text at each time saves some bytes proc R t {time {puts [set t [string ra $t 1 end][string in $t 0]]} [string len $t]} \$\endgroup\$
– david
Commented Dec 9, 2018 at 18:05
\$\begingroup\$ Got it down to 80 bytes, thanks to @david \$\endgroup\$
– sergiol
Commented Dec 10, 2018 at 10:54

Add a comment |

Olivier Grégoire · Accepted Answer · 2018-12-10 16:35:18Z

1

Java (JDK), 85 bytes

s->{for(int i=s.length();i-->0;)System.out.println(s.substring(i)+s.substring(0,i));}

Try it online!

edited Dec 10, 2018 at 16:35

answered Dec 10, 2018 at 16:16

Olivier Grégoire

14.4k3 gold badges32 silver badges56 bronze badges

Add a comment |

Giuseppe · Accepted Answer · 2018-12-10 22:01:49Z

1

SNOBOL4 (CSNOBOL4), 82 bytes

	S =INPUT
T	X =X + 1
	S LEN(1) . L REM . R
	OUTPUT =S =R L LE(X,SIZE(S))	:S(T)
END

Try it online!

answered Dec 10, 2018 at 22:01

Giuseppe

28.8k3 gold badges31 silver badges105 bronze badges

Add a comment |

maxb · Accepted Answer · 2018-12-11 15:16:34Z

1

MathGolf, 5 bytes

hÅ╫o;

Try it online!

Explanation

h       length of array/string without popping
 Å      start block of length 2
  ╫     left-rotate bits in int, list/str
   o    print TOS without popping
    ;   discard TOS

answered Dec 11, 2018 at 15:16

maxb

6,9473 gold badges32 silver badges41 bronze badges

Add a comment |

cyclaminist · Accepted Answer · 2018-12-12 03:11:03Z

1

Lua, 61 bytes

function(s)for i=1,#s do print(s:sub(i+1)..s:sub(1,i))end end

Try it online!

Split string at successive indices from one to the length of the string (one-based indexing), concatenate the pieces in the reverse order, print.

answered Dec 12, 2018 at 3:11

cyclaminist

2211 silver badge3 bronze badges

Add a comment |

score 1 · Accepted Answer · 2018-12-12 14:06:04Z

1

C (clang), 57 54 bytes

i;f(int*a){for(i=0;a[i++];printf("%S%.*S ",a+i,i,a));}

Try it online!

Takes input as a wide string.

edited Dec 12, 2018 at 14:06

answered Dec 10, 2018 at 3:46

user36046

\$\begingroup\$ Loop until a[i++] to save 7 bytes. \$\endgroup\$
– user77406
Commented Dec 12, 2018 at 6:15
\$\begingroup\$ Oh, no char*. You'd still save bytes, though (just make i global and f(char*a). \$\endgroup\$
– user77406
Commented Dec 12, 2018 at 6:26

Add a comment |

Community · Accepted Answer · 2020-06-17 09:04:33Z

1

Common Lisp, 88 bytes

(lambda(x)(loop for s from 1 to(length x)do(format t"~a~a "(subseq x s)(subseq x 0 s))))

Try it online!

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Jan 8, 2019 at 17:17

Renzo

2,60814 silver badges22 bronze badges

Add a comment |

wooshinyobject · Accepted Answer · 2019-01-14 17:56:51Z

1

MBASIC, 69 66 bytes

-3 bytes, thanks to Ørjan Johansen

1 INPUT S$:L=LEN(S$):FOR I=1 TO L:S$=MID$(S$+S$,2,L):PRINT S$:NEXT

edited Jan 14, 2019 at 17:56

answered Jan 11, 2019 at 15:14

wooshinyobject

1916 bronze badges

\$\begingroup\$ I suspect you can shorten that to 1 INPUT S$:L=LEN(S$):FOR I=1 TO L:S$=MID$(S$+S$,2,L):PRINT S$:NEXT. \$\endgroup\$
– Ørjan Johansen
Commented Jan 12, 2019 at 2:22
\$\begingroup\$ @Ørjan Johansen Very nice, thank you. \$\endgroup\$
– wooshinyobject
Commented Jan 14, 2019 at 17:58

Add a comment |

u-ndefined · Accepted Answer · 2019-05-16 13:56:20Z

1

Pepe, 64 52 bytes

rEEEEeREEeRREeeeREEReREEEeeReReeeReeERREeeerEEEEERee

Try it online! Uses newlines for separation.

edited May 16, 2019 at 13:56

answered Dec 10, 2018 at 11:44

u-ndefined

2,32311 silver badges21 bronze badges

Add a comment |

Seggan · Accepted Answer · 2022-10-25 22:52:20Z

APL (Dyalog Unicode), 13 bytes

{(↓,↑)∘⍵¨⍳≢⍵}

Try it online!

Over twice as long as the other APL answer, but uses a different more literal tactic. Test harness stolen from that answer.

{(↓,↑)∘⍵¨⍳≢⍵}
{           } ⍝ Define function
         ⍳≢   ⍝ Indexes of
           ⍵  ⍝ The input
        ¨     ⍝ For each item in ^
 (   )        ⍝ Apply the following function:
  ↓              ⍝ Drop n elements
    ↑            ⍝ Take n elements
   ,             ⍝ Concatenate the 2 above results
      ∘⍵      ⍝ Bind the right input of the above function to the input

bluswimmer · Accepted Answer · 2023-06-30 02:57:22Z

1

Lua, 52 bytes

s=...for i=1,#s do s=s:sub(2)..s:sub(1,1)print(s)end

Try it online!

answered Jun 30, 2023 at 2:57

bluswimmer

9412 silver badges5 bronze badges

Add a comment |

Shaggy · Accepted Answer · 2023-07-03 11:24:17Z

1

Rockstar, 79 77 bytes

Listen to S
X's 0
While S at X
Cut S
Rock roll S in S
Join S
Say S
Let X be+1

Try it (Code will need to be pasted in)

edited Jul 3, 2023 at 11:24

answered Jun 24, 2023 at 9:29

Shaggy

43.5k4 gold badges36 silver badges94 bronze badges

Add a comment |

l4m2 · Accepted Answer · 2023-07-04 18:59:05Z

1

JavaScript (Node.js), 32 bytes

s=>[...s].map(_=>s=s.slice(1)+_)

Try it online!

JavaScript (Node.js), 32 bytes

s=>s.map(_=>s=[...s.slice(1),_])

Try it online!

Found similarity

edited Jul 4, 2023 at 18:59

answered Jul 3, 2023 at 7:10

l4m2

28.5k2 gold badges25 silver badges104 bronze badges

Add a comment |

alephalpha · Accepted Answer · 2023-07-06 01:58:18Z

1

Nekomata, 3 bytes

x→Ř

Attempt This Online!

x       Enumerate; push [0, 1, ..., len(input) - 1]
 →      Increment
  Ř     Rotate right by that amount (automatically vectorized)

Unfortunately x is 0-indexed, so we have to increment it before rotating.

answered Jul 6, 2023 at 1:58

alephalpha

50k7 gold badges68 silver badges182 bronze badges

Add a comment |

Ed The ''Pro'' · Accepted Answer · 2023-07-06 18:24:46Z

Racket - 179 bytes

#!racket
(let([s(read-line)][a string-append])(let g([r s][i(string-length s)])(display(a r(if(= i 0)""" -> ")))(if(= i 0)(void)(g(a(substring r 1)(~a(string-ref r 0)))(- i 1)))))

Try it online!

Explanation

On line one we have the required language expression. Yesterday, I learnt that #![language] is short for #lang [language], but it is discouraged in normal programs.

On line two, we define an immediately invoked function using let. The parent let receives a line of input from the user and passes it to it's child let called g. The child let acts as a recursive loop that uses the length of the parent string as an iterator. The first if check is in charge of pretty printing the rotated string. (While it would save some bytes to remove it, I like the way it looks.) The second check is used to determine whether the string should be rotated again or if the program should end.

To rotate the string, we split the string at index 1 and append the first character to the end of the string.

#lang racket

(let ([str (read-line)] [str-app string-append])
  (let loop ([rotated str] [idx (string-length str)])
    (display (str-app rotated (if (= idx 0) "" " -> ")))
    (if (= idx 0)
      (void)
      (loop (str-app (substring rotated 1)
                     (~a (string-ref rotated 0)))
            (- idx 1)))))

Output (Input: `Heya!`)

Heya! -> eya!H -> ya!He -> a!Hey -> !Heya -> Heya!

Jordan · Accepted Answer · 2024-03-12 19:14:05Z

1

J-uby, 23 bytes

:*%[:& &:rotate,:+@|:+]

Attempt This Online!

Explanation

:* % [:& & :rotate, :+@ | :+]
                    :+@ | :+   # Range 1..(input length)
:* % [            ,         ]  # Map with...
      :& & :rotate             #   Rotate input chars

edited Mar 12 at 19:14

answered Mar 12 at 17:04

Jordan

11.3k1 gold badge33 silver badges55 bronze badges

Add a comment |

Yousername · Accepted Answer · 2024-03-12 23:24:35Z

1

TI-Basic, 40 bytes

For(I,1,length(Ans)-1
sub(Ans,2,length(Ans)-1)+sub(Ans,1,1
Disp Ans
End
Ans

Takes input in Ans. Rotates to the left.

answered Mar 12 at 23:24

Yousername

4,09010 silver badges24 bronze badges

\$\begingroup\$ Wouldn't it be shorter to store length(Ans)-1 in a variable? \$\endgroup\$
– MarcMush
Commented Mar 13 at 14:36
1

\$\begingroup\$ @MarcMush It wouldn't because you would have to store the input in a string variable. \$\endgroup\$
– Yousername
Commented Mar 13 at 18:49

Add a comment |

String rotation - output string repeatedly moving first character to the end

78 Answers 78

Vyxal, 3 bytes

Explanation:

Julia 1.0, 31 bytes

Arturo, 30 bytes

JavaScript (Node.js), 41 bytes

Uiua SBCS, 7 bytes

Brachylog, 8 bytes

Explanation

Zsh, 35 bytes

Bash, 44 40 bytes

Red, 49 43 bytes

Tcl, 78 bytes

Pushy, 4 bytes

V, 8 bytes

Powershell, 44 bytes

Tcl, 80 91 bytes

Java (JDK), 85 bytes

SNOBOL4 (CSNOBOL4), 82 bytes

MathGolf, 5 bytes

Explanation

Lua, 61 bytes

C (clang), 57 54 bytes

Common Lisp, 88 bytes

MBASIC, 69 66 bytes

Pepe, 64 52 bytes

APL (Dyalog Unicode), 13 bytes

Lua, 52 bytes

Rockstar, 79 77 bytes

JavaScript (Node.js), 32 bytes

JavaScript (Node.js), 32 bytes

Nekomata, 3 bytes

Racket - 179 bytes

Explanation

Output (Input: Heya!)

J-uby, 23 bytes

Explanation

TI-Basic, 40 bytes

Your Answer

Sign up or log in

Post as a guest

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

Linked

Related

Hot Network Questions

Uiua ^SBCS, 7 bytes

Output (Input: `Heya!`)

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