Jane Street Software Engineer candidates report screens and onsite sessions that can mix math or logic, open-ended coding, and follow-up-heavy implementation. Practice explaining choices, edge cases, and evolving designs aloud.
$288K
Avg. Base Comp
$450K
Avg. Total Comp
3-5 rounds
Typical Rounds
4 weeks
Process Length
Jane Street Software Engineer interviews described by candidates are not one uniform template, but the recurring challenge is explaining your reasoning while a problem develops. Several candidates reported math, probability, or logic alongside coding; others encountered algorithmic and data-structure prompts with follow-ups. One candidate described a tree-selection problem involving a multiset and a scoring follow-up, while another reported an OOP question that became harder as each part was completed. Clear representation choices and disciplined handling of edge cases are more actionable preparation targets than memorizing a single question type.
For coding practice, work in a language you can use comfortably, narrate the data structures you choose, and revisit the design as requirements change. Tree, multiset, and OOP exercises are relevant examples from individual reports, especially when you must explain tradeoffs rather than merely produce code. Math-puzzle preparation can include probability, logic, and translating a verbal setup into a precise model.
Candidate reports differ on whether a behavioral or non-technical conversation appears: one reported background discussion and brain teasers, while others said their sessions moved straight to technical work. Prepare a concise account of your experience, then ask the recruiter for the agenda rather than assuming a fixed sequence. One candidate reported an end-to-end process of about a month; broader timing is thinly reported.
Synthesized from 10 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 hardest part was that the interviewers were much more interested in my reasoning than in whether I remembered exact syntax. The process moved fairly quickly over about a month and included a resume discussion, math/logic questions, coding interviews, and an in-person Super Day with more problem-solving and technical coding. The coding session I had was on CoderPad in my preferred language, with a lead interviewer driving the conversation and a second interviewer observing. There were essentially no behavioral questions; they got straight to the problem and expected me to narrate my thinking.
One early exercise was to write a function that finds the three largest items in a list by maintaining first, second, and third place as I looped through it. I was also asked a logic question about draining water from a strawberry that starts at 98% water and 2% fiber until it becomes 50/50. The more challenging problems felt unlike the standard questions I had practiced and required thinking carefully about the model before coding. A representative on-site-style question involved managing a tree selection as a multiset, where selecting the same node repeatedly means it must be removed the same number of times. The follow-up scored tree levels based on selected nodes, their parents, siblings, and children, then asked for the highest-scoring consecutive block of levels. The important details were honoring the scoring precedence instead of adding overlapping scores, handling the root and a level window larger than the tree depth, and explaining an efficient BFS-plus-sliding-window approach.
When I made a mistake or suggested something suboptimal, the interviewers usually responded with questions that helped me find the flaw myself rather than giving away the answer. That made the interview demanding but fair. I did not receive an offer. My main takeaway is to talk through your representation and edge cases early, because clean, optimized problem-solving mattered more here than flawless code on the first try.
Prep tip from this candidate
Practice explaining a top-three-in-a-list pass and the strawberry water-percentage logic problem aloud. For tree questions, be precise about multiset counts, highest-rule-wins scoring, BFS level grouping, and a sliding window over consecutive levels.
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 | |
|---|---|
| Stranded Miner | |
| Cumulative Sales Since Last Restocking | |
| Priority Queue Using Linked List | |
| Total Transactions | |
| 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 | |
| Bagging vs Boosting | |
| String Shift | |
| Comments Histogram | |
| Prime to N | |
| Top 5 Turnover Risk | |
| Like Tracker | |
| Find the First Non-Repeating Character in a String | |
| Maximum Profit | |
| Total Spent on Products | |
| Google Maps Improvement |
Synthesized from candidate reports. Individual experiences may vary.
Candidates reported different entry points: an online assessment, a screening test, a coding screen, or a resume-focused video conversation. One resume-oriented screen included FPGA fundamentals and prior experience, while another report began with math-style Zoom questions. Prepare both a concise background walkthrough and a short coding or reasoning exercise.
Several candidates reported combinatorics, counting, probability, speed-distance-time, or general logic questions. These accounts suggest practicing how to state assumptions, convert the prompt into a model, and communicate intermediate reasoning; the exact topic and placement varied by candidate.
Candidates described coding problems that were extended with added constraints, including a stack/parentheses task that became a stateful editor-style design and an LRU-cache implementation. Practice explaining data-structure choices, invariants, and edge cases as the interviewer may change the requirements.
Candidates who reached later stages described multi-session interview days with algorithmic, data-structure, math, and technical coding work. One candidate reported three 45-minute onsite interviews after an initial online interview; another reported four onsite interviews after a Zoom screen. Treat the mix as variable rather than a fixed round-by-round format.
Some candidates reported a behavioral conversation about background and past experience, while others reported no behavioral questions. Prepare concise examples from your work and ask for the meeting agenda, but do not assume every Jane Street Software Engineer process includes a separate behavioral round.
