nulptr

4 ms·

1.
by nulptr 8mo ago
The +12 there is so that % works correctly (ie the number never becomes negative)
2.
by nulptr 2y ago
Hard y… yt = white
3.
by nulptr 4y ago
One way is querying the dht
4.
by nulptr 5y ago
If each command would only be executed two communication turns in the future, and a communication turn is ~200ms, isn't there ~600ms of lag for each command? > For RTS games, 250 milliseconds of command latency was not even noticed
5.
by nulptr 6y ago
Yeah, this is irritating... one workaround for this is to do: (in the context of walking a tree...): fn get_depth(root_opt: &Option<Box<TreeNode>>) -> usize { let root = match root_opt { Some(roo
6.
by nulptr 6y ago
Some starter code for each language that prints hello world would be nice. ALso, you can look to coderpad.io for other features to add for fun.
7.
by nulptr 6y ago
important to note that there's little choice for men or women in the "happy multi generational example"
8.
by nulptr 6y ago
were you applying for a data scientist or software engineer position?
9.
by nulptr 6y ago
Ahh yes, that's very clever. Thanks for sharing :)
10.
by nulptr 6y ago
I think I found a way to do it with ~8GB. As you mentioned you only need 2^30 tries due to birthday paradox. But, instead of using a hash table to store (seed, hash) pairs, we can just use a list of only hashes. To generate the next hash we
11.
by nulptr 6y ago
I have a question about how you generated collisions. If each seed is a 32-bit int, and each hash is 60 bits, then you'll have to store 92 bits for each (seed, hash) pair. With 2^32 (~4.3 billion) (seed, hash) pairs, you'd need 2^
12.
by nulptr 6y ago
I don't think it's just about solving the problem. It's also about: - how you convinced yourself and the interviewer that your solution was correct (essentially an informal proof of your code) - how you test your code a
13.
by nulptr 6y ago
rust allows for procedural macros (basically a function that takes a token stream and returns a token stream, and yes you can do parsing in this funciton https://doc.rust-lang.org/reference/procedural-macros.html
14.
by nulptr 6y ago
If you accuse someone of theft, shouldn't the burden of proof be on you? Also, if two people make a bet, and one person wins, is that theft?
15.
by nulptr 6y ago
because "ssdf" is a string but B("asd") is user-defined sum type. So in the original example, you can't unify "ssdf" and the int 33, but in the re-written version B("sfd") and A(33) have the same
16.
by nulptr 6y ago
https://outline.com/k74gf3
17.
by nulptr 6y ago
https://webcache.googleusercontent.com/search?q=cache:21xq0j...
18.
by nulptr 6y ago
Can someone explain why Uber stock is up 7% today then? Is it because Uber's expenditure will decrease because of the layoffs?
19.
by nulptr 6y ago
Out of curiosity, what software were they using to catch cheating? Was it MOSS ( https://theory.stanford.edu/~aiken/moss/ )?