Posts by Shaggy
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
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 JavaScrip...
Cracks Mark Girrafe's answer: PicoLisp A sneaky search of TIO's GitHub org revealed this one ;) (prinl "Cops and Robbers")(bye) Try it online!
JavaScript, 47 bytes n=>`0`.repeat(n)+(` 0`.padEnd(n--)+0).repeat(n) Try it online! My first pass used recursion before I realised I was over thinking things! First 51 byte version inclu...
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 ...
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 ...
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 s...
Japt, 3 bytes I/O as an array. cUé Try it cUé :Implicit input of array U c :Concatenate Ué : U rotated right once
JavaScript (V8), 28 bytes for(x=y=0;;++y)print(x+=++y) Try it online!
Japt, 9 bytes No infinite lists in Japt so we'll have to go with a recursive solution. ßOpTµJJµ2 Test it ßOpTµJJµ2 ß :Recursive call with (irrelevant) argument Op : ...
Jelly, cracked by m90 13 bytes Should be pretty simple - I'm running out of ideas; one of the downsides of only golfing in 2 languages! “¿×⁶ṆḶN{N=ȷṾ» Try it online!
brainfuck, cracked by Aaron Miller, 243 bytes void main(x,y)->{ printf=io.write(z=x-y); printf("+++++[++++>---<]>.+[--->+<]>+++.+.+++.+[---->+<]>+++.[->+++<]&...
Japt, 117 116 115 bytes Needs more golfing or, perhaps, a completely different approach. Borrows a couple of tricks trick from ETHProductions' original version. Includes 2 trailing newlines. ´LÇ...
Japt -h, 12 bytes à kÈäÎdÄÃmÊñ Try it à kÈäÎdÄÃmÊñ :Implicit input of array à :Combinations k :Remove elements that return true È :When pass...
Cracks Kevin M. Mansour's answer: Erlang Searched for languages that use fwrite, no joy. Searched for io:fwrite, got it instantly main([])-> io:fwrite("Cops and Robbers"). Try it onli...
Rockstar, 19 bytes say "Hello, World!" Try it here (Code will need to be pasted in)
Japt, 11 9 bytes Outputs the first n terms. Change the h to g to get the nth 0-indexed term. ÈÑ+ZÔÅÎ}h Try it ÈÑ+ZÔÅÎ}h :Implicit input of integer U È :Function taking an int...
Japt, 8 bytes Input as an array of negabinary digit arrays, output as a negabinary digit array. xì2n)ì2n Try it or run all test cases (headers & footers convert to & from digit arrays)...
Japt, 17 bytes ô@VøYÃíUgV öx)c f Try it Japt, 17 bytes ô@VøYÃíUgV öx)c f Try it ô@VøYÃíUgV öx)c f :Implicit input of arrays U=integers & V=indices ô :Split U ...
JavaScript, 29 bytes f=(n,x=0)=>n>0?f(n-1/++x,x):x Try it online!
Japt, 9 bytes All credit to ETH on this one. 9îQi"9îQi Test it 9î :Repeat the following to length 9 Q : Quotation mark i"9îQi : Prepend "9îQi" And, for th...
Japt v2.0a0, 19 18 17 bytes I need more caffeine! Takes input as an array of lines. Output is a reversed array. [Uc¸¬U¬Ucq\s f]ml Try it - includes all test cases, header splits string on new...
Japt, 13 bytes o ï æ@¶Xx*Xej Try it o ï æ@¶Xx*Xej :Implicit input of integer U o :Range [0,U) ï :Cartesian product æ :First pair X that r...
Japt -R, 11 bytes ;Bå+ mê ê û Test it ;Bå+ mê ê û ;B :Uppercase alphabet å+ :Cumulatively reduce by concatenation m :Map ê : Palindro...
Japt, 10 bytes o ÅÔò cÔiU Try it o ÅÔò cÔiU :Implicit input of integer U o :Range [0,U) Å :Slice off the first element Ô :Reverse ò ...
