Intuitive Surgical Software Engineer Interview Guide

The 60-second brief

As a Software Engineer at Intuitive Surgical, you build the complex software foundations that power industry-defining robotic-assisted surgery platforms, including the flagship da Vinci surgical system and the Ion endoluminal system. Software engineering at Intuitive spans a uniquely broad spectrum: from low-level embedded firmware controlling sub-millimeter robotic arm joints to real-time vision algorithms, medical data pipelines, cloud-connected platforms, and clinical planning software such as PlanPoint. In this role, your code directly intersects with physical hardware, clinical workflows, and patient safety. A successful software design does not simply pass automated unit tests; it must operate deterministically inside an operating room where real-time performance, zero-downtime reliability, and fail-safe safety mechanisms are paramount.

This guide is scoped to a Software Engineer candidate at Intuitive Surgical.

Focus areas

• VLA System Design
• Clock Domain Crossing (CDC)
• Stress-Strain Curves

The Intuitive Surgical interview process

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

Recruiter Phone Screen

Initial conversation focused on resume and alignment with technical needs of the team.

What to demonstrate

• Initial conversation focused on resume and alignment with technical needs of the team
• Depth in VLA System Design

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

30- to 60-minute video call with hiring manager or senior engineer involving resume deep-dives and basic C/C++ questions.

What to demonstrate

• 30- to 60-minute video call with hiring manager or senior engineer involving resume deep-dives and basic C/C++ questions
• Depth in VLA System Design

How to prepare

• Answer aloud and timed: How would you design and implement a custom hash map data structure from scratch, and how do you handle collision resolution?
• Answer aloud and timed: Write a program to iterate over standard C++ vectors efficiently, and explain memory layout considerations when accessing sequential elements.

Final Round Loop

Comprehensive virtual or hybrid loop including a project presentation and Q&A with cross-functional stakeholders.

What to demonstrate

• Comprehensive virtual or hybrid loop including a project presentation and Q&A with cross-functional stakeholders
• Depth in VLA System Design

How to prepare

• Answer aloud and timed: How do you optimize algorithmic time and space complexity when manipulating complex data collections under tight execution constraints?
• Answer aloud and timed: Explain the differences between raw pointers and smart pointers (such as std::unique_ptr and std::shared_ptr) in C++, including ownership semantics and performance implications.

1-on-1 Interviews

Series of interviews focusing on deep technical domains, system design, and behavioral alignment.

What to demonstrate

• Series of interviews focusing on deep technical domains, system design, and behavioral alignment
• Depth in VLA System Design

How to prepare

• Answer aloud and timed: Describe the key communication protocols used in electromechanical systems: SPI, I2C, UART, and CAN. What are their relative strengths, bandwidth considerations, and typical use cases?
• Answer aloud and timed: How would you model and code a signal crossing from a fast clock domain to a slower clock domain in digital logic or low-level firmware?

Where candidates lose points

Always explicitly communicate your thought process during coding and architectural interviews

Interviewers care deeply about how you approach ambiguous engineering challenges.

Master C++ Fundamentals

Expect detailed questions on memory allocation, smart pointers, dynamic vs. static polymorphism, move semantics, and thread synchronization. Be ready to explain why a specific pointer or data structure is chosen.

Tailor Your Candidate Presentation

Treat your project presentation as a core engineering review. Avoid overly high-level slides; include clear architecture diagrams, data flow charts, and specific code/design challenges you personally solved.

Demonstrate Hardware & Safety Awareness

Even if applying for an application-level software role, show that you appreciate the physical system constraints. Highlight how your software handles invalid inputs, network latency, or hardware state exceptions gracefully.

Questions & practice

Given a two-dimensional matrix, write an algorithm to implement Set Matrix Zeroes such that if an element is 0

Medium · Computer Science Fundamentals & Algorith

Given a two-dimensional matrix, write an algorithm to implement Set Matrix Zeroes such that if an element is 0, its entire row and column are set to 0.

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?

Given a string containing bracket characters, write a function using a stack to validate whether the input str

Medium · Computer Science Fundamentals & Algorith

Given a string containing bracket characters, write a function using a stack to validate whether the input string has balanced and valid parentheses.

Approach

1. Restate the input: its shape, its size, and what is guaranteed about it.
2. Name the brute-force solution and its complexity before improving on it.
3. Choose the data structure from the access pattern, not from familiarity.
4. State the target complexity and say which constraint rules the naive version out.

Follow-up

• How does this change if the input no longer fits in memory?
• What is the worst case, and how likely is it on real data?

Write a program to iterate over standard C++ vectors efficiently, and explain memory layout considerations whe

Medium · Computer Science Fundamentals & Algorith

Write a program to iterate over standard C++ vectors efficiently, and explain memory layout considerations when accessing sequential elements.

Approach

1. Say what the runtime actually does before reasoning about the code.
2. Name what is shared across threads and what owns each piece of state.
3. Identify the window where an invariant is briefly untrue.
4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

• What happens if two callers reach this at the same time?
• Where could this allocate more than you expect?

How do you optimize algorithmic time and space complexity when manipulating complex data collections under tig

Medium · Computer Science Fundamentals & Algorith

How do you optimize algorithmic time and space complexity when manipulating complex data collections under tight execution constraints?

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 the differences between raw pointers and smart pointers (such as std::unique_ptr and `std::shared_pt

Medium · Embedded, Firmware & System-Level Progra

Explain the differences between raw pointers and smart pointers (such as std::unique_ptr and std::shared_ptr) in C++, including ownership semantics and performance implications.

Approach

1. Say what the runtime actually does before reasoning about the code.
2. Name what is shared across threads and what owns each piece of state.
3. Identify the window where an invariant is briefly untrue.
4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

• What happens if two callers reach this at the same time?
• Where could this allocate more than you expect?

How would you model and code a signal crossing from a fast clock domain to a slower clock domain in digital lo

Medium · Embedded, Firmware & System-Level Progra

How would you model and code a signal crossing from a fast clock domain to a slower clock domain in digital logic or low-level firmware?

Approach

1. Say what the runtime actually does before reasoning about the code.
2. Name what is shared across threads and what owns each piece of state.
3. Identify the window where an invariant is briefly untrue.
4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

• What happens if two callers reach this at the same time?
• Where could this allocate more than you expect?

What considerations go into designing a real-time event loop to ensure deterministic execution without thread

Medium · Real-Time Systems, Control & Safety-Crit

What considerations go into designing a real-time event loop to ensure deterministic execution without thread starvation or priority inversion?

Approach

1. Say what the runtime actually does before reasoning about the code.
2. Name what is shared across threads and what owns each piece of state.
3. Identify the window where an invariant is briefly untrue.
4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

• What happens if two callers reach this at the same time?
• Where could this allocate more than you expect?

How would you implement a custom Promise implementation from scratch in JavaScript or C++ to manage asynchrono

Medium · Object-Oriented & Application Software D

How would you implement a custom Promise implementation from scratch in JavaScript or C++ to manage asynchronous operations?

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?

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?

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?

Describe the key communication protocols used in electromechanical systems: SPI, I2C, UART, and CAN. What are

Medium · Embedded, Firmware & System-Level Progra

Describe the key communication protocols used in electromechanical systems: SPI, I2C, UART, and CAN. What are their relative strengths, bandwidth considerations, and typical use cases?

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 how to design an efficient data structure and protocol to send, receive, and parse unordered message o

Medium · Embedded, Firmware & System-Level Progra

Explain how to design an efficient data structure and protocol to send, receive, and parse unordered message objects across a network or inter-process communication bus.

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 the maximum floating-point value that standard C++ data types can handle, and how do precision limits

Medium · Embedded, Firmware & System-Level Progra

What is the maximum floating-point value that standard C++ data types can handle, and how do precision limits impact continuous mathematical calculations in dynamic control loops?

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 robotic surgical arm system to safely release tension and exit a patient automatically

Medium · Real-Time Systems, Control & Safety-Crit

How would you design a robotic surgical arm system to safely release tension and exit a patient automatically or gracefully during a complete loss of power?

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 design a Vision-Language-Action (VLA) or autonomous sub-task system to assist a surgeon during a

Medium · Real-Time Systems, Control & Safety-Crit

How would you design a Vision-Language-Action (VLA) or autonomous sub-task system to assist a surgeon during a specific robotic surgical procedure?

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 architectural approach you would take to build a distributed system for streaming and processing

Medium · Real-Time Systems, Control & Safety-Crit

Describe the architectural approach you would take to build a distributed system for streaming and processing high-throughput, low-latency video and data frames in an operating room.

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?

Design an extensible, object-oriented Payroll System class structure, demonstrating clean encapsulation, inher

Medium · Object-Oriented & Application Software D

Design an extensible, object-oriented Payroll System class structure, demonstrating clean encapsulation, inheritance, and interface boundaries.

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 core Object-Oriented Programming (OOP) concepts—encapsulation, abstraction, inheritance, and polymorph

Medium · Object-Oriented & Application Software D

Explain core Object-Oriented Programming (OOP) concepts—encapsulation, abstraction, inheritance, and polymorphism—and provide concrete software design examples.

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?

Walk through how you would architect a web-based data collection and workflow system similar to Google Forms f

Medium · Object-Oriented & Application Software D

Walk through how you would architect a web-based data collection and workflow system similar to Google Forms for clinical trial tracking.

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 design software modules to ensure high testability, clean separation of concerns, and seamless cont

Medium · Object-Oriented & Application Software D

How do you design software modules to ensure high testability, clean separation of concerns, and seamless continuous integration?

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?

One log partition stops advancing while the others drain

Easy · poison message · head-of-line blocking · consumer lag

Search results for a subset of tenants are hours stale; the rest are current. The projection consumer reports lag of zero on 15 of 16 partitions and 400,000 on one. Its error rate is flat and its CPU is idle. outbox_event has no pending rows older than a second, so the relay has published everything it holds. Identify the mechanism, give the ordered checks, and state what you do in the first ten minutes versus what you change permanently.

Approach

1. Read the lag distribution first. A slow consumer lags everywhere; zero on fifteen partitions and 400,000 on one is not throughput. Idle CPU on the stuck partition means the consumer is not advancing its offset at all, which points at one message it cannot get past rather than at a rate problem.
2. Exonerate the producer before touching the consumer. No pending outbox rows older than a second means the relay published, so the event exists in the log. This separates never sent from sent and never applied, which are different code paths and usually different owners.
3. Read the message at the stuck offset and the handler's log lines for its event_id. A flat error rate with no progress has two explanations and you must distinguish them: the handler is throwing and the retry loop is swallowing it, or the handler is blocking on something and never returning. Idle CPU with no error lines favours the second.
4. Mitigate before diagnosing further. Move the offending event to a dead-letter store and commit the offset past it. Adding consumers does nothing here, because a partition is consumed by exactly one member of the group, and the blast radius is every aggregate hashed to that partition, not only the aggregate that produced the bad event.

Follow-up

• The dead-lettered event carried aggregate_version 7 and the projection had applied 6. What must the replay do differently if 8 and 9 landed in the meantime?
• How do you show staleness to the user while the partition is behind, given the API already returns the projection's watermark?

Suggested practice checklist

Built from the rounds and topics Intuitive Surgical candidates report.

Day 1 — Map the Intuitive Surgical loop

• Write out the reported sequence: Recruiter Phone Screen, Technical Screening, Final Round Loop, 1-on-1 Interviews.
• 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 VLA System Design

• Spend the session on VLA System Design, which Intuitive Surgical candidates report being tested on.
• Write one worked example in VLA System Design and time yourself on it.

Deliverable: One timed worked example in VLA System Design.

Day 3 — Work Clock Domain Crossing (CDC)

• Spend the session on Clock Domain Crossing (CDC), which Intuitive Surgical candidates report being tested on.
• Write one worked example in Clock Domain Crossing (CDC) and time yourself on it.

Deliverable: One timed worked example in Clock Domain Crossing (CDC).

Day 4 — Work Stress-Strain Curves

• Spend the session on Stress-Strain Curves, which Intuitive Surgical candidates report being tested on.
• Write one worked example in Stress-Strain Curves and time yourself on it.

Deliverable: One timed worked example in Stress-Strain Curves.

Day 5 — Answer out loud: Computer Science Fundamentals & Algorithms

• Answer aloud, timed: Given a two-dimensional matrix, write an algorithm to implement Set Matrix Zeroes such that if an element is 0, its entire row and column are set to 0.
• Answer aloud, timed: Given a string containing bracket characters, write a function using a stack to validate whether the input string has balanced and valid parentheses.

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

Day 6 — Answer out loud: Embedded, Firmware & System-Level Programming

• Answer aloud, timed: Explain the differences between raw pointers and smart pointers (such as std::unique_ptr and std::shared_ptr) in C++, including ownership semantics and performance implications.
• Answer aloud, timed: Describe the key communication protocols used in electromechanical systems: SPI, I2C, UART, and CAN. What are their relative strengths, bandwidth considerations, and typical use cases?

Deliverable: Spoken answers to 2 reported Embedded, Firmware & System-Level Programming question(s), under time.

Day 7 — Answer out loud: Real-Time Systems, Control & Safety-Critical Architecture

• Answer aloud, timed: How would you design a robotic surgical arm system to safely release tension and exit a patient automatically or gracefully during a complete loss of power?
• Answer aloud, timed: How would you design a Vision-Language-Action (VLA) or autonomous sub-task system to assist a surgeon during a specific robotic surgical procedure?

Deliverable: Spoken answers to 2 reported Real-Time Systems, Control & Safety-Critical Architecture question(s), under time.

Behavioural preparation

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

How would you design and implement a custom hash map data structure from scratch, and how do you handle collis

Medium · Computer Science Fundamentals & Algorith

How would you design and implement a custom hash map data structure from scratch, and how do you handle collision resolution?

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 fault detection, system state recovery, and error logging in safety-critical medical device

Medium · Real-Time Systems, Control & Safety-Crit

How do you handle fault detection, system state recovery, and error logging in safety-critical medical device software?

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?

Ship under a deadline and bound the debt you chose

Medium · pagination · technical debt · tradeoffs

You have four days to ship a tenant-facing listing endpoint. The version you would defend uses keyset pagination over (tenant_id, status, updated_at DESC, resource_id DESC); the version you can finish uses LIMIT/OFFSET with no matching index. Describe a deadline call you actually made of this shape: what you shipped, what you knowingly deferred, how you bounded the damage with a mechanism rather than an intention, and the specific numeric condition that would force the follow-up. Name who you told and where you wrote it down.

Approach

1. Name the deferred failure precisely instead of calling it slow. OFFSET n makes the database produce and discard n rows, so cost grows with page depth; without an index matching the sort, every matching row is read and sorted before the limit applies; and rows inserted between two page fetches shift across the boundary so items are skipped or repeated with nothing in the response to signal it.
2. Bound the blast radius with something mechanical rather than a promise: cap maximum page depth, cap page size, restrict the endpoint to one internal caller, or keep it behind a flag. State which failure each cap removes and which it leaves standing.
3. Attach a number to the trigger and wire it to an alarm: the first tenant crossing N resources, or the endpoint's p99 crossing its share of the 400 ms budget, so the debt announces itself instead of waiting to be remembered.
4. Write it where the next engineer looks, which is the code and the ticket, not a chat message: what was deferred, why, the cap, and the trigger.

Follow-up

• At what page depth does the offset version breach your latency budget, given your page size and row counts?
• What breaks first when you switch to keyset pagination later, and what does a client holding an old page token see?