OfferLoop

INTERVIEW GUIDE

Jane Street Software Engineer Interview: Questions & Process

Jane Street's software engineer interview is less about memorized algorithms and more about how you think — clear reasoning, probability, mental math, and careful problem solving, all explained out loud. Expect a recruiter screen, multiple technical problem-solving and coding rounds, and at least one probability or market-making game. Language doesn't matter much (they use OCaml internally); rigor, edge-case discipline, and reasoning under uncertainty do.

The interview process

1. Recruiter / HR screen ~30 min call
Tests: background, interest in the firm, and logistics
2. Technical phone screen 45-60 min, problem solving + coding
Tests: how you reason through an open-ended problem out loud, not just the final answer
3. Second technical screen 45-60 min
Tests: data structures, CS fundamentals, and clean reasoning about correctness and complexity
4. Probability & mental-math round 45-60 min, interactive
Tests: expected value, conditional probability, estimation, and quick mental arithmetic — often as a game
5. Onsite / final loop Multiple rounds, often virtual or in person
Tests: deeper coding, a market-making or trading game, and functional/algorithmic thinking

Questions you're likely to get

Technical

  • Design a data structure that supports insert, delete, and getRandom in O(1).
  • Maintain the running median of a stream of numbers as values arrive.
  • Find the kth largest element in an array — and explain why your approach is optimal.
  • Implement an LRU cache and reason about every operation's complexity.
  • Merge a set of overlapping intervals and discuss the edge cases.
  • Given a recursive definition, derive the closed form and the time complexity.

Role-specific

  • We flip a fair coin until we get two heads in a row. What's the expected number of flips?
  • Estimate how many piano tuners there are in Chicago. Walk me through your reasoning.
  • I'll make a market on a random variable — you can buy or sell. How do you decide, and update?
  • Two players roll dice under these rules — what's the probability you win, and is the game fair?

Behavioral

  • Tell me about a problem you found genuinely hard. How did you approach it?
  • Why Jane Street and quantitative trading specifically?
  • Describe a time you realized you were wrong mid-problem. What did you do?

Practice these problems live

Relevant LeetCode problems for the Jane Street Software Engineer loop. Start a live, AI-run coding interview on any of them — or open the problem on LeetCode.

Find Median from Data Stream· Hard · LeetCode #295
Find Median from Data Stream rewards the heap and streaming reasoning Jane Street probes.
LRU Cache· Medium · LeetCode #146
LRU Cache tests precise O(1) design and complexity discipline they expect.
Kth Largest Element in an Array· Medium · LeetCode #215
Kth Largest Element invites quickselect vs. heap tradeoff reasoning.
Merge Intervals· Medium · LeetCode #56
Merge Intervals is a clean correctness-and-edge-case exercise.
Implement Trie (Prefix Tree)· Medium · LeetCode #208
Implement Trie checks careful data-structure design and clarity.
Merge k Sorted Lists· Hard · LeetCode #23
Merge k Sorted Lists stresses heaps and optimal-complexity argument.

How to answer (worked examples)

We flip a fair coin until we get two heads in a row. What's the expected number of flips?
Set up states and solve with expectation equations, narrating each step. Let E0 be the expected flips from no progress, E1 from one head. From E0: E0 = 1 + 0.5*E1 + 0.5*E0. From E1: E1 = 1 + 0.5*0 + 0.5*E0. Solve to get E0 = 6. The point isn't the number — it's that you build the recurrence cleanly, define states precisely, and stay calm. Jane Street watches your reasoning far more than your recall.
Estimate how many piano tuners there are in Chicago.
Decompose out loud and state assumptions you can defend: city population, share of households with pianos, how often a piano is tuned per year, tunings one tuner does per year. Multiply through, sanity-check the magnitude, and note which assumption your answer is most sensitive to. They want structured estimation and honest reasoning about uncertainty, not a 'correct' figure.

What Jane Street looks for

FAQ

Do I need to know OCaml?

No. Jane Street uses OCaml internally, but interviews are language-agnostic — solve in whatever you're strongest in. Comfort with functional thinking can help, but it's not required to get an offer.

How much probability and mental math will there be?

A lot — more than most software interviews. Expect expected-value problems, conditional probability, estimation, and a market-making game even for engineering roles. Practice these as seriously as you practice coding.

Is it harder than a FAANG interview?

Different and often deeper. Less reliance on memorized LeetCode patterns, more on genuine problem solving, math, and reasoning under pressure. People who only grind algorithm lists are often caught off guard.

What's the market-making game about?

They quote you a market on some uncertain quantity and watch how you price, take risk, and update as information arrives. It's a proxy for trading instinct and clear thinking under uncertainty, not a trick.

How should I behave when I'm stuck?

Keep talking. Share hypotheses, test them, and reason aloud. They reward a candidate who works through being stuck cleanly far more than one who stalls silently or guesses.

Walk into the Jane Street loop already warmed up

Reading the questions isn't the same as reasoning through a probability puzzle or a market-making game out loud under pressure. Practice thinking aloud — the coding rounds, the expected-value problems, the estimation games — with OfferLoop's realtime voice coach before the real thing.

Practice this interview out loud →

Related

OfferLoop is an independent interview-practice tool and is not affiliated with, endorsed by, or sponsored by Jane Street. All company names and trademarks are the property of their respective owners.

Interview formats vary by team, level and year, and this guide is compiled from general knowledge of publicly discussed hiring processes — treat it as preparation material, not an official description of Jane Street's current process.