Search
JavaScript (Node.js), 68 bytes f=(a)=>a.map((x)=>[...x.entries()].filter((e)=>e[1]).map((e)=>e[0])) Run the function f on your input, e.g. f([[1,0,1],[1,0,1],[0,1,0]]). The output ...
Raku, 19 bytes "Hello, World!".say Explanation First second answer of the.. entire site, actually. Nothing special. I don't think this can go shorter, but this is Raku, who actually knows. I m...
Japt, 11 bytes `HÁM, Wld! Just using Japt's builtin compression. Test it
ARBLE, 15 bytes "Hello, World!" Simple use of Implicit IO. Polyglot with half a dozen golf langauges. Try it online!
Raku, 33 bytes
{1+(3...{(
JavaScript (Node.js), 31 bytes f=(a,b)=>a<0?0:b<0?1:1+f(b,a-b) Try it online!
JavaScript (V8), 28 bytes console.log("Hello, World!") Try it online!
Japt -R, 12 bytes õÈ"/\"mpXÃû Try it õÈ"/\"mpXÃû :Implicit input of integer õ :Range [1,input] È :Map each X "/\" : Literal string m ...
AppleScript, 15 bytes "Hello, World!" No, I'm not joking. This ridiculous language for a code golf actually beats some of the more normal languages.
Could it be possible to change the amount by which an upvote changes the rep? For example, a sandbox vote could be 1 rep, meaning that if you had a good idea you would still get rep, but it wouldn'...
Vyxal Hj, 10 bytes ƛ₍₃₅kF½*∑∴ Try it Online! Vyxal has gotten a whole lot better since first posting this. Explained Very simply, this is: for each item in the range [1, 100], create the lis...
With equally great hesitation, I'll also throw my hat in the ring if Jo King does not respond. (If he does, I'd rather Chris be the second moderator.) I was on the PPCG SE site for a relatively lo...
C, 16 bytes m(){*(int*)m=0;} Try it Online!
Rust 1.0.0, 58 53 52 37 bytes fn a(){#[no_mangle]static mmap:u8=0;}
Canvas, 24 bytes zz＋¹┘％！＊ ‾U｛ŗ３Fi⁸５Bu⁸＋ｎＯ Try it here! Explanation (ASCII-fied for better monospacing): zz+¹┘%!* Helper function ⁸; Expects stack to be [modulo, string] zz+ append "z...
JavaScript (Node.js), 35 32 25 bytes -7 bytes thanks to @celtschk with(process)kill(pid,11) Try it online!
JavaScript (Node.js), 53 bytes f=(a,b=[],c=a.map(([a,...c])=>(b+=[a],c)))=>b&&b+f(c) Try it online!
RoadLang, 59 bytes wagwan my slime man say"Hello, World!" chat wit u later fam My first RoadLang answer! And probably the first one on this site! Removing any of the words says "Aight the ...
JavaScript (Node.js), 70 56 bytes f=([a,...b],c=f)=>1/a?Math.max(f(b,c),[a]>c&&1+f(b,a)):0 Try it online!
Haskell, 37 bytes f(h:t)=max(1+f[x|x<-t,x>h])$f t f _=0 Try it online!
C (gcc), 114 bytes f(int n,int*p,int*i,int**o){if(n){int*m=i,k;for(;*m!=*p;++m);k=m-i;f(k,p+1,i,o);f(n-k-1,p+k+1,m+1,o);*(*o)++=*p;}} Try it online! Arguments: n is the length of the arra...
Befunge-98, 45 39 37 33 29 21 bytes v:~< >a-| >v$< ,: ^_@ Try it online! This answer probably sucks :P
C (gcc), 232 bytes f(n,w,p){printf("%i bottle%s of beer%s%s",n,"s"+(n<2)," on the wall"+w,p);}main(i){for(i=99;i;){f(i,0,", ");f(i,12,".\n");printf(i>1?"Take one down and pass it around, "...
