Mysterix's comments

Mysterix | 7 years ago | on: The Nerd as the Norm

From the first link, this part is so relatable :

"They'll stop going to the company picnic if it becomes an occasion for everyone to list all the computer problems they never bothered to mention before."

Mysterix | 8 years ago | on: Dunning-Kruger and other bogus memes

"Perception of their overall ability" seems to have a different scale that the 2 others, so the important point is not the actual values but the correlation measure.

Mysterix | 8 years ago | on: Delete your Code

This is a cognitive bias known as the "IKEA effect" [1] First time I read it applied to coding, the author is completely right. You are much faster the second time you write the piece of program, and it will be probably more effective.

[1] https://en.wikipedia.org/wiki/IKEA_effect

Mysterix | 8 years ago | on: Avery’s laws of Wi-Fi reliability

The strategy "Buy 2 routers, and if the first one fails, then use the 2nd one" is ok, and gives you the 1% result.

My (little) problem is the sentence "Replacing your router (or firmware) almost always fixes your problem.", because if the first router is broken, replacing it will only fix your problem in 10% of the cases, which is not "almost always".

Mysterix | 8 years ago | on: Avery’s laws of Wi-Fi reliability

>Replacing your router:

>

> Vendor A: 10% broken

> Vendor B: 10% broken

> P(both A and B broken):

> 10% x 10% = 1%

>

>Replacing your router (or firmware) almost always fixes your problem.

The conclusion is false :

if router A is broken, router B still have 10% chance to be broken, the two events being independant.

P(A broken | B broken) = 10%

To get the 1% effect, advice could be :

Always buy 2 routers instead of 1

Mysterix | 10 years ago | on: Hiring Is Broken – My interview experience in the tech industry

>If you are going to test my knowledge, at least ask relevant questions for the role.

Even for a front-end developer, I think that algorithms matter, because developers have to understand what they do.

And the OP's solution in O(N2), as well as the other one with hash maps, seem quite bad (it can be done trivially in O(Nlog(N), and optimized to reach O(N))

page 1