Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »

Activity for Shaggy‭

Type On... Excerpt Status Date
Answer A: My house is destroyed! Can you make me one?
JavaScript, 47 bytes n=>`0`.repeat(n)+(` 0`.padEnd(n--)+0).repeat(n) Try it online! – Try It Online") My first pass used recursion before I realised I was over thinking things! First 51 byte version includes a leading newline, second 52 byte version was in case that wasn't allow...
(more)
about 3 years ago
Comment Post #283751 Are leading or trailing newlines or spaces permitted?
(more)
about 3 years ago
Edit Post #283768 Post edited:
about 3 years ago
Edit Post #283768 Post edited:
about 3 years ago
Edit Post #283768 Post edited:
about 3 years ago
Edit Post #283768 Initial revision about 3 years ago
Answer A: My house is destroyed! Can you make me one?
Japt `-R`, 11 10 bytes ÆQ+ùUÉÃvçQ Try it ÆQ+ùUÉÃvçQ :Implicit input of integer U Æ :Map the range [0,U) Q : Quotation mark + : Append another ù : Left padded with spaces to length UÉ : ...
(more)
about 3 years ago
Comment Post #283765 [51 bytes](https://tio.run/##KypNqvyfZvtf1y6vOk/X1tg62v7R1CnaQGKZVh6Imq6jBRJaAGKvgQgtjtXSrcvTAbJmgbgrIaJzY2v/59mmp5YU65Xkx2dyFSik6Wnkaf43AQA)
(more)
about 3 years ago
Edit Post #283735 Post edited:
about 3 years ago
Edit Post #283735 Initial revision about 3 years ago
Answer A: Roll n fair dice
Japt `-mx`, 3 bytes Takes `n` as the first input and `m` as the second. ÒVö Try it ÒVö :Implicit map of the range [0,first input) Ò :Negate the bitwise NOT of (i.e., increment) V :Second input ö :Random int in range [0,V) :Implicit...
(more)
about 3 years ago
Comment Post #283649 Banning built-ins (which is what I assume you mean by "_Adding to the disallowed converters, any built-in method that formats the variable as binary without actual conversion_") turns this into a nice catalogue/showcase type challenge into a ["Do X without Y"](https://codegolf.meta.stackexchange.com/...
(more)
about 3 years ago
Comment Post #283702 [88 bytes](https://tio.run/##K05OzEn8/z/P1s5QoSRfIU8hN7GgusLWriwxR6HYNjNNo8LGSFPp0dQpj6YuezR1ulJqTnGqAlg4DyS84NHUNY@mLgYLA7mzHk1d@WjqXCXrYg0DTW0NJSXtYg1DTU0tjTxdY00g20iz9v9/AA)
(more)
about 3 years ago
Comment Post #283702 You can remove the space after the last `else` to save a byte.
(more)
about 3 years ago
Edit Post #283701 Initial revision about 3 years ago
Question In The Jailhouse Now
Challenge Given an integer `n>=4` as input create an ASCII art "prison door" measuring `n-1` characters wide and `n` characters high, using the symbols from the example below. Example ╔╦╗ ╠╬╣ ╠╬╣ ╚╩╝ The characters used are as follows: ┌───────────────┬─────────┬──...
(more)
about 3 years ago
Edit Post #283698 Post edited:
about 3 years ago
Edit Post #283699 Initial revision about 3 years ago
Answer A: Multiply two strings
JavaScript, 37 bytes I/O as character arrays. a=>b=>b.flatMap(x=>a.map(y=>x<y?x:y)) Try it online!
(more)
about 3 years ago
Edit Post #283698 Initial revision about 3 years ago
Answer A: Multiply two strings
Japt `-m`, 5 bytes Takes input in reverse order. Sadly, Japt has no minimum built-in for strings. VcmUc Try it VcmUc :Implicit map of each U in the first input string V :Second input c :Map charcodes m : Minimum with Uc : Ch...
(more)
about 3 years ago
Edit Post #283697 Initial revision about 3 years ago
Answer A: 99 Shortened Bottles of Beer
JavaScript (V8), 185 bytes for(c=99;c;)print((f=(s=` on the wall`)=>`${c||99} bottle${-c?`s`:``} of beer`+s)()+`, ${f``}. ${--c?`Take one down and pass it around`:`Go to the store and buy some more`}, ${f()}. `) Try it online!
(more)
about 3 years ago
Edit Post #283158 Post edited:
over 3 years ago
Comment Post #283407 This needs to be fleshed out a little bit to explain what a determinant is. Also, including the test cases in plain text would be handy for copying & pasting.
(more)
over 3 years ago
Comment Post #283603 Can we take input in reverse order? e.g., `123*abc=111222333`
(more)
over 3 years ago
Edit Post #283158 Post edited:
over 3 years ago
Comment Post #283166 @#53310, while I mostly agree, given how _much_ content we've already got on PPCG there is, inevitably, going to be quite a bit of crossover here. And, more specifically with catalogue questions like this that are common on all programming & golfing sites, I think they are something we should be addi...
(more)
over 3 years ago
Edit Post #281389 Post edited:
Fixed leaderboard
over 3 years ago
Suggested Edit Post #281389 Suggested edit:
Fixed leaderboard
(more)
helpful over 3 years ago
Comment Post #279793 Also, it looks like yours suffers from the same problems as mine did, not (de)compressing "Bandersnatch" & "Callooh" properly.
(more)
over 3 years ago
Comment Post #279793 [615](https://petershaggynoble.github.io/Japt-Interpreter/?v=1.4.6&code=YCdUsHMg342mZywghGQgkGUgc9KQeSCRdoMKRGlkIGd5nCCEZCBni71lIIggkGUgsLw7CkGlINrfeSDYwCCQZSDekmdvdoMsCkGYIJBlINqgIM7IcyCMdGefvC4KYAoraWAKIkJl2BggkGUgez1gSmFivHJ3b2NrYH0sIG15IHONIQpUlCBqYXdzIMgJIN/SLCCQZSBjbGF3cyDICSCvdK4hCkJl2BggkGUgS...
(more)
over 3 years ago
Edit Post #283450 Post edited:
over 3 years ago
Edit Post #283450 Post edited:
over 3 years ago
Edit Post #283450 Post edited:
over 3 years ago
Edit Post #283450 Post edited:
over 3 years ago
Comment Post #279793 [622](https://petershaggynoble.github.io/Japt-Interpreter/?v=1.4.6&code=YCdUsHMg342mZywghGQgkGUgc9KQeSCRdoMKRGlkIGd5nCCEZCBni71lIIggkGUgsLw7CkGlINrfeSDYwCCQZSDekmdvdoMsCkGYIJBlINqgIM7IcyCMdGefvC4KYAoraWAKIkJl2BggkGUgSmFivHJ3b2NrLCBteSBzjSEKVJQgamF3cyDICSDf0iwgkGUgY2xhd3MgyAkgr3SuIQpCZdgYIJBlIEp1Ymp1Y...
(more)
over 3 years ago
Edit Post #283450 Initial revision over 3 years ago
Answer A: Generate Lewis Caroll's Jabberwocky
Japt, 610 606 bytes Don't think there's anything more that can be done with it than this. 933î`'T°s ߍ¦g, „d e sҐy ‘vƒ Did gyœ „d g‹½e ˆ e °¼; A¥ Úßy ØÀ e ޒgovƒ, A˜ e Ú  ÎÈs ŒtgŸ¼.0"BeØ e 1, my s! T” jaws È ßÒ, e claws È ¯t®! BeØ e Jubjub bird, „d д ...
(more)
over 3 years ago
Edit Post #283417 Post edited:
over 3 years ago
Edit Post #283417 Initial revision over 3 years ago
Answer A: Small integer swapping
Japt, 3 bytes I/O as an array. cUé Try it cUé :Implicit input of array U c :Concatenate Ué : U rotated right once
(more)
over 3 years ago
Comment Post #283379 Another option would be to enter them as a single argument and then add something in the header to manipulate them into the format you need.
(more)
over 3 years ago
Comment Post #283380 And I don't think you need the `#include`s, seems to work without them.
(more)
over 3 years ago
Comment Post #283380 Here's a TIO for you: https://tio.run/##XVFBbtswELznFYp7kSg6qJFLUFnJQ4IcqCVlLUKR6pKUkRp@u8KlWyDpgRhqOLszGMEerHKnbfuBDmzSpjqGqNE/TM933yiLw/8coTsxB5OiCvuDFALy0VLE18efb/1lR0bv5O7DWOvP@XIiY1zGgfyZMYAiayIzVsF7Rg8TmYyLUTBlpDR8MG1xZXpFf9OPqiywmOd4sbdsBJMHb1Vk6axSGQEyai6Ic/DFFe1qiJf7wAr1JxVPa@byTimEYpLjsvmSa...
(more)
over 3 years ago
Edit Post #283376 Initial revision over 3 years ago
Question Coat of Many Colours
Challenge Given a list of unique colour names as input, sort them in the order that they first appear in Joseph's Amazing Technicolour Dreamcoat. Example Input: green, blue, red, brown Output: red, green, brown, blue The full list of colours, in order, is: 1. red 2. ...
(more)
over 3 years ago
Edit Post #283357 Initial revision over 3 years ago
Answer A: Juggler sequences
Japt, 17 bytes Needs some more work. É?[U]cßÂUp½+Uu:1ì Try it If there's a proof that the length of the sequence for any given `n` never exceeds `n3` then ... Japt, 14 bytes NcU³Æ=Âp½+UuÃâ Try it
(more)
over 3 years ago
Edit Post #283355 Post edited:
over 3 years ago