DRW interview questions

Showing 1–30 of 30 results

• Analyze distribution of a 3-dice productEasy

  This question tests the ability to analyze the probability distribution of the product of three independent discrete random variables and apply these statistical properties to practical risk management.

  DRWQuantitative TraderStatistics & MathOnline Assessment
• Build pipeline for imbalanced classificationMedium

  This interview question evaluates ML product requirements, data/labeling, modeling, serving architecture, evaluation, monitoring, and trade-offs in a realistic interview setting. A strong answer for Build pipeline for imbalanced classification states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  DRWMachine Learning EngineerML System DesignOnline Assessment
• Compute Markov steady state and expectationsMedium

  Compute Markov steady state and expectations evaluates statistical assumptions, formulas, estimation strategy, uncertainty, edge cases, and interpretation in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  DRWData ScientistStatistics & MathOnsite
• Compute a Year-End Balance with Monthly Card FeesEasy

  This problem tests logic implementation and data structure traversal, requiring the integration of conditional logic (fee waivers) into a sequential processing pipeline.

  DRWData EngineerCoding & AlgorithmsOnline Assessment
• Compute expected arc length on a circleEasy

  This question evaluates understanding of geometric probability, order statistics on a circle, and expectation computation for continuous random variables.

  DRWQuantitative TraderStatistics & MathOnline Assessment
• Delete the Fewest Characters to Avoid Triple RepeatsEasy

  This problem tests string manipulation, greedy algorithm logic, and the ability to track character frequency counts to identify and prune violations of a constraint.

  DRWData EngineerCoding & AlgorithmsOnline Assessment
• Derive eigenvalues and sum for inverse matrixEasy

  Derive eigenvalues and sum for inverse matrix evaluates statistical assumptions, formulas, estimation strategy, uncertainty, edge cases, and interpretation in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  DRWData ScientistStatistics & MathOnsite
• Differentiate sample vs population standard deviationMedium

  This interview question evaluates statistical assumptions, formulas, estimation strategy, uncertainty, edge cases, and interpretation in a realistic interview setting. A strong answer for Differentiate sample vs population standard deviation states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  DRWData ScientistStatistics & MathTechnical Screen
• Expected Dart Score for a Bivariate Normal Throw with Ring ScoringHard

  Calculate the expected score of a dart throw modeled by a zero-mean bivariate normal distribution with circular scoring rings, calibrated using a known hit probability inside the inner ring.

  DRWQuantitative ResearcherStatistics & MathOnsite
• Expected Rounds Until a Shopping-Cart Line Empties Under Random TransfersHard

  Tests modeling discrete-time Markov chains, formulating hitting-time difference equations, and solving symmetric random walk absorption problems analytically.

  DRWQuantitative ResearcherStatistics & MathOnsite
• Expected Tosses Until HHT Given HHT Appears Before HTHHard

  Calculate the probability that the coin sequence HHT appears before HTH in repeated fair tosses, and find the conditional expected number of tosses until termination given that HHT appears first.

  DRWQuantitative ResearcherStatistics & MathOnsite
• Expected Winnings in a Random-Walk Money Collection Game on 45 StonesHard

  Calculates a player's expected winnings in a random-walk money collection game on an odd-sized circle of stones using Gambler's Ruin and parity arguments.

  DRWQuantitative ResearcherStatistics & MathOnsite
• Explain core ML and DL fundamentalsMedium

  Explain core ML and DL fundamentals evaluates core ML concepts, assumptions, math intuition, training/evaluation trade-offs, and practical failure modes in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  DRWMachine Learning EngineerMachine LearningOnline Assessment
• Fewest Expenses to Defer to Year End So the Running Balance Never Goes NegativeEasy

  Given a year's transactions in order, with income as positive values, expenses as negative values and a non-negative total, find the fewest expenses to move to the end of the year so the running balance never drops below zero. It tests reasoning over prefix sums for inputs of up to 100,000 transactions.

  DRWSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Nested Transactions in an In-Memory DatabaseEasy

  This problem tests your ability to manage state and scope using stacks and dictionaries to implement transaction isolation in a key-value store.

  DRWData EngineerCoding & AlgorithmsOnline Assessment
• Largest Number From a 1-and-2 Digit String With Even Counts of Each DigitMedium

  Given a string of 1s and 2s that represents a positive integer, delete characters so the remaining counts of both digits are even, keeping the original order, and return the largest number that can remain. The problem tests careful case analysis of which digit occurrences to remove and efficient string handling for inputs up to 200,000 characters.

  DRWSoftware EngineerCoding & AlgorithmsHR Screen
• Longest Substring in Which Every Present Letter Occurs Equally OftenEasy

  Given a string of lowercase letters, find the length of the longest substring in which every letter that appears occurs the same number of times. It tests substring enumeration with incremental frequency tracking and a precise definition of what counts as balanced.

  DRWSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maximize a Digit Subsequence with Even Counts of Ones and TwosHard

  Find the lexicographically/numerically largest subsequence of a string of '1's and '2's containing an even number of both digits in linear time.

  DRWSoftware EngineerCoding & AlgorithmsHR Screen
• Minimize the Max-Min Gap of an Array After Changing Up to Three ElementsEasy

  Given an integer array, you may change up to three elements to any values; return the smallest possible difference between the largest and smallest values afterward. It tests reasoning about which extreme values are worth changing and careful handling of short arrays.

  DRWSoftware EngineerCoding & AlgorithmsTechnical Screen
• Posterior Probability of a Two-Headed Coin After Three HeadsHard

  This question tests the application of Bayes' theorem, conditional likelihoods, and posterior probability updates given sequential binary observation data.

  DRWQuantitative ResearcherStatistics & MathOnsite
• Probability the Two Strongest Teams Meet in a 16-Team Knockout FinalHard

  Calculate the probability that the two highest-ranked teams face each other in the championship match of a 16-team single-elimination tournament with probabilistic match outcomes.

  DRWQuantitative ResearcherStatistics & MathOnsite
• Process CSV for portfolio returns and metricsMedium

  This question evaluates a candidate's competency in time-series data manipulation, financial return computation, portfolio analytics, numerical stability, modular software design (clear function boundaries and unit tests), and algorithmic complexity analysis within the Data Manipulation (SQL/Python) domain.

  DRWMachine Learning EngineerData Manipulation (SQL/Python)Online Assessment
• Solve Markov and distribution expectation problemsMedium

  This interview question evaluates statistical assumptions, formulas, estimation strategy, uncertainty, edge cases, and interpretation in a realistic interview setting. A strong answer for Solve Markov and distribution expectation problems states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  DRWData ScientistStatistics & MathOnsite
• Solve movie ratings, array, release schedulerMedium

  This question tests algorithmic problem-solving across three domains: greedy array optimization, tree-based data structure design, and efficient sequence merging. It evaluates practical coding ability and complexity analysis, commonly used in quantitative and data science interviews to assess how candidates identify inefficiencies and select the right data structure to improve performance.

  DRWData ScientistCoding & AlgorithmsOnsite
• Solve odd-string, digit swap, patient slot assignmentMedium

  This multi-part problem evaluates string manipulation and parity/combinatorics for constructing odd-occurrence strings, greedy optimization and minimal-change reasoning for digit-swap distance minimization, and bipartite matching/assignment skills for patient slot allocation.

  DRWSoftware EngineerCoding & AlgorithmsOnline Assessment
• Solve three algorithmic OA problemsMedium

  This set evaluates algorithmic problem-solving skills including array manipulation and simulation for knockout tournament dynamics, graph traversal and constructive movement-sequence design on grids, and broader competencies in handling permutations, connectivity, and constraint-driven constructions.

  DRWSoftware EngineerCoding & AlgorithmsOnline Assessment
• Solve three algorithmic OA tasksMedium

  Solve three algorithmic OA tasks evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  DRWSoftware EngineerCoding & AlgorithmsOnline Assessment
• Solve three algorithmic tasks in PythonMedium

  This question evaluates proficiency in dynamic programming, range-query data structures (Fenwick/segment tree), sorting and two-pointer techniques, and algorithmic complexity analysis within the Coding & Algorithms domain for Python-based implementation.

  DRWData ScientistCoding & AlgorithmsOnsite
• Train LinearSVC to beat a hidden baselineHard

  Train LinearSVC to beat a hidden baseline evaluates ML product requirements, data/labeling, modeling, serving architecture, evaluation, monitoring, and trade-offs in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  DRWMachine Learning EngineerML System DesignOnline Assessment
• Validate a Password Against Explicit Security RulesEasy

  This problem tests string manipulation, character set validation, and the ability to apply a sequence of conditional checks efficiently.

  DRWData EngineerCoding & AlgorithmsOnline Assessment