Cargomatic Software Engineer Interview Guide

The 60-second brief

As a Software Engineer at Cargomatic, you are at the heart of a digital transformation in the logistics and freight industry. Your work directly influences how goods move across the country by building scalable, efficient, and reliable software solutions that connect shippers with carriers. This role is critical in maintaining the high-performance systems that underpin the Cargomatic platform, ensuring that supply chain operations remain fluid and transparent. You will be expected to balance high-level system design with precise implementation, tackling challenges that range from real-time data processing to complex logistics algorithms. Whether you are optimizing existing services or designing new infrastructure—such as monitoring systems for large-scale logistics networks—your contributions will have a tangible impact on the efficiency of the global supply chain.

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

Focus areas

• Coding interview problem solving
• System design
• Component-based architecture decomposition

The Cargomatic interview process

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

Recruiter Call

Initial call with a recruiter to discuss your background and the role.

What to demonstrate

• Initial call with a recruiter to discuss your background and the role
• Depth in Coding interview problem solving

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 Assessment

Evaluation of your technical skills through a coding or technical challenge.

What to demonstrate

• Evaluation of your technical skills through a coding or technical challenge
• Depth in Coding interview problem solving

How to prepare

• Answer aloud and timed: How would you refactor this code to handle larger data sets or higher concurrency?
• Answer aloud and timed: Discuss the trade-offs between different sorting or searching algorithms in a production environment.

Panel Interviews

Series of interviews focusing on coding, system design, and cultural fit.

What to demonstrate

• Series of interviews focusing on coding, system design, and cultural fit
• Depth in Coding interview problem solving

How to prepare

• Answer aloud and timed: Design a monitoring system for a high-traffic logistics or transportation network.
• Answer aloud and timed: How would you design a system to track real-time location data for thousands of active shipments?

Where candidates lose points

Communicate your thought process

Never solve a problem in silence. Your interviewers want to see how you approach ambiguity and how you handle roadblocks.

Prepare for system design

Do not neglect this area. Practice drawing out components and explaining how they interact, as this is a frequent differentiator for senior candidates.

Research the industry

Understanding the unique challenges of logistics—such as real-time tracking or carrier matching—will help you tailor your answers to be more relevant to Cargomatic.

Be ready to ask questions

Use your interview time to learn about the team's current technical challenges; it shows you are genuinely interested in contributing to their success.

Questions & practice

Implement a solution for a standard algorithmic problem using a shared terminal.

Medium · Coding and 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?

Explain the time and space complexity of your chosen data structures.

Medium · Coding and 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 refactor this code to handle larger data sets or higher concurrency?

Medium · Coding and Algorithms

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?

Discuss the trade-offs between different sorting or searching algorithms in a production environment.

Medium · Coding and 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 do you approach choosing between a SQL and NoSQL database for a specific logistics module?

Medium · System Design

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?

Stop tag and share joins from fanning out a page

Medium · join fan-out · semi-joins · many-to-many

resource_tag is (resource_id, tag_id) with PK (resource_id, tag_id); resource_share is (resource_id, shared_with_user_id, permission). The tagged-and-shared listing inner-joins resource to both, filters tenant_id, tag_id = ANY($2) and shared_with_user_id = $3, orders by updated_at DESC and takes 50. Pages come back with fewer than 50 distinct resources and the total in the header is far too high. Explain the row multiplication, rewrite both the page query and the count query so each is correct, and name the index each one needs. PostgreSQL 16.

Approach

1. Do the arithmetic against the predicates that are actually there. An inner join emits one row per matching child row, and both joins are filtered: tag_id = ANY($2) admits only the requested tags, shared_with_user_id = $3 admits one user's share rows. So a resource holding three of the requested tags and shared with $3 once yields three rows, not one — the multiplier is its count of matching tags times its share rows for that single user, and that second factor is 1 unless the table admits duplicate (resource_id, shared_with_user_id) pairs. LIMIT 50 then limits rows rather than resources, and COUNT(*) counts pairs — the header is the product, not the population.
2. Reject DISTINCT as the fix. It deduplicates after the product has been built, so the planner must materialise and sort the fanned-out set before the LIMIT can apply, and it leaves any SUM or AVG in the same select list wrong.
3. Rewrite both filters as semi-joins, keeping resource as the only row source: AND EXISTS (SELECT 1 FROM resource_tag rt WHERE rt.resource_id = r.resource_id AND rt.tag_id = ANY($2)) and the same shape against resource_share. A semi-join stops at the first match per resource and preserves the driving index order, so ORDER BY updated_at DESC, resource_id DESC LIMIT 50 still stops after 50 rows.
4. Count with the same predicates and no join at all: SELECT count(*) FROM resource r WHERE r.tenant_id = $1 AND r.status = 'active' AND EXISTS (...) AND EXISTS (...). Nothing multiplies a resource, so the number is the population.

Follow-up

• The filter changes from 'any of these tags' to 'all of these tags'. Rewrite it and state what it costs relative to the ANY form.
• A resource can be shared with the same user twice under different permissions. Does your count change, and should it?

Design a monitoring system for a high-traffic logistics or transportation network.

Medium · System Design

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 system to track real-time location data for thousands of active shipments?

Medium · System Design

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 handle data consistency in a distributed system.

Medium · System Design

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?

Listing latency scales with page size, not with filters

Easy · n+1 · latency · query batching

The tenant listing endpoint reads resource filtered by tenant_id and status, ordered by updated_at DESC, and returns each row plus the owner's display name from app_user and the actor of that resource's latest resource_revision. p99 is 55 ms at 10 rows per page and 1.4 s at 200. Database telemetry shows 401 statements per request, each under 1 ms, and nothing in the slow-query log. Diagnose the cause and give the fix, stating the statement count per request and the p99 you expect afterwards.

Approach

1. Read the counters before forming a theory. 401 statements for 200 rows is one driver query plus two per row, and sub-millisecond execution with an empty slow-query log rules out a bad plan. The time is round trips, which is why it is invisible in every per-query metric and scales with rows returned rather than with filter selectivity.
2. Name the two per-row statements from their normalised text: a single-row app_user lookup by user_id, and a resource_revision lookup by resource_id ordered by version DESC LIMIT 1. Confirm by dropping those two response fields and watching the statement count fall to one. That locates the calls in the serialisation layer, not the repository.
3. Check that the arithmetic accounts for the whole gap. Measure one round trip to the replica in isolation; 400 trips at roughly 3 ms of network plus 0.2 ms of execution is about 1.3 s on top of a 55 ms baseline, which matches. If the multiplication had fallen short, the N+1 would only be part of the story and you would keep looking.
4. Batch both lookups. Collect owner_user_ids and resource_ids from the driver query, then issue WHERE tenant_id = $1 AND user_id = ANY($2) for the users, and PostgreSQL's SELECT DISTINCT ON (resource_id) ... WHERE resource_id = ANY($2) ORDER BY resource_id, version DESC for the latest revision, which the UNIQUE (resource_id, version) index serves directly. On an engine without DISTINCT ON, use a lateral join or a row_number window. Three statements per request at any page size.

Follow-up

• The page size is capped at 200 today. What breaks first if it is raised to 2,000, and is it still this bug?
• How do you stop the next N+1 from reaching production, given that no individual query is slow and the endpoint's tests pass?

Suggested practice checklist

Built from the rounds and topics Cargomatic candidates report.

Day 1 — Map the Cargomatic loop

• Write out the reported sequence: Recruiter Call, Technical Assessment, Panel 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 3 reported rounds, with the weakest marked.

Day 2 — Work Coding interview problem solving

• Spend the session on Coding interview problem solving, which Cargomatic candidates report being tested on.
• Write one worked example in Coding interview problem solving and time yourself on it.

Deliverable: One timed worked example in Coding interview problem solving.

Day 3 — Work System design

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

Deliverable: One timed worked example in System design.

Day 4 — Work Component-based architecture decomposition

• Spend the session on Component-based architecture decomposition, which Cargomatic candidates report being tested on.
• Write one worked example in Component-based architecture decomposition and time yourself on it.

Deliverable: One timed worked example in Component-based architecture decomposition.

Day 5 — Answer out loud: Coding and Algorithms

• Answer aloud, timed: Implement a solution for a standard algorithmic problem using a shared terminal.
• Answer aloud, timed: Explain the time and space complexity of your chosen data structures.

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

Day 6 — Answer out loud: System Design

• Answer aloud, timed: Design a monitoring system for a high-traffic logistics or transportation network.
• Answer aloud, timed: How would you design a system to track real-time location data for thousands of active shipments?

Deliverable: Spoken answers to 2 reported System Design question(s), under time.

Day 7 — Answer out loud: Behavioral and Cultural Fit

• Answer aloud, timed: Tell me about a time you had to deal with a technical disagreement within your team.
• Answer aloud, timed: How do you balance the need for shipping features quickly versus maintaining code quality?

Deliverable: Spoken answers to 2 reported Behavioral and Cultural Fit question(s), under time.

Behavioural preparation

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

Tell me about a time you had to deal with a technical disagreement within your team.

Medium · Behavioral and Cultural Fit

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 balance the need for shipping features quickly versus maintaining code quality?

Medium · Behavioral and Cultural Fit

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 at Cargomatic, and what interests you about the logistics technology space?

Medium · Behavioral and Cultural Fit

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 challenging project you owned from inception to deployment.

Medium · Behavioral and Cultural Fit

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?