Search
APL (Dyalog APL), 42 bytes {⎕UCS⊢2⊥1@2⊢(7⍴2)⊤⎕UCS⍵} Attempt This Online! In APL, base encoding(⊤) returns a matrix, so setting the lowercase bit is very easy with 1@2, setting the entire secon...
APL (Dyalog APL), 61 bytes {⍵/⍨~(⊢∊⌊/,⌈/)+⌿0 1↓2⊥⍣¯1⊢0,⎕UCS⍵} Attempt This Online! APL's style of filter works very well here, since we can check for the max and min elements here: (⊢∊⌊/,⌈/) ...
Japt, 13 bytes ÆüÈc¤ñÃé ¤¬øX Try it ÆüÈc¤ñÃé ¤¬øX :Implicit input of string U Æ :Filter each character, X by ü : Group & sort U by È ...
JavaScript, 27 24 bytes Input as a string, output as a character array or empty array. s=>s.split(/[^aeiou]*/i) Try it online! Thanks to Moshi for pointing out the * I was missing that w...
Japt v2.0a0, 3 bytes o\v Try it o\v :Implicit input of string o :Keep only \v :RegEx /[aeiou]/gi
Sclipting, (UTF-16) 22 bytes 놵멡뉖땯더굅낔뭕뇐虛移 Nothing complicated, just replaces the regex [^aeiouAEIOU] with the empty string.
Given an integer $N$ in balanced quinary, output the first $N$ characters of your source code if $N$ is positive, or the last $-N$ characters of your source code if $N$ is negative. Terminology ...
Japt, 233 bytes `ÜÊ Ò Í a×G ¯¯o ÖÚb ¯ØÚ × »Ûá ÝÁ Á²g fig ¤¶n ÓI lªo §Ö ÚAo Ú-n Û u Ûo nÂ) em ÇÓy pe pi¦ Îñ ΰn Ѧk Ѧl sb É Èp Èîp Èl y °ÛG Ù i abiu alÚ app¤ aza bael ba ¼ÚAe ÞÃ...
C (gcc), 41 bytes f(x,y){int r=x*y;return r&&r==x+y?5:x+y;} Attempt This Online!
Recently I asked for tips on improving some code-golf of mine. The code was supposed to output every third value of the Fibonacci sequence starting with 2: 2,8,34,144,610,2584,10946,46368,196418,...
Output the Nth number in the list of Fibonacci numbers that have no consecutive digits. Input A non-negative integer (if you treat the Fibonacci numbers as zero-indexed) or a positive integer (...
Functions may return bools via the presence/absence of an error Crashing to mean false and not crashing to return true. Another branch of the exit code answer.
Programs/functions may use the presence/absence of output as a bool
Languages made specifically for a challenge after it was published This is the general problem with allowing languages newer than the challenge. This is already considered a standard loophole, and...
Libraries are removed when "merge variants" is on. For example, this answer written in C (clang) uses a library called BMPL, so its header is C (clang) + BMPL. While there's nothing wrong with usin...
Ruby, 75 bytes ->t,u{g=->a{a.reduce{-2*_1+_2}};('%b'%(g[t]+g[u]+(y=43690)^y)).to_i.digits} Try it online! Uses latest ruby features, so tio link will look different. Takes two digit a...
JavaScript, 26 bytes Outputs the nth term, 0-indexed. f=n=>n<2?n:f(--n)*2+f(--n) Try it online! JavaScript, 49 bytes Outputs the first n terms as a comma delimited string. f=n=>...
Lua, 20 bytes print"Hello, World!" Try it online!
Java, 37 Bytes v->System.out.print("Hello, World!");
Charcoal, 13 bytes Hello, World! Try it online! I'm surprised no one even used Charcoal in the challenge. Guess I'll take it.
Bash, 21 Bytes print "Hello, World!"
Pyth, 14 bytes "Hello, World! Try it online!
!@#$%^&*()_+, 17 bytes ^dlroW ,olleH(@) Try it online! Might learn this sometime but I found this.
Lean, 64 bytes def hello_world:io unit:=put_str"Hello, World!"#eval hello_world Try it online!
