Search
Given a sequence of lower case letters, sort them into order of height. Heights The heights of letters are dependent on font, so for this challenge the height order to be used is as defined below...
Given a string of printable ASCII characters, convert them all to lowercase, except not just the letters. ASCII characters that are letters have a bit in their binary representation that is 0 for ...
Given a sequence of letters, omit those with the highest or lowest pop count. Terminology The pop count or population count of a binary string is the number of 1s in it. For this challenge, the ...
I think everything strictly needed to write or judge a solution should never be hidden. If you feel it is too large, think about how to shorten it. Information that is not strictly necessary can b...
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] ñ :Sor...
This is a fixed output challenge. Output a textual representation of a chessboard hosting 8 queens, none of which are attacking each other. There are 92 ways of arranging them, 12 if rotations and...
JavaScript, 48 bytes _=>[..."41506372"].map(x=>1e8/9+10**x|0).join` ` Try it online! The string "41506372" encodes the position of the queen in each row. 1e8/9 gives 11111111.1111......
Given a positive integer as input, indicate which base from 2 to 16 gives the most holes in the representation of the input in that base. The digits used are 0123456789ABCDEF. Note that these incl...
Turing machines may use the contents of their tape pre-execution as their input
If there exists something (reasonable) that can run it, it's valid. This includes obscure, non-standards-compliant compilers (though this should be specified in the answer if needed). So any poste...
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...{($^a...&is-prime)>=$_})} Try it online! Anonymous code block that takes a number and returns a number. Explanation { } # Anony...
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...
Rust 1.0.0, 58 53 52 37 bytes fn a(){#[no_mangle]static mmap:u8=0;}
