Search
JavaScript (Node.js), 70 56 bytes f=([a,...b],c=f)=>1/a?Math.max(f(b,c),[a]>c&&1+f(b,a)):0 Try it online!
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...
Raku, 32 bytes {map +*,($_,*[0]...^9 ge*.gist)} Try it online! It's difficult to tell the difference between one element arrays and just plain numbers, since Raku translates between the two....
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...
RoadLang, 59 bytes wagwan my slime man say"Hello, World!" chat wit u later fam My first RoadLang answer! And probably the first one on this site! Removing any of the words says "Aight the ...
It's for non-challenge questions. These might be general tips questions, questions about how to golf specific pieces of code, common golf paradigms, etc. Here are some examples from SE that might ...
It's for questions about golfing and challenges. From the comments underneath the original proposal: @Moshi from the discussion in 19th Byte it sounded like the community could have questions a...
I was thinking the same thing. Maybe instead there should be one category for code golf and leave the main Q&A is for other types of challenges and puzzles?
We seem to ask a lot of questions in Meta, which sort of defeats the purpose of the Q&A category. Is it intended for subjective quesitons (of which this site gets few), or requests for tips, or...
C (compliant), 19 bytes (gcc -std=c18 -pedantic-errors) int main(){main();} Godbolt
Python 2, 37 bytes l=input() while 1:print len(l);l=l[0] Try it online! This makes heavy use of programs being allowed to terminate with error, which I assume is allowed by default because ...
Haskell, 40 bytes f((h:t):r)=h:f(r++[t]) f(_:r)=f r f _=[] Try it online!
JavaScript (Node.js), 36 bytes f=a=>a?.map?[a.length,...f(a[0])]:[] Try it online!
JavaScript (Node.js), 53 bytes f=(a,b=[],c=a.map(([a,...c])=>(b+=[a],c)))=>b&&b+f(c) Try it online!
JavaScript (Node.js), 39 bytes Returns dimensions from innermost to outermost f=a=>a?.pop?f(a[0]).concat(a.length):[] JavaScript (Node.js), 41 bytes Returns dimensions from outermost to ...
Japt -P, 7 2 bytes Õc Takes input as character arrays. -5 bytes thanks to @Shaggy Try it
Given a non-ragged array (an array where all sub-arrays at a particular level have the same length) of non-negative integers, answer its shape, that is, the length along every dimension. You may as...
The profile link is only relevant for claiming imported content at the moment. When we import content from SE, linking profiles allows us to give users the option of claiming their posts - thus lic...
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 ...
APL (Dyalog Unicode), 10 bytes Full program. Prompts for list of strings from stdin. 0~⍨,⍉↑0,¨⎕ Try it online! ⎕ prompt for list of strings 0,¨ prepend a zero to each ↑ convert to orthogona...
Given a list of strings(and optionally, their length) as input, weave the strings together. Intro Your goal is to mimic the WV operator in Pip. Take a list of strings and alternate between their ...
C++ (gcc), 43 bytes #import<ios> main(){puts("Hello, World!");} Try it online!
JavaScript (Node.js), 35 32 25 bytes -7 bytes thanks to @celtschk with(process)kill(pid,11) Try it online!
