Viewing profile — anandoza

Could someone also write bad code and commit it using someone else's email address in the commit message, thus making the commit link to the other person's Github profile? (Sort of…

> The driver hands you a key and leaves How?

You don't understand how something can sound appealing at first, but then in practice isn't enjoyable?

Well, you can apply the theorem to the problem. Or apply its principles to the problem.

Do you know if it's the same people, or just two significant (but possibly disjoint) populations of people?

3 hour video with no timestamps, a minimal description, and comments turned off?

Hey, I'm not 51 yet!

Doesn't gaining 600 points mean that you are able to beat the "old you" (or more precisely, people who you used to be even with) with 99% probability? (Or perhaps more meaningfully…

Ah, maybe it's been changed, but now it's more clearly intentional: > A piece of information you may or may not want us to find about is your email address.... > [email address box…

It halves your risk.

What about sentences that end in a period without a quote? That seems like it'd be much more common.

Yep, this blog post is in the context of using these symbols in mathematics, where this is the only usage of > that I've seen. I agree that programming languages, it can mean vario…

It seems pretty correct to me (excluding a few things I'm not familiar enough with to evaluate). Is it possible that you misinterpreted this as a post about > in code rather than t…

Yes, I thought the exact same as you -- that the headline meant a BCI achieved like 400 wpm or something.

If you want to frame it that way, then each physical deck can handle 52 distinct queries. So you have 52^2 / 52 = 52 decks required.

There are many situations where a good player can be predicted because there is a clear best option (or a good option that advance knowledge won't invalidate).

Lichess.org actually does have a 5fold repetition rule that applies without players claiming it -- https://lichess.org/faq#threefold Kind of funny that your hypothetical example wa…

> I always thought that it would fail to decode the string since the probability that changeme is actually valid base64 encoding must be very low I'm a bit confused, I thought any …

Draw a graph with vertices labeled 0 through N, then add edges i->(i+1) and i->(i+2). The answer is the number of paths from 0 to N. This is still pretty specific to counting paths…

> People’s general focus on the hose rather than the hole is well demonstrated by the fact that anyone you ask will be able to tell you how much money they make by some unit of tim…

They mean "previous" as in before the hackers did the password resets. (So all your passwords, except the one the hackers set.) I don't think this implies a problem with "your curr…

I think it's likely that the author's analysis of why 5 is the optimal cache size heavily depends on the fact that they only tried fib(10). For example, it's clear that cache 20 an…

> As, we can see the optimal cache size of fib function is 5. Increasing cache size will not result in much gain in terms of speedup. Try it with fib(35), curious what you find.

the simple recursive solution is actually O(fib(n)), which is exponential

There are 1024 configurations for counting in binary, and only 11 for counting "normally". Some of those other ~1000 configurations are harder to do (like having every other finger…