Activity for Shaggy
Type | On... | Excerpt | Status | Date |
---|---|---|---|---|
Edit | Post #292259 | Initial revision | — | 8 months ago |
Answer | — |
A: Substring factor Japt v1.4.5, 7 bytes â¬d!øUs Try it â¬d!øUs :Implicit input of integer U ⬠:Divisors, excluding itself d :Are any !ø : Contained in Us : The string representation of U Or, if we could simply output truthy or fal... (more) |
— | 8 months ago |
Edit | Post #291900 | Initial revision | — | 9 months ago |
Answer | — |
A: Hex detector Japt `-d`, 8 bytes °U3¥NÉ Try it 9 bytes NøT±1wU6 Try it (more) |
— | 9 months ago |
Comment | Post #288502 |
I think this would benefit from reiterating the last bullet point from the "Output" section in the "Equivalence" section. On first read through, I wasn't 100% clear on whether we needed to handle rotations, etc. (more) |
— | almost 2 years ago |
Edit | Post #288561 | Initial revision | — | almost 2 years ago |
Answer | — |
A: Efficient censorship Japt `-h`, 7 bytes à ñÊkøV Try it à ñÊkøV :Implicit input of strings U=X & V=Y à :Powerset of U ñ :Sort by Ê : Length k :Remove elements that øV : Contain V :Implicit output of last eleme... (more) |
— | almost 2 years ago |
Edit | Post #287337 |
Post edited: |
— | almost 2 years ago |
Edit | Post #287337 |
Post edited: |
— | almost 2 years ago |
Edit | Post #287816 |
Post edited: |
— | about 2 years ago |
Suggested Edit | Post #287816 |
Suggested edit: (more) |
helpful | about 2 years ago |
Edit | Post #287212 |
Post edited: |
— | over 2 years ago |
Edit | Post #287210 |
Post edited: |
— | over 2 years ago |
Edit | Post #287405 | Initial revision | — | over 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) |
— | over 2 years ago |
Edit | Post #287337 |
Post edited: |
— | over 2 years ago |
Edit | Post #287337 |
Post edited: |
— | over 2 years ago |
Edit | Post #287337 |
Post edited: |
— | over 2 years ago |
Edit | Post #287337 | Initial revision | — | over 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) |
— | over 2 years ago |
Comment | Post #287173 |
May we take input as an array of balanced quinary digits? (more) |
— | over 2 years ago |
Edit | Post #282301 |
Post edited: |
— | over 2 years ago |
Edit | Post #287212 |
Post edited: |
— | over 2 years ago |
Edit | Post #287212 | Initial revision | — | over 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) |
— | over 2 years ago |
Edit | Post #287194 |
Post edited: |
— | over 2 years ago |
Comment | Post #287194 |
Ah, that's what I was missing! Thanks, @#53196. (more) |
— | over 2 years ago |
Comment | Post #287210 |
D'oh! I could, of course. Thanks, @#53890. (more) |
— | over 2 years ago |
Edit | Post #287210 |
Post edited: |
— | over 2 years ago |
Edit | Post #287210 | Initial revision | — | over 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) |
— | over 2 years ago |
Edit | Post #287209 |
Post edited: |
— | over 2 years ago |
Edit | Post #287209 | Initial revision | — | over 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) |
— | over 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) |
— | over 2 years ago |
Edit | Post #287205 |
Post edited: |
— | over 2 years ago |
Edit | Post #287205 | Initial revision | — | over 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) |
— | over 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) |
— | over 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) |
— | over 2 years ago |
Edit | Post #287194 | Initial revision | — | over 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) |
— | over 2 years ago |
Comment | Post #287182 |
Is `null` a valid output if there are no vowels? (more) |
— | over 2 years ago |
Edit | Post #287191 | Initial revision | — | over 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) |
— | over 2 years ago |
Edit | Post #282301 |
Post edited: |
— | over 2 years ago |
Edit | Post #287168 |
Post edited: |
— | over 2 years ago |
Edit | Post #287168 |
Post edited: |
— | over 2 years ago |
Edit | Post #287168 | Initial revision | — | over 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) |
— | over 2 years ago |