Posts by Razetime
Questions The most important thing to gain traffic in a code golf site is having good questions. SE code golf has 12,718 questions(and counting), and many people are still actively posting questio...
Stax, 9 bytes Ç≈f♠É↔X+ö Run and debug it Explanation(Unpacked): wii{um|+;< w iterate until a falsy result is reached: ii push iteration number i twice {um map r...
I nominate Jo King, as they were already voted as moderator by the community earlier. They have proven to be an active and trustworthy moderator, who is also a consistent contributor to the code g...
The Ludic Numbers are a sequence that pops up when you apply the sieve of eratosthenes to the natural numbers, completely removing the numbers every iteration. Here is how they are generated: The...
RoadLang, 340 bytes wagwan my slime x is 0 rip dat bong till x bigger den 99 n dat x is x n 1 ayy bossman (x leftova 15) be 0 init bruv man say"FizzBuzz" yeah init bruv ayy bossman (x lef...
jq, 14 bytes "Hello, \(.)!" Try it online! jq has expression interpolation, pretty epic!
Challenge Given a date with day, month and year, calculate how old a person born on that day would be today. Input can be in any reasonable format(params, array, date object). Input will never b...
Canvas, 10 7 6 bytes Ｚ［］／┼┼ Try it here! Creates the top portion, centers it, and mirrors it. -3 bytes from dzaima's hint. -1, found the 6 byter! Explanation Z[]/++ Z push the al...
Stax, 12 bytes ç ∩<▬%▌ê▓jFo Run and debug it Same method as the Canvas answer.
Husk, 8 bytes S+s"S+s" Try it online! Basically Leo's original quine. It concatenates the string evaluated version of S+s to itself. So: "S+s" + "\"S+s\"" gives the original code.
Introduction The Pell(no, not Bell) Numbers are a simple, Fibonacci-like sequence, defined by the following relation: $P_n=\begin{cases}0&\mbox{if }n=0;\\1&\mbox{if }n=1;\\2P_{n-1}+P_{n-2...
Inspired by this Rosetta Code article. Introduction Balanced Ternary is a method of representing integers using -1, 0 and 1 in base 3. Decimal 11 = (1 * 32) + (1 * 31) + (−1 * 30) = [1,1,-1] or ...
Challenge Given an array in any suitable format, create a frequency table for it. i.e: Pair each unique element with the number of times it appears in the array. You can return the frequency tabl...
Free as in usable on a free platform "free" meaning there must be a downloadable interpreter available for the language which can run the program with the required features, on an online/offline s...
Few QoL improvements can be made: Some trivial challenges(i.e. "Hello World!") get many, many answers, so the leaderboard should show a scrollbar beyond some point(after the first 10 submissions, ...
SE Sandbox Link, Codidact Sandbox Link Inspired by this video. Given a positive integer, draw its Cistercian representation as ascii art. The Challenge Cistercian numerals are a decimal-based...
Ruby, 14 bytes ->s{s.reverse} Try it online! a straightforward builtin.
Husk, 8 bytes Ψḟo≥⁰≠İp Try it online! or Verify first 8 values It is always a good day when you get to use Ψ in your program. Explanation Ψḟo≥⁰≠İp İp to the infinite list of prime num...
For reference, this is the list of tags we have from SE which is 9 pages long, so I'll take the liberty of listing out which ones are "required" tags, as they are used to signify a scoring criterio...
