Point72 Data Scientist interview questions

13 Data Scientists have shared notes from their Point72 interviews, with the questions they were asked in each round. That is 34% of the 38 Point72 interview notes on Screna AI.

13 Data Scientist interview notes

Point72·Data Scientist·Technical Phone Screen

Jul 2026
Point72 data scientist interview with a geometry-heavy coding problem that felt more like a competitive programming round than anything I expected from a finance firm. The problem was well-scoped but the edge case handling is where they really pushed.
  • Given an array of circle pairs where each circle is defined by (x, y, r), classify each pair as IDENTICAL, CONCENTRIC, TOUCHING_EXTERNALLY, TOUCHING_INTERNALLY, INTERSECTING, or DISJOINT. Coordinates and radii are integers up to 1e9, and N can be up to 2e5. You must avoid floating-point errors, handle degenerate cases like r=0, and explain your time and space complexity.

“My first instinct was to just compute Euclidean distance and compare, which the interviewer immediately flagged.”

View Post

Point72·Data Scientist·Technical Phone Screen

Jul 2026
Point72 Data Scientist interview with a SQL/Python question around date parsing for financial reporting. Pretty focused technical screen, nothing too wild, but the specifics tripped me up a bit.
  • You have a transactions table where dates are stored as 8-digit integers in YYYYMMDD format. Write SQL and/or Python to convert each value into a quarterly label like '2023_Q1'.

“I knew the general idea immediately but fumbled the month-to-quarter mapping under pressure.”

View Post

Point72·Data Scientist·Technical Phone Screen

Jul 2026
Point72 Data Scientist interview with a SQL-heavy technical screen. One meaty query question that covered window functions, nulls, and tie-breaking logic all at once. Felt like a real test of whether you actually know SQL or just know the basics.
  • Given a Departments table and a Students table (with nullable dept_id, nullable GPA, and an enrollment date), write a single SQL query that returns every department including ones with no students, along with their top student by GPA. Ties should break by earliest enrollment date, then by smallest student ID. If a department has no students with a non-null GPA, return that department row with nulls for all student fields.

“This one took me a minute to untangle.”

View Post

Point72·Data Scientist·Technical Phone Screen

Jun 2026
Point72 Data Scientist interview with a geometry-based coding problem framed around a graphics engine use case. Pretty applied for a DS role, felt more like a software engineering screen than anything stats-related.
  • Given an array of circle pairs, each defined by center coordinates and radius for both circles, determine for every pair whether the circles intersect, touch, or are completely separate.

“The hint is basically the whole solution once you see it: compute the distance between centers and compare it against the sum and absolute difference of the radii.”

View Post

Point72·Data Scientist·Technical Phone Screen

Jun 2026
Point72 data scientist interview with a pretty gnarly SQL/Python question about date parsing and fiscal quarters. One question, but it had a lot of moving parts and I definitely underestimated how much edge case handling they expected.
  • Given an 8-digit integer date key in YYYYMMDD format, write both a SQL expression and a Python function that convert it to a quarter label like 'YYYY-Qn'. The solution must validate the date (returning NULL or raising an error for impossible dates like month 13 or Feb 30), support an optional fiscal start month parameter, and handle string inputs with whitespace or leading zeros correctly.

“I thought I had this in the bag because I've written quarter logic before, but the fiscal year offset tripped me up badly.”

View Post

Point72·Data Scientist·Technical Phone Screen

Jun 2026
Deep technical interview at Point72 for a data scientist role. The whole thing was essentially one long project deep-dive with five distinct sub-questions, covering everything from feature engineering to SHAP to PCA math. Felt more like a PhD defense than a job interview.
  • Pick an ML project you built personally and walk through it end-to-end: problem statement, dataset, label definition, data quality issues, leakage risks, train/validation strategy, evaluation metrics, and model choices. Justify every decision.
  • How did you decide which features to include or exclude? Walk through your process for handling missing values, outliers, high-cardinality categoricals, correlated features, and time-based target leakage. How did you verify features stay stable over time?
  • For your chosen model, which hyperparameters mattered most, what search strategy did you use, how did you structure cross-validation for time-series data, and how did you avoid overfitting to the validation set when selecting the final model?
  • Write out the core PCA optimization objective and its solution. How does PCA connect to the covariance matrix and SVD? What do the principal components actually represent, how many do you keep, and when is PCA harmful in a supervised learning context?
  • Explain SHAP values and their connection to Shapley values from cooperative game theory. What properties make SHAP attractive? Interpret a summary plot, a dependence plot, and a force plot. What are at least three failure modes or pitfalls?

“This is the kind of question where picking the wrong project kills you.”

View Post

Point72·Data Scientist·Technical Phone Screen

Jun 2026
Two coding problems back to back for a Data Scientist role at Point72. The first was a k-th missing number problem and the second involved flagging redundant events inside a sliding time window. Neither felt purely DS-flavored, more like a straight SWE screen.
  • Given an unsorted array of distinct positive integers and an integer k, return the k-th smallest positive integer that does not appear in the array.
  • Given parallel arrays of operation names and timestamps, and a window size W, count how many events are redundant, where an event is redundant if the same operation has occurred at least twice within the preceding W seconds.

“My first instinct was to just iterate from 1 upward and count misses, which works fine for small inputs but falls apart when nums[i] can go up to a billion.”

View Post

Point72·Data Scientist·Take-home Assignment

May 2026
Point72 data scientist take-home with three pretty brutal coding tasks. No fluff, no behavioral stuff, just pure problem-solving under time pressure. The problems were harder than I expected for a DS role.
  • Given a list of date strings in mixed and potentially ambiguous formats, normalize each one to UTC ISO 8601. Handle timezone conversions, two-digit year mapping, leap year validation, and compute the business-day difference between any two normalized dates, excluding weekends and a fixed holiday set. Return an error for invalid inputs.
  • Given target quantities for up to 6 item types, unit prices, and a list of special bundles each with their own price, find the minimum cost to exactly meet the target quantities using any combination of bundles and individual unit purchases. Return the cost and the actual combination used, or -1 if it's impossible. Bundles cannot oversupply.
  • Implement a function that classifies the spatial relationship between two circles, returning one of seven possible states from 'separate' to 'concentric equal'. Use squared distances to avoid precision loss, handle near-tangency within a small epsilon, and return intersection point coordinates when applicable.

“This one wrecked me more than I want to admit.”

View Post

Point72·Data Scientist·Technical Phone Screen

Apr 2026
Point72 Data Scientist interview with a SQL question centered on department-level aggregation. Pretty standard stuff but the LEFT JOIN detail matters more than it looks.
  • Write a SQL query that shows each department name alongside its student count, making sure departments with zero students still appear in the results.

“The zero-count departments are the whole point.”

View Post

Point72·Data Scientist·Technical Phone Screen

Apr 2026
Point72 data scientist round with a combinatorics/greedy algorithm problem that looks deceptively clean until you hit the edge cases. The problem had real depth to it and required thinking carefully about optimality proofs, not just a working solution.
  • Given item counts by color, find the maximum number of outfits you can form where each outfit uses exactly 3 items of distinct colors. Return the count and construct the first 10 valid outfits. Aim for O(C log C) time and O(C) space.

“I got the greedy idea pretty fast, grab the three largest remaining counts each round using a max-heap, but then they asked me to prove it's optimal and I fumbled.”

View Post