← Back to Directory

Squarepoint interview notes, page 1 of 2

Mid-sized

Screna has 17 Squarepoint interview write-ups. The most reported round is the technical phone screen (14).

17 interview notes · updated Jul 2026

Squarepoint·Software Engineer·Technical Phone Screen

Apr 2026
Math-heavy interview for a discretionary trader role at Squarepoint. One question, no feedback, just silence while I fumbled through it. Not the most encouraging experience.
  • For an n-sided polygon, how many diagonals can be drawn by connecting all non-adjacent vertices?

“Started with a brute-force approach, counting n-3 diagonals from the first vertex, n-4 from the second, and so on.”

View Post

Squarepoint·Software Engineer·Technical Phone Screen

Apr 2026
Interviewed for a quant engineer role at Squarepoint. One question, pretty math-heavy, felt like a warm-up but it had some depth to it once you started thinking carefully.
  • Given a fixed interval [a, b], how would you construct a random variable that maximizes its variance?

“My first instinct was to think about a uniform distribution, which felt wrong almost immediately.”

View Post

Squarepoint·Software Engineer·Technical Phone Screen

Apr 2026
Squarepoint quant/dev screen that went sideways fast. The coding problem itself wasn't crazy but the interviewer kept blocking every reasonable approach I tried, and I ran out of time without finishing. Left feeling like the whole thing was rigged against me.
  • What technical indicators do you use when trading stocks?
  • Implement an EMA indicator in pandas from scratch, without looking at documentation.

“Said EMA, which was true and felt like a reasonable answer.”

View Post

Squarepoint·Software Engineer·Recruiter / HR Screen

Apr 2026
Pretty standard early-round screen for a quant engineer role at Squarepoint. They walked through my resume and asked the usual 'why us' type stuff. Nothing too surprising.
  • Walk me through your resume.
  • Why Squarepoint specifically?

“Standard opener.”

View Post

Squarepoint·Software Engineer·Technical Phone Screen

Apr 2026
Squarepoint SWE interview with a greedy algorithm problem that looks straightforward but has a few subtle pieces worth thinking through carefully. Pretty standard coding round vibe.
  • You have n products where each product's unit price equals its current remaining stock quantity. Given m customers each buying exactly one unit, design an algorithm to maximize total revenue. Each sale reduces a product's quantity by 1 and earns that quantity as revenue before decrement.

“I saw max-heap pretty quickly, always pull the largest quantity, sell it, push quantity minus one back in.”

View Post

Squarepoint·Software Engineer·Technical Phone Screen

May 2026
Squarepoint SWE interview, coding round focused on string processing. The problem looked straightforward but there were enough edge cases and design decisions to trip you up if you weren't careful about clarifying scope upfront.
  • Given a string, count word frequencies case-insensitively and return the top words by frequency in descending order, with ties broken alphabetically. The result is capped at 3 words total. How do you approach this, and what design tradeoffs do you consider?

“The part I nearly got wrong was the global cap.”

View Post

Squarepoint·Data Scientist·Technical Phone Screen

May 2026
Squarepoint Data Scientist interview with a coding round that leaned more algorithmic than I expected for the role. The stock prices problem came up in two parts and they wanted both solutions plus complexity analysis on the spot.
  • Given an array of daily stock prices, find the maximum profit from a single buy-sell transaction. You must buy before you sell and cannot short. Return 0 if no profit is possible.
  • Now extend it: you can make as many buy-sell transactions as you want, but you can only hold one share at a time. What is the maximum total profit, and what is the complexity of your solution?

“The single-transaction version I got pretty quickly.”

View Post

Squarepoint·Software Engineer·Technical Phone Screen

May 2026
Quant interview at Squarepoint with a probability question that looks straightforward but has a few ways to go about it. Short and focused.
  • You roll a fair 6-sided die three times. What is the probability that the three outcomes are strictly increasing?

“I started by counting total outcomes (6^3 = 216) then tried to count strictly increasing triples.”

View Post

Squarepoint·Software Engineer·Online Assessment (OA)

May 2026
Squarepoint OA for a software engineer role, two coding problems. Nothing too wild but the second one had some annoying edge cases I didn't fully think through until after I submitted.
  • You have an array representing inventory counts for n products. Selling one unit of product i earns revenue equal to its current stock level, then the stock drops by one. Given m total customers each buying exactly one unit, figure out which products to sell to which customers to maximize total revenue.
  • Given a string of text, count word frequencies where words are defined as maximal sequences of letters only (non-letter characters act as separators) and the comparison is case-insensitive. Return up to 3 distinct words sorted by descending frequency, with ties broken alphabetically.

“Greedy with a max-heap, pretty much.”

View Post

Squarepoint·Data Scientist·Technical Phone Screen

May 2026
Squarepoint Capital data scientist interview was pretty much a pure coding and algo session. Three problems back to back, two of them finance-flavored, one classic DP. Not a lot of small talk.
  • Implement a function that computes the maximum drawdown of a cumulative PnL series, returning the drawdown value as a negative number plus the start and end indices of the drawdown period. Analyze time and space complexity.
  • Given an array of daily stock prices, find the maximum profit from a single buy and sell transaction where the sell must happen after the buy. Return 0 if no profitable trade is possible. Your solution must run in O(n) time and O(1) space.
  • Given a list of coin denominations and a target amount, return the minimum number of coins needed to reach that amount using unlimited coins of each type, or -1 if it's impossible. Walk through a dynamic programming solution and its complexity.

“This was the one I was least prepared for going in.”

View Post