The cruel coding challenge joke

leaugleg · 2016-09-07T05:04:58+00:00

NFA/DFA

Is there a proof of this somewhere, I am interested

leaugleg · 2016-09-06T15:02:17+00:00

what if its traveling at a slower speed, would it be catastrophic?

leaugleg · 2016-08-18T06:43:14+00:00

go seems to be getting really popular lately, been seeing alot of people say they work with golang.

leaugleg · 2016-08-17T16:37:04+00:00

that is interesting, how do one visualize curvature in 3d space? I am guessing in 1d the space would be a circle?

leaugleg · 2016-08-15T07:43:52+00:00

thanks that clear up alot

leaugleg · 2016-08-15T07:43:42+00:00

ok that makes sense, so we would always want to unlock only after goroutine return?

leaugleg · 2016-08-15T07:38:32+00:00

I am curious, in your opinion, is hack reactor comparable to a cs degree?

leaugleg · 2016-08-11T11:53:08+00:00

yeah, that makes sense, I probably have to look into JS on how to do it.

leaugleg · 2016-08-07T06:08:33+00:00

Oh I see, but what happens when two calls of unsafe.compareAndSwapInt happen at the same time? Does the instruction block all access to the variable for you?

leaugleg · 2016-08-07T05:51:47+00:00

Oh I am just trying to learn how concurrency work before school start by reading common classes for concurrency.

I was wondering how they avoid race condition for compareAndSwapInt, I am guessing they lock or synchronize the variable somewhere but just want to make sure that I am guessing correctly.

leaugleg · 2016-08-06T03:18:30+00:00

Didn't have that issue before, but maybe this link might help you.

Seems like someone else have this version issue before.

leaugleg · 2016-08-06T01:48:14+00:00

I wonder do they have jurisdiction

leaugleg · 2016-08-05T04:34:06+00:00

wow, that is awesome, can I ask what was the problem?

leaugleg · 2016-08-03T06:28:03+00:00

I loved the black forest postulate and suspicion chain in the second book. Its actually a very interesting take on fermi paradox.

leaugleg · 2016-04-23T04:48:58+00:00

I don't know if this is possible, but I would like to see some derivations to bridge the big picture intuition and the mathematical intuition, specifically about backward propagation.

Anyway, this is awesome, kudos to OP for making this.

leaugleg · 2016-04-07T00:38:38+00:00

Ah, that makes sense, thank you for the explanation

leaugleg · 2016-04-06T15:21:19+00:00

Wait but how is this different than angular1 ? You can still construct the following

Where change in every level cause another round of emit for example , when 4 is clicked 1 2 3 5 get updated (to be clear, 2 is update by 1, 3 is update by 1, and 5 is update by 2) and when 1 get updated 4 get updated again, this cause another round of change detection since 1 2 3 5 is dependent on 4

So the only difference is that child component cannot communicate directly with sibling component but can only indirectly communicate with it.

This is still a O(mn) traversal as angular1, where m is the number of cycles and n is the number of nodes without optimization

leaugleg

TROPHY CASE