cswork / libraryOpen practice workspace

Interview guides · Scout Motors

Scout Motors Software Engineer Interview Guide

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

The 60-second brief

At Scout Motors, a Software Engineer plays a pivotal role in reviving an iconic American brand for the modern, electric era. You are not just writing code; you are building the digital backbone of next-generation, rugged electric SUVs and trucks. Software at Scout Motors bridges the gap between hardware and user experience, powering everything from advanced battery management systems (BMS) and vehicle diagnostics to cutting-edge infotainment and connected vehicle services. This role is highly collaborative, requiring close integration with specialized hardware teams, including those in bumper systems, materials, and battery validation. Because Scout Motors is building its platform from the ground up, engineers face unique challenges at the intersection of embedded systems, cloud connectivity, and real-time vehicle control.

This guide is scoped to a Software Engineer candidate at Scout Motors.

Focus areas

  • LRU (Least Recently Used) Cache Behavior
  • Battery Systems Knowledge
  • Battery Validation

The Scout Motors interview process

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

HR Screening Call

Discuss your background, motivations, and overall alignment with the role.

What to demonstrate

  • Discuss your background, motivations, and overall alignment with the role
  • Depth in LRU (Least Recently Used) Cache Behavior

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 Evaluations

Includes live coding, system design discussions, or domain-specific deep dives.

What to demonstrate

  • Includes live coding, system design discussions, or domain-specific deep dives
  • Depth in LRU (Least Recently Used) Cache Behavior

How to prepare

  • Answer aloud and timed: Describe your experience working with battery validation systems or electric vehicle (EV) powertrains.
  • Answer aloud and timed: How do you ensure software reliability when interfacing directly with physical vehicle controllers?

Practical Case Study

Some teams may incorporate a practical case study or technical presentation.

What to demonstrate

  • Some teams may incorporate a practical case study or technical presentation
  • Depth in LRU (Least Recently Used) Cache Behavior

How to prepare

  • Answer aloud and timed: Implement a Least Recently Used (LRU) Cache and explain how you would optimize its performance.
  • Answer aloud and timed: How would you debug an issue where a sensor is dropping data packets intermittently?

Leadership Interview

Final interview with a Director or Hiring Manager focusing on long-term fit and leadership potential.

What to demonstrate

  • Final interview with a Director or Hiring Manager focusing on long-term fit and leadership potential
  • Depth in LRU (Least Recently Used) Cache Behavior

How to prepare

  • Answer aloud and timed: Design a search or navigation algorithm suitable for displaying maps on an in-vehicle infotainment system.
  • Answer aloud and timed: What strategies do you use to manage memory allocation in embedded environments?

Where candidates lose points

Structure your behavioral answers

Use the STAR method (Situation, Task, Action, Result) to keep your answers concise and impactful. Focus heavily on your specific contributions and the quantitative outcomes of your work.

Brush up on embedded concepts

Even if you are applying for a higher-level software role, having a basic understanding of how software interacts with microcontrollers, memory constraints, and physical sensors will make you a much stronger candidate.

Check-then-act on shared state

Read, decide, write is not safe under concurrency unless the decision and the write are one atomic step: a unique constraint with conflict handling, a compare-and-set, or a row lock held for the whole transaction. Two requests can both pass the existence check before either inserts, which shows up as duplicate rows under load and never in a single-threaded test.

Questions & practice

Implement a Least Recently Used (LRU) Cache and explain how you would optimize its performance.

Medium · Coding & Problem Solving

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?

What strategies do you use to manage memory allocation in embedded environments?

Medium · Coding & Problem Solving

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?

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?

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?

Explain why the owner filter ignores the listing index

Medium · composite index · query plans · sort elimination

The only index on resource is (tenant_id, status, updated_at DESC, resource_id DESC). A new endpoint returns one user's resources across all statuses, newest created first: WHERE tenant_id = $1 AND owner_user_id = $2 ORDER BY created_at DESC LIMIT 20. On a tenant with 2M rows it takes 900 ms and EXPLAIN shows a sort above a large scan. Explain precisely why the existing index cannot serve it, give the index that can, and state which of these the new index still will not help: owner_user_id alone across tenants; the same query ordered by updated_at. PostgreSQL 16.

Approach

  1. Separate the two jobs an index does. For filtering, a composite btree is seekable only on a left prefix, so with no predicate on status the scan can at best range over tenant_id and test owner_user_id per row; PostgreSQL 16 has no btree skip scan to jump the unconstrained column.
  2. For ordering, the index is sorted by (status, updated_at) within a tenant and not by created_at, so the LIMIT cannot stop early: every matching row is read and then sorted. That is the 'Sort Method: top-N heapsort' line, and it is why the plan reads 2M rows to answer with 20.
  3. Derive the replacement from the access path — equality, equality, then the ordering column: CREATE INDEX CONCURRENTLY ON resource (tenant_id, owner_user_id, created_at DESC). The scan seeks to the (tenant, owner) range and walks 20 entries in order, so the Sort node disappears along with the row-read.
  4. Treat INCLUDE (title, status) as conditional, not free. An index-only scan still visits the heap for any row whose page is not marked all-visible, so on a table taking 1.2k writes/second the win depends on autovacuum keeping the visibility map current, and the wider index costs more on every insert.

Follow-up

  • 90% of rows are status='active'. Would a partial index WHERE status = 'active' change your answer, and for which of the three queries?
  • A dashboard runs this for 40 owners in one page load. What changes about the design?

How many years of experience do you have with hardware-in-the-loop (HIL) testing?

Medium · Automotive & Domain Expertise

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 do you ensure software reliability when interfacing directly with physical vehicle controllers?

Medium · Automotive & Domain Expertise

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?

Design a search or navigation algorithm suitable for displaying maps on an in-vehicle infotainment system.

Medium · Coding & Problem Solving

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 debug an issue where a sensor is dropping data packets intermittently?

Medium · Coding & Problem Solving

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 Scout Motors candidates report.

Day 1 — Map the Scout Motors loop

  • Write out the reported sequence: HR Screening Call, Technical Evaluations, Practical Case Study, Leadership Interview.
  • 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 LRU (Least Recently Used) Cache Behavior

  • Spend the session on LRU (Least Recently Used) Cache Behavior, which Scout Motors candidates report being tested on.
  • Write one worked example in LRU (Least Recently Used) Cache Behavior and time yourself on it.

Deliverable: One timed worked example in LRU (Least Recently Used) Cache Behavior.

Day 3 — Work Battery Systems Knowledge

  • Spend the session on Battery Systems Knowledge, which Scout Motors candidates report being tested on.
  • Write one worked example in Battery Systems Knowledge and time yourself on it.

Deliverable: One timed worked example in Battery Systems Knowledge.

Day 4 — Work Battery Validation

  • Spend the session on Battery Validation, which Scout Motors candidates report being tested on.
  • Write one worked example in Battery Validation and time yourself on it.

Deliverable: One timed worked example in Battery Validation.

Day 5 — Answer out loud: Automotive & Domain Expertise

  • Answer aloud, timed: Tell me about your automotive experience and the specific tools or platforms you have used.
  • Answer aloud, timed: How many years of experience do you have with hardware-in-the-loop (HIL) testing?

Deliverable: Spoken answers to 2 reported Automotive & Domain Expertise question(s), under time.

Day 6 — Answer out loud: Coding & Problem Solving

  • Answer aloud, timed: Implement a Least Recently Used (LRU) Cache and explain how you would optimize its performance.
  • Answer aloud, timed: How would you debug an issue where a sensor is dropping data packets intermittently?

Deliverable: Spoken answers to 2 reported Coding & Problem Solving question(s), under time.

Day 7 — Answer out loud: Behavioral & STAR Method

  • Answer aloud, timed: Why are you interested in joining Scout Motors at this stage of our journey?
  • Answer aloud, timed: Why are you looking to leave your current position?

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

Behavioural preparation

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

Tell me about your automotive experience and the specific tools or platforms you have used.

Medium · Automotive & Domain Expertise

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 your experience working with battery validation systems or electric vehicle (EV) powertrains.

Medium · Automotive & Domain Expertise

Approach

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

Follow-up

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

Why are you interested in joining Scout Motors at this stage of our journey?

Medium · Behavioral & STAR Method

Approach

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

Follow-up

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

Why are you looking to leave your current position?

Medium · Behavioral & STAR Method

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 when you had to deliver a project with highly ambiguous requirements.

Medium · Behavioral & STAR Method

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 situation where you had a technical disagreement with a colleague. How did you resolve it?

Medium · Behavioral & STAR Method

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?