I ve made my Computational model (?) and i got this:
x = input()
y = False
breaking = False
u = "1"
while 1:
for i in x:
if y:x += i * 2;y = False;u = i;continue
if i == "1":
x += "2"
x = x[1:]
elif i == "3":
if x[-1] == "0":y = Tru...
50-100 rep for answers in TypeScript's type system
There aren't many answers here written in TypeScript's (turing complete) type system; as of posting, there six, two of which are my own. I like seeing such answers, so I'll be awarding a 50 rep bounty to answers that meet all of the following cri...
What general tips do you have for golfing in TypeScript's type system? I'm looking for ideas which can be applied to code-golf problems and which are also at least somewhat specific to TypeScript's type system (e.g. "remove comments" is not an answer).
Please post one tip per answer.
If you're no...
alpha=0.5
sample['u'] = np.random.normal(size=len(sample))
sample['v'] = sample.groupby('state')['u'].transform(lambda x : (1-alpha) * x.to_numpy() + alpha*np.random.normal(size=1))
sample is a pandas df of sample data with people's wages organized by what state they're from and other factors (g...
Infix notation is a method of printing mathematical expressions where each operator sits between its two arguments, such as \$ \left(5 \cdot 4\right) + 3 \$.
Prefix notation is a method of printing expressions where operators sit before their arguments. The equivalent of the above is +*543. It's ...
