Search
Japt, 625 615 bytes `'T°s ߦg, d e sÒy v Did gy d g½e e °¼; A¥ Úßy ØÀ e Þgov, A e Ú ÎÈs tg¼. ` +i` "BeØ e {=`Jab¼rwock`}, my s! T jaws È ßÒ, e claws È ¯t®! BeØ e...
Jelly, 2 bytes ŒṪ Try it online! 1-indexed, but the footer converts to 0-indexed. Less built-in: Jelly, 3 bytes œẹ1 Try it online! œẹ All multidimensional indices of 1 one. ...
Update: we can do this more easily now. We can change the reputation grants per post type per category, both up and down, without creating a new post type. Sandbox posts would continue to use the...
C, 66 59 bytes -7 bytes thanks to Lundin! In-place string reversal f(char*s){s[1]?f(s+1):0;for(char t=*s;s[1];*++s=t)*s=s[1];} Try it online!
JavaScript (Node.js), 147 bytes f=(a,b='IVXLCDM',g=Math.log10(a)<<1,c=10**(g/2),e=a/c|0,i=b[g+1],j=a=>b[g].repeat(a))=>a?(e<4?j(e):e<6?j(5-e)+i:e<9?i+j(e-5):j(1)+b[g+2])+f(a...
Note: This challenge was underspecified and bad, and as such I would not encourage answering it in the future. Challenge You will be given a single 2D boolean array $M$. You may take its dimensi...
JavaScript (Node.js), 541 540 bytes for(_='=>)==!(+==0h,.map(M,R(=1,,e,b &&Nl=[-1,))s(n,=(a a=u,v(i=g(z,u,f=(a,w,cs=Math.max,r?[...r(--a ) (a)]:[],R>&b>&a<w&b<...
Task Print the following: ABDFHJLNPRTVXZ CABDFHJLNPRTVX ECABDFHJLNPRTV GECABDFHJLNPRT IGECABDFHJLNPR KIGECABDFHJLNP MKIGECABDFHJLN OMKIGECABDFHJL QOMKIGECABDFHJ SQOMKIGECABDFH USQOMKIGE...
Canvas, 17 11 bytes Ｚ２ｎ⤢Ｊ｛×７«ｍＴ Try it here! Z The alphabet 2n split into pairs: ["AB","CD","EF",…] ⤢ transposed: ["ACEGI…","BDFHJ…"] J remove and pu...
Yes! You can post it. As you are owner of that post. So, you can do as you want with the post. You can read about license in the question also. This post didn't use Codidact's import script; it...
Originally from Somewhere Else. I thought I'd continue making more drawing challenges here now that I discovered it. Make the Stack Overflow logo using the following criteria: The tray: ...
Abundant numbers are numbers which are less than their proper divisor sum. For example $18$ is abundant as $1 + 2 + 3 + 6 + 9 = 21 > 18$ Deficient numbers are numbers which are greater than the...
Husk, 10 bytes kSo±-ȯΣhḊḣ Try it online! keyon is very nice here, but it's still a bit too long, sadly.
Here is what the top of the feed for the Code Golf Challenges category looks like currently: <?xml version="1.0" encoding="UTF-8"?> <feed xmlns="http://www.w3.org/2005/Atom"> <i...
Write the shortest program that takes no input and outputs a Sudoku solution. For reference, a Sudoku solution is a 9x9 grid of digits where each column, each row and each of the nine 3x3 grids th...
Idea shamelessly stolen from caird and rak1507 Shuffle a subset of a list of unique, positive integers with uniform randomness, given the indices of that subset. For example, given the list $[A, B...
Sandbox votes should give no reputation I believe this is already the case, but for completeness: I agree that neither upvotes nor downvotes on Sandbox posts should affect reputation. Although I...
Python, 88 bytes import abc,code,fcntl,graphlib,json,pickle,cmd,errno,heapq,re,struct,csv,pwd,xml,sys,bz2 Attempt This Online! Requires a Unix-like operating system for fcntl and pwd, and at l...
The challenge is to write as short a source as possible, where the English alphabet (in alphabetical order from top to bottom) "abcdefghijklmnopqrstuvwxyz" is a sub-sequence of the source code. Th...
Your mission for today, should you choose to accept it, is to write a simple 12-hour clock calculator. Your input will always be in the form of arg op arg, where op is either + or -, and arg is eit...
Python 3.8+, 51 byte lambda n:((i:="IVXLCDM".index(n))%2*4+1)*10**(i//2) Testing the code: f=lambda n:((i:="IVXLCDM".index(n))%2*4+1)*10**(i//2) for s in "IVXLCDM": print(s, f(s)) T...
HTML, 16 bytes <body bgcolor=0> an attribute that works well for this challenge. tested on Mozilla Firefox. -3 from [Object object]
Given a list of non-negative integers the function $f$ replaces every integer with the number of identical integers preceding it (not necessarily contiguously). So f [1,1,2,2,1,3,3] = [1,2,1,2,3,1...
The Challenge Your job is to, given input positive non-zero integer $n$, output an ASCII representation of the tiled Fibonacci squares up to the $n$th number of the Fibonacci sequence. Rules Inp...
Jelly, 13 bytes 50R>×ɗị⁾-|Ø[j Try it online! Full program only--insofar as supporting the input requirements is concerned. Jelly implicitly Python evals the arguments to every program, so s...
