cswork / libraryOpen practice workspace

Interview guides · Eight Sleep

Eight Sleep Software Engineer Interview Guide

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

The 60-second brief

As a Software Engineer at Eight Sleep, you sit at the intersection of cutting-edge hardware, IoT connectivity, and health-tech innovation. This role is vital to building and scaling the digital ecosystem that powers smart sleep products, mobile applications, and backend cloud infrastructure. Your code directly impacts how users interact with biometric tracking, temperature regulation, and personalized sleep fitness data. The work spans multiple technical domains, ranging from mobile client development using React Native to robust backend services and sensor data processing. You will tackle complex problems involving real-time data sync, embedded systems communication, and seamless customer experiences. Because Eight Sleep operates in a fast-paced hardware-software integrated environment, your contributions must be both reliable and highly performant under real-world conditions.

This guide is scoped to a Software Engineer candidate at Eight Sleep.

Focus areas

  • React Native
  • Mobile App Development
  • Troubleshooting & Debugging

The Eight Sleep interview process

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

Recruiter Call

Initial screening call to discuss your background and alignment with the company's mission.

What to demonstrate

  • Initial screening call to discuss your background and alignment with the company's mission
  • Depth in React Native

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.

Engineering Leadership Conversation

Conversations with engineering leadership to evaluate high-level experience and communication skills.

What to demonstrate

  • Conversations with engineering leadership to evaluate high-level experience and communication skills
  • Depth in React Native

How to prepare

  • Answer aloud and timed: 1–2 sentences introducing the category and what it tests. These questions assess your ability to design scalable systems, handle high-throughput IoT data streams, and write maintainable server-side code.
  • Answer aloud and timed: Bullet list of realistic example questions (drawn from the provided interview data): How would you design a system to ingest and process real-time telemetry data from thousands of connected devices? Read this backend code snippet, identify the source of the performance bottleneck, and propose a fix. How do you ensure data consistency across distributed microservices? What caching strategies would you implement for a high-traffic consumer product backend?

Technical Evaluation

Take-home coding assignment focused on mobile or backend engineering, designed to be challenging.

What to demonstrate

  • Take-home coding assignment focused on mobile or backend engineering, designed to be challenging
  • Depth in React Native

How to prepare

  • Answer aloud and timed: 1–2 sentences introducing the category and what it tests. Interviewers use these scenarios to observe your diagnostic process, code reading ability, and structured problem-solving under constraints.
  • Answer aloud and timed: Bullet list of realistic example questions (drawn from the provided interview data): Troubleshoot a simulated failure in our product backend and explain your step-by-step debugging approach. How would you build a feature from scratch that aggregates physiological sensing data into daily user insights? Walk me through how you isolate memory leaks in a production service.

Live Technical Troubleshooting

Live sessions involving troubleshooting, code reviews, and behavioral or situational problem-solving.

What to demonstrate

  • Live sessions involving troubleshooting, code reviews, and behavioral or situational problem-solving
  • Depth in React Native

How to prepare

  • Answer aloud and timed: 1–2 sentences introducing the category and what it tests. This area explores your past projects, collaboration style, and how you handle ambiguity and cross-functional friction.
  • Answer aloud and timed: Bullet list of realistic example questions (drawn from the provided interview data): Tell me about a past project where you had to balance rapid delivery with long-term code quality. How do you provide granular technical details when discussing your past work with non-technical stakeholders? Describe a situation where you disagreed with a product or architectural decision and how you resolved it.

Where candidates lose points

Prioritize code perfection and design

When completing take-home assignments, balance clean visual implementation with immaculate code structure, testing, and error handling to meet internal evaluation bars.

Communicate your granular details

During behavioral and experience screens, avoid staying exclusively at a high level; be prepared to dive deep into the specific technical choices you made on past projects.

Be ready for live troubleshooting

Practice reading unfamiliar codebases quickly, identifying bottlenecks, and verbalizing your debugging steps clearly to the interviewer.

Showcase user empathy

Tie your technical decisions back to the end-user experience, especially when discussing mobile app features and biometric data tracking.

Questions & practice

Bullet list of realistic example questions (drawn from the provided interview data): How would you structure a

Medium · Mobile Client and Frontend Development

Bullet list of realistic example questions (drawn from the provided interview data): How would you structure a complex React Native application according to specific product requirements? What strategies do you use to optimize render performance and state management in mobile apps? How do you handle offline-first data synchronization in a mobile client? Walk through how you debug asynchronous race conditions in a cross-platform environment.

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?

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?

Diff a projection against the primary without per-row point reads

Hard · reconciliation · range hashing · throttling

The listing projection has drifted and some rows show a stale version. The primary holds 40,000,000 resource rows across 12,000 tenants while serving 1,200 writes and 14,000 reads per second. The obvious repair, reading each resource row and comparing its version against the projection, is correct and would eventually finish. Explain precisely why it is unacceptable here, then give a diff that finds the differing rows, state its complexity, and make it safe to run against a live primary. Replication lag is usually under 100 ms and is not bounded.

Approach

  1. Quantify the naive cost rather than calling it slow: 40,000,000 point reads at even 0.5 ms each is over five hours serialised, and the only lever is concurrency, which is exactly what you cannot spend. The primary's pool is sized for the write path, and 40,000,000 random reads evict the buffer cache that sustains the 85 percent cache hit rate, so the audit degrades the system it is auditing.
  2. Replace random access with one ordered pass per side. Both sides can be read in (tenant_id, resource_id) order, which is a sequential scan on each and a merge join in O(n) time and O(1) memory. For a dense diff that is the whole answer, and it reads the primary once instead of 40,000,000 times.
  3. For the expected sparse case, compare range hashes instead of rows: partition the key space, compute per range an order-independent aggregate over hash(resource_id, version), compare aggregates, and descend only into ranges that differ. With d differing rows and branching factor B, at most d ranges mismatch per level, so the drill-down examines O(d log_B(n/d)) ranges and reads full rows only in mismatching leaves.
  4. Aggregate with a sum modulo 2^64 or a multiset hash, never XOR. XOR is order-independent but self-cancelling, so two rows wrong in the same way, or a row duplicated on one side, leave the range aggregate matching and the range is declared clean.

Follow-up

  • The diff reports 900 stale rows. How do you decide between patching those rows and rebuilding the projection from resource_revision?
  • Same job, but the projection lives in a search index that cannot be scanned in key order. What changes?

Find version gaps and relay lag with window functions

Medium · window functions · event tables · frame semantics

outbox_event holds event_id, aggregate_type, aggregate_id, aggregate_version, event_type, payload, status ('pending','published','dead'), attempts, created_at, published_at. A projection is missing rows and you must decide whether the relay skipped events or the consumer dropped them. Write three queries over the last seven days: one listing every aggregate_id whose published aggregate_version sequence has a hole, one giving per-day counts with a running total, and one returning the newest published event per aggregate. For each, say where the window function is evaluated relative to WHERE and LIMIT. PostgreSQL 16.

Approach

  1. Gaps: compute lead(aggregate_version) OVER (PARTITION BY aggregate_id ORDER BY aggregate_version) in a subquery, then filter next_version <> aggregate_version + 1 in the outer query. Window functions are evaluated after WHERE, GROUP BY and HAVING and before the outer ORDER BY and LIMIT, so the predicate cannot sit in the same WHERE clause and PostgreSQL 16 has no QUALIFY.
  2. Say what the seven-day filter does to the answer: it truncates every partition, so the first row per aggregate has no predecessor inside the window and a hole spanning the boundary is invisible. Widen the window, or join to resource.version as the authority for the true maximum.
  3. Running total: SELECT date_trunc('day', created_at) AS d, count() AS n, sum(count()) OVER (ORDER BY date_trunc('day', created_at) ROWS UNBOUNDED PRECEDING). An aggregate inside a window call is legal because grouping runs before windowing. The grouping key is unique per row here so ROWS and RANGE agree, but write the frame anyway — over ungrouped rows with tied timestamps the default RANGE frame pulls in every peer row and the total jumps.
  4. Newest per aggregate: DISTINCT ON (aggregate_id) ... ORDER BY aggregate_id, aggregate_version DESC is the cheap PostgreSQL-only form when an index matches that order; row_number() OVER (PARTITION BY aggregate_id ORDER BY aggregate_version DESC) = 1 is the portable form and needs a subquery for the same evaluation-order reason as the gap query.

Follow-up

  • Relay failover redelivers events. Does a duplicate break the gap query, and how would you detect one from this table alone?
  • Turn the gap check into a continuous monitor rather than a query someone runs after an incident. What does it watch?

Stop tag and share joins from fanning out a page

Medium · join fan-out · semi-joins · many-to-many

resource_tag is (resource_id, tag_id) with PK (resource_id, tag_id); resource_share is (resource_id, shared_with_user_id, permission). The tagged-and-shared listing inner-joins resource to both, filters tenant_id, tag_id = ANY($2) and shared_with_user_id = $3, orders by updated_at DESC and takes 50. Pages come back with fewer than 50 distinct resources and the total in the header is far too high. Explain the row multiplication, rewrite both the page query and the count query so each is correct, and name the index each one needs. PostgreSQL 16.

Approach

  1. Do the arithmetic against the predicates that are actually there. An inner join emits one row per matching child row, and both joins are filtered: tag_id = ANY($2) admits only the requested tags, shared_with_user_id = $3 admits one user's share rows. So a resource holding three of the requested tags and shared with $3 once yields three rows, not one — the multiplier is its count of matching tags times its share rows for that single user, and that second factor is 1 unless the table admits duplicate (resource_id, shared_with_user_id) pairs. LIMIT 50 then limits rows rather than resources, and COUNT(*) counts pairs — the header is the product, not the population.
  2. Reject DISTINCT as the fix. It deduplicates after the product has been built, so the planner must materialise and sort the fanned-out set before the LIMIT can apply, and it leaves any SUM or AVG in the same select list wrong.
  3. Rewrite both filters as semi-joins, keeping resource as the only row source: AND EXISTS (SELECT 1 FROM resource_tag rt WHERE rt.resource_id = r.resource_id AND rt.tag_id = ANY($2)) and the same shape against resource_share. A semi-join stops at the first match per resource and preserves the driving index order, so ORDER BY updated_at DESC, resource_id DESC LIMIT 50 still stops after 50 rows.
  4. Count with the same predicates and no join at all: SELECT count(*) FROM resource r WHERE r.tenant_id = $1 AND r.status = 'active' AND EXISTS (...) AND EXISTS (...). Nothing multiplies a resource, so the number is the population.

Follow-up

  • The filter changes from 'any of these tags' to 'all of these tags'. Rewrite it and state what it costs relative to the ANY form.
  • A resource can be shared with the same user twice under different permissions. Does your count change, and should it?

1–2 sentences introducing the category and what it tests. This section evaluates your mastery of client-side f

Medium · Mobile Client and Frontend Development

1–2 sentences introducing the category and what it tests. This section evaluates your mastery of client-side frameworks, UI/UX implementation, and performance optimization in mobile environments.

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?

1–2 sentences introducing the category and what it tests. These questions assess your ability to design scalab

Medium · Backend Architecture and Systems Design

1–2 sentences introducing the category and what it tests. These questions assess your ability to design scalable systems, handle high-throughput IoT data streams, and write maintainable server-side code.

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?

Bullet list of realistic example questions (drawn from the provided interview data): How would you design a sy

Medium · Backend Architecture and Systems Design

Bullet list of realistic example questions (drawn from the provided interview data): How would you design a system to ingest and process real-time telemetry data from thousands of connected devices? Read this backend code snippet, identify the source of the performance bottleneck, and propose a fix. How do you ensure data consistency across distributed microservices? What caching strategies would you implement for a high-traffic consumer product backend?

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?

1–2 sentences introducing the category and what it tests. Interviewers use these scenarios to observe your dia

Medium · Troubleshooting and Technical Problem-So

1–2 sentences introducing the category and what it tests. Interviewers use these scenarios to observe your diagnostic process, code reading ability, and structured problem-solving under constraints.

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?

Bullet list of realistic example questions (drawn from the provided interview data): Troubleshoot a simulated

Medium · Troubleshooting and Technical Problem-So

Bullet list of realistic example questions (drawn from the provided interview data): Troubleshoot a simulated failure in our product backend and explain your step-by-step debugging approach. How would you build a feature from scratch that aggregates physiological sensing data into daily user insights? Walk me through how you isolate memory leaks in a production service.

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 Eight Sleep candidates report.

Day 1 — Map the Eight Sleep loop

  • Write out the reported sequence: Recruiter Call, Engineering Leadership Conversation, Technical Evaluation, Live Technical Troubleshooting.
  • 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 4 reported rounds, with the weakest marked.

Day 2 — Work React Native

  • Spend the session on React Native, which Eight Sleep candidates report being tested on.
  • Write one worked example in React Native and time yourself on it.

Deliverable: One timed worked example in React Native.

Day 3 — Work Mobile App Development

  • Spend the session on Mobile App Development, which Eight Sleep candidates report being tested on.
  • Write one worked example in Mobile App Development and time yourself on it.

Deliverable: One timed worked example in Mobile App Development.

Day 4 — Work Troubleshooting & Debugging

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

Deliverable: One timed worked example in Troubleshooting & Debugging.

Day 5 — Answer out loud: Mobile Client and Frontend Development

  • Answer aloud, timed: 1–2 sentences introducing the category and what it tests. This section evaluates your mastery of client-side frameworks, UI/UX implementation, and performance optimization in mobile environments.
  • Answer aloud, timed: Bullet list of realistic example questions (drawn from the provided interview data): How would you structure a complex React Native application according to specific product requirements? What strategies do you use to optimize render performance and state management in mobile apps? How do you handle offline-first data synchronization in a mobile client? Walk through how you debug asynchronous race conditions in a cross-platform environment.

Deliverable: Spoken answers to 2 reported Mobile Client and Frontend Development question(s), under time.

Day 6 — Answer out loud: Backend Architecture and Systems Design

  • Answer aloud, timed: 1–2 sentences introducing the category and what it tests. These questions assess your ability to design scalable systems, handle high-throughput IoT data streams, and write maintainable server-side code.
  • Answer aloud, timed: Bullet list of realistic example questions (drawn from the provided interview data): How would you design a system to ingest and process real-time telemetry data from thousands of connected devices? Read this backend code snippet, identify the source of the performance bottleneck, and propose a fix. How do you ensure data consistency across distributed microservices? What caching strategies would you implement for a high-traffic consumer product backend?

Deliverable: Spoken answers to 2 reported Backend Architecture and Systems Design question(s), under time.

Day 7 — Answer out loud: Troubleshooting and Technical Problem-Solving

  • Answer aloud, timed: 1–2 sentences introducing the category and what it tests. Interviewers use these scenarios to observe your diagnostic process, code reading ability, and structured problem-solving under constraints.
  • Answer aloud, timed: Bullet list of realistic example questions (drawn from the provided interview data): Troubleshoot a simulated failure in our product backend and explain your step-by-step debugging approach. How would you build a feature from scratch that aggregates physiological sensing data into daily user insights? Walk me through how you isolate memory leaks in a production service.

Deliverable: Spoken answers to 2 reported Troubleshooting and Technical Problem-Solving question(s), under time.

Behavioural preparation

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

1–2 sentences introducing the category and what it tests. This area explores your past projects, collaboration

Medium · Behavioral and Experience Alignment

1–2 sentences introducing the category and what it tests. This area explores your past projects, collaboration style, and how you handle ambiguity and cross-functional friction.

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?

Bullet list of realistic example questions (drawn from the provided interview data): Tell me about a past proj

Medium · Behavioral and Experience Alignment

Bullet list of realistic example questions (drawn from the provided interview data): Tell me about a past project where you had to balance rapid delivery with long-term code quality. How do you provide granular technical details when discussing your past work with non-technical stakeholders? Describe a situation where you disagreed with a product or architectural decision and how you resolved it.

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?

Unblock an engineer without taking the keyboard

Easy · mentoring · leases · at-least-once

A teammate has spent two days on a job handler that occasionally writes duplicate rows. They are certain the queue is delivering twice by mistake. You suspect a lease expiring under a slow handler, so the job is running concurrently with itself. Describe how you have unblocked someone in this position: what you asked before offering a hypothesis, what you showed them rather than told them, and what you left them owning. Then say what you would do if their theory turned out to be the right one.

Approach

  1. Ask before diagnosing, and ask for things answerable from data they already have: the attempt count on the job rows that produced duplicates, the handler's observed duration against its lease expiry, and whether the duplicate rows share a natural key that a unique constraint could have caught.
  2. Teach the shape rather than the answer. A lease cannot distinguish a dead worker from a slow one, so a handler that outruns its lease is running twice by design, and deploys deliver the other half by killing handlers mid-run on every rollout. Both of their candidate theories produce identical duplicate rows, which is why the evidence has to come from timings rather than from argument.
  3. Hand over a checklist they execute: a natural key on every write the handler performs so the second copy collides rather than appends, the record of intent written before any external effect, a lease heartbeat while running, and the metric that shows it working.
  4. Keep ownership with them deliberately. Pair on the first write, then step back; if you finish it yourself you have closed one ticket and left the same person stuck on the next redelivery.

Follow-up

  • How would you distinguish a genuine double-delivery from a lease expiry using only the data already stored?
  • Their handler calls an external endpoint before recording that it did. What do you tell them to change first?