Activity for Shaggy
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Suggested Edit | Post #287816 |
Suggested edit: (more) |
helpful | almost 2 years ago |
| Edit | Post #287212 |
Post edited: |
— | almost 2 years ago |
| Edit | Post #287210 |
Post edited: |
— | almost 2 years ago |
| Edit | Post #287405 | Initial revision | — | about 2 years ago |
| Answer | — |
A: Digit antitranspose Japt, 2 bytes Input as a multi-line string ÕÔ Try it ÕÔ :Implicit input of string Õ :Transpose Ô :Reverse (more) |
— | about 2 years ago |
| Edit | Post #287337 |
Post edited: |
— | about 2 years ago |
| Edit | Post #287337 |
Post edited: |
— | about 2 years ago |
| Edit | Post #287337 |
Post edited: |
— | about 2 years ago |
| Edit | Post #287337 | Initial revision | — | about 2 years ago |
| Answer | — |
A: Sort letters by height Japt, 23 16 15 13 bytes Lexicographical sort using the custom alphabet `tipbdghkflyqj`. I/O as characters arrays, sorts in ascending order. n`pbdghkf§qj Try it (more) |
— | about 2 years ago |
| Comment | Post #287173 |
May we take input as an array of balanced quinary digits? (more) |
— | about 2 years ago |
| Edit | Post #282301 |
Post edited: |
— | about 2 years ago |
| Edit | Post #287212 |
Post edited: |
— | about 2 years ago |
| Edit | Post #287212 | Initial revision | — | about 2 years ago |
| Answer | — |
A: Mediocre pop count JavaScript, 104 102 99 bytes I/O as a character array. a=>a.filter(x=>a[...Buffer(x)[0].toString(2)].sort()).sort()) Try it online! (more) |
— | about 2 years ago |
| Edit | Post #287194 |
Post edited: |
— | about 2 years ago |
| Comment | Post #287194 |
Ah, that's what I was missing! Thanks, @#53196. (more) |
— | about 2 years ago |
| Comment | Post #287210 |
D'oh! I could, of course. Thanks, @#53890. (more) |
— | about 2 years ago |
| Edit | Post #287210 |
Post edited: |
— | about 2 years ago |
| Edit | Post #287210 | Initial revision | — | about 2 years ago |
| Answer | — |
A: Lowercase, but not just the letters JavaScript, 52 51 28 bytes s=>Buffer(s).map(x=>x|32)+`` Try it online! -1 byte thanks to trichoplax. (more) |
— | about 2 years ago |
| Edit | Post #287209 |
Post edited: |
— | about 2 years ago |
| Edit | Post #287209 | Initial revision | — | about 2 years ago |
| Answer | — |
A: Lowercase, but not just the letters Japt, 3 bytes c|H Try it c|H :Implicit input of string c :Map charcodes | : Bitwise OR with H : 32 (more) |
— | about 2 years ago |
| Comment | Post #287207 |
Why do none of the characters between space & forward slash change? Each one of them has a `0` in the specified position of the binary of their charcode. So I would expect each of them to be changed to `0123456789:;<=>?`, respectively. (more) |
— | about 2 years ago |
| Edit | Post #287205 |
Post edited: |
— | about 2 years ago |
| Edit | Post #287205 | Initial revision | — | about 2 years ago |
| Answer | — |
A: Mediocre pop count Japt, 13 bytes ÆüÈc¤ñÃé ¤¬øX Try it ÆüÈc¤ñÃé ¤¬øX :Implicit input of string U Æ :Filter each character, X by ü : Group & sort U by È : Passing each character through the following function c : ... (more) |
— | about 2 years ago |
| Comment | Post #287194 |
I had considered that, thanks @#53196, but discarded it would group consecutive vowels together and potentially have empty strings in the array, giving an inconsistent output format. (more) |
— | about 2 years ago |
| Comment | Post #285511 |
I'm an idiot! [5 bytes](https://petershaggynoble.github.io/Japt-Interpreter/?v=1.4.6&code=ayDkzmU&input=MjA) (more) |
— | about 2 years ago |
| Edit | Post #287194 | Initial revision | — | about 2 years ago |
| Answer | — |
A: Just the vowels please JavaScript, 27 24 bytes Input as a string, output as a character array or empty array. s=>s.split(/[^aeiou]/i) Try it online! Thanks to Moshi for pointing out the `` I was missing that would allow me to use `split` instead of `match` and get down to 24 bytes. (more) |
— | about 2 years ago |
| Comment | Post #287182 |
Is `null` a valid output if there are no vowels? (more) |
— | about 2 years ago |
| Edit | Post #287191 | Initial revision | — | about 2 years ago |
| Answer | — |
A: Just the vowels please Japt v2.0a0, 3 bytes o\v Try it o\v :Implicit input of string o :Keep only \v :RegEx /[aeiou]/gi (more) |
— | about 2 years ago |
| Edit | Post #282301 |
Post edited: |
— | about 2 years ago |
| Edit | Post #287168 |
Post edited: |
— | about 2 years ago |
| Edit | Post #287168 |
Post edited: |
— | about 2 years ago |
| Edit | Post #287168 | Initial revision | — | about 2 years ago |
| Answer | — |
A: 55 fruit salad: choose your own Kolmogorov complexity Japt, 233 bytes `ÜÊ Ò Í a×G ¯¯o ÖÚb ¯ØÚ × »Ûá ÝÁ Á²g fig ¤¶n ÓI lªo §Ö ÚAo Ú-n Û u Ûo nÂ) em ÇÓy pe pi¦ Îñ ΰn Ѧk Ѧl sb É Èp Èîp Èl y °ÛG Ù i abiu alÚ app¤ aza bael ba ¼ÚAe ÞÃl Öðo ¯mÞö ÖÇÐU ¯qui Öry ¬¬n© c¨Îà emÞV gpe Î\ Just a compressed string, decompressed by... (more) |
— | about 2 years ago |
| Comment | Post #287153 |
I think the test cases would be easier to visualise using a non-whitespace character for the "background". (more) |
— | about 2 years ago |
| Edit | Post #287166 | Initial revision | — | about 2 years ago |
| Answer | — |
A: Up to date JavaScript Try-It-Online There is a new project called Attempt This Online intended as an alternative to TIO. It's pretty nascent so doesn't yet support the same volume of languages as TIO and the only version of JavaScript currently available is Node. Other than that, there are plenty of tools available online for writin... (more) |
— | about 2 years ago |
| Comment | Post #287132 |
There are _plenty_ of others but I'm partial to codepen.io, myself. (more) |
— | about 2 years ago |
| Edit | Post #287125 |
Post edited: |
— | about 2 years ago |
| Edit | Post #287124 |
Post edited: |
— | about 2 years ago |
| Comment | Post #285891 |
The Japt one _must_ work in a couple of other languages, surely? I'd be shocked if it didn't. (more) |
— | about 2 years ago |
| Comment | Post #287133 |
I would VTC this as a dupe of your existing challenge about fruits. (more) |
— | about 2 years ago |
| Comment | Post #287088 |
For the first time here, I find my finger hovering over the `-1` icon and my apologies for not bringing this up in the Sandbox; I did mean to.
This doesn't really feel like a golfing or even coding challenge to me but rather a challenge to find the permutation of the combination that compresses to... (more) |
— | about 2 years ago |
| Edit | Post #287125 |
Post edited: |
— | about 2 years ago |