cswork / libraryOpen practice workspace

Interview guides · Rapid

Rapid Software Engineer Interview Guide

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

The 60-second brief

A Software Engineer at Rapid plays a pivotal role in building, scaling, and maintaining the world’s leading API platform. At its core, Rapid enables millions of developers to find, connect to, and manage thousands of APIs through a unified interface. As an engineer here, you are not just writing code; you are building the critical infrastructure, developer tools, and API gateways that power modern software ecosystems. Your work directly impacts how developers worldwide design, deploy, and consume microservices. The engineering challenges at Rapid are deeply rooted in high availability, low latency, and systems complexity. You will work on optimizing API hubs, building robust developer dashboards, and designing scalable microservices architectures that handle billions of API requests daily.

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

Focus areas

  • JavaScript
  • Software architecture
  • Node.js

The Rapid interview process

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

Recruiter Screen

A brief initial conversation with a recruiter to assess your fit for the role.

What to demonstrate

  • A brief initial conversation with a recruiter to assess your fit for the role
  • Depth in JavaScript

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.

Initial Technical Conversation

Discussion led by an engineering team lead focusing on your technical background and past projects.

What to demonstrate

  • Discussion led by an engineering team lead focusing on your technical background and past projects
  • Depth in JavaScript

How to prepare

  • Answer aloud and timed: How does the event loop work in Node.js, and how does it handle asynchronous I/O operations?
  • Answer aloud and timed: Explain the component lifecycle in React and how you would optimize a component to prevent unnecessary re-renders.

Core Technical Evaluation

In-depth coding exercises and system architecture discussions to evaluate technical skills.

What to demonstrate

  • In-depth coding exercises and system architecture discussions to evaluate technical skills
  • Depth in JavaScript

How to prepare

  • Answer aloud and timed: What are the differences between client-side rendering and server-side rendering, and when would you choose one over the other?
  • Answer aloud and timed: How would you design a rate-limiting mechanism for an API gateway handling millions of requests?

Leadership and Collaboration Round

Final round focusing on leadership qualities and ability to work within a team.

What to demonstrate

  • Final round focusing on leadership qualities and ability to work within a team
  • Depth in JavaScript

How to prepare

  • Answer aloud and timed: Describe the key differences between SQL and NoSQL databases, and explain when you would deploy each in a microservices architecture.
  • Answer aloud and timed: How do you handle database migration and schema changes in a live production environment with zero downtime?

Where candidates lose points

Master the core stack

Do not skip the basics of JavaScript. Be ready to explain currying, closures, and asynchronous execution patterns in detail, as these are frequently tested.

Understand the product

Spend time exploring Rapid’s API Hub before your interview. Understanding how developers interact with the platform will give you valuable context for both system design and behavioral rounds.

Prepare your system design talking points

When designing systems, always start by defining the scale, requirements, and constraints. Do not jump straight into drawing databases without explaining your assumptions first.

Questions & practice

How does the event loop work in Node.js, and how does it handle asynchronous I/O operations?

Medium · JavaScript & Frontend 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?

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?

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?

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?

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?

Explain the concept of currying in JavaScript and provide a practical use case.

Medium · JavaScript & Frontend Development

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 are higher-order functions in JavaScript, and how do they differ from standard functions?

Medium · JavaScript & Frontend Development

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?

Explain the component lifecycle in React and how you would optimize a component to prevent unnecessary re-rend

Medium · JavaScript & Frontend Development

Explain the component lifecycle in React and how you would optimize a component to prevent unnecessary re-renders.

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 are the differences between client-side rendering and server-side rendering, and when would you choose on

Medium · JavaScript & Frontend Development

What are the differences between client-side rendering and server-side rendering, and when would you choose one over the other?

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?

How would you design a rate-limiting mechanism for an API gateway handling millions of requests?

Medium · Backend & Systems Architecture

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 the key differences between SQL and NoSQL databases, and explain when you would deploy each in a micr

Medium · Backend & Systems Architecture

Describe the key differences between SQL and NoSQL databases, and explain when you would deploy each in a microservices architecture.

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?

What is load balancing, and what strategies would you use to distribute traffic across microservices?

Medium · Backend & Systems Architecture

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 implement caching at the API gateway level to improve response times.

Medium · Backend & Systems Architecture

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?

Describe a time when you had to debug a critical production issue under tight time constraints. How did you id

Medium · Behavioral & Project Walkthroughs

Describe a time when you had to debug a critical production issue under tight time constraints. How did you identify the root cause?

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

Day 1 — Map the Rapid loop

  • Write out the reported sequence: Recruiter Screen, Initial Technical Conversation, Core Technical Evaluation, Leadership and Collaboration Round.
  • 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 JavaScript

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

Deliverable: One timed worked example in JavaScript.

Day 3 — Work Software architecture

  • Spend the session on Software architecture, which Rapid candidates report being tested on.
  • Write one worked example in Software architecture and time yourself on it.

Deliverable: One timed worked example in Software architecture.

Day 4 — Work Node.js

  • Spend the session on Node.js, which Rapid candidates report being tested on.
  • Write one worked example in Node.js and time yourself on it.

Deliverable: One timed worked example in Node.js.

Day 5 — Answer out loud: JavaScript & Frontend Development

  • Answer aloud, timed: Explain the concept of currying in JavaScript and provide a practical use case.
  • Answer aloud, timed: What are higher-order functions in JavaScript, and how do they differ from standard functions?

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

Day 6 — Answer out loud: Backend & Systems Architecture

  • Answer aloud, timed: How would you design a rate-limiting mechanism for an API gateway handling millions of requests?
  • Answer aloud, timed: Describe the key differences between SQL and NoSQL databases, and explain when you would deploy each in a microservices architecture.

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

Day 7 — Answer out loud: Behavioral & Project Walkthroughs

  • Answer aloud, timed: Walk me through a challenging project you designed from scratch, explaining your technical choices and the trade-offs you made.
  • Answer aloud, timed: Describe a time when you had to debug a critical production issue under tight time constraints. How did you identify the root cause?

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

Behavioural preparation

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

How do you handle database migration and schema changes in a live production environment with zero downtime?

Medium · Backend & Systems Architecture

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?

Walk me through a challenging project you designed from scratch, explaining your technical choices and the tra

Medium · Behavioral & Project Walkthroughs

Walk me through a challenging project you designed from scratch, explaining your technical choices and the trade-offs you made.

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 disagreements with product managers or other engineers regarding technical debt versus featu

Medium · Behavioral & Project Walkthroughs

How do you handle disagreements with product managers or other engineers regarding technical debt versus feature delivery?

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

Tell me about a time you had to learn a new technology quickly to solve a specific problem on your team.

Medium · Behavioral & Project Walkthroughs

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?