Search Results

JavaScript (Node.js), 55 bytes f=(n,d=1,a=0,C=n[a])=>C<2?f((n[a]^=1,n),d=C?-d:d,a+d):n Try it online!

JavaScript (Node.js), 299 bytes f=(i,L=0,N=i.map((E,I)=>i.map(G=>I<G|0)).reverse(),Y=Q=>Q.map((e,j)=>Q.reduce((A,g,h)=>A+Q[h][j],0)),F=d=>i[N[L].indexOf(1)-d]&&i[N[L].lastIndexOf(1)-d]&&!(X=N.map((E, …

Python 3.8 (pre-release), 128 bytes lambda n:(s:=sum(n))and'\n'.join('\n'.join((n[-1]-N)*s//2*' '+N*('*'+'* '[0<m<s-1]*(s-2)+'*'*(s>1))for m in range(s))for N in n) Try it online!

Python 3.8 (pre-release), 43 bytes f=lambda n,i=2:n and[n[0]]+f(n[[i]>n:],i+1) Try it online! Thanks @dingledooper for -2 bytes.

Python 3.8 (pre-release), 64 bytes lambda n,l:(c:=[[l]*(l+l+len(n))]*l)+[l*[l]+e+l*[l]for e in n]+c Try it online! It's been a while since I posted a working answer...so feel free to suggest golfs. …

Python 3.8 (pre-release), 66 bytes lambda n:n*0==0and n or sum((1-i%2*2)*f(e)for i,e in enumerate(n)) Try it online!

Python 3.8 (pre-release), 45 bytes lambda l,F:[i for i,e in enumerate(l)if F(e)] Try it online! Looks like it won't get much shorter than this. Explanation: keep all indexes (found by unpacking; the …

JavaScript (Node.js), 99 bytes n=>n.sort((a,b,l=e=>`b${D=e.slice(-1)}#`.search(e[1])+12*D+'C D EF G A B'.search(e[0]))=>l(a)-l(b)) Try it online!

Vyxal, 38 bytes 1N→_a`\d+`?λ←_a1+→_a`\d+`?Ẏ⌊s←_a iS;øṙ Try it Online! Thanks @lyxal for helping me a lot in chat. I've never posted any Vyxal answers before. This is a port of my JavaScript solution. …

JavaScript (Node.js), 62 bytes n=>n.replace(r=/\d+/g,_=>n.match(r).sort((a,b)=>a-b)[i++],i=0) Try it online! Probably defeats the purpose of the challenge, but it is valid. Takes in a stringified li …