cswork / libraryOpen practice workspace

Interview guides · Invitation Homes

Invitation Homes Software Engineer Interview Guide

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

The 60-second brief

A Software Engineer at Invitation Homes plays a critical role in building and maintaining the technology platforms that power the nation's premier single-family home leasing company. With a portfolio of tens of thousands of homes, the business relies heavily on sophisticated digital solutions to manage the entire leasing lifecycle. As an engineer here, you will design, develop, and optimize applications that directly impact thousands of residents and field associates daily. The work spans a diverse range of internal and external products, including resident portals, property search engines, automated maintenance dispatch systems, and internal financial tools. The engineering team is tasked with solving complex logistics, scheduling, and data-synchronization challenges.

This guide is scoped to a Software Engineer candidate at Invitation Homes.

Focus areas

  • Object-Oriented Programming (OOP)
  • Algorithms & problem solving
  • JavaScript

The Invitation Homes interview process

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

Recruiter Phone Screen

Initial conversation focusing on professional background, salary expectations, and interest in the company.

What to demonstrate

  • Initial conversation focusing on professional background, salary expectations, and interest in the company
  • Depth in Object-Oriented Programming (OOP)

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 a lead engineer or Director of Engineering, this stage includes high-level technical discussions and a live coding exercise.

What to demonstrate

  • Conducted by a lead engineer or Director of Engineering, this stage includes high-level technical discussions and a live coding exercise
  • Depth in Object-Oriented Programming (OOP)

How to prepare

  • Answer aloud and timed: How does asynchronous execution work in JavaScript, and how do you handle error propagation in asynchronous workflows?
  • Answer aloud and timed: Describe the component lifecycle in React and how you manage state across a large-scale application.

Onsite/Virtual Loop

Comprehensive interviews with senior members and peers, diving into project experience, coding challenges, and collaboration skills.

What to demonstrate

  • Comprehensive interviews with senior members and peers, diving into project experience, coding challenges, and collaboration skills
  • Depth in Object-Oriented Programming (OOP)

How to prepare

  • Answer aloud and timed: What testing frameworks have you used, and what is your strategy for writing robust unit and integration tests?
  • Answer aloud and timed: Given an array of integers, find two numbers that add up to a specific target sum.

Where candidates lose points

Understand the Scale of Operations

Before your interview, familiarize yourself with how Invitation Homes operates. Think about the technological challenges of managing physical assets across different states, coordinating maintenance technicians, and handling high volumes of financial transactions.

Communicate Your Thought Process

During the live coding sessions, do not code in silence. Talk through your strategy, explain why you are choosing a specific data structure, and discuss any trade-offs you are making. If you get stuck, the interviewers are happy to guide you, but they can only do so if they know what you are thinking.

If you encounter a question or concept you do not know during the interview, be honest

Explain how you would go about researching the answer or finding a solution. The team highly values intellectual honesty and a willingness to learn over memorized answers.

Brush Up on OOP Fundamentals

Do not neglect core Object-Oriented Programming principles. Even if you primarily write functional code in your current role, be prepared to discuss classes, interfaces, inheritance, and encapsulation, as these are frequently evaluated during the technical conversations.

Questions & practice

Explain the core differences between relational databases like PostgreSQL and non-relational alternatives.

Medium · Full-Stack & Language Fundamentals

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?

What are the primary principles of Object-Oriented Programming (OOP), and how do you apply them in your daily

Medium · Full-Stack & Language Fundamentals

What are the primary principles of Object-Oriented Programming (OOP), and how do you apply them in your daily development?

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?

How does asynchronous execution work in JavaScript, and how do you handle error propagation in asynchronous wo

Medium · Full-Stack & Language Fundamentals

How does asynchronous execution work in JavaScript, and how do you handle error propagation in asynchronous workflows?

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?

Describe the component lifecycle in React and how you manage state across a large-scale application.

Medium · Full-Stack & Language Fundamentals

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?

Given an array of integers, find two numbers that add up to a specific target sum.

Medium · Coding & Algorithms

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?

Write a function to determine if a given string is a palindrome, ignoring casing and non-alphanumeric characte

Medium · Coding & Algorithms

Write a function to determine if a given string is a palindrome, ignoring casing and non-alphanumeric characters.

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?

How would you implement a function to merge two sorted linked lists into a single sorted list?

Medium · Coding & Algorithms

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?

Write an algorithm to find the first non-repeating character in a string and return its index.

Medium · Coding & Algorithms

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?

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?

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?

What testing frameworks have you used, and what is your strategy for writing robust unit and integration tests

Medium · Full-Stack & Language Fundamentals

What testing frameworks have you used, and what is your strategy for writing robust unit and integration tests?

Approach

  1. Say who the caller is and what they do when the call fails halfway.
  2. Define the identity of a request so a retry cannot double-apply it.
  3. Separate accepted, pending, failed and confirmed; they are different facts.
  4. Design the error taxonomy before the success shape; callers branch on it.

Follow-up

  • What happens if the caller retries after a timeout?
  • How does a client discover it is on an old version of this contract?

Give the resource write endpoints a failure taxonomy clients can act on

Easy · error taxonomy · status codes · retries

Two callers use POST and PATCH /v1/resources: a server-side SDK that retries automatically, and a browser app that shows the user a message. Today every failure is a 500 carrying prose. Define the error contract for a malformed body, a field that fails validation, an expired token, a token whose auth_version no longer matches, a resource_id owned by another tenant, a version mismatch on update, an idempotency key reused with a different body, an exceeded tenant quota, and a read replica that has not caught up. Deliverable: the envelope, the status per case, and what each caller does.

Approach

  1. Split the envelope by audience: a stable code enum for programs, a message documented as human-only and free to change wording, a request_id that joins to resource_revision.request_id and the trace, and a details array of field paths for validation failures. Publish the negative rules too - clients never branch on message, and an unrecognised code falls back to the status class.
  2. Assign status by who has to change something. 400 for bytes that do not parse, 422 for a body that parses and violates a rule, 401 for a token that no longer authenticates - expiry and an auth_version mismatch are the same instruction, re-authenticate - 403 for a scope the principal lacks, 404 rather than 403 for another tenant's resource_id because 403 confirms the id exists, 412 for a failed If-Match (409 if the version travels in the body instead), 422 for a key reused with a different fingerprint, 429 for quota.
  3. Derive retryability from whether the outcome is unknown, not from the status number. A timeout or a 5xx on a write is unknown - the transaction may have committed and the response lost - so the only safe retry is one carrying the same idempotency key. Every 4xx except 429 is deterministic, and retrying it only spends the caller's remaining deadline.
  4. Refuse to model replica lag as an error. Read-after-write is held by pinning the session to the primary for a short window, not by a 404 the SDK retries into a loop; if staleness must be visible, expose it as a watermark on a 200, because a failure code invites a retry that cannot fix it.

Follow-up

  • A customer reports two resources created from one click. Which of your status codes could have produced that, and what in the contract permitted the client's reading?
  • You need a tenth error code next quarter without a version bump. What must v1 already have said for that to be non-breaking?

Listing latency scales with page size, not with filters

Easy · n+1 · latency · query batching

The tenant listing endpoint reads resource filtered by tenant_id and status, ordered by updated_at DESC, and returns each row plus the owner's display name from app_user and the actor of that resource's latest resource_revision. p99 is 55 ms at 10 rows per page and 1.4 s at 200. Database telemetry shows 401 statements per request, each under 1 ms, and nothing in the slow-query log. Diagnose the cause and give the fix, stating the statement count per request and the p99 you expect afterwards.

Approach

  1. Read the counters before forming a theory. 401 statements for 200 rows is one driver query plus two per row, and sub-millisecond execution with an empty slow-query log rules out a bad plan. The time is round trips, which is why it is invisible in every per-query metric and scales with rows returned rather than with filter selectivity.
  2. Name the two per-row statements from their normalised text: a single-row app_user lookup by user_id, and a resource_revision lookup by resource_id ordered by version DESC LIMIT 1. Confirm by dropping those two response fields and watching the statement count fall to one. That locates the calls in the serialisation layer, not the repository.
  3. Check that the arithmetic accounts for the whole gap. Measure one round trip to the replica in isolation; 400 trips at roughly 3 ms of network plus 0.2 ms of execution is about 1.3 s on top of a 55 ms baseline, which matches. If the multiplication had fallen short, the N+1 would only be part of the story and you would keep looking.
  4. Batch both lookups. Collect owner_user_ids and resource_ids from the driver query, then issue WHERE tenant_id = $1 AND user_id = ANY($2) for the users, and PostgreSQL's SELECT DISTINCT ON (resource_id) ... WHERE resource_id = ANY($2) ORDER BY resource_id, version DESC for the latest revision, which the UNIQUE (resource_id, version) index serves directly. On an engine without DISTINCT ON, use a lateral join or a row_number window. Three statements per request at any page size.

Follow-up

  • The page size is capped at 200 today. What breaks first if it is raised to 2,000, and is it still this bug?
  • How do you stop the next N+1 from reaching production, given that no individual query is slow and the endpoint's tests pass?

Suggested practice checklist

Built from the rounds and topics Invitation Homes candidates report.

Day 1 — Map the Invitation Homes loop

  • Write out the reported sequence: Recruiter Phone Screen, Technical Screening, Onsite/Virtual Loop.
  • 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 Object-Oriented Programming (OOP)

  • Spend the session on Object-Oriented Programming (OOP), which Invitation Homes candidates report being tested on.
  • Write one worked example in Object-Oriented Programming (OOP) and time yourself on it.

Deliverable: One timed worked example in Object-Oriented Programming (OOP).

Day 3 — Work Algorithms & problem solving

  • Spend the session on Algorithms & problem solving, which Invitation Homes candidates report being tested on.
  • Write one worked example in Algorithms & problem solving and time yourself on it.

Deliverable: One timed worked example in Algorithms & problem solving.

Day 4 — Work JavaScript

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

Deliverable: One timed worked example in JavaScript.

Day 5 — Answer out loud: Full-Stack & Language Fundamentals

  • Answer aloud, timed: Explain the core differences between relational databases like PostgreSQL and non-relational alternatives.
  • Answer aloud, timed: What are the primary principles of Object-Oriented Programming (OOP), and how do you apply them in your daily development?

Deliverable: Spoken answers to 2 reported Full-Stack & Language Fundamentals question(s), under time.

Day 6 — Answer out loud: Coding & Algorithms

  • Answer aloud, timed: Given an array of integers, find two numbers that add up to a specific target sum.
  • Answer aloud, timed: Write a function to determine if a given string is a palindrome, ignoring casing and non-alphanumeric characters.

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

Day 7 — Answer out loud: Behavioral, Vision & Industry Alignment

  • Answer aloud, timed: What do you know about Invitation Homes and the single-family rental industry?
  • Answer aloud, timed: Describe a challenging technical problem you solved in a past project. How did you identify the issue, and what was your solution?

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

Behavioural preparation

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

What do you know about Invitation Homes and the single-family rental industry?

Medium · Behavioral, Vision & Industry 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 challenging technical problem you solved in a past project. How did you identify the issue, and wha

Medium · Behavioral, Vision & Industry Alignment

Describe a challenging technical problem you solved in a past project. How did you identify the issue, and what was your solution?

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 a situation where you disagree with a senior team member or stakeholder on a technical decis

Medium · Behavioral, Vision & Industry Alignment

How do you handle a situation where you disagree with a senior team member or stakeholder on a technical decision?

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 in the real estate technology space, and how do you see our platform evolving to bette

Medium · Behavioral, Vision & Industry Alignment

Why do you want to work in the real estate technology space, and how do you see our platform evolving to better serve residents?

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?