Zwift Software Engineer Interview Guide

The 60-second brief

A Software Engineer at Zwift works at the unique intersection of multiplayer gaming, fitness, and community building. Engineers here are responsible for developing and scaling an immersive, real-time virtual world that powers training and racing for millions of cyclists and runners globally. Whether optimizing low-latency game engines, building robust backend microservices, or developing community tools, your work directly impacts how users interact with the platform and each other. Because Zwift blends a massive multiplayer online (MMO) game environment with real-time physical telemetry data, the technical challenges are highly diverse. You could be working on game systems that require deep optimization and 3D mathematics, or on web and platform teams ensuring seamless community support and data pipelines.

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

Focus areas

• Data structures & algorithms
• Coding interviews (problem solving)
• 3D math

The Zwift interview process

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

Recruiter Conversation

A brief discussion with a recruiter to assess candidate fit for the role.

What to demonstrate

• A brief discussion with a recruiter to assess candidate fit for the role
• Depth in Data structures & algorithms

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

An initial technical assessment to evaluate the candidate's skills and knowledge.

What to demonstrate

• An initial technical assessment to evaluate the candidate's skills and knowledge
• Depth in Data structures & algorithms

How to prepare

• Answer aloud and timed: Explain JavaScript scoping rules, closures, and how the event loop handles asynchronous operations.
• Answer aloud and timed: Write a function to detect collisions or calculate distances between objects in a coordinate space.

Interview Day

A structured final interview loop conducted via Zoom, rotating through breakout rooms.

What to demonstrate

• A structured final interview loop conducted via Zoom, rotating through breakout rooms
• Depth in Data structures & algorithms

How to prepare

• Answer aloud and timed: Design a scalable backend service that can handle real-time telemetry data from millions of active connected fitness devices.
• Answer aloud and timed: Explain the principles of 3D mathematics, including vector operations, matrices, and quaternions, as they apply to positioning in a game world.

Where candidates lose points

Review Math Fundamentals Early

Do not let early math questions catch you off guard. Refresh your knowledge of basic algebra, coordinate geometry, and 3D vectors before your first technical conversation.

Emphasize Practicality over Tricky Syntax

When coding, focus on readability and clean structure. If you are writing a solution, explain your approach clearly and write code that your future teammates would easily understand.

Prepare Your Project Stories

Be ready to discuss your past projects in deep detail. Know your specific contributions, the technical trade-offs you made, and the overall business impact of your work.

Show Empathy for the User

Zwift is a highly community-driven platform. Frame your technical decisions around how they ultimately improve the experience, stability, and joy of the end user.

Questions & practice

Solve a classic array manipulation or string parsing problem (equivalent to medium difficulty on popular codin

Medium · Coding & Algorithms

Solve a classic array manipulation or string parsing problem (equivalent to medium difficulty on popular coding platforms).

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?

Explain JavaScript scoping rules, closures, and how the event loop handles asynchronous operations.

Medium · Coding & Algorithms

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?

Write a function to detect collisions or calculate distances between objects in a coordinate space.

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?

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?

Implement a solution to organize and format raw data returned from an API fetch into equal-length, cleanly ali

Medium · Coding & Algorithms

Implement a solution to organize and format raw data returned from an API fetch into equal-length, cleanly aligned columns.

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?

Design a scalable backend service that can handle real-time telemetry data from millions of active connected f

Medium · System Design & Mathematics

Design a scalable backend service that can handle real-time telemetry data from millions of active connected fitness devices.

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 the principles of 3D mathematics, including vector operations, matrices, and quaternions, as they appl

Medium · System Design & Mathematics

Explain the principles of 3D mathematics, including vector operations, matrices, and quaternions, as they apply to positioning in a game world.

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 optimize a network protocol to minimize latency and packet loss during a high-density virtual cy

Medium · System Design & Mathematics

How would you optimize a network protocol to minimize latency and packet loss during a high-density virtual cycling race?

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?

Describe how you would structure a relational or non-relational database to support a global community leaderb

Medium · System Design & Mathematics

Describe how you would structure a relational or non-relational database to support a global community leaderboard system.

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?

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

Day 1 — Map the Zwift loop

• Write out the reported sequence: Recruiter Conversation, Technical Screening, Interview Day.
• 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 Data structures & algorithms

• Spend the session on Data structures & algorithms, which Zwift candidates report being tested on.
• Write one worked example in Data structures & algorithms and time yourself on it.

Deliverable: One timed worked example in Data structures & algorithms.

Day 3 — Work Coding interviews (problem solving)

• Spend the session on Coding interviews (problem solving), which Zwift candidates report being tested on.
• Write one worked example in Coding interviews (problem solving) and time yourself on it.

Deliverable: One timed worked example in Coding interviews (problem solving).

Day 4 — Work 3D math

• Spend the session on 3D math, which Zwift candidates report being tested on.
• Write one worked example in 3D math and time yourself on it.

Deliverable: One timed worked example in 3D math.

Day 5 — Answer out loud: Coding & Algorithms

• Answer aloud, timed: Implement a solution to organize and format raw data returned from an API fetch into equal-length, cleanly aligned columns.
• Answer aloud, timed: Solve a classic array manipulation or string parsing problem (equivalent to medium difficulty on popular coding platforms).

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

Day 6 — Answer out loud: System Design & Mathematics

• Answer aloud, timed: Design a scalable backend service that can handle real-time telemetry data from millions of active connected fitness devices.
• Answer aloud, timed: Explain the principles of 3D mathematics, including vector operations, matrices, and quaternions, as they apply to positioning in a game world.

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

Day 7 — Answer out loud: Behavioral & Teamwork

• Answer aloud, timed: Describe a time when you had to make a technical compromise to meet a tight product deadline.
• Answer aloud, timed: How do you handle a situation where you disagree with a product manager or technical lead on the implementation details of a feature?

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

Behavioural preparation

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

Describe a time when you had to make a technical compromise to meet a tight product deadline.

Medium · Behavioral & Teamwork

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 product manager or technical lead on the implementatio

Medium · Behavioral & Teamwork

How do you handle a situation where you disagree with a product manager or technical lead on the implementation details of a feature?

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?

Talk about a significant technical contribution you made in your previous role and the measurable impact it ha

Medium · Behavioral & Teamwork

Talk about a significant technical contribution you made in your previous role and the measurable impact it had on the business or users.

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 approach mentoring junior engineers and conducting constructive code reviews?

Medium · Behavioral & Teamwork

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?