Activity for Shaggy
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Comment | Post #287153 |
I think the test cases would be easier to visualise using a non-whitespace character for the "background". (more) |
— | over 2 years ago |
| Edit | Post #287166 | Initial revision | — | over 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) |
— | over 2 years ago |
| Comment | Post #287132 |
There are _plenty_ of others but I'm partial to codepen.io, myself. (more) |
— | over 2 years ago |
| Edit | Post #287125 |
Post edited: |
— | over 2 years ago |
| Edit | Post #287124 |
Post edited: |
— | over 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) |
— | over 2 years ago |
| Comment | Post #287133 |
I would VTC this as a dupe of your existing challenge about fruits. (more) |
— | over 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) |
— | over 2 years ago |
| Edit | Post #287125 |
Post edited: |
— | over 2 years ago |
| Edit | Post #287124 |
Post edited: |
— | over 2 years ago |
| Edit | Post #287125 |
Post edited: |
— | over 2 years ago |
| Edit | Post #287125 |
Post edited: |
— | over 2 years ago |
| Edit | Post #287125 | Initial revision | — | over 2 years ago |
| Answer | — |
A: The holeyest base Japt `-h`, 19 18 bytes Gõ ñ@ìX xg#5#}4s3 Try it Gõ ñ@ìX xg#5#}4s3 :Implicit input of integer U G :16 õ :Range [1,G] ñ :Sort by @ :Passing each X through the following functio... (more) |
— | over 2 years ago |
| Edit | Post #287124 |
Post edited: |
— | over 2 years ago |
| Edit | Post #287124 |
Post edited: |
— | over 2 years ago |
| Edit | Post #287124 | Initial revision | — | over 2 years ago |
| Answer | — |
A: 8 coexisting queens Japt `-R`, 16 15 bytes Uses spaces for `#`s and `"`s for `Q`s. ##Ë64ì £QùXÄÃy Test it (footer reformats the output to use the characters from the spec) This one uses `1`s for `#`s. ##Ë64ì £#ÿ¤hXQ Test it (footer as above) ##Ë64ì £QùXÄÃy ##Ë64 ... (more) |
— | over 2 years ago |
| Comment | Post #287090 |
Seeing as there are only 12 possible layouts before without rotation/reflection, it'd probably be best to include them as examples. (more) |
— | over 2 years ago |
| Comment | Post #282836 |
Instead of creating a new object, you're assigning the callback function of the `map` to variable `d` and using that as your object. (more) |
— | over 2 years ago |
| Edit | Post #286986 |
Post edited: |
— | over 2 years ago |
| Edit | Post #287081 |
Post edited: |
— | over 2 years ago |
| Edit | Post #287081 | Initial revision | — | over 2 years ago |
| Answer | — |
A: Determine whether an integer is square-free JavaScript, 31 bytes Outputs `0` for falsey and a non-zero value for truthy. If the 2 values must be consistent then replace the last `` with `&&` to output `true` instead. n=>(g=d=>d++>n||n%d2g(d))(1) Try it online! (more) |
— | over 2 years ago |
| Comment | Post #282836 |
[26 bytes](https://tio.run/##JYxBCoMwFETX5hR/V4Nfwaa1FIkXCVkETUqLNWJCNqW9ehojw8zADLyXCsqN23P19WInHQ2Pig@qeau1nHjgwySC5PVvLxpHuzgPXjvvgIMghWixxXNWm8WQSUw7wxte8YL39LDkDjtJZE@IsRuUsz4oYM1Bo/AhxU63s25m@yjzW8EJ6iFFBSYvlPbkG/8) (more) |
— | over 2 years ago |
| Edit | Post #287054 |
Post edited: |
— | over 2 years ago |
| Comment | Post #287054 |
It's an anonymous function, @#56533, just like we have in [JavaScript](https://codegolf.codidact.com/posts/287035/287045#answer-287045) .The `f=` would only need to be included if the function were recursive. (more) |
— | over 2 years ago |
| Comment | Post #287054 |
I see where I went wrong! Fixed. Thanks, @#8056. (more) |
— | over 2 years ago |
| Edit | Post #287054 |
Post edited: |
— | over 2 years ago |
| Edit | Post #287054 | Initial revision | — | over 2 years ago |
| Answer | — |
A: Presumptuous base conversion Python, 45 bytes I am not a Python guy at all, so I'm quite proud of this. I'm sure, though, there's something simple I could be doing to save myself a few bytes! lambda n:int(n,int(max("1"+n),16)+1)or len(n) Try it online! (more) |
— | over 2 years ago |
| Comment | Post #287050 |
Actually, screw it, I'm quite proud of that, seeing as I'm not a Python guy so I'm having it for meself! 😆 Sorry! (more) |
— | over 2 years ago |
| Comment | Post #287050 |
[45 bytes](https://tio.run/##K6gsycjPM7YoKPqfZhvzPycxNyklUSHPKjOvRCNPB0TmJlZoKBkpaedp6hiaaWobauYXKeSk5mnkaf4vKAIpSNNQMjE1VtLU/J8GAA), for starters. (more) |
— | over 2 years ago |
| Comment | Post #287050 |
I'm not a Python guy but would a lambda not be shorter? (more) |
— | over 2 years ago |
| Edit | Post #286972 |
Post edited: |
— | over 2 years ago |
| Edit | Post #287044 |
Post edited: |
— | over 2 years ago |
| Edit | Post #287045 |
Post edited: |
— | over 2 years ago |
| Edit | Post #287045 |
Post edited: |
— | over 2 years ago |
| Edit | Post #287045 |
Post edited: |
— | over 2 years ago |
| Edit | Post #287044 | Post undeleted | — | over 2 years ago |
| Edit | Post #287044 |
Post edited: |
— | over 2 years ago |
| Edit | Post #287045 |
Post edited: |
— | over 2 years ago |
| Edit | Post #287045 | Post undeleted | — | over 2 years ago |
| Edit | Post #287045 |
Post edited: |
— | over 2 years ago |
| Edit | Post #287045 | Post deleted | — | over 2 years ago |
| Edit | Post #287044 | Post deleted | — | over 2 years ago |
| Edit | Post #287045 | Initial revision | — | over 2 years ago |
| Answer | — |
A: Presumptuous base conversion JavaScript, 73 71 63 53 52 bytes Well, this ain't pretty at all! Will need to take another pass over it to try to improve upon it, maybe with recursion.Yeah, I was completely overthinking this one! s=>parseInt(s,`0x`+[...s].sort().pop()-0)||s.length Try it online! (Includes all test ... (more) |
— | over 2 years ago |
| Edit | Post #287044 |
Post edited: |
— | over 2 years ago |