Their process is pure problem-solving: no system design, no behavioral rounds, just 3 to 4 back-to-back sessions of hard algorithmic and functional programming problems, almost always in OCaml or the language of your choice. If you cannot reason about recursion, probability, and combinatorics fluently, prepare for at least 6 months.
Recruitment process
- Resume or campus screen: targets top IITs, NITs, and competitive programming candidates
- Online Assessment or phone screen: 1 to 2 hard algorithmic problems, 60 minutes
- Technical Interview 1: Hard problem-solving with live thinking and iterative refinement
- Technical Interview 2: A second hard problem, sometimes probability or combinatorics
- Technical Interview 3 (on-site or virtual): Third problem, often the most open-ended
- Offer or debrief: Decision is collective across all interviewers
Interview rounds
- Online Assessment or Phone Screen (60 min): 1 to 2 hard problems. They evaluate how you think aloud, not just whether you reach the answer.
- Technical Interview 1 (60 min): A hard algorithmic or mathematical problem. Interviewers expect you to explore wrong approaches openly and correct course collaboratively.
- Technical Interview 2 (60 min): May involve probability, combinatorics, or dynamic programming. Functional programming fluency is a significant advantage here.
- Technical Interview 3 (60 min): The most open-ended round. Problems are often novel and require building intuition from scratch during the session.
Questions candidates report
- 01Practise
Reverse a linked list in O(1) extra space. Then explain when you'd use this in production.
Standard - 02Practise
What is the difference between a class and an object? Give an example.
Warm-upTCS Ninja/Digital tracks lean heavily on CS fundamentals: OOP, OS, DBMS, SQL basics. Expect rapid-fire Q's, not deep dives. - 03Practise
Write a SQL query to find the second-highest salary in a department.
Warm-up - 04Practise
What is normalisation in databases? When would you de-normalise?
Warm-up - 05Practise
What's the difference between a stack and a queue? Give a real-world use case for each.
Warm-up - 06Practise
Given a stream of integers, design a data structure that returns the median in O(log n).
Intense - 07Practise
You have a service that's slow only on Tuesdays. Walk me through how you'd debug.
StandardGoogleyness: structured debugging, hypothesis-driven, instrumentation-first. - 08Practise
Here's 200 lines of payment-processing code with several intentional bugs. Find them and explain the production impact of each.
IntenseStripe's signature 'bug bash' round. Off-by-one, race conditions, wrong error handling, edge cases in money math. Communicating impact > finding all bugs. - 09Practise
Explain webhooks vs. polling for a developer who has never built a payment integration. You have 4 sentences.
StandardStripe values writing clarity above almost everything. Length-constrained explanation tests prioritisation of ideas. - 10Practise
Walk me through Razorpay's fraud-detection model. How would you reduce false positives without increasing chargeback losses?
IntenseRazorpay ML rounds tie model decisions to ₹ impact, chargeback cost vs. blocked-good-txn cost. Pure ML answers without business framing fail.
Frequently asked questions
What is the recruitment process at Jane Street?
The typical Jane Street recruitment process has 6 stages: Resume or campus screen: targets top IITs, NITs, and competitive programming candidates → Online Assessment or phone screen: 1 to 2 hard algorithmic problems, 60 minutes → Technical Interview 1: Hard problem-solving with live thinking and iterative refinement → Technical Interview 2: A second hard problem, sometimes probability or combinatorics → Technical Interview 3 (on-site or virtual): Third problem, often the most open-ended → Offer or debrief: Decision is collective across all interviewers.
What are the interview rounds at Jane Street?
Jane Street typically conducts 4 interview rounds: Online Assessment or Phone Screen (60 min): 1 to 2 hard problems. They evaluate how you think aloud, not just whether you reach the answer.; Technical Interview 1 (60 min): A hard algorithmic or mathematical problem. Interviewers expect you to explore wrong approaches openly and correct course collaboratively.; Technical Interview 2 (60 min): May involve probability, combinatorics, or dynamic programming. Functional programming fluency is a significant advantage here.; Technical Interview 3 (60 min): The most open-ended round. Problems are often novel and require building intuition from scratch during the session..
What framework should I use for Jane Street technical interviews?
HireStepX recommends the First-principles decomposition framework for this type of interview: Break every problem into its smallest mathematical invariant first, then build up a solution incrementally with the interviewer before writing a single line of code.
Reverse a linked list in O(1) extra space. Then explain when you'd use this in production.
To answer this question well, HireStepX recommends the First-principles decomposition approach: Break every problem into its smallest mathematical invariant first, then build up a solution incrementally with the interviewer before writing a single line of code. Ground your answer in a specific real example from your own experience.
What is the difference between a class and an object? Give an example.
To answer this question well, HireStepX recommends the First-principles decomposition approach: Break every problem into its smallest mathematical invariant first, then build up a solution incrementally with the interviewer before writing a single line of code. Ground your answer in a specific real example from your own experience.
Write a SQL query to find the second-highest salary in a department.
To answer this question well, HireStepX recommends the First-principles decomposition approach: Break every problem into its smallest mathematical invariant first, then build up a solution incrementally with the interviewer before writing a single line of code. Ground your answer in a specific real example from your own experience.
What is normalisation in databases? When would you de-normalise?
To answer this question well, HireStepX recommends the First-principles decomposition approach: Break every problem into its smallest mathematical invariant first, then build up a solution incrementally with the interviewer before writing a single line of code. Ground your answer in a specific real example from your own experience.
What's the difference between a stack and a queue? Give a real-world use case for each.
To answer this question well, HireStepX recommends the First-principles decomposition approach: Break every problem into its smallest mathematical invariant first, then build up a solution incrementally with the interviewer before writing a single line of code. Ground your answer in a specific real example from your own experience.