Ho presentato la mia candidatura tramite un selezionatore. Ho sostenuto un colloquio presso Jane Street
Colloquio
phone interview, and pure technology interview. some questions of school project exps, and then write code on collabedit.com and talk with interviewer. the problem is write a binary tree and then write a function to get its depth. the language should be OCaml which is Jane street used in their daily work.
Domande di colloquio [1]
Domanda 1
the problem is write a binary tree and then write a function to get its depth.
It was a very quick and painless process. Recruiter very responsive, kind interviewers. High implementation and difficult problems, so failed onsite after 3 interviews and a Question and Answer Session.
Ho sostenuto un colloquio presso Jane Street (Londra, Inghilterra)
Colloquio
Did not pass the initial coding round. I tried to explain my thought in details to the interviewer but failed to translate my thought into code. So far interviewer is very nice.
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Jane Street (New York, NY)
Colloquio
My experience interviewing at Jane Street was definitely challenging, but also surprisingly collaborative. Instead of focusing only on whether I could get the right answer quickly, the interviewers were much more interested in how I approached problems and explained my thinking. I worked through a few coding questions involving data structures and algorithms, and there were also some probability-style questions that tested logical reasoning. The interviewers were clearly very sharp, but they were also approachable and encouraged me to talk through my thought process the entire time. When I got stuck, they would sometimes guide me with small hints so we could keep exploring the problem together. Overall, it felt less like a typical high-pressure interview and more like a thoughtful technical conversation with experienced engineers.
Domande di colloquio [1]
Domanda 1
“What is the expected number of coin flips needed to get two heads in a row?”