cswork / libraryOpen practice workspace

Interview guides · Arrowstreet Capital

Arrowstreet Capital Software Engineer Interview Guide

Arrowstreet Capital Software Engineer interview guide: reported rounds, questions and how candidates describe the process.

The 60-second brief

As a Software Engineer at Arrowstreet Capital, you occupy a critical position at the intersection of high-frequency data, complex financial modeling, and robust platform infrastructure. You are not merely writing code; you are building the technological backbone that enables a sophisticated investment firm to operate at scale. Your work directly influences how investment data is processed, how quantitative strategies are deployed, and how the firm maintains its competitive edge in global markets. This role demands a unique blend of technical rigor and business acumen. You will likely find yourself working on everything from low-level systems and cloud infrastructure to performance-critical applications that support investment decision-making.

This guide is scoped to a Software Engineer candidate at Arrowstreet Capital.

Focus areas

  • Problem Solving (General)
  • Data Structures & Algorithms
  • System Fundamentals (TCP/UDP)

The Arrowstreet Capital interview process

Arrowstreet Capital candidates report 3 rounds over 3-5 weeks. The stages below are what candidates describe, not a published process.

Initial Screens

Initial screenings conducted by the recruiter and hiring manager to assess candidate fit.

What to demonstrate

  • Initial screenings conducted by the recruiter and hiring manager to assess candidate fit
  • Depth in Problem Solving (General)

How to prepare

  • Be able to walk your CV end to end in two minutes, and say why this company specifically.
  • Have your salary expectations, notice period and location constraints ready, and ask for the rest of the loop in writing.

Technical Assessments

Deep-dive technical assessments involving multiple team members to evaluate technical skills.

What to demonstrate

  • Deep-dive technical assessments involving multiple team members to evaluate technical skills
  • Depth in Problem Solving (General)

How to prepare

  • Answer aloud and timed: How do you approach memory management in C++? (e.g., templates, smart pointers, RAII).
  • Answer aloud and timed: What are the key differences between various cloud deployment models and on-premise data centers?

Behavioral Rounds

Behavioral interviews to assess cultural fit and alignment with team values.

What to demonstrate

  • Behavioral interviews to assess cultural fit and alignment with team values
  • Depth in Problem Solving (General)

How to prepare

  • Prepare three examples from your own work, each with a decision you made and an outcome you can quantify.
  • Re-read the description of the behavioral rounds above and write down what you would ask to confirm before it.

Where candidates lose points

Prepare for the "Why

Don't just provide an answer to a coding problem; explain the trade-offs of your solution, including time and space complexity.

Be ready for deep-dives

If you list a technology on your resume, expect to be asked about its internal workings, not just how to use it.

Show passion for the domain

While you don't need to be a finance expert, showing interest in how your software impacts investment outcomes is a significant advantage.

Prepare for multiple interviewers

You will often speak with a range of team leads; tailor your communication style to be technical with engineers and strategic with partners.

Questions & practice

How do you approach memory management in C++? (e.g., templates, smart pointers, RAII).

Medium · Technical & Domain Knowledge

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

Solve this algorithmic problem (LeetCode Medium to Hard level).

Medium · Coding & Problem Solving

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Identify the heaviest tenants in a five-minute window under memory pressure

Medium · top-k · heavy hitters · streaming

The edge service handles about 3,000 requests per second across roughly 50,000 tenants, peaking near 9,000. Expose the 50 heaviest tenants by request count over the trailing five minutes so limits can be tightened before one tenant's backfill starves the fleet. You may not retain five minutes of raw records. Give the exact solution and its memory, then the bounded-memory approximation with its error stated as a formula, and say which you would ship and at what tenant cardinality that choice changes.

Approach

  1. Do the exact version first, because it is affordable at this cardinality: a ring of 300 one-second counters per tenant, advanced lazily, is 1,200 bytes of counters per tenant and roughly 60 to 90 MB for 50,000 tenants with overhead. Carry a running total and subtract the bucket you overwrite so a window read is O(1) rather than 300 adds.
  2. Extract the top 50 with a size-k min-heap over the tenant sums: O(d log k) for d tenants, against O(d log d) to sort them all. Maintaining the heap continuously instead of on query requires a tenant-to-heap-index map, because incrementing a count already inside the heap means sifting from a known position, and without that map you rebuild the heap on every request.
  3. State the approximation precisely rather than gesturing at sketches. Misra-Gries with m counters retains every item whose true count exceeds N/(m+1), and each retained count underestimates the truth by at most N/(m+1). With m = 1,000 and N = 900,000 requests in the window the error is roughly 900 requests, which is fine for spotting a tenant sending 50,000 and useless for ranking two tenants 200 apart.
  4. Say what breaks when the window slides: Misra-Gries and Space-Saving are insert-only and cannot be decremented as records age out. The workable construction is one summary per sub-window, say ten seconds, with 30 summaries merged at query time, and the merged error is the sum of the per-summary errors, so the bound degrades linearly in the number of sub-windows.

Follow-up

  • The heaviest tenant is heavy because of one export job rather than user traffic. Should the limiter treat those as the same tenant?
  • Two tenants sit tied at the boundary of the top 50. Does your answer flap, and does the flapping matter?

Write a function to optimize data retrieval from a large SQL database.

Medium · Coding & Problem Solving

Approach

  1. Name the grain you start from and join outward from it.
  2. Check whether any join is one-to-many before aggregating, or the sums inflate.
  3. Say which index the query would use, and what makes it unusable.
  4. Handle the rows that do not match: that is usually the actual question.

Follow-up

  • How does the query change if that join becomes one-to-many?
  • What happens to this when the table is ten times larger?

Replace offset paging on the resource feed with keyset

Easy · keyset pagination · composite index · sort order

resource holds resource_id, tenant_id, owner_user_id, title, body_ref, version, status ('draft','active','archived','deleted'), created_at, updated_at, deleted_at, with an index on (tenant_id, status, updated_at DESC, resource_id DESC). The listing endpoint returns active resources for one tenant, newest update first, 50 per page, today with LIMIT 50 OFFSET n. Tenants reach page 400 and rows are created while they read. Write the keyset query, define what the cursor carries and how it is encoded, and say which part of the index each predicate uses. Assume PostgreSQL 16.

Approach

  1. Name the two failures separately. OFFSET 20000 makes the server produce and discard 20,000 rows, so page cost grows with depth rather than with page size. Independently, any write that changes how many rows sort above the offset moves the window between two fetches, and the direction decides which anomaly you get: an insert lands at the head of updated_at DESC and pushes already-returned rows down past the boundary, so they are returned a second time; a delete above the offset, or a row whose updated_at is bumped above the cursor, pulls rows up and one is never returned at all. Nothing in the response reveals either.
  2. Write the seek: WHERE tenant_id = $1 AND status = 'active' AND (updated_at, resource_id) < ($2, $3) ORDER BY updated_at DESC, resource_id DESC LIMIT 50. The row-value comparison is one index range rather than a disjunction, and both columns are NOT NULL, which is what makes that comparison well defined.
  3. Map each predicate onto the index: tenant_id and status are equality on the leading columns, (updated_at, resource_id) is the range, and the ORDER BY matches the index order so no Sort node appears and the scan stops after 50 rows. The DESC in the definition only matters for mixed directions — a plain ascending btree on the same columns is read backwards for this query.
  4. Put both sort columns in the cursor and nothing the client can tamper with into another tenant: base64 of (updated_at, resource_id), validated server-side, with tenant_id taken from the principal.

Follow-up

  • The client asks for 'jump to page 400'. What do you offer instead, and what does the honest version cost?
  • Sort order becomes user-selectable across four columns. How many indexes is that, and which would you refuse to add?

Can you explain the difference between TCP and UDP, and when you would prioritize one over the other?

Medium · Technical & Domain Knowledge

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

What are the key differences between various cloud deployment models and on-premise data centers?

Medium · Technical & Domain Knowledge

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

Given a specific system constraint, how would you design a scalable component to handle throughput?

Medium · Coding & Problem Solving

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

How would you debug a production issue where a service is experiencing latency spikes?

Medium · Coding & Problem Solving

Approach

  1. Establish what changed and when, before forming any theory.
  2. Pick a bisection that eliminates candidates whichever way it turns out.
  3. Check the instrumentation before believing the symptom.
  4. Separate the trigger from the cause; the deploy is rarely the bug.

Follow-up

  • What would you look at first, and what would it rule out?
  • How would you tell a cause from a coincidence here?

Suggested practice checklist

Built from the rounds and topics Arrowstreet Capital candidates report.

Day 1 — Map the Arrowstreet Capital loop

  • Write out the reported sequence: Initial Screens, Technical Assessments, Behavioral Rounds.
  • For each round, write one sentence on what it is judging, from the description above, and mark the one you are least ready for.

Deliverable: A one-page map of the 3 reported rounds, with the weakest marked.

Day 2 — Work Problem Solving (General)

  • Spend the session on Problem Solving (General), which Arrowstreet Capital candidates report being tested on.
  • Write one worked example in Problem Solving (General) and time yourself on it.

Deliverable: One timed worked example in Problem Solving (General).

Day 3 — Work Data Structures & Algorithms

  • Spend the session on Data Structures & Algorithms, which Arrowstreet Capital candidates report being tested on.
  • Write one worked example in Data Structures & Algorithms and time yourself on it.

Deliverable: One timed worked example in Data Structures & Algorithms.

Day 4 — Work System Fundamentals (TCP/UDP)

  • Spend the session on System Fundamentals (TCP/UDP), which Arrowstreet Capital candidates report being tested on.
  • Write one worked example in System Fundamentals (TCP/UDP) and time yourself on it.

Deliverable: One timed worked example in System Fundamentals (TCP/UDP).

Day 5 — Answer out loud: Technical & Domain Knowledge

  • Answer aloud, timed: Can you explain the difference between TCP and UDP, and when you would prioritize one over the other?
  • Answer aloud, timed: Walk me through your experience with PowerShell scripting and automating infrastructure tasks.

Deliverable: Spoken answers to 2 reported Technical & Domain Knowledge question(s), under time.

Day 6 — Answer out loud: Coding & Problem Solving

  • Answer aloud, timed: Solve this algorithmic problem (LeetCode Medium to Hard level).
  • Answer aloud, timed: Write a function to optimize data retrieval from a large SQL database.

Deliverable: Spoken answers to 2 reported Coding & Problem Solving question(s), under time.

Day 7 — Answer out loud: Behavioral & Leadership

  • Answer aloud, timed: Tell me about a time you had to reconcile conflicting technical requirements from different stakeholders.
  • Answer aloud, timed: How do you handle ambiguity when a project’s scope changes mid-stream?

Deliverable: Spoken answers to 2 reported Behavioral & Leadership question(s), under time.

Behavioural preparation

Behavioural rounds judge the decision you made and what it cost.

Walk me through your experience with PowerShell scripting and automating infrastructure tasks.

Medium · Technical & Domain Knowledge

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

Tell me about a time you had to reconcile conflicting technical requirements from different stakeholders.

Medium · Behavioral & Leadership

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

How do you handle ambiguity when a project’s scope changes mid-stream?

Medium · Behavioral & Leadership

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

Describe a situation where you had to influence a team member or stakeholder to adopt a different technical ap

Medium · Behavioral & Leadership

Describe a situation where you had to influence a team member or stakeholder to adopt a different technical approach.

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?