Create this "String Mix-Up" function in as few bytes as possible

Question

This is my first time here at Code Golf SE so feel free to add your input/advice/suggestions to improve my post if necessary. The week after my computer science exam, the solutions were publicly published. One problem had a 45 line example solution but my solution was only 18 lines, (which I was very proud of), but I bet you guys here at code golf SE can do better.

Here are the requirements:

• Takes two inputs, string1 and string2.
• Delete the first occurrence of string2 found in the string1.
• Add string2 in reverse order to the beginning of string1, and
• Add string2 in reverse order to the end of the string1.
• If string2 does not occur in string1, do not modify string1.
• Output the modified string1

Example:

Input:

batman
bat

thebatman
bat

batman
cat

Output:

tabmantab

tabthemantab

batman

Note: The problem was intended to handle basic inputs. Assume all expected inputs are restricted to characters A-Z, numbers, or other special characters visible on your keyboard. It does not need to handle tabs or newlines.

Submissions with shortest byte counts in each language win.

Answer 1

Stax, 16 11 bytes

ÄE┘¢8·╦Ωb•∩

Run and debug it online

The corresponding ascii representation of the same program is this.

Y#xyz|eyr|Sx?

This fixes the bugs in original version. It uses conditionals and stuff.

Y                   Save 2nd input in y.  Now the two inputs are x and y.
 #                  Occurrences of y in x. (a)
  xyz               x, y, ""
     |e             replace first occurrence
       yr|S         surround with y reversed. (b)
           x        first input. (c)
            ?       a ? b : c

The result is printed implicitly.

Answer 2

Python, 55 bytes

lambda s,t:s.replace(t,'',1).join(2*[t[::-1]*(t in s)])

Try it online!

Using join to get the a+b+a pattern. This lets us write expression for a only once while still using a lambda. Compare:

Python 2, 57 bytes

def f(s,t):r=t[::-1]*(t in s);print r+s.replace(t,'',1)+r

Try it online!

Answer 3

APL (Dyalog Unicode), 36 bytes^SBCS

Look ma, no regex!

Anonymous infix lambda, taking string2 as left argument and string1 as right argument. Assumes ⎕IO (Index Origin) to be 0, which is default on many systems.

{r,⍵[(⍳≢⍵)~(f⍳1)+⍳≢⍺],r←⌽⍺/⍨∨/f←⍺⍷⍵}

Try it online!

{…} "dfn"; ⍺ is left argument, ⍵ is right argument; e.g. "bat" and "manbatmanbat":

 ⍺⍷⍵ find where string2 begins in string1; [0,0,0,1,0,0,0,0,0,1,0,0]

 f← assign to f (find)

 ∨/ OR-reduction (does string2 occur at all?); 1

 ⍺/⍨ use that to compress string2 ("" if not found); "bat"

 ⌽ reverse that; "tab"

 r← assign to r (reverse)

 ⍵[…], prepend string2 indexed by the following indices:

  ≢⍵ the length of string2; 3

  ⍳ the indices of that; [0,1,2]

  (…)+ add the following to that:

   f⍳1 index of first 1 in f; 3

  Now we have the indices to be removed; [3,4,5]

  (…)~ the following indices except those indices:

   ≢⍵ length of string2; 12

   ⍳ the indices of that; [0,1,2,3,4,5,6,7,8,9,10,11]

  Now we have the indices we want to keep; [0,1,2,6,7,8,9,10,11]

 This gives us the remaining parts of string1 followed by a reversed string2; "manmanbattab"

 r, prepend r to that; "tabmanmanbattab"

Answer 4

C#, 148 bytes

using System.Linq;using System.Text.RegularExpressions;(a,b)=>a==(a=new Regex(Regex.Escape(b)).Replace(a,"",1))?a:(b=string.Concat(b.Reverse()))+a+b

Answer 5

Ruby, 39 38 35 bytes

-3 bytes due to a neat trick by Asone Tuhid

->x,y{(x[y]&&="")?y.reverse!+x+y:x}

Try it online!

Answer 6

Python 3, 56 bytes

lambda s,t:[s,t[::-1]+s.replace(t,'',1)+t[::-1]][t in s]

Try it online!

Answer 7

Retina, 35 bytes

^(.*)¶(.*?)\1(.*)
¶$^$1$2$3$^$1
0A`

Try it online! $^ is new in Retina 1 and reverses its argument which is just what's needed here.

Answer 8

Java 8, 126 113 bytes

(a,b)->a.equals(a=a.replaceFirst(java.util.regex.Pattern.quote(b),""))?a:(b=new StringBuffer(b).reverse()+"")+a+b

Port of @lee's C# .NET answer, so make sure to upvote him!

Try it online.

Old 126 byte answer:

a->b->{Object r=new StringBuffer(b).reverse();return a.contains(b)?r+a.replaceFirst(java.util.regex.Pattern.quote(b),"")+r:a;}

Try it online.

Explanation:

a->b->{                    // Method with two String parameters and String return-type
  Object r=new StringBuffer(b).reverse();
                           //  2nd input reversed
  return a.contains(b)?    //  If the 1st input contains the 2nd:
    r                      //   Output the reversed 2nd input
     +a.replaceFirst(java.util.regex.Pattern.quote(b),"") 
                           //   Removed the first occurrence of the 2nd in the 1st input,
                           //   escaping any characters like dots, pluses, etc.
                           //   and then append that to the result
     +r                    //   appended with the reversed 2nd input again
   :                       //  Else:
    a;}                    //   Simply output the 1st input

Answer 9

Perl 5 + -pl, 38 34 bytes

$s=<>;s/\Q$s//&&s/^|$/reverse$s/ge

-4 thanks to Ton Hospel

Try it online!

Answer 10

05AB1E, 12 bytes

DIåiIõ.;IR.ø

Try it online!

Explanation

D             # duplicate 1st input
 Iåi          # if 2nd input is in first input
    Iõ.;      # replace the first occurrence of 2nd input with the empty string
        IR.ø  # surround with 2nd input reversed

Answer 11

Javascript (ES6), 69 65 64 bytes

x=>y=>x.match(y)?(k=[...y].reverse().join``)+x.replace(y,'')+k:x

Try it online!

Answer 12

K4, 36 bytes

Solution:

{$[#s:x ss y;r,(x_/(#y)#*s),r:|y;x]}

Examples:

q)k){$[#s:x ss y;r,x_/(#y)#*s,r:|y;x]}["batman";"bat"]
"tabman"
q)k){$[#s:x ss y;r,(x_/(#y)#*s),r:|y;x]}["batman";"bat"]
"tabmantab"
q)k){$[#s:x ss y;r,(x_/(#y)#*s),r:|y;x]}["thebatman";"bat"]
"tabthemantab"
q)k){$[#s:x ss y;r,(x_/(#y)#*s),r:|y;x]}["batman";"cat"]
"batman"
q)k){$[#s:x ss y;r,(x_/(#y)#*s),r:|y;x]}["batbatbat";"bat"]
"tabbatbattab

Explanation:

If string 2 (y) is found in string 1 (x) then drop first indices of first occurrence.

{$[#s:x ss y;r,(x_/(#y)#*s),r:|y;x]} / the solution
{                                  } / lambda with implicit x,y
 $[         ;                   ; ]  / $[condition;true;false]
      x ss y                         / string-search for y in x
    s:                               / save result as s
   #                                 / count length
                              |y     / reverse (|) y
                            r:       / save as r
                           ,         / join with
               (          )          / do this together
                        *s           / first (*) s
                       #             / take
                   (#y)              / length of y
                x_/                  / drop (_) over (/)
             r,                      / join with r
                                 x   / (else) return x

Answer 13

Jelly, 18 bytes

œṣ⁹Ḣ;jɗ⁹ṭṚ};Ṛ}ðẇ@¡

Try it online!

Full program.

Answer 14

Javascript 85 bytes

a=>b=>a.includes(b)?[...b].reverse().join``+a.replace(b,'')+[...b].reverse().join``:a

If someone knows how to avoid using split('').reverse().join('') for reversing string, please let me know

f=a=>b=>a.includes(b)?[...b].reverse().join``+a.replace(b,'')+[...b].reverse().join``:a


console.log(f('batman')('bat'))

console.log(f('thebatman')('bat'))

console.log(f('batman')('cat'))

Answer 15

Javascript, ES6 - 73 bytes

b=x=>y=>{v=[...y].reverse().join``;u=x.replace(y,"");alert(u==x?x:v+u+v)}

Answer 16

Python 2, 62 Bytes

def f(a,b):b*=b in a;a=a.replace(b,"",1);b=b[::-1];print b+a+b

Answer 17

Jelly, 21 20 bytes

œṣµḢ;j⁹$ɓ;;@ðU}
ç¹w?

Try it online!

---

Ouch! Why can other languages get 11~12 bytes? Am I doing something wrong?

And finally, I think I know how chain separators works...

œṣµḢ;j⁹$ɓ;;@ðU}   Helper link (dyadic). General structure:
œṣ                <dyad>                    - given x and y, split x at
                                              sublists equal to y.
   Ḣ;j⁹$                <monad>             - given x, join with y except at
                                              first index.
         ;;@                   <dyad>       - given x and y, return y+x+y.
                                              Note that this link is flipped.
             U}                      <dyad> - reverse right argument.

ç¹w?    Main link. Evaluate the last link if the second input is a substring
        of the first input, otherwise - apply identity (do nothing).

Answer 18

SNOBOL4 (CSNOBOL4), 73 bytes

	S =INPUT
	T =INPUT
	S T =	:F(O)
	T =REVERSE(T)
	S =T S T
O	OUTPUT =S
END

Try it online!

What's a regular expression?

Answer 19

AWK, 85 bytes

{for(;x++<N=split($0,a,"");)p=a[x]p;$0=NR%2?L=$0:sub($0,"",L)?p L p:L}!(NR%2)

Try it online!

Input is: primary string on odd-lines, replacement on even lines. Replacement is case sensitive.

Answer 20

Python 3, 58 bytes

def f(a,b):z=(b in a)*b[::-1];return z+a.replace(b,'',1)+z