Ho presentato la mia candidatura online. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso Jane Street nel mese di dic 2012
Colloquio
Applied through their site. The HR are nice people.
First interview with a junior engineer. They jumped right into the technical exercise and weren't going to introduce themselves until I asked. They were patient, helpful and answered all my questions thoroughly.
Second interview was with an engineer who apparently does lots of interviews. They spoke in some strange accent and it was very hard to get what they said. They didn't know much about OOP and kept interrupting and asking with each line I wrote. Also, they gave brief answers to my questions.
Domande di colloquio [2]
Domanda 1
Implement a linked list.
Given a collection of linked lists, give the list with the minimum length.
Given a collection of linked lists, give the list with the minimum sum.
Implement a machine with a stack and a memory. Implement a method that takes a list of instructions and executes them on the machine then outputs the last element on the machine's stack.
How would you build an OCaml-like syntax using that machine.
Now, given an expression in the structure you've built, convert it into a list of instructions that can be run on the machine.
The interviewer asked me some probability questions, felt kind of competition mathy. The interviewer was friendly but I got stuck on the math. It doesn't seem like it was meant to be too hard if you're familiar though.
Domande di colloquio [1]
Domanda 1
They asked some probability questions, a little tricky if you don't have any familiarity
first there's a 10-15 min call with a recruiter (another form of screening i guess) where you talk about your background and experiences. then if you pass that, an online interview. if you pass it too, there are 3 on-site interviews (they pay for everything), 2 before lunch and one after.
I was given a tree problem. At the start, I asked a few clarification questions. While coding it, the interviewer gave me some hints on how to better implement it. Was able to solve it. Did not get to the next round.
