Jane Street Software Engineer Interview Questions
Practice the exact questions companies are asking right now.
"I got asked a hardcore MCM DP question and I saw it on PracHub as well. Solved that question in 5 minutes. Without PracHub I doubt I could solve it in 5 hours. Though somehow didn't get hired, perhaps I guess I solved it too fast? /s"
"Believe me i'm a student here jn US. Recently interviewed for MSFT. They asked me exact question from PracHub. I saw it the night before and ignored it cause why waste time on random sites. I legit wanna go back and redo this whole thing if I had chance. Not saying will work for everyone but there is certainly some merit to that website. And i'm gonna use it in future prep from now on like lc tagged"
"10 years of experience but never worked at a top company. PracHub's senior-level questions helped me break into FAANG at 35. Age is just a number."
"I was skeptical about the 'real questions' claim, so I put it to the test. I searched for the exact question I got grilled on at my last Meta onsite... and it was right there. Word for word."
"Got a Google recruiter call on Monday, interview on Friday. Crammed PracHub for 4 days. Passed every round. This platform is a miracle worker."
"I've used LC, Glassdoor, and random Discords. Nothing comes close to the accuracy here. The questions are actually current — that's what got me. Felt like I had a cheat sheet during the interview."
"The solution quality is insane. It covers approach, edge cases, time complexity, follow-ups. Nothing else comes close."
"Legit the only resource you need. TC went from 180k -> 350k. Just memorize the top 50 for your target company and you're golden."
"PracHub Premium for one month cost me the price of two coffees a week. It landed me a $280K+ starting offer."
"Literally just signed a $600k offer. I only had 2 weeks to prep, so I focused entirely on the company-tagged lists here. If you're targeting L5+, don't overthink it."
"Coaches and bootcamp prep courses cost around $200-300 but PracHub Premium is actually less than a Netflix subscription. And it landed me a $178K offer."
"I honestly don't know how you guys gather so many real interview questions. It's almost scary. I walked into my Amazon loop and recognized 3 out of 4 problems from your database."
"Discovered PracHub 10 days before my interview. By day 5, I stopped being nervous. By interview day, I was actually excited to show what I knew."
"I recently cleared Uber interviews (strong hire in the design round) and all the questions were present in prachub."
"The search is what sold me. I typed in a really niche DP problem I got asked last year and it actually came up, full breakdown and everything. These guys are clearly updating it constantly."
Optimal Stopping with Square-Number Ruin
Optimal Stopping with Square-Number Ruin You repeatedly roll a fair six-sided die and add each roll to a running total. Before each roll, you may stop...
Optimize a Two-Box Place-or-Take Game
Optimize a Two-Box Place-or-Take Game A one-player game has two opaque boxes and lasts exactly 100 turns. On a place turn, a third party adds one unit...
Validate order book data across multiple databases
Assume your organization stores order book–related data in multiple databases (e.g., one for raw exchange messages, one for normalized orders, one for...
Turning Interview Code into a Reusable Library or API
You have just finished implementing a small game engine during a coding interview: a board data structure for a two-player piece-dropping game, a func...
Design exchange–trading system message flow
Design the message contract and flow between a firm's trading system (OMS/EMS) and an external exchange. Assume: - The trading system sends orders and...
Collapsible Code Editor: Brace Matching and Toggle
This question tests stack-based parsing and stateful data structure design through a two-part brace-matching and collapsible editor problem. It evalua...
Calculate win chance in three-player dice game
Probability of Winning with Rerolls on Ties Setup - Three players: A (you), B, and C. - A fair six-sided die is used. - B and C have already rolled an...
Implement a Circular Buffer
This question evaluates understanding of data structures and buffer management, specifically FIFO semantics, fixed-capacity storage, wraparound indexi...
Design sequential reveal classification and policy
FashionMNIST: Row-wise Reveal Evaluation, Reward-Optimal Masking, Augmentation, and Early Exit Context You have a trained CNN classifier for FashionMN...
Transform sparse time-code stream to dense rows
Problem You are given: - A fixed set of M distinct codes (strings). The column order of the output matrix is the lexicographic order of these codes. -...
Answer why Jane Street
HR Screen Behavioral Question: Why Jane Street? You are interviewing for a Software Engineer role. In 60–90 seconds, explain: 1. Why Jane Street speci...
Calculate dice game win probability
Calculate dice game win probability Dice Game With Tie Rerolls: Probability You Eventually Win Context - Three players each roll a fair standard 6-sid...
Sort trade executions into a canonical order
You are building a small component in a trading system that consumes trade execution records from an upstream feed. The records may arrive out of orde...
Optimize trade PnL table updates
This question evaluates understanding of incremental aggregation and state management, including handling overlapping predicates, caching expensive or...
Bottom-Insertion Connect Game: Detect the First k-in-a-Row Winner
Two players, B and R, take turns dropping pieces onto a board that covers the upper half-plane of an integer grid. Columns are indexed by arbitrary in...
Implement Connect Four with bottom push-up
Implement a Connect Four variant with bottom push-up. In standard Connect Four a dropped disc falls to the lowest empty cell of a column. In this vari...
Decode an Encrypted Paragraph Tree
Decode an Encrypted Paragraph Tree A document is stored as a tree of paragraphs. Each node holds a paragraph text — a string of lowercase English lett...
Merge Two Insertion Diffs in Linear Time
A text-editing system represents changes to a document as insertion diffs. An insertion diff is a set of (position, value) pairs, where each pair mean...
Stack Machine Interpreter with Typed Int and String Values
You are building an interpreter for a simple stack machine. The machine has a single stack, and every value on the stack is one of exactly two primiti...
Reach a Target Using Each Number At Most Once
Reach a Target Using Each Number At Most Once You are given an array of integers nums and an integer target. Decide whether you can build an arithmeti...