Jane Street Coding Interview Questions

A coding question on a small stack language whose values are strings and whose programs can branch. You execute such programs, then rewrite them to print a debug value before each unconditional branch without changing the interpreter, keeping every branch destination correct after instructions shift.

An object-design coding question about the collapse and expand feature of an editor for curly-brace code: pair up block boundaries, then keep the displayed text correct as blocks are toggled. It tests whether inner blocks remember being collapsed when an outer block is closed and reopened, and whether rendering stays linear.

This dynamic simulation problem, frequently asked during Jane Street interviews, challenges you to build an efficient supermarket queue management system supporting customer insertions, item count updates, and simultaneous checkout processing. It tests your proficiency with advanced data structures like balanced trees to handle priority adjustments and complex state changes. To view the complete problem breakdown, optimal data structure choices, and model code, unlock access with a subscription.

This interview challenge, frequently featured in Jane Street loops, requires candidates to determine the frequency of a specific numeral within a given numerical sequence. The task evaluates basic arithmetic logic, digit extraction techniques, and efficient counting strategies across a broad span of integers. Interviewers use this problem to test foundational programming proficiency and attention to edge cases. Access to the complete problem description, testing harness, and optimal solution requires a paid subscription.

This Jane Street puzzle requires you to reduce a character string by repeatedly removing specific adjacent pairs until no further reductions are possible. It evaluates your understanding of stack-based data structures and algorithmic reduction rules under ambiguous choices. To view the complete challenge details, constraints, and an optimal model solution, a subscription is required.

This Jane Street interview question presents a practical estimation challenge where you must calculate total citywide plastic bag usage by combining population statistics, shopping frequencies, and consumption rates. Although rooted in Fermi-style estimation principles, the task requires translating logical approximations into a deterministic, runnable computational solution via a provided code stub. You will practice bridging high-level analytical reasoning with clean programmatic execution under defined parameters. Unlock the complete problem description and model solution by purchasing a subscription.

A streaming data-transformation question: sparse timestamped readings arrive in sorted batches and must be turned into complete fixed-width rows, with gaps marked. It tests online processing with bounded memory, deciding exactly when a row is finished, and handling records that span batch boundaries.

This Jane Street interview question asks you to build a functional code folding mechanism similar to modern text editors. Candidates must parse text formatting based on hierarchical indentation rules to dynamically hide and reveal nested sections. The challenge evaluates your data structure design, state management, and string manipulation abilities under edge cases. Access the complete problem description and expert reference implementation with a subscription.

In this Jane Street algorithmic puzzle, you are tasked with designing a dynamic data structure for an unbounded Connect-N game board featuring vertical gravity and infinite expansion in all directions. The exercise tests your proficiency in managing sparse matrix states, tracking winning sequences dynamically, and optimizing spatial operations under unusual constraints. Get access to the full problem breakdown and verified solution with a subscription.