Profile Activity Vote Summary All Communities

panadestein‭

Physicist working on quantum computing. Here for golfing in array languages, mainly BQN.

Template

Extra fields

https://panadestein.github.io/

Posts

See all 5 »

66%

+2 −0

Challenges Display a Progress Bar

BQN, 32 bytes (']'∾˜'['∾@+45+50↑79⥊˜·⌊×⟜50÷⊢)´ A tacit function. A pity, I had to add the parenthesis so I can fold the list of values that represent the fraction. Otherwise, assuming left and ...

posted 11mo ago by panadestein‭

Answer

60%

+1 −0

Challenges Borromean coprimes

BQN, 27 bytes •math.GCD{∧´∘⥊(1=𝔽´)∧1<𝔽⌜˜} Booleans in BQN are the integers 0‿1. Try all test cases on the: BQN online REPL

posted 11mo ago by panadestein‭ · edited 11mo ago by panadestein‭

Answer

60%

+1 −0

Challenges Partial Sums of Harmonic Series

BQN, 23 bytes {𝕩{𝕊⍟(𝕗>·+´∘÷1+↕)𝕩+1}1} This recursion is more complicated than it should, but I managed to keep it purely functional. I use a modifier to mimic passing a left argument, that's...

posted 11mo ago by panadestein‭

Answer

60%

+1 −0

Challenges Find all unique quintuplets in an array that sum to a given target

BQN, 31 bytes {⍷(+´⊸=⟜𝕩∧5=≠)¨⊸/⥊(↕2¨𝕨)/¨<∧𝕨}´ This block function returns the empty array ⟨⟩ if the conditions cannot be satisfied. It works by sorting the input list to prevent having to fi...

posted 11mo ago by panadestein‭

Answer

60%

+1 −0

Challenges Expand a polynomial

BQN, 15 bytes ⊢(«∘⊢-×)´˜1∾˜≠˜ A 3-train (fold with initial): we zero list of the same length as the input with a one appended (the base case), then for each root we do the multiplication by the...

posted 11mo ago by panadestein‭

Answer

See all 5 »

Reputation		61
Top-level posts		0
Answers		5
Received votes (up minus down)		6
Edits made		1

Earned Abilities

Statistics

Posts
Total		5
Questions		0
Answers		5
Articles		0

Votes cast
Total		14

Flags raised
Total		0