Jane Street Researcher Interview Questions
& Process
Real candidates share what happened, how many rounds they had,
and how the experience turned out.
Based on 10 interview experiences · FREE TO READ
Candidate interview experiences
First-hand accounts from people who interviewed at Jane Street.
Jane Street
Machine Learning Researcher
Intern Difficult Neutral experience No offer 1 round
Interview process
Recruiter call Phone screen
Interview formats
Technical
Had an initial screening call over Zoom, which lasted about an hour. They posed a puzzle-based question and at the end, I had some time to ask them questions. The overall experience wasn't great, and I wasn't invited for an onsite interview.
Confirmed questions1 question
- An ML puzzle question was asked.
Jane Street
Researcher
Entry Easy Neutral experience No offer 1 round
Interview process
Recruiter call Technical screen Background check Offer
Interview formats
Technical Behavioral
The interviewer started by giving me some info about the job. Then we got into probability questions. There were three questions, and they were actually the same ones others had posted here. I answered them correctly and quickly, just had a tiny algebra mistake on one. He seemed happy with my answers and then asked about my graduation date and why I was interested in Jane St. A few days later, HR emailed saying they weren't moving forward with my application. I'm not sure what led to that decision, maybe it was because I didn't go to a 'target' school, even though my department is top 10.
Confirmed questions2 questions
- If you throw a die once or twice and get paid the face value, what's the expected payoff?
- Given V~U[0,1], if you make a bet B, and you win 1.5 times V if B>V (otherwise your bet is worthless with no loss), what should you bet?
Jane Street
Researcher
Intern Difficult Positive experience Accept offer 2 rounds
Interview process
Recruiter call Take home Technical screen
Interview formats
Technical Coding
I applied for an intern role. The interviewer was nice and spoke well. The last 15 minutes were for my questions, and it was all good. He gave me 4 tasks, and I finished them in 40 minutes. The tasks were engaging, and I enjoyed doing them.
Confirmed questions3 questions
- Given 100 windows, 2 individuals, and 50 days, where one person can break windows to communicate information to another on any given day, what is the maximum number of bits that can be transferred?
- In a scenario with 100 windows, 2 people, and 50 days, where one person breaks windows to communicate information, determine the quantity of information bits that can be transferred.
- Considering the first person breaks windows and the second person repairs some, how can they maximize the bits transferred daily? Develop an algorithm and find the highest possible bit transfer rate, with the first person gaining information from repaired windows and the second from broken ones.
Jane Street Researcher Interview Questions
Quoted word for word from Jane Street interview reports.
“Two gamblers are playing a coin toss game. Gamer A has (n+1) fair coins, B has n fair coins. What is the probability that A will have more than B if both flip all their coins?”
Read reports →“What is the probability it rains on a weekend?”
Read reports →“Given a fair die, if you roll it once and get a score, you can choose to keep it or roll up to two more times, taking the final score. What would be a fair price to pay to play this game?”
Read reports →“If you throw a die once or twice and get paid the face value, what's the expected payoff?”
Read reports →“Given V~U[0,1], if you make a bet B, and you win 1.5 times V if B>V (otherwise your bet is worthless with no loss), what should you bet?”
Read report →“Given 100 windows, 2 individuals, and 50 days, where one person can break windows to communicate information to another on any given day, what is the maximum number of bits that can be transferred?”
Read report →“What is the approximate out-of-sample rate?”
Read report →“Solve ML puzzles.”
Read report →“Considering the first person breaks windows and the second person repairs some, how can they maximize the bits transferred daily? Develop an algorithm and find the highest possible bit transfer rate, with the first person gaining information from repaired windows and the second from broken ones.”
Read report →Formats, difficulty and experience
Across all 10 Jane Street interview reports.