Boxbot Software Engineer Interview Guide

The 60-second brief

A Software Engineer at Boxbot works at the cutting edge of physical automation, robotics, and logistics technology. In this role, you are not just writing code that lives in the cloud; you are building the software brain that orchestrates complex, real-world robotic systems. Your code directly controls mechanical components, processes real-time sensor data, and optimizes the throughput of advanced automation systems designed to revolutionize the logistics and delivery space. The impact of a Software Engineer at Boxbot is immediate and highly visible. You will design, implement, and scale software that bridges the gap between digital logic and physical motion. This requires solving complex multi-disciplinary problems where software, hardware, and control theory intersect.

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

Focus areas

• Software Engineering
• Programming (Problem Solving)
• C++

The Boxbot interview process

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

Initial Screening

Two rounds of screening conducted by senior engineering team members focusing on coding proficiency and C++ knowledge.

What to demonstrate

• Two rounds of screening conducted by senior engineering team members focusing on coding proficiency and C++ knowledge
• Depth in Software Engineering

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.

Onsite Interview Loop

A comprehensive series of 4 to 5 panel sessions covering software programming, hardware-software integration, and architectural design.

What to demonstrate

• A comprehensive series of 4 to 5 panel sessions covering software programming, hardware-software integration, and architectural design
• Depth in Software Engineering

How to prepare

• Answer aloud and timed: Describe how you would implement a thread-safe queue for passing sensor data from a hardware interface thread to a processing thread.
• Answer aloud and timed: What is cache locality, and how does data structure design (such as std::vector versus std::list) affect CPU cache performance?

1:1 with Founder

Final conversation with the founder focusing on high-level strategy, company culture, and long-term career goals.

What to demonstrate

• Final conversation with the founder focusing on high-level strategy, company culture, and long-term career goals
• Depth in Software Engineering

How to prepare

• Answer aloud and timed: Explain the concept of RAII (Resource Acquisition Is Initialization) and how it prevents resource leaks in modern C++.
• Answer aloud and timed: Design a software architecture for a robotic arm that must safely stop if a safety sensor detects an obstacle. How do you handle latency and fail-safes?

Where candidates lose points

Think in Physical Constraints

Whenever you are designing a system or writing code, explicitly state the physical assumptions you are making. Mention latency, power limits, sensor noise, and safety boundaries. This shows interviewers that you understand the physical reality of your code.

Emphasize Safety and Reliability

In robotics, a software bug can cause physical damage or injury. Always highlight how you design your software to fail safely, handle unexpected inputs, and recover gracefully from hardware faults.

Over-Communicate during Panels

The onsite loop features panels with multiple interviewers. Engage the entire group, explain your thought process out loud as you write code or design systems, and welcome their feedback as collaborative input.

Brush up on Finite State Machines (FSMs)

A significant portion of robotic orchestration relies on deterministic state transitions. Be ready to design clean, maintainable, and robust state machines on the whiteboard.

Questions & practice

Explain the difference between std::unique_ptr and std::shared_ptr. When would you use one over the other

Medium · C++ and Systems Programming

Explain the difference between std::unique_ptr and std::shared_ptr. When would you use one over the other in a real-time system?

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 does a virtual table (vtable) work in C++? What is the performance overhead associated with virtual functi

Medium · C++ and Systems Programming

How does a virtual table (vtable) work in C++? What is the performance overhead associated with virtual function calls?

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?

Describe how you would implement a thread-safe queue for passing sensor data from a hardware interface thread

Medium · C++ and Systems Programming

Describe how you would implement a thread-safe queue for passing sensor data from a hardware interface thread to a processing thread.

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 is cache locality, and how does data structure design (such as std::vector versus std::list) affect C

Medium · C++ and Systems Programming

What is cache locality, and how does data structure design (such as std::vector versus std::list) affect CPU cache performance?

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?

Explain the concept of RAII (Resource Acquisition Is Initialization) and how it prevents resource leaks in mod

Medium · C++ and Systems Programming

Explain the concept of RAII (Resource Acquisition Is Initialization) and how it prevents resource leaks in modern C++.

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?

Explain the components of a PID controller. How would you tune a PID controller for a motor driving a heavy me

Medium · Controls & Algorithms

Explain the components of a PID controller. How would you tune a PID controller for a motor driving a heavy mechanical load?

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?

Describe how you would implement a basic path-planning algorithm for an automated guided vehicle (AGV) navigat

Medium · Controls & Algorithms

Describe how you would implement a basic path-planning algorithm for an automated guided vehicle (AGV) navigating a grid-based warehouse.

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?

Describe the difference between kinematics and dynamics in the context of robotic manipulation.

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

How would you detect and handle a motor stall or mechanical jam using motor feedback data?

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

Describe a situation where you had to work with highly ambiguous or incomplete requirements. How did you proce

Medium · Behavioral & Collaboration

Describe a situation where you had to work with highly ambiguous or incomplete requirements. How did you proceed?

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?

Denormalise tenant onto revisions and backfill it live

Hard · denormalisation · online migration · backfill

resource_revision (revision_id, resource_id, version, actor_user_id, change_kind, patch, request_id, created_at) has 400M rows and no tenant column; tenant_id lives only on resource. Two reads need it: a tenant-scoped audit feed ordered by created_at DESC, and an offboarding purge. Both join back to resource today. Justify adding tenant_id to resource_revision against those two reads, name the anomaly the copy introduces and the constraint that prevents it, then give the ordered migration for a live table taking 1.2k writes/second — the lock each step takes, how the backfill is batched, and where each step stops being reversible. PostgreSQL 16.

Approach

1. Justify from the access path rather than from taste. Without the column, the audit feed either scans resource_revision by created_at and discards other tenants' rows, or resolves the tenant's resource_ids first and probes with them — both proportional to the tenant's whole history rather than to one page. With (tenant_id, created_at DESC, revision_id DESC) it is a seek that stops at 50 rows, and the purge becomes a ranged delete instead of a join.
2. Name the cost exactly: a second copy of a fact can disagree with the first. Make the disagreement unwritable rather than documented — add UNIQUE (resource_id, tenant_id) on resource so it can serve as a foreign-key target, then FOREIGN KEY (resource_id, tenant_id) REFERENCES resource (resource_id, tenant_id) on the revision table. A revision can then only ever carry its parent's tenant.
3. Step one, expand: ALTER TABLE resource_revision ADD COLUMN tenant_id BIGINT NULL, with no default, so it is a catalogue change and no rewrite. It still needs ACCESS EXCLUSIVE for an instant, and that instant queues behind the longest open transaction on the table while every later query queues behind it — set lock_timeout to 2s and retry rather than wait.
4. Step two, dual-write: deploy the writer that populates tenant_id on every new revision while reads still use the join. Reversible by redeploying the previous build, because nothing reads the column yet.

Follow-up

• The backfill is half finished and a rollback is required. What state is the table in, and what does the previous build do with a half-populated column?
• How do you verify the backfill actually finished, given rows are still being inserted while it runs?

Design a software architecture for a robotic arm that must safely stop if a safety sensor detects an obstacle.

Medium · Systems & Hardware-Software Architecture

Design a software architecture for a robotic arm that must safely stop if a safety sensor detects an obstacle. How do you handle latency and fail-safes?

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 state machine to manage the lifecycle of an automated storage and retrieval system?

Medium · Systems & Hardware-Software 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 your approach to testing software when the physical hardware is not yet built or is unavailable. How

Medium · Systems & Hardware-Software Architecture

Describe your approach to testing software when the physical hardware is not yet built or is unavailable. How do you design mock interfaces?

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 API that allows a high-level orchestration system to communicate with low-level motor controllers.

Medium · Systems & Hardware-Software 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?

Read latency spikes on a sixty-second sawtooth

Medium · cache stampede · single-flight · ttl

The cached listing read path serves about 14k reads/second at an 85% hit rate. p99 sits at 35 ms for 57 seconds, jumps to 900 ms for 3, and repeats. During each spike the primary shows several hundred identical listing queries starting within the same millisecond, all carrying one large tenant's id. Cache entries use a 60-second TTL. Give the mechanism, the ordered checks, the fix, and the correctness hazard your fix must not introduce.

Approach

1. Match the period to a configured number before theorising about load. A spike every 60 seconds against a 60-second TTL is an entry expiring, and you confirm it by correlating spike timestamps with the entry's write time rather than with the traffic curve. If the period had matched a cron or a GC interval instead, this is a different investigation.
2. Establish the concurrency of the miss. Several hundred identical queries in one millisecond means the miss path has no coalescing: every request that arrives between expiry and repopulation recomputes. The herd size is that key's arrival rate times its recompute time, so at 1.2k reads/second for the hot key and a 250 ms recompute you expect about 300 concurrent misses, which matches what is observed.
3. Add single-flight on the miss path so one caller per key recomputes under a short-lived lock while the rest wait for its result. Prefer stale-while-revalidate where the read tolerates it: return the expired value immediately and refresh asynchronously, which removes the latency spike rather than serialising it into a queue of waiters.
4. De-synchronise the keys. Write TTLs with jitter, for example 60 seconds plus or minus 10%, so a deploy or a mass invalidation does not align every key on the same second and turn a per-key herd into a fleet-wide one.

Follow-up

• The same sawtooth appears on a key that is invalidated on write rather than expired. Is that the same bug?
• How does your answer change if the recompute takes 4 seconds instead of 250 ms?

Suggested practice checklist

Built from the rounds and topics Boxbot candidates report.

Day 1 — Map the Boxbot loop

• Write out the reported sequence: Initial Screening, Onsite Interview Loop, 1:1 with Founder.
• 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 Software Engineering

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

Deliverable: One timed worked example in Software Engineering.

Day 3 — Work Programming (Problem Solving)

• Spend the session on Programming (Problem Solving), which Boxbot candidates report being tested on.
• Write one worked example in Programming (Problem Solving) and time yourself on it.

Deliverable: One timed worked example in Programming (Problem Solving).

Day 4 — Work C++

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

Deliverable: One timed worked example in C++.

Day 5 — Answer out loud: C++ and Systems Programming

• Answer aloud, timed: Explain the difference between std::unique_ptr and std::shared_ptr. When would you use one over the other in a real-time system?
• Answer aloud, timed: How does a virtual table (vtable) work in C++? What is the performance overhead associated with virtual function calls?

Deliverable: Spoken answers to 2 reported C++ and Systems Programming question(s), under time.

Day 6 — Answer out loud: Systems & Hardware-Software Architecture

• Answer aloud, timed: Design a software architecture for a robotic arm that must safely stop if a safety sensor detects an obstacle. How do you handle latency and fail-safes?
• Answer aloud, timed: How would you design a state machine to manage the lifecycle of an automated storage and retrieval system?

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

Day 7 — Answer out loud: Controls & Algorithms

• Answer aloud, timed: Explain the components of a PID controller. How would you tune a PID controller for a motor driving a heavy mechanical load?
• Answer aloud, timed: Describe how you would implement a basic path-planning algorithm for an automated guided vehicle (AGV) navigating a grid-based warehouse.

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

Behavioural preparation

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

How do you handle clock synchronization and message latency across multiple distributed microcontrollers in a

Medium · Systems & Hardware-Software Architecture

How do you handle clock synchronization and message latency across multiple distributed microcontrollers in a robotic system?

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 sensor noise and signal filtering in a real-time control loop?

Medium · Controls & Algorithms

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?

Describe a time when you had to resolve a technical disagreement with a mechanical or electrical engineer. How

Medium · Behavioral & Collaboration

Describe a time when you had to resolve a technical disagreement with a mechanical or electrical engineer. How did you reach a compromise?

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 challenging software bug you encountered that was caused by a hardware limitation or defect. H

Medium · Behavioral & Collaboration

Tell me about a challenging software bug you encountered that was caused by a hardware limitation or defect. How did you diagnose and fix it?

Approach

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

Follow-up

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

How do you prioritize technical debt versus delivering new features in a fast-moving startup environment?

Medium · Behavioral & Collaboration

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?