Quotes around sequence of chars

Question

Challenge

Your goal is to write a function that puts quotes around a sequence of capital letters in a string.

So some examples (everything on the left (before function) and right (after function) are STRINGS):

Hello the name's John Cena -> "H"ello the name's "J"ohn "C"ena

I got BIG OLD truck -> "I" got "BIG" "OLD" truck

[OLD, joe, SMOE] ->["OLD", joe, "SMOE"]

'BIG') -> '"BIG"')

fOOd -> f"OO"d

"78176&@*#dd09)*@(&#*@9a0YOYOYOYOYOYOOYOYOYOY28#@e -> "78176&@*#dd09)*@(&#*@9a0"YOYOYOYOYOYOOYOYOYOY"28#@e

Assumptions and Clarifications

The sequence of capital letters can have a length of one (e.g. a string containing one character: H -> "H")
You can assume there will be only a string inputted.

Winning Criteria

Code golf, fewest bytes wins.

I'm having difficulties seeing that first test case... :P. Probably because the time is now! — lyxal, Commented Mar 17, 2020 at 4:14
I'm unable to see the words "John Cena"... Must be something to do with his phrase "you can't see me, my time is now". :P — lyxal, Commented Mar 17, 2020 at 20:57

Grimmy · Accepted Answer · 2020-03-16 17:46:45Z

4

Perl 5, 15 bytes

s/[A-Z]+/"$&"/g

Try it online!

answered Mar 16, 2020 at 17:46

Grimmy

15.8k1 gold badge34 silver badges64 bronze badges

Add a comment |

Grimmy · Accepted Answer · 2020-03-16 17:39:13Z

3

05AB1E, 13 bytes

0.ø.γ.u}'"ý¦¨

Try it online!

0.ø              # surround input string with 0s
   .γ  }         # group characters by:
     .u          #  is uppercase?
        '"ý      # join groups with quotes
           ¦¨    # remove the first and last characters (0s)

edited Mar 16, 2020 at 17:39

answered Mar 16, 2020 at 17:35

Grimmy

15.8k1 gold badge34 silver badges64 bronze badges

Add a comment |

manatwork · Accepted Answer · 2020-03-16 18:14:12Z

3

Gema, 8 characters

<K>="$0"

Sample run:

bash-5.0$ gema '<K>="$0"' <<< 'Hello the name’s John Cena'
"H"ello the name’s "J"ohn "C"ena

Try it online!

answered Mar 16, 2020 at 18:14

manatwork

20.6k5 gold badges51 silver badges81 bronze badges

Add a comment |

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

3

JavaScript (ES6), 32 30 bytes

Using a reference to the last match

Version suggested by @Grimmy
Saved 2 bytes thanks to @Shaggy

s=>s.replace(/[A-Z]+/g,'"$&"')

Try it online!

JavaScript (ES6), 35 bytes

With a callback function

s=>s.replace(/[A-Z]+/g,s=>`"${s}"`)

Try it online!

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Mar 16, 2020 at 17:40

Arnauld

198k20 gold badges179 silver badges650 bronze badges

\$\begingroup\$ amazing nice job \$\endgroup\$
– Si Random
Commented Mar 16, 2020 at 17:41
1

\$\begingroup\$ 32 with backrefs \$\endgroup\$
– Grimmy
Commented Mar 16, 2020 at 17:43
\$\begingroup\$ Why not just $&? \$\endgroup\$
– Shaggy
Commented Mar 16, 2020 at 18:22

Add a comment |

RGS · Accepted Answer · 2020-03-16 17:50:57Z

2

Python 3, 47 bytes

lambda s:re.sub('([A-Z]+)',r'"\1"',s)
import re

Try it online!

answered Mar 16, 2020 at 17:50

RGS

14.1k1 gold badge57 silver badges116 bronze badges

Add a comment |

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

2

Japt, 11 bytes

r"%A+"`"$&"

Try it

edited Jun 17, 2020 at 9:04

CommunityBot

1

answered Mar 16, 2020 at 18:06

Gymhgy

8,02811 silver badges35 bronze badges

Add a comment |

user92069user92069 · Accepted Answer · 2020-03-17 02:26:58Z

2

Pyth, 20 bytes

Blatant port of RGS's Python answer. (I relized that I posted to the wrong challenge, whoops!)

:Q"([A-Z]+)""\"\\1\"

Try it online!

answered Mar 17, 2020 at 2:26

user92069

\$\begingroup\$ A shorter way to write the second string is s[N\\1N \$\endgroup\$
– isaacg
Commented Mar 17, 2020 at 19:51

Add a comment |

Noodle9 · Accepted Answer · 2020-03-17 10:09:03Z

2

sed, 26 21 bytes

Saved 5 bytes thanks to Xcali!!!

s/[[:upper:]]\+/"&"/g

Try it online!

edited Mar 17, 2020 at 10:09

answered Mar 16, 2020 at 18:47

Noodle9

20.3k3 gold badges21 silver badges46 bronze badges

\$\begingroup\$ Using & cuts down on the byte count: Try it online! \$\endgroup\$
– Xcali
Commented Mar 17, 2020 at 2:28
\$\begingroup\$ @Xcali Nice one - thanks! :-) \$\endgroup\$
– Noodle9
Commented Mar 17, 2020 at 10:10

Add a comment |

IMP1 · Accepted Answer · 2020-03-17 14:18:39Z

Ruby, 64 bytes

->s{s.chars.chunk{|c|c<c.downcase}.map{|u,c|u ??"+c*''+?":c}*''}

Try it online!

Longer than the other Ruby solution, but one that doesn't use regex. I also love an excuse to use chunk.

This groups successive characters of the string depending on whether or not they're uppercase, and then surround the ones that are uppercase with ". I had to do the downcase check rather than checking with upcase, because otherwise non-character strings (spaces, punctuation, etc.) would also be considered uppercase letters.

Golfy Tricks:

*'' instead of .join
< instead of !=

Grimmy · Accepted Answer · 2020-03-16 17:58:37Z

1

Retina, 11 bytes

[A-Z]+
"$&"

Try it online!

I thought Retina has a shortcut for [A-Z] but apparently that only works in transliterations and not substitutions? Hmm...

answered Mar 16, 2020 at 17:58

Grimmy

15.8k1 gold badge34 silver badges64 bronze badges

Add a comment |

Jonathan Allan · Accepted Answer · 2020-03-16 18:57:34Z

1

V (vim), 9 bytes

Í¨õ«©/"±"

Try it online!

This instructs Vim to replace all occurrences on all lines (Í)
...using the substitution $\u$\+/"\1". Each \x may be replaced by x with the high-bit set, thus \1 becomes ±, etc...

answered Mar 16, 2020 at 18:57

Jonathan Allan

110k7 gold badges65 silver badges282 bronze badges

Add a comment |

user92069user92069 · Accepted Answer · 2020-03-17 00:58:00Z

1

QuadR, 10 bytes

Port of @Adám's answer.

[A-Z]+
"&"

Try it online!

answered Mar 17, 2020 at 0:58

user92069

\$\begingroup\$ yo didn't realize ur question so similar my bad bro, got notified \$\endgroup\$
– Si Random
Commented Mar 17, 2020 at 1:16

Add a comment |

Noodle9 · Accepted Answer · 2020-03-17 01:19:16Z

1

C (gcc), ^{100 \$\cdots\$ 74} 72 bytes

Saved 21 23 bytes thanks to ceilingcat!!!
Saved a byte thanks to S.S. Anne!!!

t;u;f(int*s){for(t=1;*s;printf(s++),t=u)(u=*s<65|*s>90)^t&&putchar(34);}

Try it online!

Uses wchar_t strings for input.

edited Mar 17, 2020 at 1:19

answered Mar 16, 2020 at 19:14

Noodle9

20.3k3 gold badges21 silver badges46 bronze badges

\$\begingroup\$ @ceilingcat Wow! That's a great golf! Very readable in a golfy way: print quotes when we 're about to move in or out of caps. And of course that makes the putchar refactoring redundant - thanks! :-) \$\endgroup\$
– Noodle9
Commented Mar 16, 2020 at 22:57
\$\begingroup\$ -1 with widechar \$\endgroup\$
– S.S. Anne
Commented Mar 16, 2020 at 23:36
\$\begingroup\$ Try adding an L before the string to make it a widechar string. \$\endgroup\$
– S.S. Anne
Commented Mar 16, 2020 at 23:46
\$\begingroup\$ @S.S.Anne Ah, that's a good one - thanks! :-) \$\endgroup\$
– Noodle9
Commented Mar 17, 2020 at 0:06
\$\begingroup\$ @ceilingcat Huh, that's very interesting - thanks! :-) \$\endgroup\$
– Noodle9
Commented Mar 17, 2020 at 1:20

Add a comment |

lyxal · Accepted Answer · 2020-03-17 02:06:34Z

1

Keg, 31 bytes

0&?(:A$Z$•[⑻[|1⑼\",],|⑻[\",]0⑾,

Try it online!

But seriously, don't ask who Joe is.

answered Mar 17, 2020 at 2:06

lyxal

34.3k2 gold badges64 silver badges141 bronze badges

\$\begingroup\$ wait, but, who's joe? \$\endgroup\$
– Si Random
Commented Mar 19, 2020 at 13:48
1

\$\begingroup\$ Joe mama! (I warned you not to ask! :P) \$\endgroup\$
– lyxal
Commented Mar 19, 2020 at 22:00
1

\$\begingroup\$ LLLLLLLLLLOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL \$\endgroup\$
– Si Random
Commented Mar 19, 2020 at 22:25
\$\begingroup\$ Ha! Got'em! Haha XD lol! \$\endgroup\$
– lyxal
Commented Mar 19, 2020 at 22:28

Add a comment |

Sumner18 · Accepted Answer · 2020-03-17 14:11:44Z

1

R, 34 bytes

gsub("([A-Z]+)","'\\1'",scan(,''))

Try it online!

Simple use of Regular Expressions.

39 bytes

cat(gsub('([A-Z]+)','"\\1"',scan(,'')))

Try it online!

This method is the only way I can get the double quotes to work.

edited Mar 17, 2020 at 14:11

answered Mar 16, 2020 at 18:38

Sumner18

1,9269 silver badges19 bronze badges

\$\begingroup\$ @JoKing Seems inconsequential to me. There was no specification on the type of quotes, but shockingly enough, the R code to switch it would be longer. \$\endgroup\$
– Sumner18
Commented Mar 17, 2020 at 13:42

Add a comment |

Noodle9 · Accepted Answer · 2020-03-16 18:53:05Z

0

AWK, 22 bytes

gsub("[A-Z]+","\"&\"")

Try it online!

answered Mar 16, 2020 at 18:53

Noodle9

20.3k3 gold badges21 silver badges46 bronze badges

Add a comment |

Neil · Accepted Answer · 2020-03-16 21:46:46Z

0

Charcoal, 20 bytes

Ｆ⁺Ｓ «ω✂"⁼№⪪α¹ω№αι≔ιω

Try it online! Link is to verbose version of code. Port of my answer to the question linked by @manatwork in the comments.

answered Mar 16, 2020 at 21:46

Neil

177k12 gold badges74 silver badges281 bronze badges

Add a comment |

Nick Kennedy · Accepted Answer · 2020-03-16 23:05:34Z

0

Jelly, 11 bytes

e€ØAŻIœṗj”"

Try it online!

A monadic link taking a string and returning a string.

answered Mar 16, 2020 at 23:05

Nick Kennedy

21.2k3 gold badges17 silver badges43 bronze badges

Add a comment |

Flying Green Banana · Accepted Answer · 2020-03-16 23:07:31Z

0

perl -pE, 16 bytes

s/\p{Lu}+/"$&"/g

Unicode compliant, unlike the s/[A-Z]+/"$&"/g solution presented earlier.

answered Mar 16, 2020 at 23:07

Flying Green Banana

1

2

\$\begingroup\$ Needs a -CS to actually be unicode compliant. Without the flag, outputs garbage. \$\endgroup\$
– Grimmy
Commented Mar 16, 2020 at 23:43

Add a comment |

IMP1 · Accepted Answer · 2020-03-17 14:10:19Z

0

Ruby, 30 bytes

->s{s.gsub(/([A-Z]+)/,'"\1"')}

Try it online!

A simple regex substitution.

answered Mar 17, 2020 at 14:10

IMP1

7013 silver badges7 bronze badges

Add a comment |

Stack Exchange Network

Quotes around sequence of chars

Challenge

So some examples (everything on the left (before function) and right (after function) are STRINGS):

Assumptions and Clarifications

Winning Criteria

20 Answers 20

Perl 5, 15 bytes

05AB1E, 13 bytes

Gema, 8 characters

JavaScript (ES6), 32 30 bytes

Using a reference to the last match

JavaScript (ES6), 35 bytes

With a callback function

Python 3, 47 bytes

Japt, 11 bytes

Pyth, 20 bytes

sed, 26 21 bytes

Ruby, 64 bytes

Golfy Tricks:

Retina, 11 bytes

V (vim), 9 bytes

QuadR, 10 bytes

C (gcc), ^{100 \$\cdots\$ 74} 72 bytes

Keg, 31 bytes

R, 34 bytes

39 bytes

AWK, 22 bytes

Charcoal, 20 bytes

Jelly, 11 bytes

perl -pE, 16 bytes

Ruby, 30 bytes

Your Answer

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

Linked

Hot Network Questions

Quotes around sequence of chars

Challenge

So some examples (everything on the left (before function) and right (after function) are STRINGS):

Assumptions and Clarifications

Winning Criteria

20 Answers 20

Perl 5, 15 bytes

05AB1E, 13 bytes

Gema, 8 characters

JavaScript (ES6), 32 30 bytes

Using a reference to the last match

JavaScript (ES6), 35 bytes

With a callback function

Python 3, 47 bytes

Japt, 11 bytes

Pyth, 20 bytes

sed, 26 21 bytes

Ruby, 64 bytes

Golfy Tricks:

Retina, 11 bytes

V (vim), 9 bytes

QuadR, 10 bytes

C (gcc), 100 \$\cdots\$ 74 72 bytes

Keg, 31 bytes

R, 34 bytes

39 bytes

AWK, 22 bytes

Charcoal, 20 bytes

Jelly, 11 bytes

perl -pE, 16 bytes

Ruby, 30 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 or ask your own question.

Linked

Related

Hot Network Questions

C (gcc), ^{100 \$\cdots\$ 74} 72 bytes

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