Candidatei-me online. Fui entrevistado pela Jane Street (Londres, Inglaterra) em out. de 2024
Entrevista
Interview process at Jane Street typically includes an initial recruiter call, followed by multiple technical interviews focused on probability, statistics, mental math, game theory, and market intuition. Later rounds involve trading simulations, behavioral fit, and a final onsite assessing decision-making under uncertainty
Perguntas de entrevista [1]
Pergunta 1
You are given four fair coins. All four coins are flipped simultaneously. What is the probability that exactly two heads occur, given that at least one head is observed?
Candidatei-me por indicação de um funcionário. Fiz uma entrevista na empresa Jane Street (Hong Kong).
Entrevista
1 stage was a call from someone at Jane Street just for screening purposes to ask me about my motivations. Was then flown out to HongKong for an in-person interview, met with 3 people there and did technical interview. Heard back on the last day before I left Hong Kong
Perguntas de entrevista [1]
Pergunta 1
Some of the questions were:
- How much wood could a woodchuck wood if a woodchuck could chuck wood? (brain teaser)
- How many carrots are made each in year in Nepal? (basic market sizing question)
- What's 568,582 x 38,1731 (Basic Mental Math Question) and then they followed up with "now divided what you got by 64.31" they give you 30 seconds to answer
- What was Robert Granieri's childhood dogs name? (testing knowledge of the company)
Candidatei-me online. O processo levou 3 semanas. Fui entrevistado pela Jane Street (Hong Kong) em mai. de 2024
Entrevista
Round 1: Mainly probability based questions involving dice
Round 2: More game theory based questions
Round 3: Played a game with the interviewer where I had to come up with a winning strategy and answer some follow up questions on it
Did not proceed to final round
Perguntas de entrevista [1]
Pergunta 1
They gave me a game involving a gold bar, where both me and the interview would slice it at a certain point. Had to find optimal solution
