cswork / libraryOpen practice workspace

Interview guides · Velo3D

Velo3D Software Engineer Interview Guide

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

The 60-second brief

As a Software Engineer at Velo3D, you will work at the absolute frontier where advanced digital computation meets physical metal manufacturing. Velo3D is redefining additive manufacturing with its end-to-end metal 3D printing solution. Software is not merely a supporting tool here; it is the primary engine that enables the printing of previously "impossible" geometries without the need for support structures. You will be responsible for building the highly complex software systems that translate abstract 3D CAD models into precise physical instructions for laser-based powder bed fusion printers. Your work will directly impact Velo3D's flagship preprint software, Flow, as well as the real-time execution and monitoring systems running on the Sapphire printing hardware.

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

Focus areas

  • Simulation / Physics Engineering
  • Distributed Systems
  • Multi-disciplinary Problem Solving

The Velo3D interview process

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

Recruiter Screen

Initial screening by a recruiter focusing on technical background and resume review.

What to demonstrate

  • Initial screening by a recruiter focusing on technical background and resume review
  • Depth in Simulation / Physics 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.

Technical Phone Interview

One or two technical interviews conducted via phone or video with team leads or senior engineers.

What to demonstrate

  • One or two technical interviews conducted via phone or video with team leads or senior engineers
  • Depth in Simulation / Physics Engineering

How to prepare

  • Answer aloud and timed: Describe the data structures you would use to efficiently query spatial neighbors in a large-scale 3D point cloud.
  • Answer aloud and timed: Walk through the mathematics of rotating a 3D vector using quaternions versus rotation matrices, and discuss the computational trade-offs of each.

Comprehensive Interview Loop

A series of multiple technical sessions, a peer panel, and interviews with executive leadership.

What to demonstrate

  • A series of multiple technical sessions, a peer panel, and interviews with executive leadership
  • Depth in Simulation / Physics Engineering

How to prepare

  • Answer aloud and timed: How would you detect and resolve self-intersections in a complex 2D toolpath generated from a sliced 3D model?
  • Answer aloud and timed: How would you design a software architecture to simulate thermal dissipation across a metal powder bed during a laser melting process?

Where candidates lose points

Connect Software to Hardware Reality

During technical design rounds, always ground your software abstractions in physical constraints. For example, when designing an algorithm, consider how memory layout affects real-time execution speed on physical printer hardware.

Keep your technical explanations highly visual and grounded in physical constraints

Velo3D deals with physical metal fabrication, so pure software abstractions must always connect back to hardware reality.

Prepare for Executive Grilling

Do not be defensive when asked direct or tough questions about your resume or past technical decisions. Frame your answers around what you learned, how you grew, and how those experiences make you uniquely qualified to solve the complex problems at Velo3D.

Questions & practice

Explain how you would optimize a polygon slicing algorithm for a 3D mesh with millions of triangles.

Medium · Computational Geometry & 3D Math

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?

Merge partitioned event streams into one ordered feed with bounded lateness

Hard · k-way merge · watermarks · out-of-order streams

The read-model service consumes 64 log partitions carrying about 4,000 events per second in total. Each partition is ordered within itself, but partitions drift by up to 30 seconds, and the activity feed must present a tenant's events in occurred_at order. Produce the merge. State its complexity, the buffer it requires in events and in bytes, what happens when one partition is idle, and what you do with an event that arrives after you have already emitted its position. Payloads average 1 KB.

Approach

  1. Merge with a min-heap over the 64 partition heads keyed on (occurred_at, event_id): O(log P) per event and O(n log P) overall. The tie-break on event_id is what makes the output deterministic when two partitions carry the same millisecond, which matters because the feed is paginated and a non-deterministic order reorders pages under the reader.
  2. Emitting the heap head is only correct once every partition has produced everything up to that timestamp, so the emit condition is a watermark: the minimum across partitions of the highest occurred_at seen, less the allowed lateness. Events are held until the watermark passes them, which is what turns individually ordered streams into a jointly ordered one.
  3. Size the buffer from the lateness rather than guessing: 4,000 events per second times 30 seconds is 120,000 buffered events, and at 1 KB each about 120 MB of heap. That number is the real price of the ordering guarantee and belongs in front of whoever asked for it.
  4. Handle the idle partition explicitly, because it fails the feed rather than corrupting it: a partition with no traffic never advances its own maximum, so the watermark freezes and output stops entirely. Either every partition emits a periodic idle marker carrying the broker's current time, or the watermark falls back to wall clock for a partition silent beyond a threshold.

Follow-up

  • The lateness budget is raised to five minutes. What is the new buffer, and what besides memory changes?
  • The consumer restarts. Where does it resume from, and what does the feed look like for the first 30 seconds?

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?

Describe the data structures you would use to efficiently query spatial neighbors in a large-scale 3D point cl

Medium · Computational Geometry & 3D Math

Describe the data structures you would use to efficiently query spatial neighbors in a large-scale 3D point cloud.

Approach

  1. Name the grain you start from and join outward from it.
  2. Check whether any join is one-to-many before aggregating, or the sums inflate.
  3. Say which index the query would use, and what makes it unusable.
  4. Handle the rows that do not match: that is usually the actual question.

Follow-up

  • How does the query change if that join becomes one-to-many?
  • What happens to this when the table is ten times larger?

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?

How do you determine if a given 3D coordinate lies inside, outside, or on the boundary of a complex, non-manif

Medium · Computational Geometry & 3D Math

How do you determine if a given 3D coordinate lies inside, outside, or on the boundary of a complex, non-manifold CAD solid?

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 the mathematics of rotating a 3D vector using quaternions versus rotation matrices, and discuss t

Medium · Computational Geometry & 3D Math

Walk through the mathematics of rotating a 3D vector using quaternions versus rotation matrices, and discuss the computational trade-offs of each.

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 detect and resolve self-intersections in a complex 2D toolpath generated from a sliced 3D model?

Medium · Computational Geometry & 3D Math

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 software architecture to simulate thermal dissipation across a metal powder bed during

Medium · Simulation & Physics-Based Computing

How would you design a software architecture to simulate thermal dissipation across a metal powder bed during a laser melting process?

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

Describe how you would parallelize a finite element analysis (FEA) solver to run efficiently on multi-core CPU

Medium · Simulation & Physics-Based Computing

Describe how you would parallelize a finite element analysis (FEA) solver to run efficiently on multi-core CPUs or modern GPUs.

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 would you use to validate the accuracy of a physical simulation model against actual sensor da

Medium · Simulation & Physics-Based Computing

What strategies would you use to validate the accuracy of a physical simulation model against actual sensor data retrieved from a physical printer?

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 distributed system to process and distribute gigabyte-scale print files to a fleet of g

Medium · Systems & Distributed Software Engineeri

How would you design a distributed system to process and distribute gigabyte-scale print files to a fleet of geographically dispersed 3D printers?

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 a low-latency data pipeline to ingest, store, and analyze real-time sensor tel

Medium · Systems & Distributed Software Engineeri

Explain how you would implement a low-latency data pipeline to ingest, store, and analyze real-time sensor telemetry from a machine during a 100-hour print job.

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 designing an API that allows third-party CAD software to seamlessly integrate with a

Medium · Systems & Distributed Software Engineeri

Describe your approach to designing an API that allows third-party CAD software to seamlessly integrate with a proprietary print-preparation engine.

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?

How do you handle network partition events in a distributed system where continuous machine state synchronizat

Medium · Systems & Distributed Software Engineeri

How do you handle network partition events in a distributed system where continuous machine state synchronization is safety-critical?

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?

One customer endpoint stalls deliveries to every other destination

Medium · bulkhead · timeouts · saturation

The egress service delivers about 1.5k webhooks/second across 40,000 destinations, with a per-destination concurrency cap of 4 and a 10-second connect-plus-read timeout. Throughput falls to 300/second, queue depth climbs, and p99 delivery latency for unaffected destinations goes from 200 ms to minutes, while the error rate barely moves. One tenant holds 900 destination rows whose URLs share a hostname that now answers in 9.5 seconds. Explain the mechanism with the arithmetic, then give the containment in the order you would apply it.

Approach

  1. Look at saturation before errors. A flat error rate with collapsing throughput says nothing is failing, things are waiting, so the first signal to pull is in-flight request count or pool wait time rather than the error counter. This is the distinction that decides the whole investigation.
  2. Group in-flight work by resolved host, not by destination id. The cap is keyed per destination row, so 900 rows sharing one hostname buy 3,600 concurrent slots against a single host, each held for 9.5 seconds. The bulkhead was never a bulkhead for that host, and grouping by the wrong dimension is why the dashboard looked healthy.
  3. Do the arithmetic in both directions. Required concurrency is arrival rate times latency, so 1.5k/second at 200 ms needs about 300 in flight, which is entirely consumed by 3,600 slow slots; conversely whatever concurrency is left sustains rate equals concurrency divided by 9.5 seconds, which is the 300/second you are seeing. Matching both numbers is what promotes this from a plausible story to the mechanism.
  4. Explain why the circuit breaker never helped. It opens on consecutive failures, and a 9.5-second response inside a 10-second timeout is a success. Slow is not failing, so an error-rate breaker cannot see this; you need a slow-call ratio, a deadline propagated from the caller's remaining budget, or a concurrency limiter.

Follow-up

  • The host recovers to 80 ms. How long does the queue take to drain, and what does the drain do to the recovered host?
  • Where should the 10-second timeout number actually come from?

Suggested practice checklist

Built from the rounds and topics Velo3D candidates report.

Day 1 — Map the Velo3D loop

  • Write out the reported sequence: Recruiter Screen, Technical Phone Interview, Comprehensive Interview Loop.
  • 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 Simulation / Physics Engineering

  • Spend the session on Simulation / Physics Engineering, which Velo3D candidates report being tested on.
  • Write one worked example in Simulation / Physics Engineering and time yourself on it.

Deliverable: One timed worked example in Simulation / Physics Engineering.

Day 3 — Work Distributed Systems

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

Deliverable: One timed worked example in Distributed Systems.

Day 4 — Work Multi-disciplinary Problem Solving

  • Spend the session on Multi-disciplinary Problem Solving, which Velo3D candidates report being tested on.
  • Write one worked example in Multi-disciplinary Problem Solving and time yourself on it.

Deliverable: One timed worked example in Multi-disciplinary Problem Solving.

Day 5 — Answer out loud: Computational Geometry & 3D Math

  • Answer aloud, timed: Explain how you would optimize a polygon slicing algorithm for a 3D mesh with millions of triangles.
  • Answer aloud, timed: How do you determine if a given 3D coordinate lies inside, outside, or on the boundary of a complex, non-manifold CAD solid?

Deliverable: Spoken answers to 2 reported Computational Geometry & 3D Math question(s), under time.

Day 6 — Answer out loud: Simulation & Physics-Based Computing

  • Answer aloud, timed: How would you design a software architecture to simulate thermal dissipation across a metal powder bed during a laser melting process?
  • Answer aloud, timed: Describe how you would parallelize a finite element analysis (FEA) solver to run efficiently on multi-core CPUs or modern GPUs.

Deliverable: Spoken answers to 2 reported Simulation & Physics-Based Computing question(s), under time.

Day 7 — Answer out loud: Systems & Distributed Software Engineering

  • Answer aloud, timed: How would you design a distributed system to process and distribute gigabyte-scale print files to a fleet of geographically dispersed 3D printers?
  • Answer aloud, timed: Explain how you would implement a low-latency data pipeline to ingest, store, and analyze real-time sensor telemetry from a machine during a 100-hour print job.

Deliverable: Spoken answers to 2 reported Systems & Distributed Software Engineering question(s), under time.

Behavioural preparation

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

How do you handle numerical stability and precision issues when running iterative differential equation solver

Medium · Simulation & Physics-Based Computing

How do you handle numerical stability and precision issues when running iterative differential equation solvers in real-time?

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 your career transitions. What motivated each of your job changes, and what did you learn from

Medium · Behavioral & Career Journey

Walk me through your career transitions. What motivated each of your job changes, and what did you learn from those transitions?

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 a strong technical disagreement with a peer or senior engineer. How did you prese

Medium · Behavioral & Career Journey

Describe a time when you had a strong technical disagreement with a peer or senior engineer. How did you present your arguments, and how was the issue resolved?

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 situations where the project requirements are highly ambiguous and depend on physical hardwa

Medium · Behavioral & Career Journey

How do you handle situations where the project requirements are highly ambiguous and depend on physical hardware that is still under development?

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 do you want to work in the additive manufacturing space, and how do you adapt to working in a highly multi

Medium · Behavioral & Career Journey

Why do you want to work in the additive manufacturing space, and how do you adapt to working in a highly multi-disciplinary engineering team?

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?