Search
Dyalog APL Extended, 14 bytes {¯4⍭4⍭⍣(⍵≤-)2} Try it online! {¯4⍭4⍭⍣(⍵≤-)2} Monadic dfn 2 start with 2 ⍣ Repeat 4⍭ the function "next prime" ...
For a small number of posts, it will be easier to create them here than to import them. Your moderators (yes we need to get some) can create new help topics, which you can link to from question po...
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...
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...
JavaScript (Node.js), 47 bytes f=(a,b=0,c=a=>a&&1/a+c(a-1))=>c(b)<a?f(a,b+1):b Try it online! For large numbers, a rounding error will occur and yield incorrect result. The ...
JavaScript (Node.js), 27 25 bytes (-2 thanks to JoKing) f=(a,b)=>a<0?0:1+f(b,a-b) Try it online!
Japt -N, 9 bytes ¨T©ÒßVVnU Try it ¨T©ÒßVVnU :Implicit input of integers U & V ¨ :U is >= T : 0 © :Logical AND with Ò :Negate the...
AppleScript, 264 bytes Sue me. It works. set n to text returned of (display dialog "" default answer "") as number set o to "" repeat with i from 1 to n repeat (n-i) times set o to o...
Japt -R, 28 bytes Lõ@"Fizz"pXv3)+"Buzz"pXv5)ªX I spent a long time playing with wizardry string/array slicing. It did not work out. This solution just repeats "Fizz" and "Buzz" if divisible. T...
I also endorse the nomination for Jo King. However, they have yet to accept the nomination, leaving us with zero viable nominations as of current writing. So, with great hesitation, I put my name f...
C++ (gcc), 43 bytes #import<ios> main(){puts("Hello, World!");} Try it online!
When editing my profile, I see: Link with Stack Exchange You can't link a Stack Exchange account to your account on this site because there is no associated Stack Exchange site from which to ...
Japt -P, 7 2 bytes Õc Takes input as character arrays. -5 bytes thanks to @Shaggy Try it
Haskell, 40 bytes f((h:t):r)=h:f(r++[t]) f(_:r)=f r f _=[] Try it online!
C (gcc), 108 bytes *h,i;main(){for(;i++<100;){char s[]="%dFizzBuzz ",b=i%5;h=s+2;printf(s+(i%3?b?*h=32,0:6:b?h[1]=32,2:2),i);}} Godbolt. Works on clang too. Contains some serious abuse of al...
Given an array of numbers, output the length of the longest increasing (not necessarily contiguous) subsequence. It is guaranteed that there are no duplicates in the array. For example, if the inpu...
Laser, 9 bytes c⌜ps \U# My own language's showcase time! This is a 2D language with an instruction pointer initially pointing to the right. It takes implicit input as an array of characters. ...
Ruby, 14 bytes ->s{s.reverse} Try it online! a straightforward builtin.
Golfing numbers Numbers above 15 and below zero take more than one byte to create. Here's a table of numbers up to 100 (Not including negatives yet) Table for '98 NOTE: For numbers that are al...
Given two strings, I define their product as follows: If any of the two strings is empty, the product is the empty string. If the second string consists of a single character, the result ...
