I arrive at LaGuardia at 5:30 p.m. on Thursday afternoon. I've been told that a car will meet me at the airport, but I don't have any more specific information than that. Then, roughly ten seconds after I step off the plane, I get a call from a friendly-sounding guy who tells me to head to the nearest exit, where he will be pulling up momentarily. Clearly, Jane Street has already planted a tracking device on me.( Collapse )
- Back last April, one of my friends -- the same one who kept asking me what was so great about Scheme -- told me he was frustrated about the way Scheme made him "twist everything into a recursive, list-based form". I told him that I was having a hard time thinking of a problem that didn't fit that form, and he said, "How about a FIFO?" Thus nerdsniped, I went looking for constant-time, purely functional queue implementations in Scheme, and I was able to dig up this paper for him. (This was before I'd ever heard of Chris Okasaki's book.) I didn't actually, you know, read the paper before sending it to him, but now that I look at it, the representation described in section 2.2 is precisely what my interviewer suggested. It's a cute idea, and not that hard to implement.