cswork / libraryOpen practice workspace

Interview guides · Robert Slack

Robert Slack Software Engineer Interview Guide

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

The 60-second brief

A Software Engineer at Robert Slack plays a critical role in designing, building, and maintaining the core technology platforms that power one of the fastest-growing real estate brokerages in the industry. The engineering team is responsible for developing high-scale lead generation systems, advanced customer relationship management (CRM) tools, and seamless transaction management portals. These proprietary systems enable real estate agents to connect with clients efficiently, process transactional data securely, and drive business growth at scale. In this role, your work directly impacts daily operations, agent productivity, and the overall customer experience. You will collaborate closely with product managers, data analysts, and operational teams to solve complex problems ranging from real-time data synchronization to high-throughput API integrations.

This guide is scoped to a Software Engineer candidate at Robert Slack.

Focus areas

  • Behavioral Interviewing (STAR method)
  • Virtual/Asynchronous Video Interviewing
  • Spring Boot

The Robert Slack interview process

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

Online Application

Submit your application for the Software Engineer position.

What to demonstrate

  • Submit your application for the Software Engineer position
  • Depth in Behavioral Interviewing (STAR method)

How to prepare

  • Answer aloud and timed: Tell me about a time when you had to balance multiple important priorities under a tight deadline.
  • Answer aloud and timed: Describe a situation where something went wrong on a project and explain how you dealt with it.

Asynchronous Virtual Assessment

Complete a virtual assessment to evaluate foundational coding skills and behavioral alignment.

What to demonstrate

  • Complete a virtual assessment to evaluate foundational coding skills and behavioral alignment
  • Depth in Behavioral Interviewing (STAR method)

How to prepare

  • Answer aloud and timed: Why do you want to work at Robert Slack, and how do you see yourself contributing to our mission?
  • Answer aloud and timed: Tell me about a time you had to work closely with others to solve a difficult problem.

Live Technical Interviews

Engage in live interviews with the engineering team and hiring managers focusing on technical discussions and system architecture.

What to demonstrate

  • Engage in live interviews with the engineering team and hiring managers focusing on technical discussions and system architecture
  • Depth in Behavioral Interviewing (STAR method)

How to prepare

  • Answer aloud and timed: How do you manage your workload when you are assigned more tasks than you can realistically complete in a day?
  • Answer aloud and timed: Given an input string, write a function to perform string manipulation or compression efficiently.

Where candidates lose points

Master the STAR Method

Since behavioral questions are a significant component of both the HireVue and live rounds, ensure your stories are structured clearly, focusing heavily on the actions you took and the measurable results you achieved.

Practice Live Code Explanation

During the panel interviews, you will be asked to explain your coding choices and thought processes. Practice talking out loud while coding to demonstrate your communication and problem-solving skills.

Understand the Business Context

Show that you understand Robert Slack's position in the real estate market. Align your answers to show how your technical solutions can drive business value, agent efficiency, and client satisfaction.

Questions & practice

Given an input string, write a function to perform string manipulation or compression efficiently.

Medium · Core Coding & Algorithmic Problem-Solvin

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 a basic terminal-based version of a classic board game, such as Connect 4.

Medium · Core Coding & Algorithmic Problem-Solvin

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?

Parse and manipulate a complex array structure to extract specific data points.

Medium · Core Coding & Algorithmic Problem-Solvin

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 a classic graph traversal problem, such as finding the shortest path or detecting cycles.

Medium · Core Coding & Algorithmic Problem-Solvin

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?

Recreate the game mechanics of a grid-based puzzle game like 2048.

Medium · Core Coding & Algorithmic Problem-Solvin

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?

Walk through a sample block of Java code and explain its output, identifying any potential bugs or performance

Medium · Object-Oriented Programming (OOP) & Syst

Walk through a sample block of Java code and explain its output, identifying any potential bugs or performance bottlenecks.

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?

Keep soft-deleted accounts from blocking re-registration

Easy · soft delete · unique constraints · engine differences

app_user holds user_id, tenant_id, email CITEXT, password_hash (NULL for SSO principals), email_verified_at, auth_version, status ('invited','active','suspended','deactivated'), created_at, updated_at, deleted_at. Two live accounts for one address inside a tenant must be impossible, but an address freed by a soft delete must be reusable, and the same tenant may delete and re-register it repeatedly. Write the uniqueness DDL for PostgreSQL 16, then the equivalent for MySQL 8 where partial indexes do not exist, and say what each permits once three deleted rows already hold that address.

Approach

  1. Start from what is actually unique: not (tenant_id, email), but (tenant_id, email) among live rows. PostgreSQL says that directly — CREATE UNIQUE INDEX app_user_live_email ON app_user (tenant_id, email) WHERE deleted_at IS NULL. A full constraint over the same two columns burns the address permanently the first time someone deletes an account.
  2. Keep case-insensitivity in the type or the index, never in the application: CITEXT as given, or UNIQUE (tenant_id, lower(email)) as an expression index where the extension is unavailable. A case-sensitive unique column is exactly how two accounts for one human appear.
  3. For MySQL 8 the predicate has to move inside the key: add a discriminator column that is a constant 0 while the row is live and is set to user_id on delete, with UNIQUE (tenant_id, email, deleted_marker). Live rows share the constant and still collide; deleted rows differ from each other and stop colliding.
  4. State the NULL variant and its dependency: leaving the marker NULL for deleted rows also works, because a unique index treats NULLs as distinct — true in MySQL, and true in PostgreSQL only under the default NULLS DISTINCT, which PostgreSQL 15 lets you reverse. Check the polarity against the three existing deleted rows: constant-on-live is what preserves the collision you want, and reversing it silently admits duplicate live accounts.

Follow-up

  • A deleted account re-registers with the same address the next day. Do the old resource rows follow the new user_id, and how does the API keep the two principals apart?
  • How do you honour an erasure request while resource_revision.actor_user_id still references this table?

Explain why the owner filter ignores the listing index

Medium · composite index · query plans · sort elimination

The only index on resource is (tenant_id, status, updated_at DESC, resource_id DESC). A new endpoint returns one user's resources across all statuses, newest created first: WHERE tenant_id = $1 AND owner_user_id = $2 ORDER BY created_at DESC LIMIT 20. On a tenant with 2M rows it takes 900 ms and EXPLAIN shows a sort above a large scan. Explain precisely why the existing index cannot serve it, give the index that can, and state which of these the new index still will not help: owner_user_id alone across tenants; the same query ordered by updated_at. PostgreSQL 16.

Approach

  1. Separate the two jobs an index does. For filtering, a composite btree is seekable only on a left prefix, so with no predicate on status the scan can at best range over tenant_id and test owner_user_id per row; PostgreSQL 16 has no btree skip scan to jump the unconstrained column.
  2. For ordering, the index is sorted by (status, updated_at) within a tenant and not by created_at, so the LIMIT cannot stop early: every matching row is read and then sorted. That is the 'Sort Method: top-N heapsort' line, and it is why the plan reads 2M rows to answer with 20.
  3. Derive the replacement from the access path — equality, equality, then the ordering column: CREATE INDEX CONCURRENTLY ON resource (tenant_id, owner_user_id, created_at DESC). The scan seeks to the (tenant, owner) range and walks 20 entries in order, so the Sort node disappears along with the row-read.
  4. Treat INCLUDE (title, status) as conditional, not free. An index-only scan still visits the heap for any row whose page is not marked all-visible, so on a table taking 1.2k writes/second the win depends on autovacuum keeping the visibility map current, and the wider index costs more on every insert.

Follow-up

  • 90% of rows are status='active'. Would a partial index WHERE status = 'active' change your answer, and for which of the three queries?
  • A dashboard runs this for 40 owners in one page load. What changes about the design?

Explain the four pillars of Object-Oriented Programming (OOP) and provide a practical example of how you have

Medium · Object-Oriented Programming (OOP) & Syst

Explain the four pillars of Object-Oriented Programming (OOP) and provide a practical example of how you have used them in a past project.

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 design a scalable microservices architecture using Spring Boot?

Medium · Object-Oriented Programming (OOP) & Syst

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?

Explain how you would design an API to handle high-volume real estate lead routing.

Medium · Object-Oriented Programming (OOP) & Syst

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?

Every query on one table stalls for forty seconds mid-deploy

Medium · lock contention · ddl · migrations

During a release on PostgreSQL, every query touching resource times out for about 40 seconds and then recovers with no intervention. The release ran one migration, ALTER TABLE resource ADD COLUMN archived_reason TEXT, and the migration log shows it completing in 6 ms. Unrelated tables showed no change in error rate. Explain how a 6 ms statement caused a 40-second stall, give the ordered checks you would run on a live system to confirm it, and give the migration procedure that prevents a repeat.

Approach

  1. Separate the statement's duration from the lock's duration. ADD COLUMN with no default is a catalogue-only change and genuinely runs in milliseconds, but it requires ACCESS EXCLUSIVE, and it cannot acquire that until every transaction already touching the table has finished.
  2. Account for the queueing, which is the part that surprises people. A lock request that is waiting blocks later requests for conflicting modes behind it rather than letting them overtake, so one long-open transaction holds the DDL and the DDL holds all the traffic. The stall length is set by the longest open transaction, not by the size of the change.
  3. Confirm on a live system in this order: pg_stat_activity for that table ordered by xact_start, looking for the oldest transaction and specifically for state = idle in transaction; then pg_locks where granted = false to find the waiter; then join them on pid to name blocker and blocked. pg_blocking_pids() does that join for you and is the fastest single call.
  4. Prevent rather than merely time it better. Set lock_timeout to a second or two on the migration session so the DDL abandons the queue after a bounded wait and is retried, instead of holding it for as long as the oldest transaction lives. Be exact about what that buys: queries arriving during the wait still queue behind the pending ACCESS EXCLUSIVE request, so each attempt costs them up to one lock_timeout of added latency. The outage goes from 40 seconds to about one second per attempt, not to zero. Also run migrations away from deploy-time peaks, and put a statement timeout and an idle-in-transaction timeout on the analytics role that opens the long transactions.

Follow-up

  • The same release also wants NOT NULL on that column. What is the sequence that gets there without a long lock?
  • Your lock_timeout retry fails ten times in a row because the analytics transaction is always open. What do you change?

Suggested practice checklist

Built from the rounds and topics Robert Slack candidates report.

Day 1 — Map the Robert Slack loop

  • Write out the reported sequence: Online Application, Asynchronous Virtual Assessment, Live Technical Interviews.
  • 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 Behavioral Interviewing (STAR method)

  • Spend the session on Behavioral Interviewing (STAR method), which Robert Slack candidates report being tested on.
  • Write one worked example in Behavioral Interviewing (STAR method) and time yourself on it.

Deliverable: One timed worked example in Behavioral Interviewing (STAR method).

Day 3 — Work Virtual/Asynchronous Video Interviewing

  • Spend the session on Virtual/Asynchronous Video Interviewing, which Robert Slack candidates report being tested on.
  • Write one worked example in Virtual/Asynchronous Video Interviewing and time yourself on it.

Deliverable: One timed worked example in Virtual/Asynchronous Video Interviewing.

Day 4 — Work Spring Boot

  • Spend the session on Spring Boot, which Robert Slack candidates report being tested on.
  • Write one worked example in Spring Boot and time yourself on it.

Deliverable: One timed worked example in Spring Boot.

Day 5 — Answer out loud: Behavioral & Situational (STAR Format)

  • Answer aloud, timed: Tell me about a time when you had to balance multiple important priorities under a tight deadline.
  • Answer aloud, timed: Describe a situation where something went wrong on a project and explain how you dealt with it.

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

Day 6 — Answer out loud: Core Coding & Algorithmic Problem-Solving

  • Answer aloud, timed: Given an input string, write a function to perform string manipulation or compression efficiently.
  • Answer aloud, timed: Implement a basic terminal-based version of a classic board game, such as Connect 4.

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

Day 7 — Answer out loud: Object-Oriented Programming (OOP) & System Design

  • Answer aloud, timed: Explain the four pillars of Object-Oriented Programming (OOP) and provide a practical example of how you have used them in a past project.
  • Answer aloud, timed: How would you design a scalable microservices architecture using Spring Boot?

Deliverable: Spoken answers to 2 reported Object-Oriented Programming (OOP) & System Design question(s), under time.

Behavioural preparation

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

Tell me about a time when you had to balance multiple important priorities under a tight deadline.

Medium · Behavioral & Situational (STAR Format)

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 something went wrong on a project and explain how you dealt with it.

Medium · Behavioral & Situational (STAR Format)

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?

Why do you want to work at Robert Slack, and how do you see yourself contributing to our mission?

Medium · Behavioral & Situational (STAR Format)

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 work closely with others to solve a difficult problem.

Medium · Behavioral & Situational (STAR Format)

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 manage your workload when you are assigned more tasks than you can realistically complete in a day?

Medium · Behavioral & Situational (STAR Format)

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?

What is an out-of-sequence transaction, and how do you handle concurrency issues in a transactional database?

Medium · Object-Oriented Programming (OOP) & Syst

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?