practice a little every day, paws crossed ♡
Quantitative Researcher Interview Questions
Practice 9403 coding, system design and machine learning questions from 546 companies, sorted by role, topic and interview round. Every question has step-by-step hints, a code runner that supports 8 languages and an AI mentor; members also get the full solution walkthrough.
- 9403
- Questions
- 546
- Companies
- 11
- Topics
- 8
- Languages
Showing 1–14 of 14 results
- Goldman SachsMediumQuantitative ResearcherMinimum-Cost Round Trip Visiting Every City Once with Asymmetric Costs
Given a complete matrix of possibly asymmetric travel costs between up to 16 cities, return the minimum cost of a round trip that starts at city 0, visits every other city exactly once and returns to city 0. The problem tests exact optimization over subsets of cities within tight limits.
Coding & AlgorithmsTechnical Screen - Goldman SachsMediumQuantitative ResearcherTotal Rainwater Trapped Above an Elevation Profile of Unit-Width Bars
Given the heights of adjacent unit-width bars in an elevation profile, compute the total amount of rainwater that stays trapped between them after rain, with water spilling off both open ends. The coding problem tests reasoning about the bars that bound each position and handling up to 100,000 bars efficiently.
Coding & AlgorithmsTechnical Screen - Hudson River TradingMediumQuantitative ResearcherImplement Buffer Parsers and Generic Map Class
This problem tests your ability to safely parse binary data streams from raw memory buffers and implement a type-safe generic wrapper around standard associative containers.
Coding & AlgorithmsOnline AssessmentC++TemplatesBinary-Parsing - Jump TradingMediumQuantitative ResearcherMaintain a Fixed-Window Rolling Mean in Constant Time
Implement an efficient sliding-window mean calculation over a stream or sequence of signed integers. Tests sliding window mechanics, constant-time updates, handling integer overflow, and edge cases.
Coding & AlgorithmsOnsiteSliding WindowArraysStreaming - OptiverEasyQuantitative ResearcherStone Pile Doubling Game: Can One Pile Be Emptied?
This question evaluates a candidate's algorithmic reasoning and discrete-mathematics skills, particularly understanding deterministic state transitions, invariants, and cycle detection in iterative processes.
Coding & AlgorithmsTechnical Screen - Point72MediumQuantitative ResearcherFind the Minimum in a Rotated Sorted Array
A strictly increasing array of distinct integers has been rotated at an unknown pivot. Work through the function contract, boundary cases, correctness argument, and time and space complexity expected in a production-quality solution.
Coding & AlgorithmsTechnical Screen - SquarepointMediumQuantitative ResearcherFind Values Whose Removal Minimizes Pairing Cost
Determine all unique values from an odd-length array whose removal leaves an even-length array that can be partitioned into pairs with minimum total absolute difference.
Coding & AlgorithmsTechnical Screenarrayssortingprefix-sum - SquarepointMediumQuantitative ResearcherShortest Subarray with at Least K Distinct Values
Determine the minimum length of a contiguous subarray that contains at least k distinct elements. This problem tests sliding-window techniques, hash map management, and linear-time optimization.
Coding & AlgorithmsTechnical Screensliding-windowhash-tabletwo-pointers - Two SigmaMediumQuantitative ResearcherLinear Interpolator with Extrapolation
This question evaluates understanding of piecewise linear interpolation and extrapolation, numerical robustness with floating-point values, and algorithmic competencies such as sorting and efficient query location for large datasets.
Coding & AlgorithmsTechnical Screen - Virtu FinancialHardQuantitative ResearcherMaximum Edges in a Triangle-Free Graph
Determine the maximum number of edges an undirected, simple graph on n vertices can have without containing any triangle (K3), and construct one such extremal graph.
Coding & AlgorithmsOnsitegraph-theorymathcombinatorics - Virtu FinancialHardQuantitative ResearcherMaximum Total Height of Mountain-Shaped Towers Under Per-Plot Height Caps
Each plot in a row has a maximum allowed tower height. Choose tower heights that rise to a single peak and then fall, never exceeding any cap, so that the total height is as large as possible. Tests reasoning about the peak position, per-position caps, and 64-bit sums.
Coding & AlgorithmsOnline Assessment - Virtu FinancialHardQuantitative ResearcherMinimum Number of Transfers to Settle All Debts in a Group
Given a list of past loans between people, compute the minimum number of new money transfers needed so that everyone's net balance returns to zero. Tests reducing a transaction log to net balances and searching for the fewest settling transfers under small input bounds.
Coding & AlgorithmsOnline Assessment - Virtu FinancialHardQuantitative ResearcherReach a Target Pair by Repeatedly Adding One Coordinate to the Other
Starting from a pair of positive integers, each move adds one coordinate to the other. Decide whether an exact target pair can be reached. Tests reasoning about reachability when values go up to one billion and simulating every forward move is far too slow.
Coding & AlgorithmsOnline Assessment - VoleonMediumQuantitative ResearcherReturn Words in Repeated Anagram Groups
Return all input occurrences belonging to repeated anagram groups, preserving order and duplicates with multiplicity-aware letter-count signatures.
Coding & AlgorithmsTechnical Screen
Goldman Sachs
Hudson River Trading
Optiver
Point72
Squarepoint
Two Sigma
Virtu Financial
Voleon