Common Words
Easy · Online assessment (OA) · Full-time
Count strings that appear exactly once in each of two arrays. Simple frequency counting problem, quick to implement. Done in a couple minutes as a warm-up.

Browse 10 Jane Street interview questions for quantitative finance and trading interview preparation. Questions in this collection are tagged for full-time roles. Explore the topics and stages below and filter the collection to plan your practice.
Questions come from candidate contributions and online research. Reports reflect past experiences and do not guarantee what Jane Street will ask. Locked question details require points. Public examples below are free to read.
Read 3 free Jane Street interview question examplesRead the full problem statements and use the links to revisit or share a specific example.
Easy · Online assessment (OA) · Full-time
Count strings that appear exactly once in each of two arrays. Simple frequency counting problem, quick to implement. Done in a couple minutes as a warm-up.
Hard · Onsite · Phone screen · Full-time
Two arrays where nums1[i] grows by nums2[i] each second. Each second I can zero out one element after the increment. Find the minimum seconds to get the total sum at or below x. I used DP where I sorted by growth rate and decided which elements to zero out at which time step. Hard problem, the sorting insight was the key.
Medium · Online assessment (OA) · Phone screen · Onsite · Full-time
A robot starts at the origin facing north and gets commands to turn or move forward, with obstacles on certain grid squares. I simulated the movement step by step, checking for obstacles before each unit move, and tracked the maximum squared distance from the origin at any point. The interviewer asked about optimizing for very long move commands.