# Reversencode the given string

Given a string, if it is even, break the string into 2 even parts, then reverse the parts to get the "reversencoded" string.

Example:

onomatopoeia -> tamonoaieopo

If the string is not of even length, then do not change the position of the middle character, and reverse the letters before and after the middle character.

Example:

pizza -> ipzaz

discord -> sidcdro

Limitations: The input will not contain any other characters other than AlphaNumeric characters. i.e. No newlines/whitespaces.

General contest, shortest code in each language will be winning. Good luck!

btw: i made up the word reversencoded, i'm fairly sure such a form of "encryption" doesnt exist

• "btw: i made up the word reversencoded, i'm fairly sure such a form of "encryption" doesnt exist" Now it does! Apr 19 at 16:18

# Jelly, 6 bytes

ṚŒHZUZ


Try it online!

## Explanation

Consider the string ABCDEFGHI:

ṚŒHZUZ
Ṛ      reverse -> IHGFEDCBA
ŒH    split into halves -> IHGFE
DCBA
Z   transpose -> ID
HC
GB
FA
E
U  reverse each row -> DI
CH
BG
AF
E
Z transpose -> DCBAE
IHGF
implicitly concatenate -> DCBAEIHGF


I never thought the time would come when I'd outgolf Jonathan Allan in Jelly…

• You know that feeling you get when you miss something that seems incredibly obvious in hindsight? +1 Apr 18 at 19:03
• It's interesting that this doesn't translate golfily into J, because J fills the bottom right corner with a space, and the row-reversal then moves the E to the 2nd column. Which this means you need special case code to handle that. So J's "matixes are always square" is a liability here. Apr 19 at 15:35

# Factor, 7672 65 bytes

[ dup length 2 rem swap halves rot cut [ reverse ] tri@ 3append ]


Try it online!

-7 bytes thanks to @Bubbler!

## Explanation:

It's a quotation (anonymous function) that takes a string from the data stack as input and leaves a string on the data stack as output. Assuming "pizza" is on the data stack when this quotation is called...

• dup Duplicate the object on top of the data stack

Stack: "pizza" "pizza"

• length Take the length

Stack: "pizza" 5

• 2 Push 2 to the stack

Stack: "pizza" 5 2

• rem The remainder of dividing second-from-top by top

Stack: "pizza" 1

• swap Swap the top two objects

Stack: 1 "pizza"

• halves Cut a sequence in half. If the sequence has an odd number of elements, the extra element will be in the sequence that is on top of the stack. halves returns slices for efficiency.

Stack: 1 T{ slice f 0 2 "pizza" } T{ slice f 2 5 "pizza" }

• rot Move the object third from the top to the top

Stack: T{ slice f 0 2 "pizza" } T{ slice f 2 5 "pizza" } 1

• cut Take a sequence and an index and split the sequence in two at that index. When given an index at either end of a sequence, an empty string will be one of the outputs. cut will "reify" the slice.

Stack: T{ slice f 0 2 "pizza" } "z" "za"

• [ reverse ] Push a quotation for tri@ to use later

Stack: T{ slice f 0 2 "pizza" } "z" "za" [ reverse ]

• tri@ Apply a quotation to three objects. In this case, reverse them.

Stack: "ip" "z" "az"

• 3append Append three sequences

Stack: "ipzaz"

• Suggest 3append for swap glue, and 2 rem for odd? 1 0 ? Apr 18 at 22:52
• @Bubbler Great suggestions. For some reason I thought 3append was missing because 2append doesn't exist. I get my versions mixed up. Apr 18 at 23:12

# R, 86 bytes

(or 79 bytes with output as a vector of characters instead of a string)

function(s,n=nchar(s),m=n/2+.5,o=n:1)intToUtf8(utf8ToInt(s)[c(o[o<m],o[o==m],o[o>m])])


Try it online!

• Nice golfing for the specific ranges! Apr 18 at 19:18
• -3 bytes? Try it online! Apr 19 at 4:34
• @pajonk - Nice! I think you should post it yourself, though: I thought I'd tried all the combinations of indexing with & without ifs, but never found this one. Well done! Apr 19 at 5:37
• @pajonk - ...and your approach can even go down by 2 more bytes: Try it online!... Apr 19 at 5:39
• Ok, thanks! I posted it. Apr 19 at 5:54

# Retina, 36 bytes

^((.)+?)(.)??((?<-2>.)+)^$1$3$^$4


Try it online! Link includes test cases. Explanation:

^((.)+?)(.)??((?<-2>.)+)$ Match a minimal prefix, an optional centre character, and then a suffix of the same length as the prefix. The prefix and centre are lazy rather than greedy as that's shorter than checking that the group $2 is properly balanced.

$^$1$3$^$4  Reverse the prefix and suffix. # Jelly, 9 bytes LHịJ‘œṖ⁸U  Try it online! Full program, due to Jelly's smash-printing ## How it works LHịJ‘œṖ⁸U - Main link. Takes a string S on the left L - Length of S, L H - L÷2 J - Indices of S; [1, 2, 3, ..., L] ị - Index into; If L is even, this just returns L÷2 If L is odd, this returns [(L-1)÷2, [(L+1)÷2] ‘ - Increment ⁸ - Yield S, to prevent œṖ hooking to U œṖ - Partition S at the indices in the left U - Reverse each sublist Implicitly "smash" together (["ip", "z", "az"] -> "ipzaz") and print  # JavaScript (ES6), 59 58 bytes Saved 1 byte thanks to @edc65 Expects an array of characters. s=>s.map(c=>s[i*2]?p=s[i+++i]?c+p:p+c:q=c+q,i=p=q='')&&p+q  Try it online! ### Commented s => // s[] = input string, as an array s.map(c => // for each character c in s[]: s[i * 2] ? // if s[i * 2] is defined, this is either the first // half of the string or the middle character of a // string of odd length: p = // update p: s[i++ + i] ? // if s[i * 2 + 1] is defined, this is not the // middle character: c + p // prepend c to p : // else (middle character): p + c // append c to p : // else (2nd half of the string): q = c + q, // prepend c to q i = p = q = '' // start with p = q = '' and i zero'ish ) // end of map() && p + q // return p + q  • Wow! Little improvement: manual management of i : s=>s.map(c=>s[i*2]?p=s[i+++i]?c+p:p+c:q=c+q,i=p=q='')&&p+q Apr 19 at 13:21 • @edc65 Thank you! The weird thing is I'm almost certain that I tried exactly that and thought it was just as long. Apr 19 at 13:26 # 05AB1E, 1613 12 bytes R2ä?IgÉiÁ}?  Try it online! R reverse input 2ä slice to 2 pieces, i.e. ["azz", "ip"]  dump pieces to stack ? print last piece without newline I push input g length É is odd iÁ} if true rotate right by one ? print without newline  • Slightly more interesting way IMO: insert an Á before the I, change the É to an È, and change iÁ} to ._. Apr 19 at 3:04 # J, 25 22 bytes [:;]<@|./.~#\*@-2%~1+#  Try it online! ## the idea Consider discord. We solve in two steps: • Create a mask like _1 _1 _1 0 1 1 1. For even number inputs, the mask will not contain 0. • Use that mask to partition into groups, reversing each group. ## J details Using discord as an example: • 1+# The length plus one, 8 in this case • 2%~ Divided by 2, so now 4. • - Subtracted elementwise from • #\ The range 1..<length>  _3 _2 _1 0 1 2 3  • *@ Sign of each:  _1 _1 _1 0 1 1 1  • /.~ Use that as mask to group the input • <@|. Reversing and boxing each group ┌───┬─┬───┐ │sid│c│dro│ └───┴─┴───┘  • [:; Raze sidcdro  # Python 3.8 (pre-release), 50 bytes lambda x:x[(l:=len(x)//2)-1::-1]+x[l:-l]+x[:~l:-1]  Try it online! -8 bytes thanks to dingledooper • 50 bytes Apr 18 at 21:47 • @dingledooper oh, that's a nice way to use slices. thanks! Apr 18 at 22:06 # Pyth, 21 bytes ++_<QK/lQ2*@QK%lQ2_>K  Try it online! Q # input K/lQ2 # Set K to len(Q)/2 (integer division) _<QK # Take first K elements and reverse them *@QK%lQ2 # The element at index K taken len(Q) % 2 times _>K # Take last K elements and reverse them ++ # Concatenate them  -2 bytes thanks to hakr14 • 21 bytes Apr 18 at 18:25 # R, 81 79 bytes function(s,n=nchar(s),m=n/2+1)intToUtf8(utf8ToInt(s)[c(m:2-1,m[n>1&n%%2],n:m)])  Try it online! -2 bytes thanks to @Dominic -2 bytes thanks to @Giuseppe Developed independently from @Dominic's answer, but some golfs adapted from there. Abuses the fact that range operator : and extract operator [ both cast their inputs to int. • 79 bytes. very nice! Apr 19 at 14:06 • @Giuseppe, thanks! I need to remember that golf, it's really useful :) Apr 20 at 4:53 # Retina 0.8.2, 42 bytes ^|$
¶
+(.*¶)(.)(.*)(.)(¶.*)
$2$1$3$5$4 ¶  Try it online! Link includes test cases. Explanation: ^|$
¶


Wrap the input in a working area of three lines.

(.*¶)(.)(.*)(.)(¶.*)
$2$1$3$5$4  Extract the first and last characters of the input, building them up in reverse in the working area. +  Continue extracting characters until there is at most one left. ¶  Join the pieces back together. # Jelly, 9 bytes ŒHṚU2¦FƲ⁺  A monadic Link accepting a list that yields a list. Try it online! ### How? ŒHṚU2¦FƲ⁺ - Link: list, S ⁺ - repeat this twice - i.e. f(f(S)): Ʋ - last four links as a monad - f(x) ŒH - split (x) into two halves (odd length x gives longer first half) Ṛ - reverse 2¦ - apply to second element: U - upend (reverses just 2nd element) F - flatten  Another 9 byter using the same method: ŒHṪ;UFƲ$⁺

• I'm surprised ŒHṪ;UFµ⁺ doesn't work Apr 18 at 18:02
• Ṫ;UF needs to be a single link/chain. Apr 18 at 18:03

# Red, 81 bytes

func[s][rejoin[reverse take/part s(n: length? s)/ 2 take/part s n % 2 reverse s]]


Try it online!

# Using parse, 93 bytes

func[s][h:(n: length? s)/ 2 d: n % 2 b:[change copy t h skip(reverse t)]parse s[b d skip b]s]


Try it online!

# SNOBOL4 (CSNOBOL4), 95 bytes

	M =LEN(SIZE(I =INPUT) / 2)
I M . L ARB . C M . R RPOS(0)
OUTPUT =REVERSE(L) C REVERSE(R)
END


Try it online!

# V (vim), 54 bytes

YpC<c-r>=strlen('<c-r>"')/2
<esc>DkA <esc>0@"li
<esc>$@"hi <Esc>:%!rev gJgJF x  Try it online! The 'no whitespace' guarantee helped a lot with writing this solution. ## Explanation YpC<c-r>=strlen('<c-r>"')/2 Yp copy input to new line C cut and open insert mode <c-r>=strlen('<c-r>"')/2 set the line to half of input length call this k <esc>DkA <esc>0@"li <esc> exit insert mode D delete the number k(and copy) k move to the input A <esc> insert a space at the end 0@"l move right k times from the start i insert a newline <esc>$@"hi
\$@"hi                  do the same thing, except from the right

<esc>:%!rev                 reverse all lines

gJgJF x
gJgJ                        join the three lines
F                       navigate to the previous space
x                     delete it


# Vyxal, d, 7 bytes

Ṙ½ÞTRÞT


Try it Online!

Porting Jelly is always the best way to do code-golf.

## Explained

Ṙ½ÞTRÞT
Ṙ         # reversed(input)
½        # ↑ split into two halves
ÞT      # transpose ↑
R     # reverse each row in ↑ (when neither argument is a function, reduce performs vectorised reverse instead)
ÞT   # tranpose ↑ and deep sum (flatten then sum) using -d flag


# Julia, 50 48 bytes

a->a[(d=(l=end)÷2):-1:1]a[d+1:l-d]a[l:-1:l-d+1]


Try it online!

# Charcoal, 15 bytes

⭆⪪θ⊘⊕Ｌθ⭆⪪ι⊘Ｌθ⮌λ


Try it online! Link is to verbose version of code. Explanation:

  θ             Input string
⪪              Split into pieces of length
θ         Input string
Ｌ          Length
⊕           Incremented
⊘            Halved
⭆               Map over pieces and join
ι      Current piece
⪪       Split into pieces of length
θ   Input string
Ｌ    Length
⊘     Halved
⭆        Map over pieces and join
λ Current piece
⮌  Reversed
Implicitly print


# Python 3.8, 63 62 bytes

lambda s:s[(l:=len(s))//2-1::-1]+s[l//2]*(l&1)+s[:-~l//2-1:-1]


Try it online!

# 05AB1E (legacy), 9 bytes

g;¤Ā‚Ć£íJ


Explanation:

g          # Get the length of the (implicit) input
;         # Halve it
¤        # Get the last digit (without popping), which is either 0 or 5
Ā       # Truthify it, converting the 5 to 1 (0 remains 0)
‚      # Pair the two values together
Ć     # Enclose it; appending the leading halve length as trailing item
£    # Split the (implicit) input into parts of that size (which truncates the
# decimals)
í   # Reverse each part
J  # Join the parts back together to a string
# (after which the result is output implicitly)


It uses the legacy version of 05AB1E, because in the new version the ¤ won't work on decimals and would require an explicit cast to string (so 10 bytes instead: g;§¤Ā‚Ć£íJ).

# Japt, 13 bytes

Splits the input (e.g. "pizza" or "pizzas") into an array based on indexes (e.g. ["pi", "z", "za"] or ["piz", "zas"]), then maps each item through string reverse and joins again.

üÏgUÊ*½-½ÃmÔ¬
ü             // Group input characters by mapped value where
Ï            // depending on whether the index is smaller, equal or larger than
UÊ*½-½     // input's length in half minus half,
g           // the value is -1, 0, or 1.
Ã    // Then,
mÔ¬ // map each item through reverse and join to a string.


Try it here.

# Java (JDK), 274 bytes

class A{public static void main(String[]a){System.out.print(new StringBuilder(a.substring(0,a.length()/2)).reverse().toString()+(a.length()%2==1?a.charAt(a.length()/2):"")+new StringBuilder(a.substring((int)(a.length()/2D+.5D))).reverse().toString());}}


Try it online!

• @ceilingcat 179 bytes by using interface A{static void main instead of class A{public static void main and StringBuffer instead of StringBuilder. May 18 at 14:33