cswork / libraryOpen practice workspace

Interview guides · Compass

Compass Software Engineer Interview Guide

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

The 60-second brief

As a Software Engineer at Compass, you sit at the intersection of technology and real estate, building enterprise-grade platform tools that transform how real estate agents, buyers, and sellers navigate complex real estate transactions. Compass powers a modern real estate technology platform that handles massive datasets, real-time communication feeds, integrated financial and title services, and collaborative document workflows. In this role, your code directly influences high-stakes workflows where speed, data precision, and platform reliability are paramount. The engineering challenges at Compass span back-end system architecture, real-time data synchronization, dynamic listing search engines, and intuitive client-facing software.

This guide is scoped to a Software Engineer candidate at Compass.

Focus areas

  • Data Structures & Algorithms (DSA)
  • Debugging
  • System Design

The Compass interview process

Compass candidates report 7 rounds over 4-6 weeks. The stages below are what candidates describe, not a published process.

Recruiter Phone Screen

Discuss your technical background, career goals, and compensation expectations.

What to demonstrate

  • Discuss your technical background, career goals, and compensation expectations
  • Depth in Data Structures & Algorithms (DSA)

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 Screening

Conducted by an internal engineer or through a technical assessment focusing on algorithms and programming concepts.

What to demonstrate

  • Conducted by an internal engineer or through a technical assessment focusing on algorithms and programming concepts
  • Depth in Data Structures & Algorithms (DSA)

How to prepare

  • Answer aloud and timed: Given a dictionary and start/end words, find a single sequence path corresponding to the Word Ladder II problem.
  • Answer aloud and timed: Implement encode and decode functions for complex data structures, incorporating base conversion logic using modulus and division loops.

Virtual Onsite Loop

Consists of three to five one-hour sessions covering coding, debugging, system design, and behavioral evaluation.

What to demonstrate

  • Consists of three to five one-hour sessions covering coding, debugging, system design, and behavioral evaluation
  • Depth in Data Structures & Algorithms (DSA)

How to prepare

  • Answer aloud and timed: Solve array and interval management challenges, such as merging overlapping intervals and generating custom test cases for time slot collisions.
  • Answer aloud and timed: Design a secure document sharing system supporting granular access permissions for both public viewing and specific authenticated users.

Algorithm Coding

Focus on solving algorithm challenges during the virtual onsite loop.

What to demonstrate

  • Focus on solving algorithm challenges during the virtual onsite loop
  • Depth in Data Structures & Algorithms (DSA)

How to prepare

  • Answer aloud and timed: Design a scalable task allocation system featuring multi-user concurrency control and locking mechanisms.
  • Answer aloud and timed: Architect an e-commerce purchasing and transaction management pipeline capable of guaranteeing data consistency under high throughput.

Debugging Exercise

Engage in a practical debugging or pair-programming exercise.

What to demonstrate

  • Engage in a practical debugging or pair-programming exercise
  • Depth in Data Structures & Algorithms (DSA)

How to prepare

  • Answer aloud and timed: Design a real-time activity feed system that aggregates and presents actions from multiple internal and external data sources.
  • Answer aloud and timed: Debug a Python or Java script managing email distribution lists that fails when processing opt-out records stored in multidimensional arrays.

System Design Round

Evaluate your ability to design systems effectively.

What to demonstrate

  • Evaluate your ability to design systems effectively
  • Depth in Data Structures & Algorithms (DSA)

How to prepare

  • Answer aloud and timed: Refactor a legacy data parsing function to improve memory footprint and correctly maintain key-value dictionary structures.
  • Answer aloud and timed: Analyze a broken class structure and apply core object-oriented principles to ensure correct data encapsulation and inheritance.

Behavioral Evaluation

Conducted with an engineering manager to assess cultural fit and soft skills.

What to demonstrate

  • Conducted with an engineering manager to assess cultural fit and soft skills
  • Depth in Data Structures & Algorithms (DSA)

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 evaluation above and write down what you would ask to confirm before it.

Where candidates lose points

Practice live debugging without modern IDE aids

Get comfortable reviewing pre-existing code, adding print or logging statements, and identifying logic flaws without relying on automated breakpoints or line-by-line IDE debuggers.

Talk through your code continuously

Interviewers at Compass evaluate your thought process as much as your final solution. Verbally state your assumptions, outline brute-force ideas first, and explain performance trade-offs before writing code.

Construct custom test cases proactively

Do not rely solely on the interviewer to give you test inputs. Formulate your own edge cases—such as empty arrays, out-of-order records, or boundary inputs—and trace your solution against them.

Always clarify problem requirements before coding

In system design and algorithmic rounds alike, explicitly state assumptions about data scale, concurrency, and input bounds.

Questions & practice

Given a graph of course dependencies, calculate the minimum number of time intervals required to complete all

Medium · Data Structures & Algorithmic Problem So

Given a graph of course dependencies, calculate the minimum number of time intervals required to complete all courses.

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?

Implement an efficient algorithm to merge k sorted linked lists into a single sorted list.

Medium · Data Structures & Algorithmic Problem So

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?

Given a dictionary and start/end words, find a single sequence path corresponding to the Word Ladder II proble

Medium · Data Structures & Algorithmic Problem So

Given a dictionary and start/end words, find a single sequence path corresponding to the Word Ladder II problem.

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?

Implement encode and decode functions for complex data structures, incorporating base conversion logic using m

Medium · Data Structures & Algorithmic Problem So

Implement encode and decode functions for complex data structures, incorporating base conversion logic using modulus and division loops.

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?

Solve array and interval management challenges, such as merging overlapping intervals and generating custom te

Medium · Data Structures & Algorithmic Problem So

Solve array and interval management challenges, such as merging overlapping intervals and generating custom test cases for time slot collisions.

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?

Refactor a legacy data parsing function to improve memory footprint and correctly maintain key-value dictionar

Medium · Code Debugging & Refactoring

Refactor a legacy data parsing function to improve memory footprint and correctly maintain key-value dictionary structures.

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?

Why do you want to join Compass, and how do your technical background and values align with our engineering cu

Medium · Behavioral & Value Alignment

Why do you want to join Compass, and how do your technical background and values align with our engineering culture?

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?

Hold a per-tenant active cap against concurrent creates

Hard · write skew · isolation levels · constraints

A tenant on the standard plan may hold at most 50 resources with status='active'. The create handler runs SELECT count(*) FROM resource WHERE tenant_id = $1 AND status = 'active', compares to 50, then inserts. Two creates arrive 3 ms apart on different instances and the tenant lands at 51. Name the anomaly, say whether PostgreSQL 16 READ COMMITTED or REPEATABLE READ prevents it and why, then give an implementation that holds the cap at READ COMMITTED with the exact statements. Finally, say what changes when the cap is 'at most one running export per tenant' on job_run.

Approach

  1. Name it: write skew. The two transactions read an overlapping set and write disjoint rows, so there is no row-level conflict for the engine to detect and each commit is individually legal.
  2. Rule out the levels precisely. READ COMMITTED takes a fresh snapshot per statement and takes no lock on the counted rows, so both see 49. PostgreSQL's REPEATABLE READ is snapshot isolation: it removes non-repeatable reads and phantoms within the snapshot but still admits write skew, because the anomaly is not a re-read of a changed row, it is a read of a set that a concurrent transaction invalidates. Only SERIALIZABLE closes it, by tracking the read dependency and aborting one transaction with SQLSTATE 40001 — a guarantee that exists only if the application re-runs the whole transaction from the read.
  3. Convert the set predicate into a single-row conflict: keep tenant.active_resource_count and run UPDATE tenant SET active_resource_count = active_resource_count + 1 WHERE tenant_id = $1 AND active_resource_count < 50 in the same transaction as the INSERT. Zero affected rows is the cap, returned as 409. The row lock serialises the decision at any isolation level, and contention is bounded to one tenant's row — which is also the fair-scheduling unit, unlike a global counter that would convoy every tenant behind one row.
  4. State the cost you just took on: a counter is a second source of truth that can drift, so every path that changes status must adjust it inside the same transaction, and a periodic reconciliation has to exist, with resource_revision as the authority for what the count should have been.

Follow-up

  • A resource moves from archived back to active. Which statements change, and what breaks if the counter update and the status change land in different transactions?
  • The cap becomes plan-dependent and a plan can change mid-month. Where does the number 50 live, and who reads it?

Design a secure document sharing system supporting granular access permissions for both public viewing and spe

Medium · System Design & Platform Architecture

Design a secure document sharing system supporting granular access permissions for both public viewing and specific authenticated users.

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?

Design a scalable task allocation system featuring multi-user concurrency control and locking mechanisms.

Medium · System Design & Platform Architecture

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?

Architect an e-commerce purchasing and transaction management pipeline capable of guaranteeing data consistenc

Medium · System Design & Platform Architecture

Architect an e-commerce purchasing and transaction management pipeline capable of guaranteeing data consistency under high throughput.

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?

Design a real-time activity feed system that aggregates and presents actions from multiple internal and extern

Medium · System Design & Platform Architecture

Design a real-time activity feed system that aggregates and presents actions from multiple internal and external data sources.

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?

Debug a Python or Java script managing email distribution lists that fails when processing opt-out records sto

Medium · Code Debugging & Refactoring

Debug a Python or Java script managing email distribution lists that fails when processing opt-out records stored in multidimensional arrays.

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?

Analyze a broken class structure and apply core object-oriented principles to ensure correct data encapsulatio

Medium · Code Debugging & Refactoring

Analyze a broken class structure and apply core object-oriented principles to ensure correct data encapsulation and inheritance.

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 Compass candidates report.

Day 1 — Map the Compass loop

  • Write out the reported sequence: Recruiter Phone Screen, Technical Screening, Virtual Onsite Loop, Algorithm Coding, Debugging Exercise, System Design Round.
  • 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 7 reported rounds, with the weakest marked.

Day 2 — Work Data Structures & Algorithms (DSA)

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

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

Day 3 — Work Debugging

  • Spend the session on Debugging, which Compass candidates report being tested on.
  • Write one worked example in Debugging and time yourself on it.

Deliverable: One timed worked example in Debugging.

Day 4 — Work System Design

  • Spend the session on System Design, which Compass candidates report being tested on.
  • Write one worked example in System Design and time yourself on it.

Deliverable: One timed worked example in System Design.

Day 5 — Answer out loud: Data Structures & Algorithmic Problem Solving

  • Answer aloud, timed: Given a graph of course dependencies, calculate the minimum number of time intervals required to complete all courses.
  • Answer aloud, timed: Implement an efficient algorithm to merge k sorted linked lists into a single sorted list.

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

Day 6 — Answer out loud: System Design & Platform Architecture

  • Answer aloud, timed: Design a secure document sharing system supporting granular access permissions for both public viewing and specific authenticated users.
  • Answer aloud, timed: Design a scalable task allocation system featuring multi-user concurrency control and locking mechanisms.

Deliverable: Spoken answers to 2 reported System Design & Platform Architecture question(s), under time.

Day 7 — Answer out loud: Code Debugging & Refactoring

  • Answer aloud, timed: Debug a Python or Java script managing email distribution lists that fails when processing opt-out records stored in multidimensional arrays.
  • Answer aloud, timed: Refactor a legacy data parsing function to improve memory footprint and correctly maintain key-value dictionary structures.

Deliverable: Spoken answers to 2 reported Code Debugging & Refactoring question(s), under time.

Behavioural preparation

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

Tell me about a time when you experienced a technical disagreement with your manager and how you resolved it.

Medium · Behavioral & Value Alignment

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 make a controversial engineering decision under strict deadline pressure

Medium · Behavioral & Value Alignment

Describe a situation where you had to make a controversial engineering decision under strict deadline pressure.

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 prioritize non-functional engineering requirements like test coverage or refactoring when product f

Medium · Behavioral & Value Alignment

How do you prioritize non-functional engineering requirements like test coverage or refactoring when product features are urgently requested?

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?