Fusemachines Software Engineer Interview Guide

The 60-second brief

A Software Engineer at Fusemachines plays a pivotal role in driving the company's mission of democratizing artificial intelligence. In this position, you are not just writing standard application code; you are building the robust infrastructure, scalable pipelines, and high-performance APIs that power cutting-edge AI and machine learning solutions. Your work directly bridges the gap between complex data science models and intuitive, enterprise-grade software products that serve a global client base. The impact of this role is highly visible across the organization. You will collaborate closely with AI researchers, product managers, and external stakeholders to translate sophisticated business requirements into clean, maintainable systems.

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

Focus areas

• Data Structures and Algorithms (DSA)
• Coding Interviews
• Problem Solving

The Fusemachines interview process

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

Initial HR Screening

A brief 15-to-30-minute conversation to discuss your background, career interests, and alignment with the role.

What to demonstrate

• A brief 15-to-30-minute conversation to discuss your background, career interests, and alignment with the role
• Depth in Data Structures and Algorithms (DSA)

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

A practical assignment designed to evaluate your hands-on coding standards, architectural decisions, and ability to deliver functional software.

What to demonstrate

• A practical assignment designed to evaluate your hands-on coding standards, architectural decisions, and ability to deliver functional software
• Depth in Data Structures and Algorithms (DSA)

How to prepare

• Answer aloud and timed: Given an unsorted array of integers, write an efficient algorithm to find the two numbers that add up to a specific target.
• Answer aloud and timed: Describe how a hash map handles collisions internally, and discuss the worst-case time complexity of its operations.

Technical Interview

A deep-dive session lasting approximately one hour, focusing on your data structures and algorithms knowledge, a review of your coding task, and core engineering concepts.

What to demonstrate

• A deep-dive session lasting approximately one hour
• Focusing on your data structures and algorithms knowledge, a review of your coding task, and core engineering concepts

How to prepare

• Answer aloud and timed: Implement a function to reverse a string in-place without using built-in language reverse utilities.
• Answer aloud and timed: Walk us through the architectural choices and design patterns you implemented in your technical assessment task.

Final HR & Salary Negotiation

A discussion focusing on working hours, culture fit, compensation expectations, and final offer details.

What to demonstrate

• A discussion focusing on working hours, culture fit, compensation expectations, and final offer details
• Depth in Data Structures and Algorithms (DSA)

How to prepare

• Answer aloud and timed: How do you structure an API to ensure it is secure, scalable, and easy for other developers to consume?
• Answer aloud and timed: Explain how you would design a database schema for a multi-tenant application where data isolation is critical.

Where candidates lose points

Talk through your code

During the technical interview, never code in silence. Explain your approach as you write, detailing why you chose a specific data structure or algorithm and what the trade-offs are.

Prepare for the code review

Treat the review of your technical assessment as a collaborative session. Show that you can accept constructive feedback gracefully and explain your architectural decisions with confidence.

Comparing floating-point values for equality, or holding money in them

Binary floating point cannot represent 0.1 exactly, so repeated addition drifts and an equality check fails on values that are mathematically equal. Store currency as integer minor units or a decimal type, and compare floats against a tolerance you chose for a stated reason.

Questions & practice

Explain the difference between an array and a linked list, and describe scenarios where you would prefer one o

Medium · Data Structures & Algorithms

Explain the difference between an array and a linked list, and describe scenarios where you would prefer one over the other.

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 a cycle in a singly linked list? Walk through the time and space complexity of your appro

Medium · Data Structures & Algorithms

How would you detect a cycle in a singly linked list? Walk through the time and space complexity of your approach.

Approach

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

Follow-up

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

Given an unsorted array of integers, write an efficient algorithm to find the two numbers that add up to a spe

Medium · Data Structures & Algorithms

Given an unsorted array of integers, write an efficient algorithm to find the two numbers that add up to a specific target.

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 a hash map handles collisions internally, and discuss the worst-case time complexity of its opera

Medium · Data Structures & Algorithms

Describe how a hash map handles collisions internally, and discuss the worst-case time complexity of its operations.

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?

Implement a function to reverse a string in-place without using built-in language reverse utilities.

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

What strategies do you use to optimize slow-running SQL queries, and how do database indexes work under the ho

Medium · Practical Coding & System Implementation

What strategies do you use to optimize slow-running SQL queries, and how do database indexes work under the hood?

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?

Hold a per-tenant active cap against concurrent creates

Hard · write skew · isolation levels · constraints

A tenant on the standard plan may hold at most 50 resources with status='active'. The create handler runs SELECT count(*) FROM resource WHERE tenant_id = $1 AND status = 'active', compares to 50, then inserts. Two creates arrive 3 ms apart on different instances and the tenant lands at 51. Name the anomaly, say whether PostgreSQL 16 READ COMMITTED or REPEATABLE READ prevents it and why, then give an implementation that holds the cap at READ COMMITTED with the exact statements. Finally, say what changes when the cap is 'at most one running export per tenant' on job_run.

Approach

1. Name it: write skew. The two transactions read an overlapping set and write disjoint rows, so there is no row-level conflict for the engine to detect and each commit is individually legal.
2. Rule out the levels precisely. READ COMMITTED takes a fresh snapshot per statement and takes no lock on the counted rows, so both see 49. PostgreSQL's REPEATABLE READ is snapshot isolation: it removes non-repeatable reads and phantoms within the snapshot but still admits write skew, because the anomaly is not a re-read of a changed row, it is a read of a set that a concurrent transaction invalidates. Only SERIALIZABLE closes it, by tracking the read dependency and aborting one transaction with SQLSTATE 40001 — a guarantee that exists only if the application re-runs the whole transaction from the read.
3. Convert the set predicate into a single-row conflict: keep tenant.active_resource_count and run UPDATE tenant SET active_resource_count = active_resource_count + 1 WHERE tenant_id = $1 AND active_resource_count < 50 in the same transaction as the INSERT. Zero affected rows is the cap, returned as 409. The row lock serialises the decision at any isolation level, and contention is bounded to one tenant's row — which is also the fair-scheduling unit, unlike a global counter that would convoy every tenant behind one row.
4. State the cost you just took on: a counter is a second source of truth that can drift, so every path that changes status must adjust it inside the same transaction, and a periodic reconciliation has to exist, with resource_revision as the authority for what the count should have been.

Follow-up

• A resource moves from archived back to active. Which statements change, and what breaks if the counter update and the status change land in different transactions?
• The cap becomes plan-dependent and a plan can change mid-month. Where does the number 50 live, and who reads it?

Walk us through the architectural choices and design patterns you implemented in your technical assessment tas

Medium · Practical Coding & System Implementation

Walk us through the architectural choices and design patterns you implemented in your technical assessment task.

Approach

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

Follow-up

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

How do you structure an API to ensure it is secure, scalable, and easy for other developers to consume?

Medium · Practical Coding & System Implementation

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 design a database schema for a multi-tenant application where data isolation is critical

Medium · Practical Coding & System Implementation

Explain how you would design a database schema for a multi-tenant application where data isolation is 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?

Exports duplicate a row range about once a week

Hard · leases · clock skew · idempotency

Roughly once a week an export writes a file containing a duplicated range of rows. The affected job_run rows show attempt = 1, status = succeeded, one started_at, and a lease_owner naming a different host from the one whose logs show the job starting. Leases last 30 seconds and are heartbeated every 10 from inside the handler; lease_expires_at is computed on the worker and compared against the database's now(). Find the mechanism, and give a fix that holds even if you cannot fix the clocks.

Approach

1. Start from the fact that eliminates the obvious answer. attempt = 1 means no retry was recorded, so this is not a re-run after failure; two workers ran the same row concurrently and the takeover path never touched the counter. lease_owner naming a host other than the one that started the job is the same statement from the other side.
2. Enumerate the mechanisms that cause a premature takeover, then find the signal that separates them. Either the lease genuinely expired because the heartbeat did not fire, which is what happens when the heartbeat runs on the handler's own thread and the handler makes a long blocking call, or it only appeared expired because two clocks disagree, since lease_expires_at is written from the worker's clock and evaluated against the database's. The discriminator is the distribution: incidents clustered on the longest exports indict the heartbeat, incidents clustered on one host indict skew. Measure both, and measure each host's offset against the database directly.
3. Read the reclaim query precisely. In PostgreSQL now() is transaction start time, not statement time, so a reclaimer holding a long transaction compares against an older timestamp than expected; clock_timestamp() is the statement-time function. This is worth ruling in or out before you redesign anything, because it changes which rows look expired.
4. Remove the second clock rather than trying to synchronise it. Issue and extend the lease in the database, with lease_expires_at = now() + interval '30 seconds' in both the claim and the heartbeat, so exactly one clock is ever compared and worker skew stops mattering to this predicate.

Follow-up

• The displaced worker has already streamed half the file to object storage. What makes that side effect safe to repeat?
• You now count takeovers. What alert fires on that counter, and at what threshold?

Suggested practice checklist

Built from the rounds and topics Fusemachines candidates report.

Day 1 — Map the Fusemachines loop

• Write out the reported sequence: Initial HR Screening, Technical Assessment, Technical Interview, Final HR & Salary Negotiation.
• 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 Data Structures and Algorithms (DSA)

• Spend the session on Data Structures and Algorithms (DSA), which Fusemachines candidates report being tested on.
• Write one worked example in Data Structures and Algorithms (DSA) and time yourself on it.

Deliverable: One timed worked example in Data Structures and Algorithms (DSA).

Day 3 — Work Coding Interviews

• Spend the session on Coding Interviews, which Fusemachines candidates report being tested on.
• Write one worked example in Coding Interviews and time yourself on it.

Deliverable: One timed worked example in Coding Interviews.

Day 4 — Work Problem Solving

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

Deliverable: One timed worked example in Problem Solving.

Day 5 — Answer out loud: Data Structures & Algorithms

• Answer aloud, timed: Explain the difference between an array and a linked list, and describe scenarios where you would prefer one over the other.
• Answer aloud, timed: How would you detect a cycle in a singly linked list? Walk through the time and space complexity of your approach.

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

Day 6 — Answer out loud: Practical Coding & System Implementation

• Answer aloud, timed: Walk us through the architectural choices and design patterns you implemented in your technical assessment task.
• Answer aloud, timed: How do you structure an API to ensure it is secure, scalable, and easy for other developers to consume?

Deliverable: Spoken answers to 2 reported Practical Coding & System Implementation question(s), under time.

Day 7 — Answer out loud: Professional Background & Behavioral

• Answer aloud, timed: Walk me through your academic background and any specialized training, such as the Fusemachines Fellowship program.
• Answer aloud, timed: Describe a challenging technical project you completed. What obstacles did you encounter, and how did you resolve them?

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

Behavioural preparation

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

How do you handle asynchronous operations and error propagation in your preferred programming language?

Medium · Practical Coding & System Implementation

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 academic background and any specialized training, such as the Fusemachines Fellowship pro

Medium · Professional Background & Behavioral

Walk me through your academic background and any specialized training, such as the Fusemachines Fellowship program.

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 technical project you completed. What obstacles did you encounter, and how did you reso

Medium · Professional Background & Behavioral

Describe a challenging technical project you completed. What obstacles did you encounter, and how did you resolve them?

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 manage your working hours and prioritize tasks when handling multiple deliverables under tight dead

Medium · Professional Background & Behavioral

How do you manage your working hours and prioritize tasks when handling multiple deliverables under tight deadlines?

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 you had a technical disagreement with a team member. How did you approach the situation t

Medium · Professional Background & Behavioral

Tell me about a time you had a technical disagreement with a team member. How did you approach the situation to find a resolution?

Approach

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

Follow-up

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

What motivates you to work in the AI and machine learning space, and how do you keep your software engineering

Medium · Professional Background & Behavioral

What motivates you to work in the AI and machine learning space, and how do you keep your software engineering skills current?

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?