Candidates describe Jane Street software engineer interviews as coding problems that grow with follow-ups, sometimes alongside math puzzles. Interviewers focus on reasoning and clean code more than speed.
$235K
Avg. Base Comp
$380K
Avg. Total Comp
3-4 rounds
Typical Rounds
Not reported
Process Length
Jane Street software engineer interviews, as candidates describe them, center on coding problems that start simple and keep growing. One candidate began with a stack-based parentheses task that the interviewer stretched into a code-folding editor. Another, in a recent one-hour C++ session, moved from scanning a stream of numbers to a queue and hash map that returned the earliest number seen exactly once. The follow-up that mattered was explaining why the approach was efficient overall.
Several people say the interviewers cared more about reasoning and clean code than about running anything. One was told they would not need to run code at all, because the goal was to see how they think and whether the code stayed clean as complications were added. Talk through your representation before you write it, and keep the structure tidy so the next requirement fits.
Not everyone sees the same mix. Some reports include math-style questions, such as counting and combinatorics brainteasers and a speed-distance-time problem. Another candidate describes a behavioral opener with brain teasers, then a math-focused round and an OOP question that built in difficulty, repeated at a harder level with two engineers. A third describes onsite rounds that each opened with an algorithm problem, including a basic tree question, followed by follow-ups that probed tradeoffs. That candidate says anyone who did not pass was sent home after the second onsite interview, so early rounds carry real weight.
Most accounts here ended without an offer. Pick the language you are fastest in, since one candidate struggled in an unfamiliar one. Practice multi-part problems out loud, and be ready to explain why your solution is efficient, not just that it works.
Synthesized from 39 candidate reports by our editorial team.
Had an interview recently?
Share your experience. Unlock the full guide.
Real interview reports from people who went through the Jane Street process.
The interview process had three rounds, and my first interview was a one-hour coding session in C++. I was asked to process a stream of numbers and, after each update, return the earliest number that had appeared exactly once. I initially suggested scanning the entire sequence, but the interviewer asked me to improve the solution, so I used a queue and a hash map to track frequencies. The hardest part was explaining why the solution was efficient overall, even though a single update could require removing several repeated numbers from the queue. We also discussed edge cases, such as having no unique numbers left, and I had to fix a small bug while explaining my reasoning aloud.
Share your own interview experience to unlock all reports, or subscribe for full access.
Sourced from candidate reports and verified by our team.
Topics based on recent interview experiences.
Featured question at Jane Street
Given two sorted lists, write a function to merge them into one sorted list.
| Question | |
|---|---|
| Total Transactions | |
| Stranded Miner | |
| Cumulative Sales Since Last Restocking | |
| Priority Queue Using Linked List | |
| Last Element of a Singly Linked List | |
| International e-Commerce Warehouse | |
| Summing Numeric Strings | |
| Text Editor With OOP | |
| Above Average Product Prices | |
| LRU Cache 1 | |
| 2nd Highest Salary | |
| Employee Salaries | |
| Subscription Overlap | |
| Closest SAT Scores | |
| Empty Neighborhoods | |
| Top Three Salaries | |
| Monthly Customer Report | |
| Rolling Bank Transactions | |
| Find the Missing Number | |
| Maximum Profit | |
| Bagging vs Boosting | |
| String Shift | |
| Prime to N | |
| Comments Histogram | |
| Top 5 Turnover Risk | |
| Find the First Non-Repeating Character in a String | |
| Like Tracker | |
| Size of Joins | |
| Total Spent on Products |
Synthesized from candidate reports. Individual experiences may vary.
Candidates describe different openings. Some report an online assessment or screening test, and one describes a 45-minute online interview before the onsite. One candidate says they skipped the online assessment and went straight into a coding interview. Expect a well-defined problem where clear communication counts.
One recent candidate had a one-hour C++ session on a stream of numbers. They were asked to improve a first scan-based answer and explain its overall efficiency. Another solved a parentheses problem that grew into a code-folding editor. A third reports a Zoom round of counting and speed-distance-time puzzles before a coding round, so prepare for both styles.
One candidate describes three 45-minute onsite interviews with two engineers each, plus a tour and lunch. Each round opened with an algorithm problem and follow-up questions. Another describes an OOP question that kept building in difficulty, followed by a harder version with two engineers. The first candidate says non-passing candidates were sent home after the second interview.
These reports do not give consistent timing for decisions. Most accounts ended without an offer, and one recent candidate was still waiting for a reply.
