Runway (CA) Software Engineer Interview Guide

The 60-second brief

As a Software Engineer at Runway (CA), you will play a pivotal role in redefining the intersection of art, artificial intelligence, and human creativity. Runway (CA) is at the absolute forefront of applied generative AI, developing foundational multimodal models that empower filmmakers, designers, and creators worldwide. Engineers here do not merely build standard web applications; they design and optimize the highly interactive interfaces, robust media pipelines, and scalable backend architectures that make complex AI models accessible and highly performant in real-time. The impact of this role is immediate and profound. You will be responsible for translating cutting-edge research into intuitive, production-grade tools that handle massive video and image assets.

This guide is scoped to a Software Engineer candidate at Runway (CA).

Focus areas

• Coding assessments / take-home projects
• React
• Data modeling with classes

The Runway (CA) interview process

Runway (CA) candidates report 4 rounds over 3-5 weeks. The stages below are what candidates describe, not a published process.

Recruiter Screen

A comprehensive conversation covering your technical background, experience with complex systems, and cultural motivations.

What to demonstrate

• A comprehensive conversation covering your technical background, experience with complex systems, and cultural motivations
• Depth in Coding assessments / take-home projects

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.

Take-Home Assessment

A rigorous, timed assessment that serves as the primary technical gatekeeper for the company.

What to demonstrate

• A rigorous, timed assessment that serves as the primary technical gatekeeper for the company
• Depth in Coding assessments / take-home projects

How to prepare

• Answer aloud and timed: Implement a custom state management solution or data structure that efficiently handles undo/redo operations for a high-frequency user interface.
• Answer aloud and timed: Explain how you would optimize data serialization and deserialization for large payloads sent between a client application and an AI inference server.

Onsite Loop

Includes deep-dive technical reviews, system design sessions, and conversations with key leadership.

What to demonstrate

• Includes deep-dive technical reviews, system design sessions, and conversations with key leadership
• Depth in Coding assessments / take-home projects

How to prepare

• Answer aloud and timed: Build a highly interactive component in React that handles drag-and-drop media assets while maintaining 60 frames per second.
• Answer aloud and timed: How would you manage complex, asynchronous state transitions when multiple AI model generations are running concurrently in the UI?

Preparation Session

A dedicated session to coach you on what to expect and how to present your work.

What to demonstrate

• A dedicated session to coach you on what to expect and how to present your work
• Depth in Coding assessments / take-home projects

How to prepare

• Answer aloud and timed: What strategies do you use to optimize asset loading, caching, and rendering of high-resolution video files in the browser?
• Answer aloud and timed: Tell me about a time you had to deliver a complex technical project under tight deadlines with highly ambiguous requirements.

Where candidates lose points

Prioritize Readability Over Cleverness

When completing the take-home test, avoid overly complex one-liners or highly obscure language features. The reviewers prioritize clean naming conventions, clear structural properties, and self-documenting code.

Manage Your Time Aggressively

During the timed take-home, set a strict timeline. Aim to have a working draft within the first 90 minutes so you have ample time to refactor, write tests, and document your architectural decisions.

Showcase Product Empathy

Throughout your interviews, demonstrate that you care about the end user—the creator. Discuss how your architectural choices impact user-perceived latency, UI responsiveness, and overall creative flow.

Align Your Career Narrative

When speaking with senior leadership and the CEO, ensure your professional story reflects a desire to build in high-growth, high-intensity environments. Highlight your adaptability and your excitement for the generative AI space.

Questions & practice

How would you manage complex, asynchronous state transitions when multiple AI model generations are running co

Medium · Frontend & UI Engineering

How would you manage complex, asynchronous state transitions when multiple AI model generations are running concurrently in the UI?

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?

Canonicalise a request body into a stable idempotency fingerprint

Medium · parsing · canonicalisation · hashing

idempotency_key.request_fingerprint is a SHA-256 over the method, path and canonicalised body, and a retry whose fingerprint differs must be rejected with 422 rather than served the stored response. Write the canonicaliser. Bodies are JSON up to 256 KB nested at most 32 levels; clients vary key order, whitespace and unicode escaping, and some send 64-bit ids as JSON numbers. Produce a deterministic byte string such that semantically identical bodies match and any semantic difference does not. State your complexity and name two normalisations you refuse to perform.

Approach

1. Parse once into a tree, then re-serialise under fixed rules: object keys sorted, array order preserved, one escaping convention, no insignificant whitespace. Parsing is O(n) and sorting keys is O(k log k) per object, so O(n log n) overall with O(depth) stack, and the 32-level cap is enforced during parsing because hostile nesting is how a canonicaliser becomes a stack overflow.
2. Sort keys by their UTF-8 bytes and say why the obvious implementation is wrong in some runtimes: a default string comparison that orders by UTF-16 code units places surrogate pairs, meaning code points from U+10000 up, below U+E000 to U+FFFF, which is not UTF-8 byte order, so two services written in different languages disagree on the same document.
3. Do not re-encode numbers through a double. IEEE-754 binary64 represents integers exactly only up to 2^53, so normalising a 19-digit id through a float changes it, and 1 against 1.0 cannot be reconciled without deciding whether they are the same value. Preserve the literal token, and require ids as strings at the API boundary if you want them comparable.
4. Reject duplicate keys rather than picking one. JSON permits them and parsers disagree, most keeping the last, so any choice you make ties the fingerprint to a parser detail that the code handling the request does not necessarily share.

Follow-up

• A client sends the same logical request with an extra field your API ignores. Same key, different fingerprint, so you return 422. Is that the right answer?
• Where does the fingerprint get computed relative to request decompression and the body-size limit?

Archive a resource graph without breaking live references or recursing

Medium · graph traversal · topological order · tenant isolation

Resources reference other resources within a tenant; for the largest tenant the reference table holds up to 2,000,000 nodes and 8,000,000 edges. Archiving a resource must archive everything reachable from it that nothing outside the set still references, refuse when a live external referrer exists, and terminate when references form cycles, which they legitimately do. Produce the archive order and the refusal list, targeting O(V+E). Say what stops the traversal crossing a tenant boundary, and why recursion is the wrong control structure at this size.

Approach

1. Load the subgraph with the tenant predicate on both endpoints of the edge, not only on the side you started from. Scoping the left table alone is the classic cross-tenant leak: one mis-entered edge then pulls another tenant's resources into the traversal and, worse, into the archive.
2. Traverse iteratively with an explicit stack. A 2,000,000-node graph can hold a chain deep enough to exhaust a native stack in the low tens of thousands of frames, and that failure is a process crash rather than an error you can return.
3. Treat cycles as data rather than corruption: compute strongly connected components with Tarjan in O(V+E) using its own explicit stack, then condense. The condensation is a DAG, so a topological order over it gives the archive order, and every member of a component archives in one transaction because no order within a cycle is valid.
4. Decide refusals with reverse edges. A candidate is archivable only if every in-edge originates inside the candidate set, so build the transpose or count in-degrees restricted to the visited set, and emit each blocked resource with the id of the external referrer, which is the only part of the answer an operator can act on.

Follow-up

• The graph is read in one query and the archive writes a minute later. What can change in between, and how do you make the write safe?
• The candidate set is 400,000 resources. Is that one transaction, and if not, what does a half-finished archive look like to a reader?

Write the update path that detects a concurrent edit

Medium · optimistic concurrency · transactional outbox · audit history

resource carries version INT NOT NULL DEFAULT 1. resource_revision holds revision_id, resource_id, version, actor_user_id, change_kind, patch JSONB, request_id, created_at with UNIQUE (resource_id, version). outbox_event holds aggregate_type, aggregate_id, aggregate_version, event_type, payload, status. A PUT carries the version the client read. Write the exact statements for the single transaction that applies the edit, records the revision and enqueues 'resource.updated', and give the handler's branch on zero affected rows. Then say what PostgreSQL 16 does under READ COMMITTED when two of these updates hit one row at once.

Approach

1. One transaction, three writes, no network call inside it: UPDATE resource SET title = $3, version = version + 1, updated_at = now() WHERE resource_id = $1 AND tenant_id = $4 AND version = $2; then INSERT the resource_revision row at version $2 + 1; then INSERT the outbox_event row at the same aggregate_version. The event goes to a table rather than a broker because no transaction spans both.
2. Branch on the affected-row count before doing anything else. Zero has three causes — stale version, wrong tenant, row gone — so re-read once and map to 409 carrying the current version, or 404 for an id outside the caller's tenant, which also stops the endpoint confirming that another tenant's id exists.
3. State the engine behaviour instead of assuming it. Under READ COMMITTED the second UPDATE blocks on the row lock, and when the first commits PostgreSQL re-evaluates the WHERE clause against the newly committed row, so the version predicate now fails and the statement reports zero rows. Under REPEATABLE READ the identical collision raises SQLSTATE 40001 instead, so the handler must fold both shapes into one conflict response.
4. Keep UNIQUE (resource_id, version) even though the predicate already serialises writers. It is what makes a lost update unwritable if any other path ever reaches the revision table, and it converts a logic bug into 23505 rather than into a silently missing history row.

Follow-up

• A client sends the version it read ten minutes ago and the resource has moved three versions. What is in your 409 so it can resolve the conflict without a full re-fetch?
• Two editors, two disjoint fields, no overlap. Does your answer still refuse the second write, and should it?

Hold a per-tenant active cap against concurrent creates

Hard · write skew · isolation levels · constraints

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

Approach

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

Follow-up

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

Design a set of robust data classes to represent a complex, nested media-editing timeline, ensuring type safet

Medium · Technical & Code Architecture

Design a set of robust data classes to represent a complex, nested media-editing timeline, ensuring type safety and immutability.

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 do you structure properties and naming conventions in a shared codebase to maximize readability and minimi

Medium · Technical & Code Architecture

How do you structure properties and naming conventions in a shared codebase to maximize readability and minimize cognitive load for other engineers?

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?

Implement a custom state management solution or data structure that efficiently handles undo/redo operations f

Medium · Technical & Code Architecture

Implement a custom state management solution or data structure that efficiently handles undo/redo operations for a high-frequency user interface.

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 optimize data serialization and deserialization for large payloads sent between a client

Medium · Technical & Code Architecture

Explain how you would optimize data serialization and deserialization for large payloads sent between a client application and an AI inference server.

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?

Build a highly interactive component in React that handles drag-and-drop media assets while maintaining 60 fra

Medium · Frontend & UI Engineering

Build a highly interactive component in React that handles drag-and-drop media assets while maintaining 60 frames per second.

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?

What strategies do you use to optimize asset loading, caching, and rendering of high-resolution video files in

Medium · Frontend & UI Engineering

What strategies do you use to optimize asset loading, caching, and rendering of high-resolution video files in the browser?

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?

Exports duplicate a row range about once a week

Hard · leases · clock skew · idempotency

Roughly once a week an export writes a file containing a duplicated range of rows. The affected job_run rows show attempt = 1, status = succeeded, one started_at, and a lease_owner naming a different host from the one whose logs show the job starting. Leases last 30 seconds and are heartbeated every 10 from inside the handler; lease_expires_at is computed on the worker and compared against the database's now(). Find the mechanism, and give a fix that holds even if you cannot fix the clocks.

Approach

1. Start from the fact that eliminates the obvious answer. attempt = 1 means no retry was recorded, so this is not a re-run after failure; two workers ran the same row concurrently and the takeover path never touched the counter. lease_owner naming a host other than the one that started the job is the same statement from the other side.
2. Enumerate the mechanisms that cause a premature takeover, then find the signal that separates them. Either the lease genuinely expired because the heartbeat did not fire, which is what happens when the heartbeat runs on the handler's own thread and the handler makes a long blocking call, or it only appeared expired because two clocks disagree, since lease_expires_at is written from the worker's clock and evaluated against the database's. The discriminator is the distribution: incidents clustered on the longest exports indict the heartbeat, incidents clustered on one host indict skew. Measure both, and measure each host's offset against the database directly.
3. Read the reclaim query precisely. In PostgreSQL now() is transaction start time, not statement time, so a reclaimer holding a long transaction compares against an older timestamp than expected; clock_timestamp() is the statement-time function. This is worth ruling in or out before you redesign anything, because it changes which rows look expired.
4. Remove the second clock rather than trying to synchronise it. Issue and extend the lease in the database, with lease_expires_at = now() + interval '30 seconds' in both the claim and the heartbeat, so exactly one clock is ever compared and worker skew stops mattering to this predicate.

Follow-up

• The displaced worker has already streamed half the file to object storage. What makes that side effect safe to repeat?
• You now count takeovers. What alert fires on that counter, and at what threshold?

Suggested practice checklist

Built from the rounds and topics Runway (CA) candidates report.

Day 1 — Map the Runway (CA) loop

• Write out the reported sequence: Recruiter Screen, Take-Home Assessment, Onsite Loop, Preparation Session.
• 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 Coding assessments / take-home projects

• Spend the session on Coding assessments / take-home projects, which Runway (CA) candidates report being tested on.
• Write one worked example in Coding assessments / take-home projects and time yourself on it.

Deliverable: One timed worked example in Coding assessments / take-home projects.

Day 3 — Work React

• Spend the session on React, which Runway (CA) candidates report being tested on.
• Write one worked example in React and time yourself on it.

Deliverable: One timed worked example in React.

Day 4 — Work Data modeling with classes

• Spend the session on Data modeling with classes, which Runway (CA) candidates report being tested on.
• Write one worked example in Data modeling with classes and time yourself on it.

Deliverable: One timed worked example in Data modeling with classes.

Day 5 — Answer out loud: Technical & Code Architecture

• Answer aloud, timed: Design a set of robust data classes to represent a complex, nested media-editing timeline, ensuring type safety and immutability.
• Answer aloud, timed: How do you structure properties and naming conventions in a shared codebase to maximize readability and minimize cognitive load for other engineers?

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

Day 6 — Answer out loud: Frontend & UI Engineering

• Answer aloud, timed: Build a highly interactive component in React that handles drag-and-drop media assets while maintaining 60 frames per second.
• Answer aloud, timed: How would you manage complex, asynchronous state transitions when multiple AI model generations are running concurrently in the UI?

Deliverable: Spoken answers to 2 reported Frontend & UI Engineering question(s), under time.

Day 7 — Answer out loud: Behavioral & Cultural Alignment

• Answer aloud, timed: Tell me about a time you had to deliver a complex technical project under tight deadlines with highly ambiguous requirements.
• Answer aloud, timed: How do you handle constructive feedback on your code architecture when collaborating with research scientists who may prioritize speed over engineering clean code?

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

Behavioural preparation

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

Tell me about a time you had to deliver a complex technical project under tight deadlines with highly ambiguou

Medium · Behavioral & Cultural Alignment

Tell me about a time you had to deliver a complex technical project under tight deadlines with highly ambiguous requirements.

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 constructive feedback on your code architecture when collaborating with research scientists

Medium · Behavioral & Cultural Alignment

How do you handle constructive feedback on your code architecture when collaborating with research scientists who may prioritize speed over engineering clean code?

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 are you interested in joining an early-to-mid-stage AI startup, and how do you view your long-term career

Medium · Behavioral & Cultural Alignment

Why are you interested in joining an early-to-mid-stage AI startup, and how do you view your long-term career growth within the San Francisco tech ecosystem?

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?